tla-ts 0.0.10-dev.094b9b512 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +37 -36
- package/dist/deciders.js +55 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +146 -58
- package/dist/prove.js +142 -54
- package/dist/run.cjs +45 -43
- package/dist/run.js +47 -45
- package/dist/transfer.cjs +39 -36
- package/dist/transfer.js +23 -20
- package/dist/worker.cjs +1 -1
- package/dist/worker.js +1 -1
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/check.ts +203 -33
- package/src/cli/tlapm.ts +268 -71
- package/src/cli/tlc-output.ts +3 -3
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +15 -1
- package/src/dependencies.ts +23 -2
- package/src/environment.ts +10 -5
- package/src/errors.ts +1 -1
- package/src/exit-codes.ts +1 -0
- package/src/liveness-checker.ts +530 -201
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +2 -6
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/index.ts +8 -7
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +0 -2
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +2 -2
- package/src/obligations/printer.ts +0 -2
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +1 -4
- package/src/obligations/substitution.ts +0 -2
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel.ts +2 -2
- package/src/parser.ts +151 -42
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +1 -8
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +86 -55
- package/src/prover/isabelle/isar/context.ts +25 -26
- package/src/prover/isabelle/isar/induct.ts +2 -12
- package/src/prover/isabelle/isar/method.ts +6 -10
- package/src/prover/isabelle/isar/proof.ts +40 -39
- package/src/prover/isabelle/isar/rule-cases.ts +6 -16
- package/src/prover/isabelle/isar/theory.ts +16 -17
- package/src/prover/isabelle/isar/toplevel.ts +46 -56
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +1 -3
- package/src/prover/isabelle/provers/hypsubst.ts +0 -2
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +0 -2
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +0 -2
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +0 -2
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +1 -0
- package/src/prover/prep/methods.ts +55 -6
- package/src/prover/prep/normalize.ts +4 -1
- package/src/prover/prove.ts +58 -32
- package/src/prover/ptl/decide.ts +43 -63
- package/src/prover/smt/context.ts +10 -14
- package/src/prover/smt/data.ts +51 -45
- package/src/prover/smt/encode.ts +1 -2
- package/src/prover/smt/rewrite.ts +1 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +1 -8
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +25 -16
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +4 -7
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +1 -4
- package/src/prover/smt/solver/asserted-formulas.ts +1 -2
- package/src/prover/smt/solver/ast-lt.ts +1 -2
- package/src/prover/smt/solver/ast-util.ts +4 -5
- package/src/prover/smt/solver/ast.ts +113 -157
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +2 -11
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/bound-manager.ts +39 -29
- package/src/prover/smt/solver/bound-simplifier.ts +0 -2
- package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
- package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +14 -18
- package/src/prover/smt/solver/bv1-blast.ts +1 -11
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +0 -2
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +19 -16
- package/src/prover/smt/solver/check-logic.ts +6 -2
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/conflict-resolution.ts +8 -8
- package/src/prover/smt/solver/context.ts +21 -12
- package/src/prover/smt/solver/ctx-simplify.ts +0 -1
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +7 -10
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +2 -5
- package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +0 -1
- package/src/prover/smt/solver/distribute-forall.ts +1 -11
- package/src/prover/smt/solver/dom-simplify.ts +1 -3
- package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
- package/src/prover/smt/solver/elim-uncnstr.ts +3 -16
- package/src/prover/smt/solver/enode.ts +16 -10
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +1 -7
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -6
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
- package/src/prover/smt/solver/euf/egraph.ts +66 -44
- package/src/prover/smt/solver/euf/euf-solver.ts +37 -35
- package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
- package/src/prover/smt/solver/euf/mam.ts +6 -50
- package/src/prover/smt/solver/euf/q-ematch.ts +26 -96
- package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
- package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
- package/src/prover/smt/solver/euf/q-solver.ts +3 -3
- package/src/prover/smt/solver/euf/th-solver.ts +1 -9
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +0 -1
- package/src/prover/smt/solver/factor.ts +1 -12
- package/src/prover/smt/solver/fd-solver.ts +1 -5
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +1 -2
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +25 -14
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +13 -14
- package/src/prover/smt/solver/fpa2bv-converter.ts +10 -7
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -3
- package/src/prover/smt/solver/goal.ts +0 -1
- package/src/prover/smt/solver/goal2nlsat.ts +0 -2
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +0 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +41 -3
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +1 -2
- package/src/prover/smt/solver/lia2pb.ts +18 -5
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +0 -4
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +0 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +25 -6
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +97 -62
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +0 -1
- package/src/prover/smt/solver/macro-finder.ts +1 -4
- package/src/prover/smt/solver/mam-compiler.ts +13 -14
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +6 -15
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -2
- package/src/prover/smt/solver/maxlex.ts +0 -8
- package/src/prover/smt/solver/maxsmt-base.ts +7 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +10 -3
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +1 -19
- package/src/prover/smt/solver/model-based-opt.ts +0 -1
- package/src/prover/smt/solver/model-checker.ts +2 -3
- package/src/prover/smt/solver/model-evaluator.ts +9 -6
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +0 -1
- package/src/prover/smt/solver/model-macro-solver.ts +3 -4
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +0 -1
- package/src/prover/smt/solver/mus.ts +0 -1
- package/src/prover/smt/solver/muz/dl-context.ts +57 -15
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -6
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +76 -14
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -30
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
- package/src/prover/smt/solver/muz/dl-rule.ts +91 -55
- package/src/prover/smt/solver/muz/hnf.ts +6 -6
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +14 -5
- package/src/prover/smt/solver/muz/rule-properties.ts +195 -37
- package/src/prover/smt/solver/muz/spacer-context.ts +109 -98
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -4
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -6
- package/src/prover/smt/solver/muz/spacer-pdr.ts +3 -4
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +4 -15
- package/src/prover/smt/solver/muz/spacer-util.ts +2 -29
- package/src/prover/smt/solver/muz/substitution.ts +88 -39
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +4 -4
- package/src/prover/smt/solver/nlsat/algebraic.ts +1 -4
- package/src/prover/smt/solver/nlsat/atoms.ts +0 -2
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +5 -1
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +2 -3
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat/solver.ts +47 -44
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +0 -2
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +0 -3
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
- package/src/prover/smt/solver/nnf.ts +0 -1
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +10 -10
- package/src/prover/smt/solver/opt-nlsat.ts +68 -59
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +0 -1
- package/src/prover/smt/solver/opt-solver.ts +16 -8
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +12 -11
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +2 -3
- package/src/prover/smt/solver/pb-rewriter.ts +14 -26
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +2 -3
- package/src/prover/smt/solver/probes.ts +3 -5
- package/src/prover/smt/solver/propagate-values.ts +4 -1
- package/src/prover/smt/solver/proto-model.ts +5 -6
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +50 -16
- package/src/prover/smt/solver/qe-arith-plugin.ts +2 -3
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +0 -1
- package/src/prover/smt/solver/qe-mbp.ts +13 -24
- package/src/prover/smt/solver/qe.ts +45 -55
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +71 -97
- package/src/prover/smt/solver/quant-hoist.ts +2 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +0 -1
- package/src/prover/smt/solver/quasi-macros.ts +9 -20
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +17 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +33 -20
- package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
- package/src/prover/smt/solver/rewriter.ts +1 -2
- package/src/prover/smt/solver/rlimit.ts +13 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
- package/src/prover/smt/solver/sat/clause.ts +2 -20
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +5 -8
- package/src/prover/smt/solver/sat/consequences.ts +1 -2
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -14
- package/src/prover/smt/solver/sat/model-converter.ts +1 -21
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +49 -25
- package/src/prover/smt/solver/sat/probing.ts +22 -21
- package/src/prover/smt/solver/sat/sat-tactic.ts +0 -1
- package/src/prover/smt/solver/sat/sat2goal.ts +9 -15
- package/src/prover/smt/solver/sat/scc.ts +1 -2
- package/src/prover/smt/solver/sat/simplifier.ts +15 -59
- package/src/prover/smt/solver/sat/solver.ts +22 -23
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +7 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +1 -4
- package/src/prover/smt/solver/seq-decl-plugin.ts +9 -13
- package/src/prover/smt/solver/seq-derive.ts +8 -10
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +7 -8
- package/src/prover/smt/solver/seq-factory.ts +2 -4
- package/src/prover/smt/solver/seq-monadic.ts +0 -2
- package/src/prover/smt/solver/seq-range-predicate.ts +18 -8
- package/src/prover/smt/solver/seq-re-rewriter.ts +3 -129
- package/src/prover/smt/solver/seq-re-util.ts +7 -26
- package/src/prover/smt/solver/seq-regex-bisim.ts +1 -2
- package/src/prover/smt/solver/seq-regex-live.ts +4 -6
- package/src/prover/smt/solver/seq-rewriter.ts +1 -6
- package/src/prover/smt/solver/seq-skolem.ts +0 -1
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +0 -2
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +0 -2
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +18 -14
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +1204 -582
- package/src/prover/smt/solver/smtlib-script.ts +868 -730
- package/src/prover/smt/solver/solve-eqs.ts +0 -2
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +66 -16
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +25 -60
- package/src/prover/smt/solver/theory-bv.ts +13 -52
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +46 -79
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
- package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +0 -1
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -6
- package/src/prover/smt/solver/theory-pb.ts +10 -8
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +2 -3
- package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
- package/src/prover/smt/solver/theory-seq-solve.ts +5 -7
- package/src/prover/smt/solver/theory-seq-state.ts +6 -15
- package/src/prover/smt/solver/theory-seq.ts +32 -55
- package/src/prover/smt/solver/theory.ts +16 -2
- package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
- package/src/prover/smt/solver/var-subst.ts +6 -6
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/zenon/decide.ts +9 -13
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +0 -2
- package/src/prover/zenon/index-table.ts +0 -2
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +0 -2
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +12 -13
- package/src/prover/zenon/parse.ts +0 -2
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +0 -2
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +1 -3
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +1 -2
- package/src/runtime.ts +4 -0
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +160 -36
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/typed-tier.ts +6535 -0
- package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/cmd_context/cmd_context.cpp, src/cmd_context/basic_cmds.cpp), MIT license,
|
|
2
|
-
// see z3-license.txt.
|
|
3
1
|
import { ENCODINGS, UNICODE_ENCODING } from "./seq-decl-plugin";
|
|
4
2
|
import {
|
|
5
3
|
isStackOverflow,
|
|
@@ -276,6 +274,8 @@ interface CheckResult {
|
|
|
276
274
|
isOptimizing: boolean;
|
|
277
275
|
model: ProtoModel | undefined;
|
|
278
276
|
core: number[] | undefined;
|
|
277
|
+
// check_sat_result::reason_unknown, where the port tracks it.
|
|
278
|
+
reasonUnknown?: string;
|
|
279
279
|
}
|
|
280
280
|
|
|
281
281
|
interface ScriptState {
|
|
@@ -317,9 +317,15 @@ const MANAGERLESS_COMMANDS = new Set([
|
|
|
317
317
|
export const runSmtlibScript = (
|
|
318
318
|
text: string,
|
|
319
319
|
options: DecideOptions,
|
|
320
|
-
|
|
320
|
+
printLine: (line: string, isDiagnostic?: boolean) => void,
|
|
321
321
|
) => {
|
|
322
322
|
const commands = createCommandReader(text);
|
|
323
|
+
// Z3 writes to a stream: text left without a newline starts the next line.
|
|
324
|
+
let pendingText = "";
|
|
325
|
+
const print = (line: string, isDiagnostic?: boolean) => {
|
|
326
|
+
printLine(pendingText + line, isDiagnostic);
|
|
327
|
+
pendingText = "";
|
|
328
|
+
};
|
|
323
329
|
const settings = {
|
|
324
330
|
isPrintingSuccess: false,
|
|
325
331
|
isProducingModels: true,
|
|
@@ -365,20 +371,19 @@ export const runSmtlibScript = (
|
|
|
365
371
|
eufSolver: undefined,
|
|
366
372
|
};
|
|
367
373
|
};
|
|
368
|
-
|
|
374
|
+
let state = createState();
|
|
369
375
|
const getPrintEnvironment = () => ({
|
|
370
376
|
options: settings.printOptions,
|
|
371
|
-
isUsed:
|
|
372
|
-
isClashing:
|
|
377
|
+
isUsed: state.reader.isUsed,
|
|
378
|
+
isClashing: state.reader.isClashing,
|
|
373
379
|
});
|
|
374
|
-
const format = (expr: number) => printExpr(
|
|
380
|
+
const format = (expr: number) => printExpr(state.manager, getPrintEnvironment(), expr);
|
|
375
381
|
const display = (expr: number) => print(format(expr));
|
|
376
382
|
const report = (error: SmtParseError) =>
|
|
377
383
|
print(`(error "line ${error.line} column ${error.column}: ${error.message}")`);
|
|
378
384
|
const getNamedAssertions = () => {
|
|
379
|
-
const state = script.state;
|
|
380
385
|
const manager = state.manager;
|
|
381
|
-
const isNamed =
|
|
386
|
+
const isNamed = hasNames();
|
|
382
387
|
return state.assertions.map((assertion, index) =>
|
|
383
388
|
isNamed && state.names[index] !== -1
|
|
384
389
|
? manager.mkApp(OP_IMPLIES, [state.names[index], assertion], SORT_BOOL)
|
|
@@ -405,7 +410,6 @@ export const runSmtlibScript = (
|
|
|
405
410
|
};
|
|
406
411
|
};
|
|
407
412
|
const optimize = (extra: number[]) => {
|
|
408
|
-
const state = script.state;
|
|
409
413
|
const manager = state.manager;
|
|
410
414
|
const objectives = state.objectives;
|
|
411
415
|
const hard = [...getNamedAssertions(), ...state.names.filter((name) => name !== -1), ...extra];
|
|
@@ -423,7 +427,7 @@ export const runSmtlibScript = (
|
|
|
423
427
|
setup: getSetup(),
|
|
424
428
|
write: () => {},
|
|
425
429
|
parameters: settings.parameters,
|
|
426
|
-
hasDefinitions: () =>
|
|
430
|
+
hasDefinitions: () => state.reader.hasDefinitions(),
|
|
427
431
|
},
|
|
428
432
|
objectives,
|
|
429
433
|
);
|
|
@@ -431,7 +435,7 @@ export const runSmtlibScript = (
|
|
|
431
435
|
clearCheck();
|
|
432
436
|
state.manager.limit.push(settings.rlimit);
|
|
433
437
|
try {
|
|
434
|
-
const hasAssumptions = extra.length > 0 ||
|
|
438
|
+
const hasAssumptions = extra.length > 0 || hasNames();
|
|
435
439
|
const status = optimizer.optimize(hard, {
|
|
436
440
|
...getOptOptions(),
|
|
437
441
|
hasAssumptions,
|
|
@@ -448,14 +452,7 @@ export const runSmtlibScript = (
|
|
|
448
452
|
!hasAssumptions &&
|
|
449
453
|
settings.parameters.get("opt.incremental") !== "true",
|
|
450
454
|
});
|
|
451
|
-
optimizer.model
|
|
452
|
-
state.check = {
|
|
453
|
-
status,
|
|
454
|
-
context: undefined,
|
|
455
|
-
isOptimizing: true,
|
|
456
|
-
model: optimizer.model ?? undefined,
|
|
457
|
-
core: undefined,
|
|
458
|
-
};
|
|
455
|
+
setCheck(status, { isOptimizing: true, model: optimizer.model ?? undefined });
|
|
459
456
|
print(getVerdict(status));
|
|
460
457
|
return true;
|
|
461
458
|
} catch (error) {
|
|
@@ -466,13 +463,7 @@ export const runSmtlibScript = (
|
|
|
466
463
|
}
|
|
467
464
|
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
468
465
|
optimizer.release();
|
|
469
|
-
|
|
470
|
-
status: L_UNDEF,
|
|
471
|
-
context: undefined,
|
|
472
|
-
isOptimizing: true,
|
|
473
|
-
model: undefined,
|
|
474
|
-
core: undefined,
|
|
475
|
-
};
|
|
466
|
+
setCheck(L_UNDEF, { isOptimizing: true });
|
|
476
467
|
print("unknown");
|
|
477
468
|
return true;
|
|
478
469
|
} finally {
|
|
@@ -481,12 +472,11 @@ export const runSmtlibScript = (
|
|
|
481
472
|
}
|
|
482
473
|
};
|
|
483
474
|
const resetOptimizer = () => {
|
|
484
|
-
|
|
485
|
-
|
|
475
|
+
state.optimizer?.release();
|
|
476
|
+
state.optimizer = undefined;
|
|
486
477
|
};
|
|
487
478
|
// The port keeps answering with the smt kernel where it lacks a piece of the logic's strategy.
|
|
488
479
|
const solveWithStrategy = () => {
|
|
489
|
-
const state = script.state;
|
|
490
480
|
const goal = getGoal();
|
|
491
481
|
const strategy =
|
|
492
482
|
settings.parameters.get("tactic.default_tactic") ??
|
|
@@ -516,8 +506,12 @@ export const runSmtlibScript = (
|
|
|
516
506
|
isFindingMacros: settings.isFindingMacros,
|
|
517
507
|
setup: getSetup(),
|
|
518
508
|
});
|
|
509
|
+
// mk_special_solver_for_logic gives these logics the finite-domain solver, incremental or not.
|
|
510
|
+
const isUsingFdSolver = () =>
|
|
511
|
+
(state.logic === "QF_FD" || state.logic === "SAT") &&
|
|
512
|
+
!settings.isProducingProofs &&
|
|
513
|
+
!settings.parameters.has("tactic.default_tactic");
|
|
519
514
|
const checkSat = (extra: number[]) => {
|
|
520
|
-
const state = script.state;
|
|
521
515
|
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
522
516
|
// opt::context::optimize answers as the search of the hard constraints does: once they are
|
|
523
517
|
// satisfiable, optsmt and maxsmt only improve the model. The unported parts of optimization
|
|
@@ -532,14 +526,9 @@ export const runSmtlibScript = (
|
|
|
532
526
|
const isAssuming = isNamed || extra.length > 0;
|
|
533
527
|
if (isAssuming) state.isIncremental = true;
|
|
534
528
|
if (!isOptimizing) state.hasChecked = true;
|
|
535
|
-
// mk_special_solver_for_logic gives these logics the finite-domain solver, incremental or not.
|
|
536
|
-
const isFd =
|
|
537
|
-
(state.logic === "QF_FD" || state.logic === "SAT") &&
|
|
538
|
-
!settings.isProducingProofs &&
|
|
539
|
-
!settings.parameters.has("tactic.default_tactic");
|
|
540
529
|
const assumptions = isNamed ? [...names, ...extra] : extra;
|
|
541
530
|
const kernel =
|
|
542
|
-
isAssuming || (state.isIncremental && !isOptimizing && !
|
|
531
|
+
isAssuming || (state.isIncremental && !isOptimizing && !isUsingFdSolver())
|
|
543
532
|
? checkKernel(assumptions)
|
|
544
533
|
: undefined;
|
|
545
534
|
// Z3 retries a quantifier-free problem with its tactic when the incremental kernel gives up.
|
|
@@ -551,24 +540,16 @@ export const runSmtlibScript = (
|
|
|
551
540
|
manager.limit.inc())
|
|
552
541
|
? { ...solveWithStrategy(), core: undefined }
|
|
553
542
|
: kernel;
|
|
554
|
-
solved.
|
|
555
|
-
state.check = {
|
|
556
|
-
status: solved.result,
|
|
543
|
+
setCheck(solved.result, {
|
|
557
544
|
context: solved.context,
|
|
558
545
|
isOptimizing,
|
|
559
546
|
model: solved.model,
|
|
560
547
|
core: solved.core ?? solved.context?.unsatCore ?? [],
|
|
561
|
-
};
|
|
548
|
+
});
|
|
562
549
|
print(getVerdict(solved.result));
|
|
563
550
|
} catch (error) {
|
|
564
551
|
if (!(error instanceof SmtCanceledError || isStackOverflow(error))) throw error;
|
|
565
|
-
|
|
566
|
-
status: L_UNDEF,
|
|
567
|
-
context: undefined,
|
|
568
|
-
isOptimizing,
|
|
569
|
-
model: undefined,
|
|
570
|
-
core: undefined,
|
|
571
|
-
};
|
|
552
|
+
setCheck(L_UNDEF, { isOptimizing });
|
|
572
553
|
print("unknown");
|
|
573
554
|
} finally {
|
|
574
555
|
state.manager.limit.release();
|
|
@@ -576,27 +557,38 @@ export const runSmtlibScript = (
|
|
|
576
557
|
}
|
|
577
558
|
};
|
|
578
559
|
const getModel = (list: SmtList) => {
|
|
579
|
-
const check =
|
|
560
|
+
const check = state.check;
|
|
580
561
|
if (!settings.isProducingModels || check === undefined || check.status === L_FALSE)
|
|
581
562
|
throw new SmtParseError("model is not available", list.end);
|
|
582
563
|
if (check.model !== undefined) return check.model;
|
|
583
564
|
if (check.isOptimizing) throw new SmtUnsupportedError("the models of optimization");
|
|
584
565
|
if (check.context === undefined && check.status !== L_TRUE)
|
|
585
566
|
throw new SmtUnsupportedError("the model of a canceled search");
|
|
586
|
-
const model = check.context?.getModel() ?? new ProtoModel(
|
|
567
|
+
const model = check.context?.getModel() ?? new ProtoModel(state.manager);
|
|
587
568
|
model.incRef();
|
|
588
569
|
check.model = model;
|
|
589
570
|
return model;
|
|
590
571
|
};
|
|
591
572
|
const clearCheck = () => {
|
|
592
|
-
|
|
593
|
-
|
|
573
|
+
state.check?.model?.decRef();
|
|
574
|
+
state.check = undefined;
|
|
575
|
+
};
|
|
576
|
+
// The check holds a reference to its model until clearCheck.
|
|
577
|
+
const setCheck = (status: number, result: Partial<Omit<CheckResult, "status">> = {}) => {
|
|
578
|
+
result.model?.incRef();
|
|
579
|
+
state.check = {
|
|
580
|
+
status,
|
|
581
|
+
context: undefined,
|
|
582
|
+
isOptimizing: false,
|
|
583
|
+
model: undefined,
|
|
584
|
+
core: undefined,
|
|
585
|
+
...result,
|
|
586
|
+
};
|
|
594
587
|
};
|
|
595
588
|
// cmd_context::mk_solver: mk_solver_for_logic makes the incremental solver the smt kernel unless
|
|
596
589
|
// the logic, the default tactic or the sat parameters pick a sat solver. Under sat.euf that
|
|
597
590
|
// solver is inc_sat_solver in euf mode; the other sat solvers only store their assertions.
|
|
598
591
|
const resetKernel = () => {
|
|
599
|
-
const state = script.state;
|
|
600
592
|
const logic = state.logic;
|
|
601
593
|
const parameters = settings.parameters;
|
|
602
594
|
const isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
|
|
@@ -615,10 +607,13 @@ export const runSmtlibScript = (
|
|
|
615
607
|
isEuf && !isFdSolver && parameters.get("sat.smt") !== "true"
|
|
616
608
|
? new IncSatSolver(state.manager, getSatParams(parameters), true, mkThSolver)
|
|
617
609
|
: undefined;
|
|
610
|
+
for (let index = 0; index < state.scopes.length; index++) {
|
|
611
|
+
state.kernel?.push();
|
|
612
|
+
useEufSolver((solver) => solver.push());
|
|
613
|
+
}
|
|
618
614
|
};
|
|
619
615
|
// The parts of sat.euf that are not ported leave its answers to the smt kernel.
|
|
620
616
|
const useEufSolver = <Result>(action: (solver: IncSatSolver) => Result) => {
|
|
621
|
-
const state = script.state;
|
|
622
617
|
const solver = state.eufSolver;
|
|
623
618
|
if (solver === undefined) return undefined;
|
|
624
619
|
try {
|
|
@@ -632,7 +627,6 @@ export const runSmtlibScript = (
|
|
|
632
627
|
};
|
|
633
628
|
// solver_na2as asserts a named assertion as an implication from its name.
|
|
634
629
|
const assertInKernel = (formula: number, name: number) => {
|
|
635
|
-
const state = script.state;
|
|
636
630
|
const manager = state.manager;
|
|
637
631
|
const asserted = name === -1 ? formula : manager.mkApp(OP_IMPLIES, [name, formula], SORT_BOOL);
|
|
638
632
|
manager.incRef(asserted);
|
|
@@ -641,7 +635,6 @@ export const runSmtlibScript = (
|
|
|
641
635
|
manager.decRef(asserted);
|
|
642
636
|
};
|
|
643
637
|
const checkKernel = (assumptions: number[]) => {
|
|
644
|
-
const state = script.state;
|
|
645
638
|
const kernel = state.kernel;
|
|
646
639
|
const found = useEufSolver((solver) => {
|
|
647
640
|
const result = solver.check(assumptions);
|
|
@@ -666,31 +659,30 @@ export const runSmtlibScript = (
|
|
|
666
659
|
core: undefined,
|
|
667
660
|
};
|
|
668
661
|
};
|
|
669
|
-
let pendingText = "";
|
|
670
662
|
const printDiagnostic = (line: string) => print(line, !settings.isDiagnosticOnStdout);
|
|
671
663
|
const write = (text: string, isDiagnostic: boolean) => {
|
|
672
|
-
const lines =
|
|
673
|
-
|
|
664
|
+
const lines = text.split("\n");
|
|
665
|
+
const rest = lines.pop() ?? "";
|
|
674
666
|
for (const line of lines) (isDiagnostic ? printDiagnostic : print)(line);
|
|
667
|
+
pendingText += rest;
|
|
675
668
|
};
|
|
676
669
|
const getSetup = () => ({
|
|
677
|
-
logic:
|
|
670
|
+
logic: state.logic,
|
|
678
671
|
isAutoConfig:
|
|
679
672
|
settings.parameters.get("auto_config") !== "false" &&
|
|
680
673
|
settings.parameters.get("smt.auto_config") !== "false",
|
|
681
674
|
});
|
|
682
675
|
const getTacticEnvironment = () => ({
|
|
683
|
-
manager:
|
|
676
|
+
manager: state.manager,
|
|
684
677
|
isMbqi: settings.isMbqi,
|
|
685
678
|
mbqiMaxIterations: settings.mbqiMaxIterations,
|
|
686
679
|
isFindingMacros: settings.isFindingMacros,
|
|
687
680
|
setup: getSetup(),
|
|
688
681
|
write,
|
|
689
682
|
parameters: settings.parameters,
|
|
690
|
-
hasDefinitions: () =>
|
|
683
|
+
hasDefinitions: () => state.reader.hasDefinitions(),
|
|
691
684
|
});
|
|
692
685
|
const getDatalog = () => {
|
|
693
|
-
const state = script.state;
|
|
694
686
|
state.datalog ??= createDatalogContext(
|
|
695
687
|
state.manager,
|
|
696
688
|
settings.parameters,
|
|
@@ -701,7 +693,6 @@ export const runSmtlibScript = (
|
|
|
701
693
|
const getTactic = (sexpr: SExpr, end: SmtList["end"]) =>
|
|
702
694
|
compileTactic(getTacticEnvironment(), sexpr, end);
|
|
703
695
|
const getGoal = (isTrackingDependencies = false) => {
|
|
704
|
-
const state = script.state;
|
|
705
696
|
const goal = new Goal(state.manager);
|
|
706
697
|
goal.isProofsEnabled = settings.isProducingProofs || state.isProofsEnabled === true;
|
|
707
698
|
goal.isCoresEnabled = settings.isProducingUnsatCores;
|
|
@@ -714,11 +705,18 @@ export const runSmtlibScript = (
|
|
|
714
705
|
);
|
|
715
706
|
return goal;
|
|
716
707
|
};
|
|
717
|
-
const hasNames = () =>
|
|
718
|
-
|
|
719
|
-
|
|
708
|
+
const hasNames = () => state.names.some((name) => name !== -1);
|
|
709
|
+
// parse_check_sat shrinks the expression stack once the check has run.
|
|
710
|
+
const checkSatAssuming = (items: SmtList["items"]) => {
|
|
711
|
+
const literals: number[] = [];
|
|
712
|
+
try {
|
|
713
|
+
for (const item of items) literals.push(state.reader.parseFormula(item));
|
|
714
|
+
checkSat(literals);
|
|
715
|
+
} finally {
|
|
716
|
+
for (const literal of literals) state.manager.decRef(literal);
|
|
717
|
+
}
|
|
718
|
+
};
|
|
720
719
|
const addObjective = (list: SmtList, isMax: boolean) => {
|
|
721
|
-
const state = script.state;
|
|
722
720
|
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
723
721
|
const sort = state.manager.sorts[term];
|
|
724
722
|
if (sort !== SORT_INT && sort !== SORT_REAL && !state.manager.isBvSort(sort))
|
|
@@ -734,7 +732,6 @@ export const runSmtlibScript = (
|
|
|
734
732
|
});
|
|
735
733
|
};
|
|
736
734
|
const releaseObjectives = (size: number, softSize: number) => {
|
|
737
|
-
const state = script.state;
|
|
738
735
|
for (const index of state.softTrail.splice(softSize).reverse()) {
|
|
739
736
|
const objective = state.objectives[index];
|
|
740
737
|
state.manager.decRef(objective.terms.pop() as number);
|
|
@@ -744,13 +741,11 @@ export const runSmtlibScript = (
|
|
|
744
741
|
if (objective.type !== O_MAXSMT) state.manager.decRef(objective.term);
|
|
745
742
|
};
|
|
746
743
|
const restoreAssertions = (size: number) => {
|
|
747
|
-
const state = script.state;
|
|
748
744
|
for (const assertion of state.assertions.splice(size)) state.manager.decRef(assertion);
|
|
749
745
|
for (const name of state.names.splice(size)) if (name !== -1) state.manager.decRef(name);
|
|
750
746
|
state.assertionTexts.length = size;
|
|
751
747
|
};
|
|
752
748
|
const instantiate = (list: SmtList, isNested: boolean) => {
|
|
753
|
-
const state = script.state;
|
|
754
749
|
const manager = state.manager;
|
|
755
750
|
const outer = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
756
751
|
if (manager.kinds[outer] !== KIND_QUANTIFIER)
|
|
@@ -781,698 +776,839 @@ export const runSmtlibScript = (
|
|
|
781
776
|
manager.decRef(result);
|
|
782
777
|
manager.decRef(substituted);
|
|
783
778
|
};
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
|
|
787
|
-
|
|
788
|
-
const
|
|
789
|
-
|
|
790
|
-
if (logicError !== undefined) {
|
|
791
|
-
state.manager.decRef(assertion.formula);
|
|
792
|
-
throw new SmtParseError(logicError, list.end);
|
|
793
|
-
}
|
|
794
|
-
state.assertions.push(assertion.formula);
|
|
795
|
-
state.assertionTexts.push(
|
|
796
|
-
text.slice(term.offset, (term.kind === "list" ? term.end : term).endOffset).trim(),
|
|
797
|
-
);
|
|
798
|
-
if (state.hasChecked) state.isIncremental = true;
|
|
799
|
-
resetOptimizer();
|
|
800
|
-
if (!settings.isProducingUnsatCores || assertion.name === undefined) state.names.push(-1);
|
|
801
|
-
else {
|
|
802
|
-
const manager = state.manager;
|
|
803
|
-
const answer = manager.mkApp(
|
|
804
|
-
manager.mkFuncDecl(assertion.name, [], SORT_BOOL, true),
|
|
805
|
-
[],
|
|
806
|
-
SORT_BOOL,
|
|
807
|
-
);
|
|
808
|
-
manager.incRef(answer);
|
|
809
|
-
state.names.push(answer);
|
|
810
|
-
}
|
|
811
|
-
assertInKernel(assertion.formula, state.names[state.names.length - 1]);
|
|
812
|
-
clearCheck();
|
|
813
|
-
},
|
|
814
|
-
"check-sat": (list) => checkSat(parseFormulas(list.items.slice(1))),
|
|
815
|
-
"declare-rel": (list) => {
|
|
816
|
-
const state = script.state;
|
|
817
|
-
const name = list.items[1];
|
|
818
|
-
const domain = list.items[2];
|
|
819
|
-
if (!isSymbol(name) || domain?.kind !== "list")
|
|
820
|
-
throw new SmtParseError("at least 2 arguments expected", list.end);
|
|
821
|
-
const decl = state.manager.mkFuncDecl(
|
|
822
|
-
name.text,
|
|
823
|
-
domain.items.map((sort) => state.reader.parseSort(sort)),
|
|
824
|
-
SORT_BOOL,
|
|
825
|
-
);
|
|
826
|
-
state.reader.insertFunc(decl, list.end);
|
|
827
|
-
getDatalog().registerPredicate(decl);
|
|
828
|
-
},
|
|
829
|
-
"declare-var": (list) => {
|
|
830
|
-
const state = script.state;
|
|
831
|
-
const name = list.items[1];
|
|
832
|
-
const sort = list.items[2];
|
|
833
|
-
if (!isSymbol(name) || sort === undefined)
|
|
834
|
-
throw new SmtParseError("invalid declare-var command, symbol and sort expected", list.end);
|
|
835
|
-
const manager = state.manager;
|
|
836
|
-
const range = state.reader.parseSort(sort);
|
|
837
|
-
const decl = manager.mkFuncDecl(name.text, [], range);
|
|
838
|
-
state.reader.insertFunc(decl, list.end);
|
|
839
|
-
getDatalog().registerVariable(manager.mkApp(decl, [], range));
|
|
840
|
-
},
|
|
841
|
-
rule: (list) => {
|
|
842
|
-
const rule = list.items[1];
|
|
843
|
-
if (rule === undefined) throw new SmtParseError("invalid rule, expected formula", list.end);
|
|
844
|
-
const name = list.items[2];
|
|
845
|
-
getDatalog().addRule(script.state.reader.parseFormula(rule), isSymbol(name) ? name.text : "");
|
|
846
|
-
},
|
|
847
|
-
query: (list) => {
|
|
848
|
-
const state = script.state;
|
|
849
|
-
const target = list.items[1];
|
|
850
|
-
if (!isSymbol(target))
|
|
851
|
-
throw new SmtParseError("invalid query command, argument expected", list.end);
|
|
852
|
-
const decls = state.reader.getFuncs(target.text);
|
|
853
|
-
if (decls.length !== 1)
|
|
779
|
+
// parser::parse_func_decl_ref: a name, or a name with its signature. Z3 ends the message of an
|
|
780
|
+
// unexpected token with the last identifier it read.
|
|
781
|
+
const getFuncDeclRef = (reference: SExpr) => {
|
|
782
|
+
if (isSymbol(reference)) {
|
|
783
|
+
const decls = state.reader.getFuncs(reference.text);
|
|
784
|
+
if (decls.length > 1)
|
|
854
785
|
throw new SmtParseError(
|
|
855
|
-
`
|
|
856
|
-
|
|
786
|
+
`ambiguous function declaration reference, provide full signature to disambiguate (<symbol> (<sort>*) <sort>) ${reference.text}`,
|
|
787
|
+
reference,
|
|
857
788
|
);
|
|
858
|
-
|
|
859
|
-
const relation = decls[0];
|
|
860
|
-
if (!datalog.isPredicateDecl(relation))
|
|
789
|
+
if (decls.length === 0)
|
|
861
790
|
throw new SmtParseError(
|
|
862
|
-
|
|
863
|
-
|
|
791
|
+
`invalid function declaration reference, unknown function ${reference.text}`,
|
|
792
|
+
reference,
|
|
864
793
|
);
|
|
865
|
-
|
|
866
|
-
|
|
867
|
-
|
|
868
|
-
|
|
869
|
-
|
|
870
|
-
|
|
871
|
-
|
|
872
|
-
|
|
873
|
-
|
|
874
|
-
|
|
875
|
-
|
|
876
|
-
|
|
877
|
-
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
884
|
-
|
|
885
|
-
|
|
886
|
-
|
|
887
|
-
|
|
888
|
-
|
|
889
|
-
|
|
890
|
-
|
|
891
|
-
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
895
|
-
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
905
|
-
|
|
906
|
-
|
|
907
|
-
|
|
794
|
+
return decls[0];
|
|
795
|
+
}
|
|
796
|
+
const name = reference.kind === "list" ? (reference.items[0] ?? reference.end) : reference;
|
|
797
|
+
if (reference.kind !== "list" || name.kind !== "symbol") {
|
|
798
|
+
if (name.kind === "list")
|
|
799
|
+
throw new SmtUnsupportedError("an indexed function declaration reference");
|
|
800
|
+
throw new SmtParseError(
|
|
801
|
+
"invalid function declaration reference, symbol or '(' expected got query",
|
|
802
|
+
name,
|
|
803
|
+
);
|
|
804
|
+
}
|
|
805
|
+
const domain = reference.items[1] ?? reference.end;
|
|
806
|
+
if (domain.kind !== "list")
|
|
807
|
+
throw new SmtParseError(
|
|
808
|
+
`Invalid function name. Expecting sort list starting with '(' to disambiguate function name got ${domain.kind === "symbol" || domain.kind === "keyword" ? domain.text : name.text}`,
|
|
809
|
+
domain,
|
|
810
|
+
);
|
|
811
|
+
const sorts = domain.items.map((sort) => state.reader.parseSort(sort));
|
|
812
|
+
if (reference.items[2] === undefined)
|
|
813
|
+
throw new SmtParseError("Invalid function name invalid sort, unexpected ')'", reference.end);
|
|
814
|
+
const range = state.reader.parseSort(reference.items[2]);
|
|
815
|
+
const follower = reference.items[3] ?? reference.end;
|
|
816
|
+
const found = state.reader.getFuncs(name.text).find((decl) => {
|
|
817
|
+
const funcDecl = state.manager.funcDecls[decl];
|
|
818
|
+
return (
|
|
819
|
+
funcDecl.range === range &&
|
|
820
|
+
funcDecl.domain.length === sorts.length &&
|
|
821
|
+
funcDecl.domain.every((sort, index) => sort === sorts[index])
|
|
822
|
+
);
|
|
823
|
+
});
|
|
824
|
+
if (found === undefined)
|
|
825
|
+
throw new SmtParseError(
|
|
826
|
+
`invalid function declaration reference, unknown indexed function ${name.text}`,
|
|
827
|
+
follower,
|
|
828
|
+
);
|
|
829
|
+
if (follower !== reference.end)
|
|
830
|
+
throw new SmtUnsupportedError("a function declaration reference with trailing terms");
|
|
831
|
+
return found;
|
|
832
|
+
};
|
|
833
|
+
const runCommand = new Map<string, (list: SmtList) => void>([
|
|
834
|
+
[
|
|
835
|
+
"assert",
|
|
836
|
+
(list) => {
|
|
837
|
+
const term = list.items[1] ?? list.end;
|
|
838
|
+
const assertion = state.reader.parseAssertion(term);
|
|
839
|
+
const logicError = state.reader.getLogicError(assertion.formula);
|
|
840
|
+
if (logicError !== undefined) {
|
|
841
|
+
state.manager.decRef(assertion.formula);
|
|
842
|
+
throw new SmtParseError(logicError, list.end);
|
|
843
|
+
}
|
|
844
|
+
state.assertions.push(assertion.formula);
|
|
845
|
+
state.assertionTexts.push(
|
|
846
|
+
text.slice(term.offset, (term.kind === "list" ? term.end : term).endOffset).trim(),
|
|
908
847
|
);
|
|
909
|
-
|
|
910
|
-
|
|
911
|
-
|
|
912
|
-
|
|
913
|
-
|
|
914
|
-
|
|
915
|
-
|
|
916
|
-
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
921
|
-
|
|
922
|
-
|
|
923
|
-
|
|
924
|
-
|
|
925
|
-
|
|
926
|
-
|
|
927
|
-
|
|
928
|
-
|
|
929
|
-
|
|
930
|
-
|
|
931
|
-
|
|
932
|
-
if (
|
|
933
|
-
|
|
934
|
-
|
|
935
|
-
|
|
936
|
-
|
|
937
|
-
|
|
938
|
-
|
|
939
|
-
|
|
940
|
-
|
|
941
|
-
|
|
942
|
-
|
|
943
|
-
|
|
848
|
+
if (state.hasChecked) state.isIncremental = true;
|
|
849
|
+
resetOptimizer();
|
|
850
|
+
if (!settings.isProducingUnsatCores || assertion.name === undefined) state.names.push(-1);
|
|
851
|
+
else {
|
|
852
|
+
const manager = state.manager;
|
|
853
|
+
const answer = manager.mkApp(
|
|
854
|
+
manager.mkFuncDecl(assertion.name, [], SORT_BOOL, true),
|
|
855
|
+
[],
|
|
856
|
+
SORT_BOOL,
|
|
857
|
+
);
|
|
858
|
+
manager.incRef(answer);
|
|
859
|
+
state.names.push(answer);
|
|
860
|
+
}
|
|
861
|
+
assertInKernel(assertion.formula, state.names[state.names.length - 1]);
|
|
862
|
+
clearCheck();
|
|
863
|
+
},
|
|
864
|
+
],
|
|
865
|
+
["check-sat", (list) => checkSatAssuming(list.items.slice(1))],
|
|
866
|
+
[
|
|
867
|
+
"declare-rel",
|
|
868
|
+
(list) => {
|
|
869
|
+
const name = list.items[1];
|
|
870
|
+
const domain = list.items[2];
|
|
871
|
+
if (!isSymbol(name) || domain?.kind !== "list")
|
|
872
|
+
throw new SmtParseError("at least 2 arguments expected", list.end);
|
|
873
|
+
const decl = state.manager.mkFuncDecl(
|
|
874
|
+
name.text,
|
|
875
|
+
domain.items.map((sort) => state.reader.parseSort(sort)),
|
|
876
|
+
SORT_BOOL,
|
|
877
|
+
);
|
|
878
|
+
state.reader.insertFunc(decl, list.end);
|
|
879
|
+
getDatalog().registerPredicate(decl);
|
|
880
|
+
},
|
|
881
|
+
],
|
|
882
|
+
[
|
|
883
|
+
"declare-var",
|
|
884
|
+
(list) => {
|
|
885
|
+
const name = list.items[1];
|
|
886
|
+
const sort = list.items[2];
|
|
887
|
+
if (!isSymbol(name) || sort === undefined)
|
|
888
|
+
throw new SmtParseError(
|
|
889
|
+
"invalid declare-var command, symbol and sort expected",
|
|
890
|
+
list.end,
|
|
891
|
+
);
|
|
892
|
+
const manager = state.manager;
|
|
893
|
+
const range = state.reader.parseSort(sort);
|
|
894
|
+
const decl = manager.mkFuncDecl(name.text, [], range);
|
|
895
|
+
state.reader.insertFunc(decl, list.end);
|
|
896
|
+
getDatalog().registerVariable(manager.mkApp(decl, [], range));
|
|
897
|
+
},
|
|
898
|
+
],
|
|
899
|
+
[
|
|
900
|
+
"rule",
|
|
901
|
+
(list) => {
|
|
902
|
+
const rule = list.items[1];
|
|
903
|
+
if (rule === undefined) throw new SmtParseError("invalid rule, expected formula", list.end);
|
|
904
|
+
const name = list.items[2];
|
|
905
|
+
getDatalog().addRule(state.reader.parseFormula(rule), isSymbol(name) ? name.text : "");
|
|
906
|
+
},
|
|
907
|
+
],
|
|
908
|
+
[
|
|
909
|
+
"query",
|
|
910
|
+
(list) => {
|
|
911
|
+
if (list.items[1] === undefined)
|
|
912
|
+
throw new SmtParseError("invalid query command, argument expected", list.end);
|
|
913
|
+
const relation = getFuncDeclRef(list.items[1]);
|
|
914
|
+
const datalog = getDatalog();
|
|
915
|
+
// dl_query_cmd::set_next_arg runs once the parser is past the reference.
|
|
916
|
+
const follower = list.items[2] ?? list.end;
|
|
917
|
+
if (!datalog.isPredicateDecl(relation))
|
|
918
|
+
throw new SmtParseError(
|
|
919
|
+
"Invalid query argument, expected a predicate registered as a relation",
|
|
920
|
+
follower,
|
|
921
|
+
);
|
|
922
|
+
if (follower.kind !== "keyword" && follower !== list.end)
|
|
923
|
+
throw new SmtParseError("invalid command argument, keyword expected", follower);
|
|
924
|
+
for (const assertion of state.assertions) datalog.assertExpr(assertion);
|
|
925
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
926
|
+
state.manager.limit.push(settings.rlimit);
|
|
927
|
+
try {
|
|
928
|
+
print(getVerdict(datalog.relQuery(relation)));
|
|
929
|
+
} catch (error) {
|
|
930
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
931
|
+
print(`(error "query failed: ${error.message}")`);
|
|
932
|
+
print("unknown");
|
|
933
|
+
} finally {
|
|
934
|
+
state.manager.limit.pop();
|
|
935
|
+
}
|
|
936
|
+
},
|
|
937
|
+
],
|
|
938
|
+
[
|
|
939
|
+
"check-sat-using",
|
|
940
|
+
(list) => {
|
|
941
|
+
const params = getCommandParams(list.items, CHECK_SAT_USING_PARAMETERS);
|
|
942
|
+
if (list.items[1] === undefined)
|
|
943
|
+
throw new SmtParseError("check-sat-using needs a tactic argument", list.end);
|
|
944
|
+
const builder = getTactic(list.items[1], list.end);
|
|
945
|
+
const tactic = builder.build(params);
|
|
946
|
+
clearCheck();
|
|
947
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
948
|
+
state.manager.limit.push(settings.rlimit);
|
|
949
|
+
try {
|
|
950
|
+
const checked = checkSatUsing(tactic, getGoal(builder.isTrackingDependencies));
|
|
951
|
+
setCheck(checked.status, {
|
|
952
|
+
model: checked.model,
|
|
953
|
+
core:
|
|
954
|
+
builder.isTrackingDependencies || !hasNames()
|
|
955
|
+
? getDependencyValues(checked.core)
|
|
956
|
+
: undefined,
|
|
957
|
+
reasonUnknown: checked.reasonUnknown,
|
|
958
|
+
});
|
|
959
|
+
print(getVerdict(checked.status));
|
|
960
|
+
} finally {
|
|
961
|
+
state.manager.limit.pop();
|
|
962
|
+
}
|
|
963
|
+
},
|
|
964
|
+
],
|
|
965
|
+
[
|
|
966
|
+
"check-sat-assuming",
|
|
967
|
+
(list) => {
|
|
968
|
+
const literals = list.items[1];
|
|
969
|
+
if (literals?.kind !== "list")
|
|
970
|
+
throw new SmtParseError(
|
|
971
|
+
"invalid check-sat-assuming command, '(' expected",
|
|
972
|
+
literals ?? list.end,
|
|
973
|
+
);
|
|
974
|
+
checkSatAssuming(literals.items);
|
|
975
|
+
},
|
|
976
|
+
],
|
|
977
|
+
[
|
|
978
|
+
"get-consequences",
|
|
979
|
+
(list) => {
|
|
980
|
+
const manager = state.manager;
|
|
981
|
+
const [assumptions, vars] = [list.items[1], list.items[2]].map((terms) => {
|
|
982
|
+
if (terms === undefined)
|
|
983
|
+
throw new SmtParseError("invalid command, argument(s) missing", list.end);
|
|
984
|
+
if (terms.kind !== "list")
|
|
985
|
+
throw new SmtParseError("invalid list of terms, '(' expected", terms);
|
|
986
|
+
return terms.items.map((item) => state.reader.parseTerm(item));
|
|
987
|
+
});
|
|
988
|
+
if (list.items.length > 3)
|
|
989
|
+
throw new SmtParseError("invalid command, too many arguments", list.items[3]);
|
|
990
|
+
clearCheck();
|
|
991
|
+
manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
992
|
+
manager.limit.push(settings.rlimit);
|
|
993
|
+
const names = state.names.filter((name) => name !== -1);
|
|
994
|
+
try {
|
|
995
|
+
if (isUsingFdSolver()) {
|
|
996
|
+
if (names.length > 0)
|
|
997
|
+
throw new SmtUnsupportedError("the named assertions of the finite-domain solver");
|
|
998
|
+
const found = getFdConsequences(
|
|
999
|
+
manager,
|
|
1000
|
+
new Map(),
|
|
1001
|
+
state.assertions,
|
|
1002
|
+
assumptions,
|
|
1003
|
+
vars,
|
|
1004
|
+
);
|
|
1005
|
+
setCheck(found.result, { model: found.model });
|
|
1006
|
+
print(getVerdict(found.result));
|
|
1007
|
+
print("");
|
|
1008
|
+
for (const consequence of found.consequences.items) display(consequence);
|
|
1009
|
+
found.consequences.reset();
|
|
1010
|
+
return;
|
|
1011
|
+
}
|
|
1012
|
+
const kernel = state.kernel ?? new SmtKernel(manager, getKernelParams());
|
|
1013
|
+
if (state.kernel === undefined)
|
|
1014
|
+
for (const assertion of getNamedAssertions()) kernel.assertExpr(assertion);
|
|
1015
|
+
const found = getConsequences(kernel, [...names, ...assumptions], vars);
|
|
1016
|
+
setCheck(found.result, { context: kernel.context, core: kernel.context.unsatCore });
|
|
944
1017
|
print(getVerdict(found.result));
|
|
945
1018
|
print("");
|
|
946
1019
|
for (const consequence of found.consequences.items) display(consequence);
|
|
947
1020
|
found.consequences.reset();
|
|
948
|
-
|
|
1021
|
+
} finally {
|
|
1022
|
+
manager.limit.pop();
|
|
949
1023
|
}
|
|
950
|
-
|
|
951
|
-
|
|
952
|
-
|
|
953
|
-
|
|
954
|
-
|
|
955
|
-
|
|
956
|
-
|
|
957
|
-
|
|
958
|
-
|
|
959
|
-
|
|
960
|
-
|
|
961
|
-
|
|
962
|
-
|
|
963
|
-
|
|
964
|
-
found.consequences.reset();
|
|
965
|
-
} finally {
|
|
966
|
-
manager.limit.pop();
|
|
967
|
-
}
|
|
968
|
-
},
|
|
969
|
-
minimize: (list) => addObjective(list, false),
|
|
970
|
-
maximize: (list) => addObjective(list, true),
|
|
971
|
-
"assert-soft": (list) => {
|
|
972
|
-
const state = script.state;
|
|
973
|
-
const formula = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
974
|
-
if (state.manager.sorts[formula] !== SORT_BOOL)
|
|
975
|
-
throw new SmtParseError("Invalid type for expression. Expected Boolean type.", list.end);
|
|
976
|
-
const parameters = getSoftParameters(list.items.slice(2));
|
|
977
|
-
resetOptimizer();
|
|
978
|
-
const existing = state.objectives.findIndex(
|
|
979
|
-
(objective) => objective.type === O_MAXSMT && objective.id === parameters.id,
|
|
980
|
-
);
|
|
981
|
-
const index = existing === -1 ? state.objectives.length : existing;
|
|
982
|
-
if (existing === -1)
|
|
983
|
-
state.objectives.push({
|
|
984
|
-
type: O_MAXSMT,
|
|
985
|
-
term: -1,
|
|
986
|
-
terms: [],
|
|
987
|
-
weights: [],
|
|
988
|
-
id: parameters.id,
|
|
989
|
-
});
|
|
990
|
-
if (parameters.weight.isZero()) return;
|
|
991
|
-
state.manager.incRef(formula);
|
|
992
|
-
state.objectives[index].terms.push(formula);
|
|
993
|
-
state.objectives[index].weights.push(parameters.weight);
|
|
994
|
-
state.softTrail.push(index);
|
|
995
|
-
},
|
|
996
|
-
push: (list) => {
|
|
997
|
-
const state = script.state;
|
|
998
|
-
clearCheck();
|
|
999
|
-
for (let index = getScopeCount(list); index > 0; index--) {
|
|
1000
|
-
state.scopes.push({
|
|
1001
|
-
assertions: state.assertions.length,
|
|
1002
|
-
objectives: state.objectives.length,
|
|
1003
|
-
softTrail: state.softTrail.length,
|
|
1004
|
-
});
|
|
1005
|
-
state.reader.push();
|
|
1006
|
-
state.isIncremental = true;
|
|
1007
|
-
state.kernel?.push();
|
|
1008
|
-
useEufSolver((solver) => solver.push());
|
|
1009
|
-
}
|
|
1010
|
-
},
|
|
1011
|
-
pop: (list) => {
|
|
1012
|
-
const state = script.state;
|
|
1013
|
-
const count = getScopeCount(list);
|
|
1014
|
-
if (count > state.scopes.length)
|
|
1015
|
-
throw new SmtParseError(
|
|
1016
|
-
"invalid pop command, argument is greater than the current stack depth",
|
|
1017
|
-
list.end,
|
|
1024
|
+
},
|
|
1025
|
+
],
|
|
1026
|
+
["minimize", (list) => addObjective(list, false)],
|
|
1027
|
+
["maximize", (list) => addObjective(list, true)],
|
|
1028
|
+
[
|
|
1029
|
+
"assert-soft",
|
|
1030
|
+
(list) => {
|
|
1031
|
+
const formula = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1032
|
+
if (state.manager.sorts[formula] !== SORT_BOOL)
|
|
1033
|
+
throw new SmtParseError("Invalid type for expression. Expected Boolean type.", list.end);
|
|
1034
|
+
const parameters = getSoftParameters(list.items.slice(2));
|
|
1035
|
+
resetOptimizer();
|
|
1036
|
+
const existing = state.objectives.findIndex(
|
|
1037
|
+
(objective) => objective.type === O_MAXSMT && objective.id === parameters.id,
|
|
1018
1038
|
);
|
|
1019
|
-
|
|
1020
|
-
|
|
1021
|
-
|
|
1022
|
-
|
|
1023
|
-
|
|
1024
|
-
|
|
1025
|
-
|
|
1026
|
-
|
|
1027
|
-
|
|
1028
|
-
|
|
1029
|
-
|
|
1030
|
-
|
|
1031
|
-
|
|
1032
|
-
|
|
1033
|
-
|
|
1034
|
-
|
|
1035
|
-
|
|
1036
|
-
|
|
1037
|
-
|
|
1038
|
-
|
|
1039
|
-
|
|
1040
|
-
|
|
1041
|
-
|
|
1042
|
-
|
|
1043
|
-
|
|
1044
|
-
|
|
1045
|
-
|
|
1039
|
+
const index = existing === -1 ? state.objectives.length : existing;
|
|
1040
|
+
if (existing === -1)
|
|
1041
|
+
state.objectives.push({
|
|
1042
|
+
type: O_MAXSMT,
|
|
1043
|
+
term: -1,
|
|
1044
|
+
terms: [],
|
|
1045
|
+
weights: [],
|
|
1046
|
+
id: parameters.id,
|
|
1047
|
+
});
|
|
1048
|
+
if (parameters.weight.isZero()) return;
|
|
1049
|
+
state.manager.incRef(formula);
|
|
1050
|
+
state.objectives[index].terms.push(formula);
|
|
1051
|
+
state.objectives[index].weights.push(parameters.weight);
|
|
1052
|
+
state.softTrail.push(index);
|
|
1053
|
+
},
|
|
1054
|
+
],
|
|
1055
|
+
[
|
|
1056
|
+
"push",
|
|
1057
|
+
(list) => {
|
|
1058
|
+
clearCheck();
|
|
1059
|
+
for (let index = getScopeCount(list); index > 0; index--) {
|
|
1060
|
+
state.scopes.push({
|
|
1061
|
+
assertions: state.assertions.length,
|
|
1062
|
+
objectives: state.objectives.length,
|
|
1063
|
+
softTrail: state.softTrail.length,
|
|
1064
|
+
});
|
|
1065
|
+
state.reader.push();
|
|
1066
|
+
state.isIncremental = true;
|
|
1046
1067
|
state.kernel?.push();
|
|
1047
1068
|
useEufSolver((solver) => solver.push());
|
|
1048
1069
|
}
|
|
1049
|
-
}
|
|
1050
|
-
|
|
1051
|
-
|
|
1052
|
-
|
|
1053
|
-
|
|
1054
|
-
|
|
1055
|
-
|
|
1056
|
-
|
|
1057
|
-
|
|
1058
|
-
|
|
1059
|
-
|
|
1060
|
-
|
|
1061
|
-
|
|
1062
|
-
|
|
1063
|
-
|
|
1064
|
-
|
|
1065
|
-
|
|
1066
|
-
|
|
1067
|
-
|
|
1068
|
-
|
|
1069
|
-
|
|
1070
|
+
},
|
|
1071
|
+
],
|
|
1072
|
+
[
|
|
1073
|
+
"pop",
|
|
1074
|
+
(list) => {
|
|
1075
|
+
const count = getScopeCount(list);
|
|
1076
|
+
if (count > state.scopes.length)
|
|
1077
|
+
throw new SmtParseError(
|
|
1078
|
+
"invalid pop command, argument is greater than the current stack depth",
|
|
1079
|
+
list.end,
|
|
1080
|
+
);
|
|
1081
|
+
clearCheck();
|
|
1082
|
+
if (count === 0) return;
|
|
1083
|
+
state.isIncremental = true;
|
|
1084
|
+
const scope = state.scopes[state.scopes.length - count];
|
|
1085
|
+
state.kernel?.pop(count);
|
|
1086
|
+
useEufSolver((solver) => solver.pop(count));
|
|
1087
|
+
for (let index = 0; index < count; index++) state.reader.pop();
|
|
1088
|
+
restoreAssertions(scope.assertions);
|
|
1089
|
+
resetOptimizer();
|
|
1090
|
+
releaseObjectives(scope.objectives, scope.softTrail);
|
|
1091
|
+
state.scopes.length -= count;
|
|
1092
|
+
},
|
|
1093
|
+
],
|
|
1094
|
+
[
|
|
1095
|
+
"reset",
|
|
1096
|
+
() => {
|
|
1097
|
+
clearCheck();
|
|
1098
|
+
resetOptimizer();
|
|
1099
|
+
state = createState();
|
|
1100
|
+
},
|
|
1101
|
+
],
|
|
1102
|
+
[
|
|
1103
|
+
"reset-assertions",
|
|
1104
|
+
() => {
|
|
1105
|
+
clearCheck();
|
|
1106
|
+
restoreAssertions(0);
|
|
1107
|
+
resetOptimizer();
|
|
1108
|
+
releaseObjectives(0, 0);
|
|
1109
|
+
state.scopes = state.scopes.map(() => ({ assertions: 0, objectives: 0, softTrail: 0 }));
|
|
1110
|
+
if (state.isProofsEnabled !== undefined) resetKernel();
|
|
1111
|
+
state.isIncremental = state.scopes.length > 0;
|
|
1112
|
+
state.hasChecked = false;
|
|
1113
|
+
},
|
|
1114
|
+
],
|
|
1115
|
+
[
|
|
1116
|
+
"simplify",
|
|
1117
|
+
(list) => {
|
|
1118
|
+
const manager = state.manager;
|
|
1119
|
+
if (list.items.length < 2)
|
|
1120
|
+
throw new SmtParseError("invalid simplify command, argument expected", list.end);
|
|
1121
|
+
const term = state.reader.parseTerm(list.items[1]);
|
|
1122
|
+
manager.incRef(term);
|
|
1123
|
+
const rewriter = new Rewriter(
|
|
1124
|
+
manager,
|
|
1125
|
+
getRewriterOptions(manager, getSimplifyParams(list.items.slice(2))),
|
|
1126
|
+
);
|
|
1127
|
+
const simplified = rewriter.rewrite(term);
|
|
1128
|
+
rewriter.cleanup();
|
|
1129
|
+
display(simplified);
|
|
1130
|
+
rewriter.release();
|
|
1131
|
+
manager.decRef(simplified);
|
|
1132
|
+
manager.decRef(term);
|
|
1133
|
+
},
|
|
1134
|
+
],
|
|
1070
1135
|
// The Boolean rewriter alone matches the simplifier only on Boolean structure over constants.
|
|
1071
|
-
|
|
1072
|
-
|
|
1073
|
-
|
|
1074
|
-
throw new SmtParseError("invalid command, one argument expected", list.end);
|
|
1075
|
-
const term = script.state.reader.parseTerm(list.items[1]);
|
|
1076
|
-
manager.incRef(term);
|
|
1077
|
-
const visited = new Set<number>();
|
|
1078
|
-
const todo = [term];
|
|
1079
|
-
while (todo.length > 0) {
|
|
1080
|
-
const expr = todo.pop() as number;
|
|
1081
|
-
if (visited.has(expr)) continue;
|
|
1082
|
-
visited.add(expr);
|
|
1083
|
-
const family = manager.kinds[expr] === KIND_APP ? manager.getFamily(expr) : -1;
|
|
1084
|
-
if (family !== FAMILY_BASIC && family !== FAMILY_USER && !manager.isNumeral(expr))
|
|
1085
|
-
throw new SmtUnsupportedError("the command dbg-bool-flat-rewriter beyond Boolean terms");
|
|
1086
|
-
manager.pushArgs(expr, todo);
|
|
1087
|
-
}
|
|
1088
|
-
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
1089
|
-
const rewritten = rewriter.rewrite(term);
|
|
1090
|
-
display(rewritten);
|
|
1091
|
-
rewriter.release();
|
|
1092
|
-
manager.decRef(rewritten);
|
|
1093
|
-
manager.decRef(term);
|
|
1094
|
-
},
|
|
1095
|
-
apply: (list) => {
|
|
1096
|
-
const state = script.state;
|
|
1097
|
-
const params = getCommandParams(list.items, APPLY_PARAMETERS);
|
|
1098
|
-
if (list.items[1] === undefined)
|
|
1099
|
-
throw new SmtParseError("apply needs a tactic argument", list.end);
|
|
1100
|
-
const builder = getTactic(list.items[1], list.end);
|
|
1101
|
-
const tactic = builder.build(params);
|
|
1102
|
-
const isPrintingDependencies = params.get("print_dependencies") === true;
|
|
1103
|
-
if (isPrintingDependencies && !builder.isTrackingDependencies && hasNames())
|
|
1104
|
-
throw new SmtUnsupportedError("the dependencies of a tactic that drops dependencies");
|
|
1105
|
-
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1106
|
-
const input = getGoal(builder.isTrackingDependencies);
|
|
1107
|
-
const goals = (() => {
|
|
1108
|
-
try {
|
|
1109
|
-
return applyTactic(tactic, input);
|
|
1110
|
-
} catch (error) {
|
|
1111
|
-
if (!(error instanceof SmtTacticError)) throw error;
|
|
1112
|
-
print(`(error "tactic failed: ${error.message}")`);
|
|
1113
|
-
return undefined;
|
|
1114
|
-
}
|
|
1115
|
-
})();
|
|
1116
|
-
// apply_tactic_cmd releases the result goals and then the input goal.
|
|
1117
|
-
if (goals === undefined) {
|
|
1118
|
-
input.reset();
|
|
1119
|
-
return;
|
|
1120
|
-
}
|
|
1121
|
-
try {
|
|
1136
|
+
[
|
|
1137
|
+
"dbg-bool-flat-rewriter",
|
|
1138
|
+
(list) => {
|
|
1122
1139
|
const manager = state.manager;
|
|
1123
|
-
|
|
1124
|
-
|
|
1125
|
-
|
|
1126
|
-
|
|
1127
|
-
|
|
1128
|
-
|
|
1129
|
-
|
|
1130
|
-
|
|
1131
|
-
|
|
1132
|
-
|
|
1133
|
-
|
|
1134
|
-
|
|
1135
|
-
|
|
1136
|
-
|
|
1137
|
-
|
|
1138
|
-
|
|
1139
|
-
|
|
1140
|
-
|
|
1141
|
-
|
|
1142
|
-
|
|
1143
|
-
|
|
1144
|
-
|
|
1145
|
-
|
|
1146
|
-
|
|
1147
|
-
|
|
1148
|
-
|
|
1149
|
-
|
|
1150
|
-
|
|
1151
|
-
|
|
1140
|
+
if (list.items.length !== 2)
|
|
1141
|
+
throw new SmtParseError("invalid command, one argument expected", list.end);
|
|
1142
|
+
const term = state.reader.parseTerm(list.items[1]);
|
|
1143
|
+
manager.incRef(term);
|
|
1144
|
+
const visited = new Set<number>();
|
|
1145
|
+
const todo = [term];
|
|
1146
|
+
while (todo.length > 0) {
|
|
1147
|
+
const expr = todo.pop() as number;
|
|
1148
|
+
if (visited.has(expr)) continue;
|
|
1149
|
+
visited.add(expr);
|
|
1150
|
+
const family = manager.kinds[expr] === KIND_APP ? manager.getFamily(expr) : -1;
|
|
1151
|
+
if (family !== FAMILY_BASIC && family !== FAMILY_USER && !manager.isNumeral(expr))
|
|
1152
|
+
throw new SmtUnsupportedError(
|
|
1153
|
+
"the command dbg-bool-flat-rewriter beyond Boolean terms",
|
|
1154
|
+
);
|
|
1155
|
+
manager.pushArgs(expr, todo);
|
|
1156
|
+
}
|
|
1157
|
+
const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
|
|
1158
|
+
const rewritten = rewriter.rewrite(term);
|
|
1159
|
+
display(rewritten);
|
|
1160
|
+
rewriter.release();
|
|
1161
|
+
manager.decRef(rewritten);
|
|
1162
|
+
manager.decRef(term);
|
|
1163
|
+
},
|
|
1164
|
+
],
|
|
1165
|
+
[
|
|
1166
|
+
"apply",
|
|
1167
|
+
(list) => {
|
|
1168
|
+
const params = getCommandParams(list.items, APPLY_PARAMETERS);
|
|
1169
|
+
if (list.items[1] === undefined)
|
|
1170
|
+
throw new SmtParseError("apply needs a tactic argument", list.end);
|
|
1171
|
+
const builder = getTactic(list.items[1], list.end);
|
|
1172
|
+
const tactic = builder.build(params);
|
|
1173
|
+
const isPrintingDependencies = params.get("print_dependencies") === true;
|
|
1174
|
+
if (isPrintingDependencies && !builder.isTrackingDependencies && hasNames())
|
|
1175
|
+
throw new SmtUnsupportedError("the dependencies of a tactic that drops dependencies");
|
|
1176
|
+
state.manager.limit.restart(Date.now() + options.timeLimitMs);
|
|
1177
|
+
const input = getGoal(builder.isTrackingDependencies);
|
|
1178
|
+
const goals = (() => {
|
|
1179
|
+
try {
|
|
1180
|
+
return applyTactic(tactic, input);
|
|
1181
|
+
} catch (error) {
|
|
1182
|
+
if (!(error instanceof SmtTacticError)) throw error;
|
|
1183
|
+
print(`(error "tactic failed: ${error.message}")`);
|
|
1184
|
+
return undefined;
|
|
1185
|
+
}
|
|
1186
|
+
})();
|
|
1187
|
+
// apply_tactic_cmd releases the result goals and then the input goal.
|
|
1188
|
+
if (goals === undefined) {
|
|
1189
|
+
input.reset();
|
|
1190
|
+
return;
|
|
1191
|
+
}
|
|
1192
|
+
try {
|
|
1193
|
+
const manager = state.manager;
|
|
1194
|
+
const environment = getPrintEnvironment();
|
|
1195
|
+
if (params.get("print") !== false)
|
|
1196
|
+
print(
|
|
1197
|
+
[
|
|
1198
|
+
"(goals",
|
|
1199
|
+
...goals.map((goal) =>
|
|
1200
|
+
[
|
|
1201
|
+
"(goal",
|
|
1202
|
+
...goal.forms.items.flatMap((form, index) => [
|
|
1203
|
+
...(isPrintingDependencies
|
|
1204
|
+
? [
|
|
1205
|
+
[
|
|
1206
|
+
" |-",
|
|
1207
|
+
...getDependencyValues(goal.getDependency(index)).map(format),
|
|
1208
|
+
].join(" "),
|
|
1209
|
+
]
|
|
1210
|
+
: []),
|
|
1211
|
+
` ${printExpr(state.manager, environment, form, 2)}`,
|
|
1212
|
+
]),
|
|
1213
|
+
` :precision ${PRECISION_NAMES[goal.precision]} :depth ${goal.depth})`,
|
|
1214
|
+
].join("\n"),
|
|
1215
|
+
),
|
|
1216
|
+
")",
|
|
1217
|
+
].join("\n"),
|
|
1218
|
+
);
|
|
1219
|
+
if (
|
|
1220
|
+
params.get("print_model_converter") === true &&
|
|
1221
|
+
input.converters.some(
|
|
1222
|
+
(entry) => !("definitions" in entry) || entry.definitions.length > 0,
|
|
1223
|
+
)
|
|
1152
1224
|
)
|
|
1153
|
-
|
|
1154
|
-
|
|
1155
|
-
|
|
1156
|
-
|
|
1157
|
-
|
|
1158
|
-
|
|
1159
|
-
|
|
1160
|
-
|
|
1161
|
-
|
|
1162
|
-
|
|
1225
|
+
throw new SmtUnsupportedError("printing a model converter");
|
|
1226
|
+
if (params.get("print_benchmark") !== true) return;
|
|
1227
|
+
const assertions =
|
|
1228
|
+
goals.length === 1
|
|
1229
|
+
? goals[0].forms.items
|
|
1230
|
+
: [
|
|
1231
|
+
manager.mkOr(
|
|
1232
|
+
goals.map((goal) =>
|
|
1233
|
+
goal.forms.size === 1 ? goal.forms.items[0] : manager.mkAnd(goal.forms.items),
|
|
1234
|
+
),
|
|
1163
1235
|
),
|
|
1164
|
-
|
|
1165
|
-
|
|
1166
|
-
|
|
1167
|
-
|
|
1168
|
-
|
|
1169
|
-
|
|
1170
|
-
|
|
1171
|
-
|
|
1172
|
-
|
|
1173
|
-
|
|
1174
|
-
|
|
1175
|
-
|
|
1176
|
-
|
|
1177
|
-
|
|
1178
|
-
|
|
1179
|
-
|
|
1180
|
-
|
|
1181
|
-
|
|
1182
|
-
|
|
1236
|
+
];
|
|
1237
|
+
for (const assertion of assertions) manager.incRef(assertion);
|
|
1238
|
+
const visited = new Set<number>();
|
|
1239
|
+
const decls = new Set<number>();
|
|
1240
|
+
for (const assertion of assertions) {
|
|
1241
|
+
const todo = [assertion];
|
|
1242
|
+
while (todo.length > 0) {
|
|
1243
|
+
const expr = todo.pop() as number;
|
|
1244
|
+
if (visited.has(expr)) continue;
|
|
1245
|
+
visited.add(expr);
|
|
1246
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
1247
|
+
const data = manager.getQuantifier(expr);
|
|
1248
|
+
todo.push(data.body, ...data.patterns, ...data.noPatterns);
|
|
1249
|
+
} else if (manager.kinds[expr] === KIND_APP) {
|
|
1250
|
+
manager.pushArgs(expr, todo);
|
|
1251
|
+
const decl = manager.decls[expr];
|
|
1252
|
+
const family = manager.funcDecls[decl].family;
|
|
1253
|
+
if (family === FAMILY_USER || family === FAMILY_MODEL_VALUE) decls.add(decl);
|
|
1254
|
+
}
|
|
1183
1255
|
}
|
|
1184
1256
|
}
|
|
1257
|
+
const lines = [...decls].map((decl) => {
|
|
1258
|
+
const funcDecl = manager.funcDecls[decl];
|
|
1259
|
+
return renderFormat(
|
|
1260
|
+
mkSeq1(
|
|
1261
|
+
[
|
|
1262
|
+
mkText(getQuotedName(funcDecl.name)),
|
|
1263
|
+
mkSeq5(funcDecl.domain.map((sort) => formatSort(manager, sort))),
|
|
1264
|
+
formatSort(manager, funcDecl.range),
|
|
1265
|
+
],
|
|
1266
|
+
"declare-fun",
|
|
1267
|
+
),
|
|
1268
|
+
environment.options,
|
|
1269
|
+
);
|
|
1270
|
+
});
|
|
1271
|
+
for (const assertion of assertions)
|
|
1272
|
+
lines.push(`(assert ${printExpr(manager, environment, assertion, 8)})`);
|
|
1273
|
+
print([...lines, "(check-sat)"].join("\n"));
|
|
1274
|
+
for (const assertion of assertions) manager.decRef(assertion);
|
|
1275
|
+
} finally {
|
|
1276
|
+
for (const goal of goals) if (goal !== input) goal.reset();
|
|
1277
|
+
input.reset();
|
|
1185
1278
|
}
|
|
1186
|
-
|
|
1187
|
-
|
|
1188
|
-
|
|
1189
|
-
|
|
1190
|
-
|
|
1191
|
-
|
|
1192
|
-
|
|
1193
|
-
|
|
1194
|
-
|
|
1195
|
-
"declare-fun",
|
|
1196
|
-
),
|
|
1197
|
-
environment.options,
|
|
1279
|
+
},
|
|
1280
|
+
],
|
|
1281
|
+
[
|
|
1282
|
+
"get-assertions",
|
|
1283
|
+
(list) => {
|
|
1284
|
+
if (!settings.isInteractive)
|
|
1285
|
+
throw new SmtParseError(
|
|
1286
|
+
"command is only available in interactive mode, use command (set-option :interactive-mode true)",
|
|
1287
|
+
list.end,
|
|
1198
1288
|
);
|
|
1289
|
+
print(`(${state.assertionTexts.join("\n ")})`);
|
|
1290
|
+
},
|
|
1291
|
+
],
|
|
1292
|
+
[
|
|
1293
|
+
"get-unsat-core",
|
|
1294
|
+
(list) => {
|
|
1295
|
+
if (!settings.isProducingUnsatCores)
|
|
1296
|
+
throw new SmtParseError(
|
|
1297
|
+
"unsat core construction is not enabled, use command (set-option :produce-unsat-cores true)",
|
|
1298
|
+
list.end,
|
|
1299
|
+
);
|
|
1300
|
+
const check = state.check;
|
|
1301
|
+
if (check === undefined || check.status !== L_FALSE)
|
|
1302
|
+
throw new SmtParseError("unsat core is not available", list.end);
|
|
1303
|
+
if (check.core === undefined)
|
|
1304
|
+
throw new SmtUnsupportedError("the unsat core of a tactic that drops dependencies");
|
|
1305
|
+
print(`(${check.core.map(format).join(" ")})`);
|
|
1306
|
+
},
|
|
1307
|
+
],
|
|
1308
|
+
[
|
|
1309
|
+
"eval",
|
|
1310
|
+
(list) => {
|
|
1311
|
+
const target = list.items[1];
|
|
1312
|
+
const term = target === undefined ? -1 : state.reader.parseTerm(target);
|
|
1313
|
+
if (list.items.length > 2) throw new SmtUnsupportedError("the parameters of eval");
|
|
1314
|
+
const model = getModel(list);
|
|
1315
|
+
if (term === -1) throw new SmtParseError("no arguments passed to eval", list.end);
|
|
1316
|
+
const manager = state.manager;
|
|
1317
|
+
manager.incRef(term);
|
|
1318
|
+
const value = model.eval(term, false);
|
|
1319
|
+
display(value);
|
|
1320
|
+
manager.decRef(value);
|
|
1321
|
+
manager.decRef(term);
|
|
1322
|
+
},
|
|
1323
|
+
],
|
|
1324
|
+
[
|
|
1325
|
+
"get-value",
|
|
1326
|
+
(list) => {
|
|
1327
|
+
const terms = list.items[1];
|
|
1328
|
+
if (terms?.kind !== "list")
|
|
1329
|
+
throw new SmtParseError("invalid get-value command, '(' expected", terms ?? list.end);
|
|
1330
|
+
const manager = state.manager;
|
|
1331
|
+
const exprs = terms.items.map((item) => state.reader.parseTerm(item));
|
|
1332
|
+
if (exprs.length === 0)
|
|
1333
|
+
throw new SmtParseError("invalid get-value command, empty list of terms", terms.end);
|
|
1334
|
+
if (list.items.length > 2) throw new SmtUnsupportedError("the parameters of get-value");
|
|
1335
|
+
const model = getModel(list);
|
|
1336
|
+
model.compact();
|
|
1337
|
+
// Z3 prints each term as the script spells it, from the end of the term before.
|
|
1338
|
+
const offsets = [
|
|
1339
|
+
terms.offset + 1,
|
|
1340
|
+
...terms.items.map((item) => (item.kind === "list" ? item.end : item).endOffset),
|
|
1341
|
+
];
|
|
1342
|
+
const lines = exprs.map((expr, index) => {
|
|
1343
|
+
manager.incRef(expr);
|
|
1344
|
+
const value = model.eval(expr, true);
|
|
1345
|
+
const line = `(${text.slice(offsets[index], offsets[index + 1]).trim()} ${format(value)})`;
|
|
1346
|
+
manager.decRef(value);
|
|
1347
|
+
manager.decRef(expr);
|
|
1348
|
+
return line;
|
|
1199
1349
|
});
|
|
1200
|
-
|
|
1201
|
-
|
|
1202
|
-
|
|
1203
|
-
|
|
1204
|
-
|
|
1205
|
-
|
|
1206
|
-
|
|
1207
|
-
|
|
1208
|
-
|
|
1209
|
-
|
|
1210
|
-
|
|
1211
|
-
|
|
1212
|
-
|
|
1213
|
-
|
|
1350
|
+
print(`(${lines.join("\n ")})`);
|
|
1351
|
+
},
|
|
1352
|
+
],
|
|
1353
|
+
[
|
|
1354
|
+
"get-objectives",
|
|
1355
|
+
() => {
|
|
1356
|
+
const optimizer = state.optimizer;
|
|
1357
|
+
if (optimizer === undefined || state.check === undefined)
|
|
1358
|
+
throw new SmtUnsupportedError("the command get-objectives");
|
|
1359
|
+
print(optimizer.getObjectives(format));
|
|
1360
|
+
},
|
|
1361
|
+
],
|
|
1362
|
+
[
|
|
1363
|
+
"get-model",
|
|
1364
|
+
(list) => {
|
|
1365
|
+
if (list.items.length > 1) throw new SmtUnsupportedError("the index of get-model");
|
|
1366
|
+
const manager = state.manager;
|
|
1367
|
+
const model = getModel(list);
|
|
1368
|
+
model.compact();
|
|
1369
|
+
for (const decl of state.reader.getDeclaredFuncs()) {
|
|
1370
|
+
const funcDecl = manager.funcDecls[decl];
|
|
1371
|
+
if (
|
|
1372
|
+
funcDecl.family !== FAMILY_USER ||
|
|
1373
|
+
model.constInterps.has(decl) ||
|
|
1374
|
+
model.funcInterps.has(decl)
|
|
1375
|
+
)
|
|
1376
|
+
continue;
|
|
1377
|
+
const value = model.getSomeValue(funcDecl.range);
|
|
1378
|
+
if (funcDecl.domain.length === 0) {
|
|
1379
|
+
model.registerConst(decl, value);
|
|
1380
|
+
continue;
|
|
1381
|
+
}
|
|
1382
|
+
const interp = new FuncInterp(manager, funcDecl.domain.length);
|
|
1383
|
+
interp.setElse(value);
|
|
1384
|
+
model.registerFunc(decl, interp);
|
|
1385
|
+
}
|
|
1386
|
+
model.addRecFuns();
|
|
1387
|
+
print(`(\n${printModel(manager, getPrintEnvironment(), model, 2)})`);
|
|
1388
|
+
},
|
|
1389
|
+
],
|
|
1390
|
+
["display", (list) => display(state.reader.parseTerm(list.items[1] ?? list.end))],
|
|
1391
|
+
[
|
|
1392
|
+
"dbg-lt",
|
|
1393
|
+
(list) => {
|
|
1394
|
+
const first = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1395
|
+
const second = state.reader.parseTerm(list.items[2] ?? list.end);
|
|
1396
|
+
print(String(isAstLess(state.manager, first, second)));
|
|
1397
|
+
},
|
|
1398
|
+
],
|
|
1399
|
+
[
|
|
1400
|
+
"dbg-some-value",
|
|
1401
|
+
(list) => {
|
|
1402
|
+
display(
|
|
1403
|
+
getManagerSomeValue(state.manager, state.reader.parseSort(list.items[1] ?? list.end)),
|
|
1214
1404
|
);
|
|
1215
|
-
|
|
1216
|
-
|
|
1217
|
-
|
|
1218
|
-
|
|
1219
|
-
|
|
1220
|
-
|
|
1221
|
-
|
|
1405
|
+
},
|
|
1406
|
+
],
|
|
1407
|
+
[
|
|
1408
|
+
"dbg-used-vars",
|
|
1409
|
+
(list) => {
|
|
1410
|
+
const manager = state.manager;
|
|
1411
|
+
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1412
|
+
const body =
|
|
1413
|
+
manager.kinds[term] === KIND_QUANTIFIER ? manager.getQuantifier(term).body : term;
|
|
1414
|
+
const sorts = getFreeVarSorts(manager, body, manager.freeVarBounds[body]);
|
|
1415
|
+
const lines = sorts.map(
|
|
1416
|
+
(sort, index) =>
|
|
1417
|
+
`\n (${String(index).padEnd(6)} ${sort === undefined ? "<not-used>" : renderFormat(formatSort(manager, sort), settings.printOptions)})`,
|
|
1222
1418
|
);
|
|
1223
|
-
|
|
1224
|
-
|
|
1225
|
-
|
|
1226
|
-
|
|
1227
|
-
|
|
1228
|
-
|
|
1229
|
-
|
|
1230
|
-
|
|
1231
|
-
|
|
1232
|
-
|
|
1233
|
-
|
|
1234
|
-
|
|
1235
|
-
|
|
1236
|
-
|
|
1237
|
-
|
|
1238
|
-
|
|
1239
|
-
|
|
1240
|
-
|
|
1241
|
-
|
|
1242
|
-
|
|
1243
|
-
|
|
1244
|
-
|
|
1245
|
-
|
|
1246
|
-
|
|
1247
|
-
|
|
1248
|
-
|
|
1249
|
-
|
|
1250
|
-
|
|
1251
|
-
|
|
1252
|
-
|
|
1253
|
-
|
|
1254
|
-
|
|
1255
|
-
|
|
1256
|
-
|
|
1257
|
-
|
|
1258
|
-
|
|
1259
|
-
|
|
1260
|
-
|
|
1261
|
-
|
|
1262
|
-
|
|
1263
|
-
|
|
1264
|
-
|
|
1265
|
-
|
|
1266
|
-
|
|
1267
|
-
|
|
1268
|
-
|
|
1269
|
-
|
|
1270
|
-
|
|
1271
|
-
|
|
1272
|
-
|
|
1273
|
-
print(optimizer.getObjectives(format));
|
|
1274
|
-
},
|
|
1275
|
-
"get-model": (list) => {
|
|
1276
|
-
if (list.items.length > 1) throw new SmtUnsupportedError("the index of get-model");
|
|
1277
|
-
const manager = script.state.manager;
|
|
1278
|
-
const model = getModel(list);
|
|
1279
|
-
model.compact();
|
|
1280
|
-
for (const decl of script.state.reader.getDeclaredFuncs()) {
|
|
1281
|
-
const funcDecl = manager.funcDecls[decl];
|
|
1419
|
+
print(`(vars${lines.join("")})`);
|
|
1420
|
+
},
|
|
1421
|
+
],
|
|
1422
|
+
[
|
|
1423
|
+
"dbg-elim-unused-vars",
|
|
1424
|
+
(list) => {
|
|
1425
|
+
const manager = state.manager;
|
|
1426
|
+
const term = state.reader.parseTerm(list.items[1] ?? list.end);
|
|
1427
|
+
if (manager.kinds[term] !== KIND_QUANTIFIER) {
|
|
1428
|
+
write(format(term), false);
|
|
1429
|
+
return;
|
|
1430
|
+
}
|
|
1431
|
+
display(elimUnusedVars(manager, term));
|
|
1432
|
+
},
|
|
1433
|
+
],
|
|
1434
|
+
["dbg-instantiate", (list) => instantiate(list, false)],
|
|
1435
|
+
["dbg-instantiate-nested", (list) => instantiate(list, true)],
|
|
1436
|
+
[
|
|
1437
|
+
"echo",
|
|
1438
|
+
(list) => {
|
|
1439
|
+
const message = list.items[1];
|
|
1440
|
+
if (message?.kind !== "string")
|
|
1441
|
+
throw new SmtParseError("invalid echo command, string expected", message ?? list.end);
|
|
1442
|
+
print(message.text);
|
|
1443
|
+
},
|
|
1444
|
+
],
|
|
1445
|
+
[
|
|
1446
|
+
"set-option",
|
|
1447
|
+
(list) => {
|
|
1448
|
+
const option = list.items[1];
|
|
1449
|
+
const keyword = option?.kind === "keyword" ? option.text : "";
|
|
1450
|
+
const optionName = `:${getParameterName(keyword)}`;
|
|
1451
|
+
const value = list.items[2];
|
|
1452
|
+
const isTrue = isSymbol(value, "true");
|
|
1453
|
+
if (keyword === ":produce-models") settings.isProducingModels = isTrue;
|
|
1454
|
+
if (keyword === ":produce-unsat-cores") settings.isProducingUnsatCores = isTrue;
|
|
1455
|
+
if (keyword === ":produce-proofs") settings.isProducingProofs = isTrue;
|
|
1456
|
+
if (keyword === ":interactive-mode") settings.isInteractive = isTrue;
|
|
1457
|
+
if (keyword === ":diagnostic-output-channel")
|
|
1458
|
+
settings.isDiagnosticOnStdout = value?.kind === "string" && value.text === "stdout";
|
|
1459
|
+
if (keyword === ":int-real-coercions" && !isTrue)
|
|
1460
|
+
throw new SmtUnsupportedError("the option :int-real-coercions false");
|
|
1461
|
+
if (keyword === ":error-behavior") {
|
|
1462
|
+
if (!isSymbol(value, "immediate-exit") && !isSymbol(value, "continued-execution"))
|
|
1463
|
+
throw new SmtParseError(
|
|
1464
|
+
"error setting :error-behavior, 'immediate-execution' or 'continued-execution' expected",
|
|
1465
|
+
list.end,
|
|
1466
|
+
);
|
|
1467
|
+
settings.isExitingOnError = isSymbol(value, "immediate-exit");
|
|
1468
|
+
}
|
|
1282
1469
|
if (
|
|
1283
|
-
|
|
1284
|
-
|
|
1285
|
-
|
|
1470
|
+
keyword !== "" &&
|
|
1471
|
+
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1472
|
+
value !== undefined &&
|
|
1473
|
+
value.kind !== "list"
|
|
1286
1474
|
)
|
|
1287
|
-
|
|
1288
|
-
|
|
1289
|
-
if (
|
|
1290
|
-
|
|
1291
|
-
|
|
1475
|
+
settings.parameters.set(getParameterName(keyword), value.text);
|
|
1476
|
+
if (optionName === ":print_success") settings.isPrintingSuccess = isTrue;
|
|
1477
|
+
if (
|
|
1478
|
+
!BUILTIN_OPTIONS.has(keyword) &&
|
|
1479
|
+
settings.parameters.get("smtlib2_compliant") === "true"
|
|
1480
|
+
)
|
|
1481
|
+
settings.isPrintingSuccess = true;
|
|
1482
|
+
if (optionName === ":smt.mbqi") settings.isMbqi = isTrue;
|
|
1483
|
+
if (optionName === ":smt.macro_finder") settings.isFindingMacros = isTrue;
|
|
1484
|
+
if (optionName === ":smt.mbqi.max_iterations" && value?.kind === "numeral")
|
|
1485
|
+
settings.mbqiMaxIterations = Number(value.text);
|
|
1486
|
+
if (optionName === ":rlimit" && value?.kind === "numeral")
|
|
1487
|
+
settings.rlimit = Number(value.text);
|
|
1488
|
+
if (optionName === ":rewriter.hi_div0") {
|
|
1489
|
+
settings.isHiDiv0 = isTrue;
|
|
1490
|
+
state.manager.isHiDiv0 = isTrue;
|
|
1292
1491
|
}
|
|
1293
|
-
|
|
1294
|
-
|
|
1295
|
-
|
|
1296
|
-
|
|
1297
|
-
|
|
1298
|
-
|
|
1299
|
-
|
|
1300
|
-
|
|
1301
|
-
|
|
1302
|
-
|
|
1303
|
-
|
|
1304
|
-
|
|
1305
|
-
|
|
1306
|
-
|
|
1307
|
-
|
|
1308
|
-
|
|
1309
|
-
|
|
1310
|
-
|
|
1311
|
-
|
|
1312
|
-
|
|
1313
|
-
|
|
1314
|
-
|
|
1315
|
-
|
|
1316
|
-
|
|
1317
|
-
|
|
1318
|
-
|
|
1319
|
-
|
|
1320
|
-
|
|
1321
|
-
|
|
1322
|
-
|
|
1323
|
-
|
|
1324
|
-
|
|
1325
|
-
|
|
1326
|
-
|
|
1327
|
-
|
|
1328
|
-
|
|
1329
|
-
|
|
1330
|
-
|
|
1331
|
-
|
|
1332
|
-
|
|
1333
|
-
|
|
1334
|
-
|
|
1335
|
-
|
|
1336
|
-
|
|
1337
|
-
|
|
1338
|
-
|
|
1339
|
-
|
|
1340
|
-
|
|
1341
|
-
|
|
1342
|
-
|
|
1343
|
-
|
|
1344
|
-
|
|
1345
|
-
|
|
1346
|
-
|
|
1347
|
-
|
|
1348
|
-
|
|
1349
|
-
|
|
1350
|
-
|
|
1351
|
-
|
|
1352
|
-
|
|
1353
|
-
|
|
1354
|
-
|
|
1355
|
-
|
|
1356
|
-
|
|
1357
|
-
if (
|
|
1358
|
-
|
|
1359
|
-
|
|
1360
|
-
|
|
1361
|
-
|
|
1362
|
-
|
|
1363
|
-
|
|
1364
|
-
|
|
1365
|
-
|
|
1366
|
-
|
|
1367
|
-
|
|
1368
|
-
|
|
1369
|
-
)
|
|
1370
|
-
settings.parameters.set(getParameterName(keyword), value.text);
|
|
1371
|
-
if (optionName === ":print_success") settings.isPrintingSuccess = isTrue;
|
|
1372
|
-
if (!BUILTIN_OPTIONS.has(keyword) && settings.parameters.get("smtlib2_compliant") === "true")
|
|
1373
|
-
settings.isPrintingSuccess = true;
|
|
1374
|
-
if (optionName === ":smt.mbqi") settings.isMbqi = isTrue;
|
|
1375
|
-
if (optionName === ":smt.macro_finder") settings.isFindingMacros = isTrue;
|
|
1376
|
-
if (optionName === ":smt.mbqi.max_iterations" && value?.kind === "numeral")
|
|
1377
|
-
settings.mbqiMaxIterations = Number(value.text);
|
|
1378
|
-
if (optionName === ":rlimit" && value?.kind === "numeral")
|
|
1379
|
-
settings.rlimit = Number(value.text);
|
|
1380
|
-
if (optionName === ":rewriter.hi_div0") {
|
|
1381
|
-
settings.isHiDiv0 = isTrue;
|
|
1382
|
-
script.state.manager.isHiDiv0 = isTrue;
|
|
1383
|
-
}
|
|
1384
|
-
if (optionName === ":encoding" && value !== undefined && value.kind !== "list") {
|
|
1385
|
-
settings.encoding = ENCODINGS.get(value.text) ?? UNICODE_ENCODING;
|
|
1386
|
-
script.state.manager.maxChar = settings.encoding.maxChar;
|
|
1387
|
-
script.state.manager.charBits = settings.encoding.charBits;
|
|
1388
|
-
}
|
|
1389
|
-
if (optionName === ":parser.ignore_bad_patterns")
|
|
1390
|
-
settings.parserOptions.isIgnoringBadPatterns = isTrue;
|
|
1391
|
-
const numericOption = NUMERIC_PRINT_OPTIONS.get(optionName);
|
|
1392
|
-
if (numericOption !== undefined && value?.kind === "numeral")
|
|
1393
|
-
settings.printOptions[numericOption] = Number(value.text);
|
|
1394
|
-
const booleanOption = BOOLEAN_PRINT_OPTIONS.get(optionName);
|
|
1395
|
-
if (booleanOption !== undefined) settings.printOptions[booleanOption] = isTrue;
|
|
1396
|
-
if (
|
|
1397
|
-
optionName.startsWith(":pp.") &&
|
|
1398
|
-
numericOption === undefined &&
|
|
1399
|
-
booleanOption === undefined
|
|
1400
|
-
)
|
|
1401
|
-
throw new SmtUnsupportedError(`the option ${optionName}`);
|
|
1402
|
-
},
|
|
1403
|
-
"get-option": (list) => {
|
|
1404
|
-
const option = list.items[1];
|
|
1405
|
-
if (option?.kind !== "keyword")
|
|
1406
|
-
throw new SmtParseError("invalid command argument, keyword expected", option ?? list.end);
|
|
1407
|
-
const builtinValues = new Map<string, boolean | string>([
|
|
1408
|
-
[":print-success", settings.isPrintingSuccess],
|
|
1409
|
-
[":produce-models", settings.isProducingModels],
|
|
1410
|
-
[":produce-unsat-cores", settings.isProducingUnsatCores],
|
|
1411
|
-
[":int-real-coercions", true],
|
|
1412
|
-
[":error-behavior", settings.isExitingOnError ? "immediate-exit" : "continued-execution"],
|
|
1413
|
-
]);
|
|
1414
|
-
const name = getParameterName(option.text);
|
|
1415
|
-
const value =
|
|
1416
|
-
builtinValues.get(option.text) ??
|
|
1417
|
-
(BUILTIN_OPTIONS.has(option.text)
|
|
1418
|
-
? undefined
|
|
1419
|
-
: (settings.parameters.get(name) ?? PARAMETER_DEFAULTS.get(name)));
|
|
1420
|
-
if (value === undefined) throw new SmtUnsupportedError(`the option ${option.text}`);
|
|
1421
|
-
print(String(value));
|
|
1422
|
-
},
|
|
1423
|
-
"get-info": (list) => {
|
|
1424
|
-
const info = list.items[1];
|
|
1425
|
-
if (info?.kind !== "keyword")
|
|
1426
|
-
throw new SmtParseError("invalid command argument, keyword expected", info ?? list.end);
|
|
1427
|
-
const optimizer = script.state.optimizer;
|
|
1428
|
-
if (
|
|
1429
|
-
info.text === ":reason-unknown" &&
|
|
1430
|
-
script.state.check?.status === L_UNDEF &&
|
|
1431
|
-
optimizer !== undefined &&
|
|
1432
|
-
optimizer.reasonUnknown !== ""
|
|
1433
|
-
) {
|
|
1434
|
-
print(`(:reason-unknown "${optimizer.reasonUnknown}")`);
|
|
1435
|
-
return;
|
|
1436
|
-
}
|
|
1437
|
-
if (info.text !== ":error-behavior")
|
|
1438
|
-
throw new SmtUnsupportedError(`the information ${info.text}`);
|
|
1439
|
-
print(
|
|
1440
|
-
`(:error-behavior ${settings.isExitingOnError ? "immediate-exit" : "continued-execution"})`,
|
|
1441
|
-
);
|
|
1442
|
-
},
|
|
1443
|
-
"set-logic": (list) => {
|
|
1444
|
-
const state = script.state;
|
|
1445
|
-
const logic = list.items[1];
|
|
1446
|
-
if (!isSymbol(logic))
|
|
1447
|
-
throw new SmtParseError("invalid logic name, symbol expected", logic ?? list.end);
|
|
1448
|
-
if (state.logic !== undefined)
|
|
1449
|
-
throw new SmtParseError("the logic has already been set", list.end);
|
|
1450
|
-
if (state.assertions.length > 0)
|
|
1451
|
-
throw new SmtParseError("logic must be set before initialization", list.end);
|
|
1452
|
-
if (!isSupportedLogic(logic.text)) {
|
|
1453
|
-
print("unsupported");
|
|
1454
|
-
printDiagnostic(
|
|
1455
|
-
`; ignoring unsupported logic ${logic.text} line: ${list.line} position: ${list.column}`,
|
|
1492
|
+
if (optionName === ":encoding" && value !== undefined && value.kind !== "list") {
|
|
1493
|
+
settings.encoding = ENCODINGS.get(value.text) ?? UNICODE_ENCODING;
|
|
1494
|
+
state.manager.maxChar = settings.encoding.maxChar;
|
|
1495
|
+
state.manager.charBits = settings.encoding.charBits;
|
|
1496
|
+
}
|
|
1497
|
+
if (optionName === ":parser.ignore_bad_patterns")
|
|
1498
|
+
settings.parserOptions.isIgnoringBadPatterns = isTrue;
|
|
1499
|
+
const numericOption = NUMERIC_PRINT_OPTIONS.get(optionName);
|
|
1500
|
+
if (numericOption !== undefined && value?.kind === "numeral")
|
|
1501
|
+
settings.printOptions[numericOption] = Number(value.text);
|
|
1502
|
+
const booleanOption = BOOLEAN_PRINT_OPTIONS.get(optionName);
|
|
1503
|
+
if (booleanOption !== undefined) settings.printOptions[booleanOption] = isTrue;
|
|
1504
|
+
if (
|
|
1505
|
+
optionName.startsWith(":pp.") &&
|
|
1506
|
+
numericOption === undefined &&
|
|
1507
|
+
booleanOption === undefined
|
|
1508
|
+
)
|
|
1509
|
+
throw new SmtUnsupportedError(`the option ${optionName}`);
|
|
1510
|
+
},
|
|
1511
|
+
],
|
|
1512
|
+
[
|
|
1513
|
+
"get-option",
|
|
1514
|
+
(list) => {
|
|
1515
|
+
const option = list.items[1];
|
|
1516
|
+
if (option?.kind !== "keyword")
|
|
1517
|
+
throw new SmtParseError("invalid command argument, keyword expected", option ?? list.end);
|
|
1518
|
+
const builtinValues = new Map<string, boolean | string>([
|
|
1519
|
+
[":print-success", settings.isPrintingSuccess],
|
|
1520
|
+
[":produce-models", settings.isProducingModels],
|
|
1521
|
+
[":produce-unsat-cores", settings.isProducingUnsatCores],
|
|
1522
|
+
[":int-real-coercions", true],
|
|
1523
|
+
[":error-behavior", settings.isExitingOnError ? "immediate-exit" : "continued-execution"],
|
|
1524
|
+
]);
|
|
1525
|
+
const name = getParameterName(option.text);
|
|
1526
|
+
const value =
|
|
1527
|
+
builtinValues.get(option.text) ??
|
|
1528
|
+
(BUILTIN_OPTIONS.has(option.text)
|
|
1529
|
+
? undefined
|
|
1530
|
+
: (settings.parameters.get(name) ?? PARAMETER_DEFAULTS.get(name)));
|
|
1531
|
+
if (value === undefined) throw new SmtUnsupportedError(`the option ${option.text}`);
|
|
1532
|
+
print(String(value));
|
|
1533
|
+
},
|
|
1534
|
+
],
|
|
1535
|
+
[
|
|
1536
|
+
"get-info",
|
|
1537
|
+
(list) => {
|
|
1538
|
+
const info = list.items[1];
|
|
1539
|
+
if (info?.kind !== "keyword")
|
|
1540
|
+
throw new SmtParseError("invalid command argument, keyword expected", info ?? list.end);
|
|
1541
|
+
const optimizer = state.optimizer;
|
|
1542
|
+
const check = state.check;
|
|
1543
|
+
if (
|
|
1544
|
+
info.text === ":reason-unknown" &&
|
|
1545
|
+
check?.status === L_UNDEF &&
|
|
1546
|
+
optimizer !== undefined &&
|
|
1547
|
+
optimizer.reasonUnknown !== ""
|
|
1548
|
+
) {
|
|
1549
|
+
print(`(:reason-unknown "${optimizer.reasonUnknown}")`);
|
|
1550
|
+
return;
|
|
1551
|
+
}
|
|
1552
|
+
const reasonUnknown =
|
|
1553
|
+
check === undefined
|
|
1554
|
+
? "state of the most recent check-sat command is not known"
|
|
1555
|
+
: check.reasonUnknown;
|
|
1556
|
+
if (info.text === ":reason-unknown" && reasonUnknown !== undefined) {
|
|
1557
|
+
print(`(:reason-unknown "${reasonUnknown.replaceAll('"', '\\"')}")`);
|
|
1558
|
+
return;
|
|
1559
|
+
}
|
|
1560
|
+
if (info.text === ":rlimit") {
|
|
1561
|
+
print(`(:rlimit ${state.manager.limit.count})`);
|
|
1562
|
+
return;
|
|
1563
|
+
}
|
|
1564
|
+
if (info.text !== ":error-behavior")
|
|
1565
|
+
throw new SmtUnsupportedError(`the information ${info.text}`);
|
|
1566
|
+
print(
|
|
1567
|
+
`(:error-behavior ${settings.isExitingOnError ? "immediate-exit" : "continued-execution"})`,
|
|
1456
1568
|
);
|
|
1457
|
-
|
|
1458
|
-
|
|
1459
|
-
|
|
1460
|
-
|
|
1461
|
-
|
|
1462
|
-
|
|
1463
|
-
|
|
1464
|
-
|
|
1465
|
-
|
|
1569
|
+
},
|
|
1570
|
+
],
|
|
1571
|
+
[
|
|
1572
|
+
"set-logic",
|
|
1573
|
+
(list) => {
|
|
1574
|
+
const logic = list.items[1];
|
|
1575
|
+
if (!isSymbol(logic))
|
|
1576
|
+
throw new SmtParseError("invalid logic name, symbol expected", logic ?? list.end);
|
|
1577
|
+
if (state.logic !== undefined)
|
|
1578
|
+
throw new SmtParseError("the logic has already been set", logic);
|
|
1579
|
+
if (state.assertions.length > 0)
|
|
1580
|
+
throw new SmtParseError("logic must be set before initialization", logic);
|
|
1581
|
+
if (!isSupportedLogic(logic.text)) {
|
|
1582
|
+
print("unsupported");
|
|
1583
|
+
printDiagnostic(
|
|
1584
|
+
`; ignoring unsupported logic ${logic.text} line: ${list.line} position: ${list.column}`,
|
|
1585
|
+
);
|
|
1586
|
+
return;
|
|
1587
|
+
}
|
|
1588
|
+
state.logic = logic.text;
|
|
1589
|
+
if (state.isProofsEnabled === undefined)
|
|
1590
|
+
state.reader = createSmtlibReader(state.manager, logic.text, settings.parserOptions);
|
|
1591
|
+
else {
|
|
1592
|
+
state.reader.restrictSorts(logic.text);
|
|
1593
|
+
// Deviation from Z3: its new solver starts without the open scopes, so it ignores their pop
|
|
1594
|
+
// and keeps what they asserted.
|
|
1595
|
+
resetKernel();
|
|
1596
|
+
}
|
|
1597
|
+
if (settings.isPrintingSuccess) print("success");
|
|
1598
|
+
},
|
|
1599
|
+
],
|
|
1600
|
+
["set-info", () => {}],
|
|
1601
|
+
]);
|
|
1466
1602
|
const run = (list: SmtList) => {
|
|
1467
1603
|
const head = list.items[0];
|
|
1468
1604
|
if (!isSymbol(head))
|
|
1469
1605
|
throw new SmtParseError("invalid command, symbol expected", head ?? list.end);
|
|
1470
1606
|
const command = DECLARATIONS.has(head.text)
|
|
1471
|
-
? (declaration: SmtList) =>
|
|
1472
|
-
: runCommand
|
|
1607
|
+
? (declaration: SmtList) => state.reader.declareCommand(declaration)
|
|
1608
|
+
: runCommand.get(head.text);
|
|
1473
1609
|
if (command === undefined) throw new SmtUnsupportedError(`the command ${head.text}`);
|
|
1474
|
-
if (!MANAGERLESS_COMMANDS.has(head.text) &&
|
|
1475
|
-
|
|
1610
|
+
if (!MANAGERLESS_COMMANDS.has(head.text) && state.isProofsEnabled === undefined) {
|
|
1611
|
+
state.isProofsEnabled = settings.parameters.get("proof") === "true";
|
|
1476
1612
|
resetKernel();
|
|
1477
1613
|
}
|
|
1478
1614
|
command(list);
|
|
@@ -1481,13 +1617,15 @@ export const runSmtlibScript = (
|
|
|
1481
1617
|
for (;;) {
|
|
1482
1618
|
try {
|
|
1483
1619
|
const list = commands.read();
|
|
1484
|
-
if (list === undefined || isSymbol(list.items[0], "exit"))
|
|
1620
|
+
if (list === undefined || isSymbol(list.items[0], "exit")) break;
|
|
1485
1621
|
run(list);
|
|
1486
1622
|
} catch (error) {
|
|
1487
1623
|
if (!(error instanceof SmtParseError)) throw error;
|
|
1488
1624
|
report(error);
|
|
1489
|
-
if (settings.isExitingOnError)
|
|
1625
|
+
if (settings.isExitingOnError) break;
|
|
1626
|
+
state.reader.reset();
|
|
1490
1627
|
commands.skip(report);
|
|
1491
1628
|
}
|
|
1492
1629
|
}
|
|
1630
|
+
if (pendingText !== "") printLine(pendingText);
|
|
1493
1631
|
};
|