@@ -252,6 +252,7 @@ static bool check_function(struct entrypoint *ep)
int rc = 0;
boolector_set_opt(btor, BTOR_OPT_MODEL_GEN, 1);
+ boolector_set_opt(btor, BTOR_OPT_INCREMENTAL, 1);
FOR_EACH_PTR(ep->bbs, bb) {
struct instruction *insn;
@@ -274,8 +275,8 @@ static bool check_function(struct entrypoint *ep)
ternop(btor, insn);
break;
case OP_CALL:
- rc = check_call(btor, insn);
- goto out;
+ rc &= check_call(btor, insn);
+ break;
case OP_RET:
goto out;
default:
@@ -1,10 +1,6 @@
static void ok(int x)
{
__assert((~x) == (~0 - x)); // true but not simplified yet
-}
-
-static void also_ok(int x)
-{
__assert_eq(~x, ~0 - x);
}
With the SMT solver used here, by default, once an expression is checked it's kinda consumed by the process and can't be reused anymore for another check. So, enable the incremental mode: it allows to call boolecter_sat() several times. Note: Another would be, of course, to just AND together all assertions and just check this but then we would lost the finer grained diagnostic in case of failure. Signed-off-by: Luc Van Oostenryck <luc.vanoostenryck@gmail.com> --- scheck.c | 5 +++-- validation/scheck/ok.c | 4 ---- 2 files changed, 3 insertions(+), 6 deletions(-)