diff options
| author | Mathias Preiner <mathias.preiner@gmail.com> | 2018-07-30 15:24:55 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-07-30 15:24:55 -0700 |
| commit | cf97bbba5725abcb7a4085271719de8b1a832628 (patch) | |
| tree | b6a62fa6abef6aacc07e1d0ff25d71789d92f3f5 /test/unit/theory | |
| parent | 46520451e7f6408c6caf3e52a15672732abc5911 (diff) | |
Add support for incremental eager bit-blasting. (#1838)
Eager incremental solving is achieved via solving under assumptions. As soon as incremental and eager bit-blasting is enabled, assertions are passed to the SAT solver as assumptions rather than assertions. This requires the eager SAT solver to support incremental solving, which is currently only supported by CryptoMiniSat.
Diffstat (limited to 'test/unit/theory')
| -rw-r--r-- | test/unit/theory/theory_bv_white.h | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/test/unit/theory/theory_bv_white.h b/test/unit/theory/theory_bv_white.h index f95785f53..c830e7813 100644 --- a/test/unit/theory/theory_bv_white.h +++ b/test/unit/theory/theory_bv_white.h @@ -67,8 +67,11 @@ public: void testBitblasterCore() { d_smt->setOption("bitblast", SExpr("eager")); - EagerBitblaster* bb = new EagerBitblaster(dynamic_cast<TheoryBV*>( - d_smt->d_theoryEngine->d_theoryTable[THEORY_BV])); + d_smt->setOption("incremental", SExpr("false")); + EagerBitblaster* bb = new EagerBitblaster( + dynamic_cast<TheoryBV*>( + d_smt->d_theoryEngine->d_theoryTable[THEORY_BV]), + d_smt->d_context); Node x = d_nm->mkVar("x", d_nm->mkBitVectorType(16)); Node y = d_nm->mkVar("y", d_nm->mkBitVectorType(16)); Node x_plus_y = d_nm->mkNode(kind::BITVECTOR_PLUS, x, y); |