tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
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 +5 -1
- package/dist/index.d.ts +5 -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 +43 -40
- 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 +4 -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/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- 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 +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- 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 +664 -287
- 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 +4 -11
- 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 +3 -5
- 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/md5.ts +26 -29
- 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 +37 -16
- 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 +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- 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 +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- 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,52 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { L_FALSE } from "../lbool";
|
|
3
|
+
import { ProtoModel } from "../proto-model";
|
|
4
|
+
import type { DatalogContext, Engine, ModelConverter } from "./dl-context";
|
|
5
|
+
import { MkSlice } from "./dl-mk-slice";
|
|
6
|
+
import { RuleSet } from "./dl-rule-set";
|
|
7
|
+
import { applyDefaultTransformation, transformRules } from "./dl-rule-transformer";
|
|
8
|
+
import { SpacerContext } from "./spacer-context";
|
|
9
|
+
|
|
10
|
+
// Each query gets a fresh spacer context, where Z3 keeps the lemmas of a previous query whose
|
|
11
|
+
// rules subsume the new ones.
|
|
12
|
+
export class SpacerDlInterface implements Engine {
|
|
13
|
+
private spacer: SpacerContext | undefined;
|
|
14
|
+
private modelConverters: readonly ModelConverter[] = [];
|
|
15
|
+
|
|
16
|
+
constructor(private context: DatalogContext) {}
|
|
17
|
+
|
|
18
|
+
query(query: number) {
|
|
19
|
+
const context = this.context;
|
|
20
|
+
const params = context.params;
|
|
21
|
+
context.ensureOpened();
|
|
22
|
+
const oldRules = RuleSet.copy(context.getRules());
|
|
23
|
+
context.ruleManager.mkQuery(query, context.getRules());
|
|
24
|
+
applyDefaultTransformation(context);
|
|
25
|
+
if (params.getBool("xform.slice", true)) transformRules(context, [new MkSlice(context)]);
|
|
26
|
+
if (params.getUint("xform.unfold_rules", 0) > 0)
|
|
27
|
+
throw new SmtUnsupportedError("fp.xform.unfold_rules");
|
|
28
|
+
const rules = context.getRules();
|
|
29
|
+
if (rules.outputPredicates.size === 0) return L_FALSE;
|
|
30
|
+
const queryPred = rules.getOutputPredicate();
|
|
31
|
+
const spacerRules = new RuleSet(context);
|
|
32
|
+
spacerRules.replaceRules(rules);
|
|
33
|
+
spacerRules.close();
|
|
34
|
+
context.reopen();
|
|
35
|
+
context.replaceRules(oldRules);
|
|
36
|
+
context.manager.limit.checkpoint();
|
|
37
|
+
const spacer = new SpacerContext(context);
|
|
38
|
+
this.spacer = spacer;
|
|
39
|
+
this.modelConverters = context.modelConverters ?? [];
|
|
40
|
+
spacer.setQuery(queryPred);
|
|
41
|
+
spacer.updateRules(spacerRules);
|
|
42
|
+
if (spacerRules.rules.length === 0) return L_FALSE;
|
|
43
|
+
return spacer.solve(params.getUint("spacer.min_level", 0));
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
getModel() {
|
|
47
|
+
return this.modelConverters.reduceRight(
|
|
48
|
+
(model, convert) => convert(model),
|
|
49
|
+
this.spacer?.getModel() ?? new ProtoModel(this.context.manager),
|
|
50
|
+
);
|
|
51
|
+
}
|
|
52
|
+
}
|
|
@@ -0,0 +1,241 @@
|
|
|
1
|
+
import { MBQI_MAX_ITERATIONS } from "../context";
|
|
2
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
3
|
+
import {
|
|
4
|
+
type AstManager,
|
|
5
|
+
FAMILY_ARRAY,
|
|
6
|
+
FAMILY_DATATYPE,
|
|
7
|
+
FAMILY_USER,
|
|
8
|
+
isArithSort,
|
|
9
|
+
KIND_APP,
|
|
10
|
+
OP_EQ,
|
|
11
|
+
OP_GE,
|
|
12
|
+
OP_LE,
|
|
13
|
+
OP_MOD,
|
|
14
|
+
SORT_BOOL,
|
|
15
|
+
} from "../ast";
|
|
16
|
+
import { L_FALSE } from "../lbool";
|
|
17
|
+
import { SmtKernel } from "../smt-kernel";
|
|
18
|
+
import type { Lemma, SpacerContext } from "./spacer-context";
|
|
19
|
+
import { mkAndOf, pin } from "./spacer-util";
|
|
20
|
+
|
|
21
|
+
export type LemmaGeneralizer = (lemma: Lemma) => void;
|
|
22
|
+
|
|
23
|
+
const getSortFamilyOf = (manager: AstManager, expr: number) =>
|
|
24
|
+
manager.getSortFamily(manager.sorts[expr]);
|
|
25
|
+
|
|
26
|
+
const expandLiterals = (manager: AstManager, conjs: number[]) => {
|
|
27
|
+
for (let index = 0; index < conjs.length; index++) {
|
|
28
|
+
const expr = conjs[index];
|
|
29
|
+
if (manager.getOp(expr) !== OP_EQ) continue;
|
|
30
|
+
const left = manager.getArg(expr, 0);
|
|
31
|
+
const right = manager.getArg(expr, 1);
|
|
32
|
+
if (
|
|
33
|
+
isArithSort(manager.sorts[left]) &&
|
|
34
|
+
manager.getOp(left) !== OP_MOD &&
|
|
35
|
+
manager.getOp(right) !== OP_MOD
|
|
36
|
+
) {
|
|
37
|
+
conjs[index] = pin(manager, manager.mkApp(OP_LE, [left, right], SORT_BOOL));
|
|
38
|
+
const ge = pin(manager, manager.mkApp(OP_GE, [left, right], SORT_BOOL));
|
|
39
|
+
if (index + 1 === conjs.length) conjs.push(ge);
|
|
40
|
+
else {
|
|
41
|
+
conjs.push(conjs[index + 1]);
|
|
42
|
+
conjs[index + 1] = ge;
|
|
43
|
+
}
|
|
44
|
+
index++;
|
|
45
|
+
} else if (
|
|
46
|
+
getSortFamilyOf(manager, left) === FAMILY_DATATYPE ||
|
|
47
|
+
manager.isBvSort(manager.sorts[left])
|
|
48
|
+
)
|
|
49
|
+
throw new SmtUnsupportedError("weakening datatype and bit-vector literals of spacer lemmas");
|
|
50
|
+
}
|
|
51
|
+
};
|
|
52
|
+
|
|
53
|
+
const mkInductiveGeneralizer = (context: SpacerContext): LemmaGeneralizer => {
|
|
54
|
+
const manager = context.manager;
|
|
55
|
+
const trueExpr = manager.trueExpr;
|
|
56
|
+
return (lemma) => {
|
|
57
|
+
if (lemma.getCube().length === 0) return;
|
|
58
|
+
const pt = (lemma.pob as NonNullable<Lemma["pob"]>).pt;
|
|
59
|
+
let level = lemma.level;
|
|
60
|
+
const cube = [...lemma.getCube()];
|
|
61
|
+
let core: number[] = [];
|
|
62
|
+
|
|
63
|
+
const loadCubeToCore = () => {
|
|
64
|
+
core = cube.filter((lit) => lit !== trueExpr);
|
|
65
|
+
};
|
|
66
|
+
|
|
67
|
+
const isCubeInductive = () => {
|
|
68
|
+
loadCubeToCore();
|
|
69
|
+
if (core.length === 0) return false;
|
|
70
|
+
const usedLevel = pt.checkInductive(level, core);
|
|
71
|
+
if (usedLevel === undefined) return false;
|
|
72
|
+
level = Math.max(level, usedLevel);
|
|
73
|
+
return true;
|
|
74
|
+
};
|
|
75
|
+
|
|
76
|
+
const updateCubeByCore = (from: number) => {
|
|
77
|
+
const marked = new Set(core);
|
|
78
|
+
let success = 0;
|
|
79
|
+
for (let index = from; index < cube.length; index++) {
|
|
80
|
+
if (cube[index] === trueExpr || marked.has(cube[index])) continue;
|
|
81
|
+
cube[index] = trueExpr;
|
|
82
|
+
success++;
|
|
83
|
+
}
|
|
84
|
+
return success;
|
|
85
|
+
};
|
|
86
|
+
|
|
87
|
+
const generalizeCore = (from: number) => {
|
|
88
|
+
if (core.length === 0) return 0;
|
|
89
|
+
const usedLevel = pt.checkInductive(level, core);
|
|
90
|
+
if (usedLevel === undefined) return 0;
|
|
91
|
+
const success = updateCubeByCore(from);
|
|
92
|
+
level = Math.max(level, usedLevel);
|
|
93
|
+
return success;
|
|
94
|
+
};
|
|
95
|
+
|
|
96
|
+
const generalize1 = (litIndex: number) => {
|
|
97
|
+
core = cube.filter((lit, index) => lit !== trueExpr && index !== litIndex);
|
|
98
|
+
return generalizeCore(litIndex);
|
|
99
|
+
};
|
|
100
|
+
|
|
101
|
+
const generalizeRange = (from: number, to: number) => {
|
|
102
|
+
let success = 0;
|
|
103
|
+
for (let index = from; index < to; index++) success += generalize1(index);
|
|
104
|
+
return success;
|
|
105
|
+
};
|
|
106
|
+
|
|
107
|
+
const weaken1 = (litIndex: number) => {
|
|
108
|
+
if (cube[litIndex] === trueExpr) return 0;
|
|
109
|
+
let success = 0;
|
|
110
|
+
const cubeSize = cube.length;
|
|
111
|
+
const saved = cube[litIndex];
|
|
112
|
+
cube[litIndex] = trueExpr;
|
|
113
|
+
const weakening = [saved];
|
|
114
|
+
expandLiterals(manager, weakening);
|
|
115
|
+
if (weakening[0] !== saved) {
|
|
116
|
+
cube.push(...weakening);
|
|
117
|
+
success +=
|
|
118
|
+
cube.length - cubeSize >= 2
|
|
119
|
+
? generalizeRange(cubeSize, cube.length)
|
|
120
|
+
: isCubeInductive()
|
|
121
|
+
? 1
|
|
122
|
+
: 0;
|
|
123
|
+
}
|
|
124
|
+
if (success === 0) {
|
|
125
|
+
cube[litIndex] = saved;
|
|
126
|
+
cube.length = cubeSize;
|
|
127
|
+
}
|
|
128
|
+
return success;
|
|
129
|
+
};
|
|
130
|
+
|
|
131
|
+
const weakenRange = (from: number, to: number) => {
|
|
132
|
+
let success = 0;
|
|
133
|
+
for (let index = from; index < to; index++) success += weaken1(index);
|
|
134
|
+
return success;
|
|
135
|
+
};
|
|
136
|
+
|
|
137
|
+
let numGens = generalizeRange(0, cube.length);
|
|
138
|
+
const cubeSize = cube.length;
|
|
139
|
+
numGens += weakenRange(0, cubeSize);
|
|
140
|
+
if (cubeSize < cube.length) numGens += weakenRange(cubeSize, cube.length);
|
|
141
|
+
if (numGens === 0) return;
|
|
142
|
+
lemma.updateCube(
|
|
143
|
+
lemma.pob,
|
|
144
|
+
cube.filter((lit) => lit !== trueExpr),
|
|
145
|
+
);
|
|
146
|
+
lemma.setLevel(level);
|
|
147
|
+
};
|
|
148
|
+
};
|
|
149
|
+
|
|
150
|
+
const isArrayEq = (manager: AstManager, expr: number) =>
|
|
151
|
+
manager.getOp(expr) === OP_EQ &&
|
|
152
|
+
manager
|
|
153
|
+
.getArgs(expr)
|
|
154
|
+
.every(
|
|
155
|
+
(arg) =>
|
|
156
|
+
manager.kinds[arg] === KIND_APP &&
|
|
157
|
+
manager.getFamily(arg) === FAMILY_USER &&
|
|
158
|
+
manager.getNumArgs(arg) === 0 &&
|
|
159
|
+
getSortFamilyOf(manager, arg) === FAMILY_ARRAY,
|
|
160
|
+
);
|
|
161
|
+
|
|
162
|
+
const collectArraySymbols = (manager: AstManager, root: number) => {
|
|
163
|
+
const symbols = new Set<number>();
|
|
164
|
+
let arraySort = -1;
|
|
165
|
+
const visited = new Set<number>();
|
|
166
|
+
const todo = [root];
|
|
167
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
168
|
+
if (visited.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
|
|
169
|
+
visited.add(expr);
|
|
170
|
+
manager.pushArgs(expr, todo);
|
|
171
|
+
if (manager.getFamily(expr) !== FAMILY_USER || getSortFamilyOf(manager, expr) !== FAMILY_ARRAY)
|
|
172
|
+
continue;
|
|
173
|
+
if (arraySort !== -1 && arraySort !== manager.sorts[expr]) continue;
|
|
174
|
+
arraySort = manager.sorts[expr];
|
|
175
|
+
symbols.add(manager.decls[expr]);
|
|
176
|
+
}
|
|
177
|
+
return symbols;
|
|
178
|
+
};
|
|
179
|
+
|
|
180
|
+
const mkArrayEqGeneralizer =
|
|
181
|
+
(context: SpacerContext): LemmaGeneralizer =>
|
|
182
|
+
(lemma) => {
|
|
183
|
+
const manager = context.manager;
|
|
184
|
+
const core = [...lemma.getCube()];
|
|
185
|
+
const symbols = [...collectArraySymbols(manager, mkAndOf(manager, core))];
|
|
186
|
+
if (symbols.length <= 1 || symbols.length > 8) return;
|
|
187
|
+
const eqs: number[] = [];
|
|
188
|
+
for (let first = 0; first < symbols.length; first++)
|
|
189
|
+
for (let second = first + 1; second < symbols.length; second++) {
|
|
190
|
+
const mkConst = (decl: number) => manager.mkApp(decl, [], manager.funcDecls[decl].range);
|
|
191
|
+
eqs.push(pin(manager, manager.mkEq(mkConst(symbols[first]), mkConst(symbols[second]))));
|
|
192
|
+
}
|
|
193
|
+
const solver = new SmtKernel(manager, {
|
|
194
|
+
isMbqi: true,
|
|
195
|
+
isFindingMacros: false,
|
|
196
|
+
mbqiMaxIterations: MBQI_MAX_ITERATIONS,
|
|
197
|
+
});
|
|
198
|
+
const lits = [...core];
|
|
199
|
+
let isDirty = false;
|
|
200
|
+
for (let index = 0; index < core.length; index++) {
|
|
201
|
+
if (manager.isNot(lits[index]) && isArrayEq(manager, manager.getArg(lits[index], 0)))
|
|
202
|
+
continue;
|
|
203
|
+
solver.push();
|
|
204
|
+
solver.assertExpr(lits[index]);
|
|
205
|
+
for (const eq of eqs) {
|
|
206
|
+
solver.push();
|
|
207
|
+
solver.assertExpr(eq);
|
|
208
|
+
const result = solver.check([]);
|
|
209
|
+
solver.pop(1);
|
|
210
|
+
if (result === L_FALSE) {
|
|
211
|
+
lits[index] = pin(manager, manager.mkNot(eq));
|
|
212
|
+
isDirty = true;
|
|
213
|
+
break;
|
|
214
|
+
}
|
|
215
|
+
}
|
|
216
|
+
solver.pop(1);
|
|
217
|
+
}
|
|
218
|
+
if (!isDirty) return;
|
|
219
|
+
const pob = lemma.pob as NonNullable<Lemma["pob"]>;
|
|
220
|
+
const usedLevel = pob.pt.checkInductive(lemma.level, lits);
|
|
221
|
+
if (usedLevel === undefined) return;
|
|
222
|
+
lemma.updateCube(pob, lits);
|
|
223
|
+
lemma.setLevel(usedLevel);
|
|
224
|
+
};
|
|
225
|
+
|
|
226
|
+
export const mkLemmaGeneralizers = (context: SpacerContext) => {
|
|
227
|
+
const params = context.params;
|
|
228
|
+
if (
|
|
229
|
+
params.getBool("spacer.use_euf_gen", false) ||
|
|
230
|
+
params.getBool("spacer.use_lim_num_gen", false)
|
|
231
|
+
)
|
|
232
|
+
throw new SmtUnsupportedError("the euf and limit-number spacer generalizers");
|
|
233
|
+
if (params.getBool("spacer.expand_bnd", false) || params.getBool("spacer.validate_lemmas", false))
|
|
234
|
+
throw new SmtUnsupportedError("spacer.expand_bnd and spacer.validate_lemmas");
|
|
235
|
+
const generalizers: LemmaGeneralizer[] = [];
|
|
236
|
+
if (params.getBool("spacer.use_inductive_generalizer", true))
|
|
237
|
+
generalizers.push(mkInductiveGeneralizer(context));
|
|
238
|
+
if (params.getBool("spacer.use_array_eq_generalizer", true))
|
|
239
|
+
generalizers.push(mkArrayEqGeneralizer(context));
|
|
240
|
+
return generalizers;
|
|
241
|
+
};
|
|
@@ -0,0 +1,127 @@
|
|
|
1
|
+
import { type AstManager, getSymbolName, KIND_APP } from "../ast";
|
|
2
|
+
import { RewriterTpl } from "../rewriter-tpl";
|
|
3
|
+
import { pin } from "./spacer-util";
|
|
4
|
+
|
|
5
|
+
interface MuxEntry {
|
|
6
|
+
main: number;
|
|
7
|
+
variants: number[];
|
|
8
|
+
}
|
|
9
|
+
|
|
10
|
+
class ShiftRewriter extends RewriterTpl {
|
|
11
|
+
constructor(
|
|
12
|
+
manager: AstManager,
|
|
13
|
+
private shift: (decl: number) => number | undefined,
|
|
14
|
+
) {
|
|
15
|
+
super(manager);
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
getSubst(expr: number) {
|
|
19
|
+
const manager = this.manager;
|
|
20
|
+
if (manager.kinds[expr] !== KIND_APP) return undefined;
|
|
21
|
+
const target = this.shift(manager.decls[expr]);
|
|
22
|
+
if (target === undefined) return undefined;
|
|
23
|
+
return pin(manager, manager.mkApp(target, manager.getArgs(expr), manager.sorts[expr]));
|
|
24
|
+
}
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
// The n (index 0) and o (index i + 1) variants of the predicate signatures and spacer's own
|
|
28
|
+
// constants. Z3's manager hash-conses the declarations by name, so the variants are kept here.
|
|
29
|
+
export class SpacerManager {
|
|
30
|
+
private decls = new Map<string, number>();
|
|
31
|
+
private entries = new Map<number, MuxEntry>();
|
|
32
|
+
private muxes = new Map<number, { entry: MuxEntry; index: number }>();
|
|
33
|
+
|
|
34
|
+
constructor(readonly manager: AstManager) {}
|
|
35
|
+
|
|
36
|
+
mkFuncDecl(name: string, domain: number[], range: number) {
|
|
37
|
+
const key = `${name}|${domain.join(",")}|${range}`;
|
|
38
|
+
const existing = this.decls.get(key);
|
|
39
|
+
if (existing !== undefined) return existing;
|
|
40
|
+
const decl = this.manager.mkFuncDecl(name, domain, range);
|
|
41
|
+
this.manager.incDeclRef(decl);
|
|
42
|
+
this.decls.set(key, decl);
|
|
43
|
+
return decl;
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
mkConst(name: string, sort: number) {
|
|
47
|
+
return pin(this.manager, this.manager.mkApp(this.mkFuncDecl(name, [], sort), [], sort));
|
|
48
|
+
}
|
|
49
|
+
|
|
50
|
+
constOf(decl: number) {
|
|
51
|
+
return pin(this.manager, this.manager.mkApp(decl, [], this.manager.funcDecls[decl].range));
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
private mkVariant(decl: number, index: number) {
|
|
55
|
+
const funcDecl = this.manager.funcDecls[decl];
|
|
56
|
+
const name = `${getSymbolName(funcDecl.name)}_${index === 0 ? "n" : String(index - 1)}`;
|
|
57
|
+
return this.mkFuncDecl(name, funcDecl.domain, funcDecl.range);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
private ensureCapacity(entry: MuxEntry, size: number) {
|
|
61
|
+
while (entry.variants.length < size) {
|
|
62
|
+
const index = entry.variants.length;
|
|
63
|
+
const variant = this.mkVariant(entry.main, index);
|
|
64
|
+
entry.variants.push(variant);
|
|
65
|
+
this.muxes.set(variant, { entry, index });
|
|
66
|
+
}
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
private findByDecl(decl: number, index: number) {
|
|
70
|
+
let entry = this.entries.get(decl);
|
|
71
|
+
if (entry === undefined) {
|
|
72
|
+
entry = { main: decl, variants: [] };
|
|
73
|
+
this.entries.set(decl, entry);
|
|
74
|
+
this.ensureCapacity(entry, 2);
|
|
75
|
+
}
|
|
76
|
+
this.ensureCapacity(entry, index + 1);
|
|
77
|
+
return entry.variants[index];
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
getOPred(decl: number, index: number) {
|
|
81
|
+
return this.findByDecl(decl, index + 1);
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
getNPred(decl: number) {
|
|
85
|
+
return this.findByDecl(decl, 0);
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
private shiftDecl(decl: number, target: number) {
|
|
89
|
+
const mux = this.muxes.get(decl);
|
|
90
|
+
if (mux === undefined) return undefined;
|
|
91
|
+
this.ensureCapacity(mux.entry, target + 1);
|
|
92
|
+
return mux.entry.variants[target];
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
o2n(decl: number) {
|
|
96
|
+
return this.shiftDecl(decl, 0) ?? decl;
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
o2o(decl: number, targetIndex: number) {
|
|
100
|
+
return this.shiftDecl(decl, targetIndex + 1) ?? decl;
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
n2o(decl: number, oIndex: number) {
|
|
104
|
+
return this.shiftDecl(decl, oIndex + 1) ?? decl;
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
private shiftExpr(expr: number, sourceIndex: number, targetIndex: number) {
|
|
108
|
+
if (sourceIndex === targetIndex) return expr;
|
|
109
|
+
const rewriter = new ShiftRewriter(this.manager, (decl) => {
|
|
110
|
+
const mux = this.muxes.get(decl);
|
|
111
|
+
return mux === undefined || mux.index !== sourceIndex
|
|
112
|
+
? undefined
|
|
113
|
+
: this.shiftDecl(decl, targetIndex);
|
|
114
|
+
});
|
|
115
|
+
const result = rewriter.rewrite(pin(this.manager, expr));
|
|
116
|
+
rewriter.release();
|
|
117
|
+
return result;
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
formulaO2n(expr: number, oIndex: number) {
|
|
121
|
+
return this.shiftExpr(expr, oIndex + 1, 0);
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
formulaN2o(expr: number, oIndex: number) {
|
|
125
|
+
return this.shiftExpr(expr, 0, oIndex + 1);
|
|
126
|
+
}
|
|
127
|
+
}
|
|
@@ -0,0 +1,219 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
3
|
+
import { L_GAVE_UP, type Pob, type SpacerContext } from "./spacer-context";
|
|
4
|
+
import { INFTY_LEVEL } from "./spacer-util";
|
|
5
|
+
|
|
6
|
+
class ModelNode {
|
|
7
|
+
next: ModelNode | undefined;
|
|
8
|
+
prev: ModelNode | undefined;
|
|
9
|
+
readonly origLevel: number;
|
|
10
|
+
depth = 0;
|
|
11
|
+
isClosed = false;
|
|
12
|
+
children: ModelNode[] = [];
|
|
13
|
+
|
|
14
|
+
constructor(
|
|
15
|
+
readonly parent: ModelNode | undefined,
|
|
16
|
+
readonly pob: Pob,
|
|
17
|
+
) {
|
|
18
|
+
this.origLevel = pob.level;
|
|
19
|
+
parent?.addChild(this);
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
private addChild(kid: ModelNode) {
|
|
23
|
+
this.children.push(kid);
|
|
24
|
+
kid.depth = this.depth + 1;
|
|
25
|
+
if (this.isClosed) this.setOpen();
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
isOneClosed() {
|
|
29
|
+
if (this.isClosed) return true;
|
|
30
|
+
if (this.children.length === 0) return false;
|
|
31
|
+
return this.children.every((kid) => kid.isClosed);
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
checkPreClosed() {
|
|
35
|
+
if (this.children.some((kid) => !kid.isClosed)) return;
|
|
36
|
+
this.isClosed = true;
|
|
37
|
+
for (let parent = this.parent; parent?.isOneClosed(); parent = parent.parent)
|
|
38
|
+
parent.isClosed = true;
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
setOpen() {
|
|
42
|
+
this.isClosed = false;
|
|
43
|
+
for (let parent = this.parent; parent?.isClosed; parent = parent.parent)
|
|
44
|
+
parent.isClosed = false;
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
isInQueue() {
|
|
48
|
+
return this.next !== undefined && this.prev !== undefined;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
insertAfter(node: ModelNode) {
|
|
52
|
+
if (this === node) {
|
|
53
|
+
this.next = node;
|
|
54
|
+
this.prev = node;
|
|
55
|
+
return;
|
|
56
|
+
}
|
|
57
|
+
const next = this.next as ModelNode;
|
|
58
|
+
node.next = next;
|
|
59
|
+
next.prev = node;
|
|
60
|
+
this.next = node;
|
|
61
|
+
node.prev = this;
|
|
62
|
+
}
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
class ModelSearch {
|
|
66
|
+
root: ModelNode | undefined;
|
|
67
|
+
private head: ModelNode | undefined;
|
|
68
|
+
private cache: Map<number, ModelNode[]>[] = [];
|
|
69
|
+
|
|
70
|
+
constructor(private isBfs: boolean) {}
|
|
71
|
+
|
|
72
|
+
private detach(node: ModelNode) {
|
|
73
|
+
if (node === node.next) this.head = undefined;
|
|
74
|
+
else {
|
|
75
|
+
(node.next as ModelNode).prev = node.prev;
|
|
76
|
+
(node.prev as ModelNode).next = node.next;
|
|
77
|
+
if (node === this.head) this.head = node.next;
|
|
78
|
+
}
|
|
79
|
+
node.prev = undefined;
|
|
80
|
+
node.next = undefined;
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
private getCache(node: ModelNode) {
|
|
84
|
+
while (this.cache.length <= node.origLevel) this.cache.push(new Map());
|
|
85
|
+
return this.cache[node.origLevel];
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
reset() {
|
|
89
|
+
if (this.root !== undefined) {
|
|
90
|
+
this.eraseChildren(this.root, false);
|
|
91
|
+
this.removeNode(this.root, false);
|
|
92
|
+
this.root = undefined;
|
|
93
|
+
}
|
|
94
|
+
this.cache = [];
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
popFront() {
|
|
98
|
+
const result = this.head;
|
|
99
|
+
if (result !== undefined) this.detach(result);
|
|
100
|
+
return result;
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
addLeaf(node: ModelNode) {
|
|
104
|
+
const cache = this.getCache(node);
|
|
105
|
+
let nodes = cache.get(node.pob.post);
|
|
106
|
+
if (nodes === undefined) {
|
|
107
|
+
nodes = [];
|
|
108
|
+
cache.set(node.pob.post, nodes);
|
|
109
|
+
}
|
|
110
|
+
if (nodes.includes(node)) return;
|
|
111
|
+
nodes.push(node);
|
|
112
|
+
if (nodes.length === 1) this.enqueueLeaf(node);
|
|
113
|
+
else node.isClosed = true;
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
enqueueLeaf(node: ModelNode) {
|
|
117
|
+
if (this.head === undefined) {
|
|
118
|
+
this.head = node;
|
|
119
|
+
node.insertAfter(node);
|
|
120
|
+
} else if (this.isBfs) this.head.insertAfter(node);
|
|
121
|
+
else (this.head.next as ModelNode).insertAfter(node);
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
setRoot(root: ModelNode) {
|
|
125
|
+
this.reset();
|
|
126
|
+
this.root = root;
|
|
127
|
+
this.addLeaf(root);
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
backtrackLevel(node: ModelNode) {
|
|
131
|
+
const parent = node.parent;
|
|
132
|
+
if (parent === undefined) return;
|
|
133
|
+
this.eraseChildren(parent, true);
|
|
134
|
+
this.enqueueLeaf(parent);
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
private eraseChildren(node: ModelNode, isBacktracking: boolean) {
|
|
138
|
+
const todo = [...node.children];
|
|
139
|
+
if (node.isInQueue()) this.detach(node);
|
|
140
|
+
node.children = [];
|
|
141
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
142
|
+
todo.push(...current.children);
|
|
143
|
+
this.removeNode(current, isBacktracking);
|
|
144
|
+
}
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
private removeNode(node: ModelNode, isBacktracking: boolean) {
|
|
148
|
+
const cache = this.getCache(node);
|
|
149
|
+
const nodes = cache.get(node.pob.post) as ModelNode[];
|
|
150
|
+
nodes.splice(nodes.indexOf(node), 1);
|
|
151
|
+
if (node.isInQueue()) this.detach(node);
|
|
152
|
+
if (nodes.length > 0 && isBacktracking && nodes[0].children.length === 0 && nodes[0].isClosed) {
|
|
153
|
+
nodes[0].setOpen();
|
|
154
|
+
this.enqueueLeaf(nodes[0]);
|
|
155
|
+
}
|
|
156
|
+
if (nodes.length === 0) cache.delete(node.pob.post);
|
|
157
|
+
}
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
// Deviation from Z3: gpdr_check_reachability closes only the node that reaches its premises
|
|
161
|
+
// (set_closed), so the root of a reachable query stays open and Z3 answers unreachable
|
|
162
|
+
// (spacer_pdr.cpp). The parents that all their children close are closed here, up to the root.
|
|
163
|
+
const closeNode = (node: ModelNode, root: ModelNode) => {
|
|
164
|
+
node.isClosed = true;
|
|
165
|
+
for (let parent = node.parent; parent?.isOneClosed(); parent = parent.parent)
|
|
166
|
+
parent.isClosed = true;
|
|
167
|
+
return root.isClosed;
|
|
168
|
+
};
|
|
169
|
+
|
|
170
|
+
const checkReachability = (context: SpacerContext, level: number, search: ModelSearch) => {
|
|
171
|
+
const manager = context.manager;
|
|
172
|
+
const query = context.query as NonNullable<SpacerContext["query"]>;
|
|
173
|
+
const rootPob = query.mkPob(undefined, level, 0, manager.trueExpr);
|
|
174
|
+
const root = new ModelNode(undefined, rootPob);
|
|
175
|
+
search.setRoot(root);
|
|
176
|
+
const newPobs: Pob[] = [];
|
|
177
|
+
for (let node = search.popFront(); node !== undefined; node = search.popFront()) {
|
|
178
|
+
newPobs.length = 0;
|
|
179
|
+
manager.limit.checkpoint();
|
|
180
|
+
if (node.pob.pt.isMustReachable(node.pob.post) !== undefined) {
|
|
181
|
+
if (closeNode(node, root)) return L_TRUE;
|
|
182
|
+
continue;
|
|
183
|
+
}
|
|
184
|
+
switch (context.expandPob(node.pob, newPobs)) {
|
|
185
|
+
case L_TRUE:
|
|
186
|
+
if (closeNode(node, root)) return L_TRUE;
|
|
187
|
+
break;
|
|
188
|
+
case L_FALSE:
|
|
189
|
+
search.backtrackLevel(node);
|
|
190
|
+
if (node === root) return L_FALSE;
|
|
191
|
+
break;
|
|
192
|
+
case L_GAVE_UP:
|
|
193
|
+
return L_UNDEF;
|
|
194
|
+
default:
|
|
195
|
+
for (const pob of newPobs) if (pob !== node.pob) search.addLeaf(new ModelNode(node, pob));
|
|
196
|
+
node.checkPreClosed();
|
|
197
|
+
}
|
|
198
|
+
}
|
|
199
|
+
return root.isClosed ? L_TRUE : L_FALSE;
|
|
200
|
+
};
|
|
201
|
+
|
|
202
|
+
export const gpdrSolveCore = (context: SpacerContext) => {
|
|
203
|
+
context.query = context.rels.get(context.queryPred);
|
|
204
|
+
if (context.query === undefined) return L_FALSE;
|
|
205
|
+
const search = new ModelSearch(context.isPdrBfs);
|
|
206
|
+
for (let level = 0; level < context.maxLevel; level++) {
|
|
207
|
+
context.manager.limit.checkpoint();
|
|
208
|
+
context.expandedLevel = INFTY_LEVEL;
|
|
209
|
+
const reachable = checkReachability(context, level, search);
|
|
210
|
+
if (reachable !== L_FALSE) return reachable;
|
|
211
|
+
if (level > 0 && context.propagate(context.expandedLevel, level)) return L_FALSE;
|
|
212
|
+
}
|
|
213
|
+
context.datalogContext.isBounded = true;
|
|
214
|
+
return L_UNDEF;
|
|
215
|
+
};
|
|
216
|
+
|
|
217
|
+
export const gpdrCreateSplitChildren = () => {
|
|
218
|
+
throw new SmtUnsupportedError("gpdr on rules with several predecessors");
|
|
219
|
+
};
|