From: trevor_hansen <trevor_hansen@e59a4935-1847-0410-ae03-e826735625c1>
Date: Tue, 26 Jul 2011 05:22:26 +0000 (+0000)
Subject: Bugfix. If nodes are created with just the hashing node factory (not with the simplif... 
X-Git-Url: https://git.unchartedbackwaters.co.uk/w/?a=commitdiff_plain;h=12a4f0f97a813af4e903d0f6a559cd1faa78fbcc;p=francis%2Fstp.git

Bugfix. If nodes are created with just the hashing node factory (not with the simplifying node factory). Then sometimes an infinite loop happened.

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

diff --git a/src/AST/NodeFactory/SimplifyingNodeFactory.cpp b/src/AST/NodeFactory/SimplifyingNodeFactory.cpp
index e711b6b..ea70aa2 100644
--- a/src/AST/NodeFactory/SimplifyingNodeFactory.cpp
+++ b/src/AST/NodeFactory/SimplifyingNodeFactory.cpp
@@ -497,7 +497,7 @@ ASTNode SimplifyingNodeFactory::CreateSimpleEQ(const ASTVec& children)
         }
 
 
-        if (k1 == BEEV::BVCONST && k2 == BEEV::BVSX)
+        if (k1 == BEEV::BVCONST && k2 == BEEV::BVSX && (in2[0].GetValueWidth() != width))
           {
               // Each of the bits in the extended part, and one into the un-extended part must be the same.
               bool foundZero=false, foundOne=false;