Skip to content

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

@maurobringolf

Description

@maurobringolf
  • 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)

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions