New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Completeness regression on trivially satisfiable formula (quantifier free) #5381

Closed

maurobringolf opened this issue Jul 2, 2021 · 0 comments

maurobringolf commented Jul 2, 2021

Found on commit: d5c6abe
First commit with the incompleteness since 4.8.10, according to git-bisect: 377d060
Formula can be satisfied by choosing unconstrained x9 = true.

$ z3 unknown.smt2
unknown
$ z3 tactic.default_tactic=smt sat.euf=true unknown.smt2
(declare-fun str.prefixof (String String) Bool) not handled
(declare-fun str.from_int (Int) String) not handled
unknown
$ z3-4.8.10 unknown.smt2
sat
$ cat unknown.smt2
(declare-const x Int)
(declare-const x9 Bool)
(assert (or x9 (str.prefixof (str.from_int x) (str.from_int (- x)))))
(check-sat)

The text was updated successfully, but these errors were encountered:

NikolajBjorner closed this as completed in

897cbf3

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment