BOOLEXTRACT seems to have been implemented backward. It did an equality test on

the extracted bit against *zero*, instead of *one*.

git-svn-id: https://stp-fast-prover.svn.sourceforge.net/svnroot/stp-fast-prover/trunk/stp@768 e59a4935-1847-0410-ae03-e826735625c1

diff --git a/src/parser/CVC.y b/src/parser/CVC.y
index 65fe8a15b9c83b9d87481ca53a9ae2615e21f284..c5dedc0d3d4254a7889ea6e01e4728f341353ba4 100644 (file)
--- a/src/parser/CVC.y
+++ b/src/parser/CVC.y
@@ -468,8 +468,8 @@ Formula         :     '(' Formula ')'
   ASTNode hi  =  parserInterface->CreateBVConst(32, $5);
   ASTNode low =  parserInterface->CreateBVConst(32, $5);
   ASTNode * n = new ASTNode(parserInterface->nf->CreateTerm(BVEXTRACT,1,*$3,hi,low));
-  ASTNode zero = parserInterface->CreateBVConst(1,0);                   
-  ASTNode * out = new ASTNode(parserInterface->nf->CreateNode(EQ,*n,zero));
+  ASTNode one = parserInterface->CreateBVConst(1,1);                   
+  ASTNode * out = new ASTNode(parserInterface->nf->CreateNode(EQ,*n,one));
 
 
   $$ = out;