Fix. x bvmod 0, now evaluates to x, not to 0.

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

diff --git a/src/simplifier/consteval.cpp b/src/simplifier/consteval.cpp
index f8c4d5e655e831ebab49a007dc930ade7eb1e5f5..ee4cc5f39dfdc53fa3cc139984f6a4d947292f7b 100644 (file)
--- a/src/simplifier/consteval.cpp
+++ b/src/simplifier/consteval.cpp
@@ -462,9 +462,9 @@ namespace BEEV
               && CONSTANTBV::BitVector_is_empty(tmp1))
             {
               // a = bq + r, where b!=0 implies r < b. q is quotient, r remainder. i.e. a/b = q.
-              // It doesn't matter what q is when b=0, but r needs to be 0.
+              // It doesn't matter what q is when b=0, but r needs to be a.
               if (k == BVMOD)
-                OutputNode = _bm->CreateZeroConst(outputwidth);
+                OutputNode = children[0];
               else
                 OutputNode = _bm->CreateOneConst(outputwidth);
                 // Expecting a division by zero. Just return one.