tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968
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/README.md +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/codegen.ts +6 -2
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +134 -86
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +634 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- 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 +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- 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 +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- 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 +13 -7
- 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 +1 -8
- 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 +26 -7
- 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 +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- 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 +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- 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 +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- 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 +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- 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 +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- 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 +66 -11
- 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 +167 -85
- 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 +220 -0
- 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 +324 -0
- 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 +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- 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 +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- 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 +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +264 -77
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +2 -1
- package/src/sany/generator-expressions.ts +30 -27
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +6 -5
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +165 -78
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +42 -23
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,587 @@
|
|
|
1
|
+
import { SmtInvariantError } from "../../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_ARRAY,
|
|
6
|
+
FAMILY_DATATYPE,
|
|
7
|
+
OP_EQ,
|
|
8
|
+
OP_NOT,
|
|
9
|
+
QUANTIFIER_EXISTS,
|
|
10
|
+
QUANTIFIER_FORALL,
|
|
11
|
+
SORT_BOOL,
|
|
12
|
+
} from "../ast";
|
|
13
|
+
import { flattenAndVector, flattenOrVector, mkNot } from "../ast-util";
|
|
14
|
+
import { ExprSafeReplace } from "../expr-safe-replace";
|
|
15
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
16
|
+
import { ArithProjectPlugin } from "../mbp/mbp-arith";
|
|
17
|
+
import { MbpContext, ProjectPlugin } from "../mbp/mbp-plugin";
|
|
18
|
+
import { ProtoModel } from "../proto-model";
|
|
19
|
+
import { RefVector } from "../ref-vector";
|
|
20
|
+
import { IncSatSolver } from "../sat/inc-sat-solver";
|
|
21
|
+
import { VarSubst } from "../var-subst";
|
|
22
|
+
import { type Enode, getClass } from "./egraph";
|
|
23
|
+
import type { EufSolver } from "./euf-solver";
|
|
24
|
+
import { getSubterms, isUninterpretedApp, ModelFixer } from "./q-model-fixer";
|
|
25
|
+
import type { QSolver } from "./q-solver";
|
|
26
|
+
|
|
27
|
+
const UINT_MAX = 4294967295;
|
|
28
|
+
const MAX_QUICK_CHECK_ROUNDS = 100;
|
|
29
|
+
const MAX_UNBOUNDED_EQUALITIES = 10;
|
|
30
|
+
const MAX_CHOOSE_CANDIDATES = 10;
|
|
31
|
+
const MBQI_MAX_CEXS = 1;
|
|
32
|
+
|
|
33
|
+
// The families of the arith, datatype and array project plugins of mbqi.
|
|
34
|
+
const PLUGIN_FAMILIES = new Set([FAMILY_ARITH, FAMILY_DATATYPE, FAMILY_ARRAY]);
|
|
35
|
+
|
|
36
|
+
// mbqi::q_body: the fresh constants of q's variables and its negated body over them.
|
|
37
|
+
interface QBody {
|
|
38
|
+
readonly vars: RefVector;
|
|
39
|
+
readonly freeVars: Set<number>;
|
|
40
|
+
mbody: number;
|
|
41
|
+
readonly vbody: RefVector;
|
|
42
|
+
readonly domainEqs: RefVector;
|
|
43
|
+
readonly varArgs: (readonly [number, number])[];
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
interface Instantiation {
|
|
47
|
+
readonly qlit: number;
|
|
48
|
+
readonly fml: number;
|
|
49
|
+
readonly generation: number;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
export class Mbqi {
|
|
53
|
+
private readonly manager: AstManager;
|
|
54
|
+
private readonly modelFixer: ModelFixer;
|
|
55
|
+
private model: ProtoModel | null = null;
|
|
56
|
+
private solver: IncSatSolver | null = null;
|
|
57
|
+
private q2body = new Map<number, QBody>();
|
|
58
|
+
private maxCex = 1;
|
|
59
|
+
private generationBound = UINT_MAX;
|
|
60
|
+
private generationMax = UINT_MAX;
|
|
61
|
+
private instantiations: Instantiation[] = [];
|
|
62
|
+
private readonly pinned: RefVector;
|
|
63
|
+
|
|
64
|
+
constructor(
|
|
65
|
+
private readonly ctx: EufSolver,
|
|
66
|
+
private readonly qs: QSolver,
|
|
67
|
+
) {
|
|
68
|
+
this.manager = ctx.manager;
|
|
69
|
+
this.modelFixer = new ModelFixer(ctx, qs);
|
|
70
|
+
this.pinned = new RefVector(ctx.manager);
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
private pin(expr: number) {
|
|
74
|
+
this.pinned.push(expr);
|
|
75
|
+
return expr;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
private pinOwned(expr: number) {
|
|
79
|
+
this.pinned.pushOwned(expr);
|
|
80
|
+
return expr;
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
private setModel(model: ProtoModel | null) {
|
|
84
|
+
model?.incRef();
|
|
85
|
+
this.model?.decRef();
|
|
86
|
+
this.model = model;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
private getModel() {
|
|
90
|
+
if (this.model === null) throw new SmtInvariantError("mbqi needs a model");
|
|
91
|
+
return this.model;
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
private eval(model: ProtoModel, expr: number, isModelCompletion: boolean) {
|
|
95
|
+
return this.pinOwned(model.eval(expr, isModelCompletion));
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
private isTrue(expr: number) {
|
|
99
|
+
return this.manager.isTrue(this.eval(this.getModel(), expr, false));
|
|
100
|
+
}
|
|
101
|
+
|
|
102
|
+
run() {
|
|
103
|
+
const ctx = this.ctx;
|
|
104
|
+
const manager = this.manager;
|
|
105
|
+
let result = L_TRUE;
|
|
106
|
+
this.setModel(null);
|
|
107
|
+
ctx.saveModel(null);
|
|
108
|
+
this.instantiations = [];
|
|
109
|
+
for (const lit of this.qs.universal) {
|
|
110
|
+
this.initModel();
|
|
111
|
+
const checked = this.checkForall(ctx.boolVar2expr(lit >> 1) as number);
|
|
112
|
+
this.pinned.reset();
|
|
113
|
+
if (checked === L_FALSE) result = L_FALSE;
|
|
114
|
+
else if (checked === L_UNDEF && result === L_TRUE) result = L_UNDEF;
|
|
115
|
+
}
|
|
116
|
+
this.maxCex += MBQI_MAX_CEXS;
|
|
117
|
+
for (const instantiation of this.instantiations) {
|
|
118
|
+
const generation = ctx.generation;
|
|
119
|
+
ctx.generation = instantiation.generation + 1;
|
|
120
|
+
const lit = ctx.mkLiteral(instantiation.fml) ^ 1;
|
|
121
|
+
this.qs.addClause([instantiation.qlit ^ 1, lit]);
|
|
122
|
+
ctx.generation = generation;
|
|
123
|
+
manager.decRef(instantiation.fml);
|
|
124
|
+
}
|
|
125
|
+
this.instantiations = [];
|
|
126
|
+
if (result !== L_TRUE) this.setModel(null);
|
|
127
|
+
ctx.saveModel(this.model);
|
|
128
|
+
return result;
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
// restrict_to_universe: sk is one of the universe's values made by at most generationBound
|
|
132
|
+
// instantiations.
|
|
133
|
+
private restrictToUniverse(sk: number, universe: readonly number[]) {
|
|
134
|
+
const manager = this.manager;
|
|
135
|
+
const values2root = this.ctx.values2root();
|
|
136
|
+
const eqs: number[] = [];
|
|
137
|
+
let generationMin = UINT_MAX;
|
|
138
|
+
for (const value of universe) {
|
|
139
|
+
const root = values2root.get(value);
|
|
140
|
+
if (root !== undefined) {
|
|
141
|
+
const generation = root.classGeneration();
|
|
142
|
+
generationMin = Math.min(generationMin, generation);
|
|
143
|
+
this.generationMax = Math.max(this.generationMax, generation);
|
|
144
|
+
if (generation > this.generationBound) continue;
|
|
145
|
+
}
|
|
146
|
+
eqs.push(manager.mkEq(sk, value));
|
|
147
|
+
}
|
|
148
|
+
if (eqs.length === 0)
|
|
149
|
+
for (const value of universe) {
|
|
150
|
+
const root = values2root.get(value);
|
|
151
|
+
if (root !== undefined && root.classGeneration() <= generationMin)
|
|
152
|
+
eqs.push(manager.mkEq(sk, value));
|
|
153
|
+
}
|
|
154
|
+
this.assertExpr(manager.mkOr(eqs));
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
private replaceModelValue(expr: number): number {
|
|
158
|
+
const manager = this.manager;
|
|
159
|
+
if (manager.isBool(expr)) return expr;
|
|
160
|
+
const root = this.ctx.values2root().get(expr);
|
|
161
|
+
if (root !== undefined) return this.chooseTerm(root);
|
|
162
|
+
if (manager.isApp(expr) && manager.getNumArgs(expr) > 0)
|
|
163
|
+
return this.pin(
|
|
164
|
+
manager.mkApp(
|
|
165
|
+
manager.decls[expr],
|
|
166
|
+
manager.getArgs(expr).map((arg) => this.replaceModelValue(arg)),
|
|
167
|
+
manager.sorts[expr],
|
|
168
|
+
),
|
|
169
|
+
);
|
|
170
|
+
if (manager.isModelValue(expr)) return manager.mkModelValue(0, manager.sorts[expr]);
|
|
171
|
+
const unfolded = this.getModel().unfoldAsArray(expr);
|
|
172
|
+
return unfolded === expr ? unfolded : this.replaceModelValue(this.pinOwned(unfolded));
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
private chooseTerm(root: Enode) {
|
|
176
|
+
const generation = root.generation + 1;
|
|
177
|
+
let count = 0;
|
|
178
|
+
let chosen = root;
|
|
179
|
+
for (const node of getClass(root)) {
|
|
180
|
+
if (node.generation < generation) {
|
|
181
|
+
count = 0;
|
|
182
|
+
chosen = node;
|
|
183
|
+
} else if (node.generation === generation) {
|
|
184
|
+
if (this.qs.random() % ++count === 0 && this.manager.hasQuantifierFlags[node.owner])
|
|
185
|
+
chosen = node;
|
|
186
|
+
}
|
|
187
|
+
if (count > MAX_CHOOSE_CANDIDATES) break;
|
|
188
|
+
}
|
|
189
|
+
return chosen.owner;
|
|
190
|
+
}
|
|
191
|
+
|
|
192
|
+
private checkForall(quantifier: number) {
|
|
193
|
+
const flat = this.qs.flatten(quantifier);
|
|
194
|
+
const solver = this.initSolver();
|
|
195
|
+
const qb = this.specialize(flat);
|
|
196
|
+
if (this.manager.isFalse(qb.mbody)) return L_TRUE;
|
|
197
|
+
if (this.quickCheck(quantifier, flat, qb)) return L_FALSE;
|
|
198
|
+
this.generationBound = 0;
|
|
199
|
+
this.generationMax = 0;
|
|
200
|
+
let inc = 1;
|
|
201
|
+
for (;;) {
|
|
202
|
+
solver.push();
|
|
203
|
+
this.addUniverseRestriction(qb);
|
|
204
|
+
this.assertExpr(qb.mbody);
|
|
205
|
+
const result = solver.check();
|
|
206
|
+
if (result === L_UNDEF) {
|
|
207
|
+
solver.pop(1);
|
|
208
|
+
return result;
|
|
209
|
+
}
|
|
210
|
+
if (result === L_TRUE) {
|
|
211
|
+
const model = solver.getModel();
|
|
212
|
+
if (model === null) throw new SmtInvariantError("a satisfiable check has a model");
|
|
213
|
+
const isFound =
|
|
214
|
+
this.checkForallSubst(quantifier, qb) || this.checkForallDefault(quantifier, qb, model);
|
|
215
|
+
solver.pop(1);
|
|
216
|
+
return isFound ? L_FALSE : L_UNDEF;
|
|
217
|
+
}
|
|
218
|
+
solver.pop(1);
|
|
219
|
+
if (this.generationBound >= this.generationMax) return L_TRUE;
|
|
220
|
+
this.generationBound += inc;
|
|
221
|
+
inc += 1;
|
|
222
|
+
}
|
|
223
|
+
}
|
|
224
|
+
|
|
225
|
+
private checkForallDefault(quantifier: number, qb: QBody, model: ProtoModel) {
|
|
226
|
+
this.addDomainBounds(model, qb);
|
|
227
|
+
const projection = this.solverProject(model, qb, [], false);
|
|
228
|
+
if (projection === null) return false;
|
|
229
|
+
this.addInstantiation(quantifier, projection);
|
|
230
|
+
return true;
|
|
231
|
+
}
|
|
232
|
+
|
|
233
|
+
private checkForallSubst(quantifier: number, qb: QBody) {
|
|
234
|
+
if (qb.varArgs.length === 0) return false;
|
|
235
|
+
const solver = this.initSolver();
|
|
236
|
+
const eqs: number[] = [];
|
|
237
|
+
let index = 0;
|
|
238
|
+
solver.push();
|
|
239
|
+
this.addDomainEqs(qb);
|
|
240
|
+
for (; index < this.maxCex; index++) {
|
|
241
|
+
if (solver.check() !== L_TRUE) break;
|
|
242
|
+
const cex = solver.getModel();
|
|
243
|
+
if (cex === null) throw new SmtInvariantError("a satisfiable check has a model");
|
|
244
|
+
const projection = this.solverProject(cex, qb, eqs, true);
|
|
245
|
+
if (projection === null) break;
|
|
246
|
+
this.addInstantiation(quantifier, projection);
|
|
247
|
+
this.assertExpr(this.manager.mkApp(OP_NOT, [this.manager.mkAnd(eqs)], SORT_BOOL));
|
|
248
|
+
}
|
|
249
|
+
solver.pop(1);
|
|
250
|
+
return index > 0;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
private addInstantiation(quantifier: number, projection: number) {
|
|
254
|
+
const ctx = this.ctx;
|
|
255
|
+
const isExists = this.manager.getQuantifier(quantifier).kind === QUANTIFIER_EXISTS;
|
|
256
|
+
const qlit = ctx.expr2literal(quantifier) ^ (isExists ? 1 : 0);
|
|
257
|
+
const fml = ctx.rewrite(projection);
|
|
258
|
+
this.instantiations.push({ qlit, fml, generation: ctx.getMaxGeneration(fml) });
|
|
259
|
+
}
|
|
260
|
+
|
|
261
|
+
private addUniverseRestriction(qb: QBody) {
|
|
262
|
+
const manager = this.manager;
|
|
263
|
+
const model = this.getModel();
|
|
264
|
+
for (const sk of qb.vars.items) {
|
|
265
|
+
const universe = model.getUniverse(manager.sorts[sk]);
|
|
266
|
+
if (universe !== undefined) this.restrictToUniverse(sk, universe);
|
|
267
|
+
}
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
private substitute(expr: number, qb: QBody) {
|
|
271
|
+
const subst = new VarSubst(this.manager, true);
|
|
272
|
+
const result = subst.apply(expr, qb.vars.items);
|
|
273
|
+
subst.release();
|
|
274
|
+
return this.pinOwned(result);
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
private specialize(quantifier: number) {
|
|
278
|
+
const manager = this.manager;
|
|
279
|
+
const qb = this.getBody(quantifier);
|
|
280
|
+
const data = manager.getQuantifier(quantifier);
|
|
281
|
+
const evaluated = this.eval(this.getModel(), data.body, true);
|
|
282
|
+
const substituted = this.substitute(evaluated, qb);
|
|
283
|
+
const mbody = data.kind === QUANTIFIER_FORALL ? mkNot(manager, substituted) : substituted;
|
|
284
|
+
manager.incRef(mbody);
|
|
285
|
+
if (qb.mbody !== -1) manager.decRef(qb.mbody);
|
|
286
|
+
qb.mbody = mbody;
|
|
287
|
+
return qb;
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
// q2body: fresh constants for the variables of q, which, unlike skolem constants, models of
|
|
291
|
+
// the sub-solver interpret.
|
|
292
|
+
private getBody(quantifier: number) {
|
|
293
|
+
const existing = this.q2body.get(quantifier);
|
|
294
|
+
if (existing !== undefined) return existing;
|
|
295
|
+
const manager = this.manager;
|
|
296
|
+
const data = manager.getQuantifier(quantifier);
|
|
297
|
+
const qb: QBody = {
|
|
298
|
+
vars: new RefVector(manager),
|
|
299
|
+
freeVars: new Set(),
|
|
300
|
+
mbody: -1,
|
|
301
|
+
vbody: new RefVector(manager),
|
|
302
|
+
domainEqs: new RefVector(manager),
|
|
303
|
+
varArgs: [],
|
|
304
|
+
};
|
|
305
|
+
data.sorts.forEach((sort, index) =>
|
|
306
|
+
qb.vars.push(
|
|
307
|
+
manager.mkApp(manager.mkFreshFuncDecl(data.names[index], [], sort, false), [], sort),
|
|
308
|
+
),
|
|
309
|
+
);
|
|
310
|
+
const fml = this.substitute(data.body, qb);
|
|
311
|
+
qb.vbody.push(data.kind === QUANTIFIER_FORALL ? manager.mkApp(OP_NOT, [fml], SORT_BOOL) : fml);
|
|
312
|
+
flattenAndVector(manager, qb.vbody);
|
|
313
|
+
this.extractFreeVars(quantifier, qb);
|
|
314
|
+
this.extractVarArgs(data.body, qb);
|
|
315
|
+
this.q2body.set(quantifier, qb);
|
|
316
|
+
manager.incRef(quantifier);
|
|
317
|
+
this.ctx.trail.push(() => {
|
|
318
|
+
this.q2body.delete(quantifier);
|
|
319
|
+
qb.vars.reset();
|
|
320
|
+
qb.vbody.reset();
|
|
321
|
+
qb.domainEqs.reset();
|
|
322
|
+
if (qb.mbody !== -1) manager.decRef(qb.mbody);
|
|
323
|
+
manager.decRef(quantifier);
|
|
324
|
+
});
|
|
325
|
+
return qb;
|
|
326
|
+
}
|
|
327
|
+
|
|
328
|
+
// The variables of the plugins' families go through the plugins' projections; the array and
|
|
329
|
+
// datatype plugins have no projection without definitions, and leave their variables to the
|
|
330
|
+
// model values.
|
|
331
|
+
private solverProject(model: ProtoModel, qb: QBody, eqs: number[], isUsingInst: boolean) {
|
|
332
|
+
const manager = this.manager;
|
|
333
|
+
const qmodel = this.getModel();
|
|
334
|
+
eqs.length = 0;
|
|
335
|
+
qmodel.resetEvalCache();
|
|
336
|
+
for (const sk of qb.vars.items)
|
|
337
|
+
qmodel.registerConst(manager.decls[sk], this.eval(model, sk, true));
|
|
338
|
+
const fmls = new RefVector(manager);
|
|
339
|
+
for (const fml of qb.vbody.items) fmls.push(fml);
|
|
340
|
+
const vars = [...qb.vars.items];
|
|
341
|
+
const context = new MbpContext(manager, qmodel);
|
|
342
|
+
let isExtracted = false;
|
|
343
|
+
for (let index = 0; !isUsingInst && index < vars.length; index++) {
|
|
344
|
+
const family = manager.getSortFamily(manager.sorts[vars[index]]);
|
|
345
|
+
if (!PLUGIN_FAMILIES.has(family)) continue;
|
|
346
|
+
if (!isExtracted) {
|
|
347
|
+
for (const eq of qb.domainEqs.items) fmls.push(eq);
|
|
348
|
+
this.eliminateNestedVars(fmls, qb);
|
|
349
|
+
if (!fmls.items.every((fml) => this.isTrue(fml))) {
|
|
350
|
+
fmls.reset();
|
|
351
|
+
context.release();
|
|
352
|
+
return null;
|
|
353
|
+
}
|
|
354
|
+
new ProjectPlugin(context).extractLiterals(fmls);
|
|
355
|
+
isExtracted = true;
|
|
356
|
+
}
|
|
357
|
+
if (family !== FAMILY_ARITH) continue;
|
|
358
|
+
const arith = new ArithProjectPlugin(context);
|
|
359
|
+
arith.isCheckPurified = false;
|
|
360
|
+
arith.isApplyProjection = true;
|
|
361
|
+
arith.project(vars, fmls);
|
|
362
|
+
}
|
|
363
|
+
const replace = new ExprSafeReplace(manager);
|
|
364
|
+
for (const sk of vars) {
|
|
365
|
+
const value = this.eval(qmodel, sk, false);
|
|
366
|
+
replace.insert(sk, this.replaceModelValue(value));
|
|
367
|
+
eqs.push(this.pin(manager.mkEq(sk, value)));
|
|
368
|
+
}
|
|
369
|
+
const replaced = fmls.items.map((fml) => this.pinOwned(replace.apply(fml)));
|
|
370
|
+
replace.release();
|
|
371
|
+
fmls.reset();
|
|
372
|
+
context.release();
|
|
373
|
+
return this.pin(manager.mkAnd(replaced));
|
|
374
|
+
}
|
|
375
|
+
|
|
376
|
+
// add_domain_eqs: an argument of an uninterpreted function is one of the terms its ground
|
|
377
|
+
// applications have, and a variable that some positive equality binds takes one of at most
|
|
378
|
+
// MAX_UNBOUNDED_EQUALITIES ground values.
|
|
379
|
+
private addDomainEqs(qb: QBody) {
|
|
380
|
+
const manager = this.manager;
|
|
381
|
+
qb.domainEqs.reset();
|
|
382
|
+
for (const varArg of qb.varArgs) {
|
|
383
|
+
const bounds = this.pin(this.modelFixer.restrictArg(varArg[0], varArg[1]));
|
|
384
|
+
if (manager.isTrue(bounds)) continue;
|
|
385
|
+
const vbounds = this.substitute(bounds, qb);
|
|
386
|
+
this.assertExpr(this.substitute(this.eval(this.getModel(), bounds, true), qb));
|
|
387
|
+
qb.domainEqs.push(vbounds);
|
|
388
|
+
}
|
|
389
|
+
const vars = qb.vars.items;
|
|
390
|
+
for (let index = 0; index < vars.length; index++) {
|
|
391
|
+
if (!qb.freeVars.has(index)) continue;
|
|
392
|
+
const sk = vars[vars.length - index - 1];
|
|
393
|
+
const sort = manager.sorts[sk];
|
|
394
|
+
const veqs: number[] = [];
|
|
395
|
+
const meqs: number[] = [];
|
|
396
|
+
const visited = new Set<number>();
|
|
397
|
+
const nodes = this.ctx.egraph.nodes;
|
|
398
|
+
let bound = MAX_UNBOUNDED_EQUALITIES;
|
|
399
|
+
for (let nodeIndex = 0; nodeIndex < nodes.length && bound > 0; nodeIndex++) {
|
|
400
|
+
const node = nodes[nodeIndex];
|
|
401
|
+
const expr = node.owner;
|
|
402
|
+
const value = this.ctx.node2value(node);
|
|
403
|
+
if (
|
|
404
|
+
value === undefined ||
|
|
405
|
+
manager.sorts[expr] !== sort ||
|
|
406
|
+
manager.isValue(expr) ||
|
|
407
|
+
visited.has(value)
|
|
408
|
+
)
|
|
409
|
+
continue;
|
|
410
|
+
visited.add(value);
|
|
411
|
+
const replaced = this.replaceModelValue(value);
|
|
412
|
+
veqs.push(this.pin(manager.mkEq(sk, expr)));
|
|
413
|
+
meqs.push(this.pin(manager.mkEq(sk, replaced)));
|
|
414
|
+
bound--;
|
|
415
|
+
}
|
|
416
|
+
if (veqs.length === 0) continue;
|
|
417
|
+
const meq = manager.mkOr(meqs);
|
|
418
|
+
qb.domainEqs.push(manager.mkOr(veqs));
|
|
419
|
+
this.assertExpr(meq);
|
|
420
|
+
}
|
|
421
|
+
}
|
|
422
|
+
|
|
423
|
+
private assertExpr(expr: number) {
|
|
424
|
+
this.manager.incRef(expr);
|
|
425
|
+
this.initSolver().assertExpr(expr);
|
|
426
|
+
this.manager.decRef(expr);
|
|
427
|
+
}
|
|
428
|
+
|
|
429
|
+
// add_domain_bounds: the model of the sub-solver gives the variables their values, and the
|
|
430
|
+
// arguments of uninterpreted functions get the bounds of the projections around their values.
|
|
431
|
+
private addDomainBounds(model: ProtoModel, qb: QBody) {
|
|
432
|
+
const manager = this.manager;
|
|
433
|
+
const qmodel = this.getModel();
|
|
434
|
+
qb.domainEqs.reset();
|
|
435
|
+
qmodel.resetEvalCache();
|
|
436
|
+
for (const sk of qb.vars.items)
|
|
437
|
+
qmodel.registerConst(manager.decls[sk], this.eval(model, sk, true));
|
|
438
|
+
this.ctx.modelUpdated(qmodel);
|
|
439
|
+
for (const varArg of qb.varArgs) {
|
|
440
|
+
const term = this.substitute(varArg[0], qb);
|
|
441
|
+
const value = this.eval(qmodel, manager.getArg(term, varArg[1]), false);
|
|
442
|
+
if (manager.isValue(value)) this.modelFixer.invertArg(term, varArg[1], value, qb.domainEqs);
|
|
443
|
+
}
|
|
444
|
+
}
|
|
445
|
+
|
|
446
|
+
// eliminate_nested_vars: F[g(t)] becomes F[s] and g(t) = s, for the ground s that g(t) evaluates
|
|
447
|
+
// to.
|
|
448
|
+
private eliminateNestedVars(fmls: RefVector, qb: QBody) {
|
|
449
|
+
if (qb.varArgs.length === 0) return;
|
|
450
|
+
const manager = this.manager;
|
|
451
|
+
const replace = new ExprSafeReplace(manager);
|
|
452
|
+
const eqs: number[] = [];
|
|
453
|
+
const visited = new Set<number>();
|
|
454
|
+
for (const varArg of qb.varArgs) {
|
|
455
|
+
const expr = varArg[0];
|
|
456
|
+
if (visited.has(expr)) continue;
|
|
457
|
+
visited.add(expr);
|
|
458
|
+
const term = this.substitute(expr, qb);
|
|
459
|
+
const value = this.replaceModelValue(this.eval(this.getModel(), term, false));
|
|
460
|
+
const inverse = this.modelFixer.invertApp(value);
|
|
461
|
+
replace.insert(term, inverse);
|
|
462
|
+
eqs.push(this.pin(manager.mkEq(term, inverse)));
|
|
463
|
+
}
|
|
464
|
+
for (let index = 0; index < fmls.size; index++)
|
|
465
|
+
fmls.setOwned(index, replace.apply(fmls.items[index]));
|
|
466
|
+
replace.release();
|
|
467
|
+
for (const eq of eqs) fmls.push(eq);
|
|
468
|
+
}
|
|
469
|
+
|
|
470
|
+
// extract_var_args: the arguments of uninterpreted functions that hold bound variables.
|
|
471
|
+
private extractVarArgs(expr: number, qb: QBody) {
|
|
472
|
+
const manager = this.manager;
|
|
473
|
+
for (const subterm of getSubterms(manager, expr)) {
|
|
474
|
+
if (manager.isGroundApp(subterm) || !manager.isApp(subterm)) continue;
|
|
475
|
+
if (manager.getNumArgs(subterm) === 0 || !manager.isUninterpreted(subterm)) continue;
|
|
476
|
+
manager.getArgs(subterm).forEach((arg, index) => {
|
|
477
|
+
if (
|
|
478
|
+
!manager.isGroundApp(arg) &&
|
|
479
|
+
!isUninterpretedApp(manager, arg) &&
|
|
480
|
+
!(manager.isVar(arg) && qb.freeVars.has(manager.values[arg]))
|
|
481
|
+
)
|
|
482
|
+
qb.varArgs.push([subterm, index]);
|
|
483
|
+
});
|
|
484
|
+
}
|
|
485
|
+
}
|
|
486
|
+
|
|
487
|
+
// extract_free_vars: the variables of positive equalities with a term that is not a variable.
|
|
488
|
+
private extractFreeVars(quantifier: number, qb: QBody) {
|
|
489
|
+
const manager = this.manager;
|
|
490
|
+
const data = manager.getQuantifier(quantifier);
|
|
491
|
+
const fmls = new RefVector(manager);
|
|
492
|
+
fmls.push(
|
|
493
|
+
data.kind === QUANTIFIER_EXISTS ? manager.mkApp(OP_NOT, [data.body], SORT_BOOL) : data.body,
|
|
494
|
+
);
|
|
495
|
+
flattenOrVector(manager, fmls);
|
|
496
|
+
for (const fml of fmls.items) {
|
|
497
|
+
if (!manager.isApp(fml) || manager.getOp(fml) !== OP_EQ) continue;
|
|
498
|
+
const lhs = manager.getArg(fml, 0);
|
|
499
|
+
const rhs = manager.getArg(fml, 1);
|
|
500
|
+
if (manager.isVar(lhs) && !manager.isVar(rhs)) qb.freeVars.add(manager.values[lhs]);
|
|
501
|
+
if (manager.isVar(rhs) && !manager.isVar(lhs)) qb.freeVars.add(manager.values[rhs]);
|
|
502
|
+
}
|
|
503
|
+
fmls.reset();
|
|
504
|
+
}
|
|
505
|
+
|
|
506
|
+
private quickCheck(quantifier: number, flat: number, qb: QBody) {
|
|
507
|
+
const manager = this.manager;
|
|
508
|
+
const vars = qb.vars.items;
|
|
509
|
+
const offsets = vars.map(() => 0);
|
|
510
|
+
if (!vars.every((_sk, index) => this.nextOffsetAt(offsets, vars, index, 0))) return false;
|
|
511
|
+
let numBindings = 0;
|
|
512
|
+
for (let round = 0; round < MAX_QUICK_CHECK_ROUNDS && numBindings < this.maxCex; round++) {
|
|
513
|
+
const binding = this.setBinding(offsets, vars);
|
|
514
|
+
if (qb.vbody.items.every((fml) => this.isTrue(fml))) {
|
|
515
|
+
const subst = new VarSubst(manager, true);
|
|
516
|
+
const body = this.pinOwned(subst.apply(manager.getQuantifier(flat).body, binding));
|
|
517
|
+
subst.release();
|
|
518
|
+
const isForall = manager.getQuantifier(quantifier).kind === QUANTIFIER_FORALL;
|
|
519
|
+
this.addInstantiation(quantifier, isForall ? mkNot(manager, body) : body);
|
|
520
|
+
numBindings++;
|
|
521
|
+
}
|
|
522
|
+
if (!this.nextOffset(offsets, vars)) break;
|
|
523
|
+
}
|
|
524
|
+
return numBindings > 0;
|
|
525
|
+
}
|
|
526
|
+
|
|
527
|
+
private nextOffsetAt(offsets: number[], vars: readonly number[], index: number, start: number) {
|
|
528
|
+
const manager = this.manager;
|
|
529
|
+
const sort = manager.sorts[vars[index]];
|
|
530
|
+
const nodes = this.ctx.egraph.nodes;
|
|
531
|
+
for (let nodeIndex = start; nodeIndex < nodes.length; nodeIndex++) {
|
|
532
|
+
const node = nodes[nodeIndex];
|
|
533
|
+
if (node.generation > 0) return false;
|
|
534
|
+
const expr = node.owner;
|
|
535
|
+
if (manager.sorts[expr] === sort && !manager.isValue(expr)) {
|
|
536
|
+
offsets[index] = nodeIndex;
|
|
537
|
+
return true;
|
|
538
|
+
}
|
|
539
|
+
}
|
|
540
|
+
return false;
|
|
541
|
+
}
|
|
542
|
+
|
|
543
|
+
private setBinding(offsets: readonly number[], vars: readonly number[]) {
|
|
544
|
+
const manager = this.manager;
|
|
545
|
+
const nodes = this.ctx.egraph.nodes;
|
|
546
|
+
const model = this.getModel();
|
|
547
|
+
model.resetEvalCache();
|
|
548
|
+
return offsets.map((offset, index) => {
|
|
549
|
+
const expr = nodes[offset].owner;
|
|
550
|
+
model.registerConst(manager.decls[vars[index]], this.eval(model, expr, true));
|
|
551
|
+
return expr;
|
|
552
|
+
});
|
|
553
|
+
}
|
|
554
|
+
|
|
555
|
+
// next_offset: the next binding, which also restarts every earlier variable and the variable
|
|
556
|
+
// itself when it runs out.
|
|
557
|
+
private nextOffset(offsets: number[], vars: readonly number[]) {
|
|
558
|
+
for (let index = 0; index < vars.length; index++) {
|
|
559
|
+
if (this.nextOffsetAt(offsets, vars, index, offsets[index] + 1)) return true;
|
|
560
|
+
for (let other = 0; other <= index; other++)
|
|
561
|
+
if (!this.nextOffsetAt(offsets, vars, other, 0)) return false;
|
|
562
|
+
}
|
|
563
|
+
return false;
|
|
564
|
+
}
|
|
565
|
+
|
|
566
|
+
private initModel() {
|
|
567
|
+
if (this.model !== null) return;
|
|
568
|
+
const model = new ProtoModel(this.manager).mkModel();
|
|
569
|
+
this.setModel(model);
|
|
570
|
+
this.ctx.updateModel(model);
|
|
571
|
+
}
|
|
572
|
+
|
|
573
|
+
// init_solver: mk_smt2_solver gives the incremental sat solver of sat.euf.
|
|
574
|
+
private initSolver() {
|
|
575
|
+
const ctx = this.ctx;
|
|
576
|
+
this.solver ??= new IncSatSolver(ctx.manager, ctx.s.params, true, ctx.mkThSolver);
|
|
577
|
+
return this.solver;
|
|
578
|
+
}
|
|
579
|
+
|
|
580
|
+
initSearch() {
|
|
581
|
+
this.maxCex = MBQI_MAX_CEXS;
|
|
582
|
+
}
|
|
583
|
+
|
|
584
|
+
finalizeModel(model: ProtoModel) {
|
|
585
|
+
this.modelFixer.fix(model);
|
|
586
|
+
}
|
|
587
|
+
}
|