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,455 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { L_FALSE, L_UNDEF } from "../lbool";
|
|
3
|
+
import type { DatalogContext } from "./dl-context";
|
|
4
|
+
import { MkInterpTailSimplifier } from "./dl-mk-interp-tail-simplifier";
|
|
5
|
+
import { getRuleVars, type Rule } from "./dl-rule";
|
|
6
|
+
import { RuleSet } from "./dl-rule-set";
|
|
7
|
+
import { removeDuplicateTails, type RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
8
|
+
import { HornSubsumeModelConverter } from "./horn-subsume-model-converter";
|
|
9
|
+
import { Substitution } from "./substitution";
|
|
10
|
+
|
|
11
|
+
class RuleUnifier {
|
|
12
|
+
private subst: Substitution;
|
|
13
|
+
private deltas = [0, 0];
|
|
14
|
+
private simplifier: MkInterpTailSimplifier;
|
|
15
|
+
|
|
16
|
+
constructor(private context: DatalogContext) {
|
|
17
|
+
this.subst = new Substitution(context.manager);
|
|
18
|
+
this.simplifier = new MkInterpTailSimplifier(context);
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
unifyRules(target: Rule, tailIndex: number, source: Rule) {
|
|
22
|
+
const manager = this.context.manager;
|
|
23
|
+
const varCount = Math.max(
|
|
24
|
+
getRuleVars(manager, target).length,
|
|
25
|
+
getRuleVars(manager, source).length,
|
|
26
|
+
1,
|
|
27
|
+
);
|
|
28
|
+
this.subst.reset();
|
|
29
|
+
const isReady = this.subst.unify(target.tail[tailIndex], 0, source.head, 1);
|
|
30
|
+
if (isReady) this.deltas = [0, varCount];
|
|
31
|
+
return isReady;
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
// Undefined when the interpreted tail of the resolvent simplifies to false.
|
|
35
|
+
apply(target: Rule, tailIndex: number, source: Rule): Rule | undefined {
|
|
36
|
+
const tail: number[] = [];
|
|
37
|
+
const isNegated: boolean[] = [];
|
|
38
|
+
target.tail.forEach((literal, index) => {
|
|
39
|
+
if (index === tailIndex) return;
|
|
40
|
+
tail.push(this.subst.apply(literal, 0, this.deltas));
|
|
41
|
+
isNegated.push(target.isNegated[index]);
|
|
42
|
+
});
|
|
43
|
+
source.tail.forEach((literal, index) => {
|
|
44
|
+
tail.push(this.subst.apply(literal, 1, this.deltas));
|
|
45
|
+
isNegated.push(source.isNegated[index]);
|
|
46
|
+
});
|
|
47
|
+
removeDuplicateTails(tail, isNegated);
|
|
48
|
+
const ruleManager = this.context.ruleManager;
|
|
49
|
+
const resolvent = ruleManager.fixUnboundVars(
|
|
50
|
+
ruleManager.mk(
|
|
51
|
+
this.subst.apply(target.head, 0, this.deltas),
|
|
52
|
+
tail,
|
|
53
|
+
isNegated,
|
|
54
|
+
`${target.getNameText()};${source.getNameText()}`,
|
|
55
|
+
),
|
|
56
|
+
true,
|
|
57
|
+
);
|
|
58
|
+
return this.simplifier.transformRule(resolvent);
|
|
59
|
+
}
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
// The rules at a position of a head or tail, and which of them can still be expanded or removed.
|
|
63
|
+
class Visitor {
|
|
64
|
+
readonly positions = new Map<number, number[]>();
|
|
65
|
+
canRemove: boolean[] = [];
|
|
66
|
+
canExpand: boolean[] = [];
|
|
67
|
+
|
|
68
|
+
reset(size: number) {
|
|
69
|
+
this.canRemove = Array.from({ length: size }, () => true);
|
|
70
|
+
this.canExpand = Array.from({ length: size }, () => true);
|
|
71
|
+
this.positions.clear();
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
addPosition(expr: number, position: number) {
|
|
75
|
+
const positions = this.positions.get(expr) ?? [];
|
|
76
|
+
positions.push(position);
|
|
77
|
+
this.positions.set(expr, positions);
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
delPosition(expr: number, position: number) {
|
|
81
|
+
const positions = this.positions.get(expr) as number[];
|
|
82
|
+
const index = positions.indexOf(position);
|
|
83
|
+
if (index !== -1) positions.splice(index, 1);
|
|
84
|
+
}
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
export class MkRuleInliner implements RuleTransformerPlugin {
|
|
88
|
+
private unifier: RuleUnifier;
|
|
89
|
+
private headPredCounts = new Map<number, number>();
|
|
90
|
+
private headPredNonEmptyTailCounts = new Map<number, number>();
|
|
91
|
+
private tailPredCounts = new Map<number, number>();
|
|
92
|
+
private predsWithNegOccurrence = new Set<number>();
|
|
93
|
+
private forbiddenPreds = new Set<number>();
|
|
94
|
+
private inlinedRules: RuleSet;
|
|
95
|
+
private headVisitor = new Visitor();
|
|
96
|
+
private tailVisitor = new Visitor();
|
|
97
|
+
// Z3 throws has_new_quantifier when it would inline a rule that has a quantifier.
|
|
98
|
+
private hasNewQuantifier = false;
|
|
99
|
+
private modelConverter: HornSubsumeModelConverter | undefined;
|
|
100
|
+
|
|
101
|
+
constructor(
|
|
102
|
+
private context: DatalogContext,
|
|
103
|
+
readonly priority: number,
|
|
104
|
+
) {
|
|
105
|
+
this.unifier = new RuleUnifier(context);
|
|
106
|
+
this.inlinedRules = new RuleSet(context);
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
private tryToInlineRule(target: Rule, source: Rule, tailIndex: number): Rule | undefined {
|
|
110
|
+
this.context.ruleManager.normVars(target);
|
|
111
|
+
if (this.context.ruleManager.hasQuantifiers(source)) {
|
|
112
|
+
this.hasNewQuantifier = true;
|
|
113
|
+
return undefined;
|
|
114
|
+
}
|
|
115
|
+
if (!this.unifier.unifyRules(target, tailIndex, source)) return undefined;
|
|
116
|
+
return this.unifier.apply(target, tailIndex, source);
|
|
117
|
+
}
|
|
118
|
+
|
|
119
|
+
private countPredOccurrences(source: RuleSet) {
|
|
120
|
+
const manager = this.context.manager;
|
|
121
|
+
const increment = (counts: Map<number, number>, predicate: number) =>
|
|
122
|
+
counts.set(predicate, (counts.get(predicate) ?? 0) + 1);
|
|
123
|
+
for (const rule of source.rules) {
|
|
124
|
+
const head = rule.getDecl(manager);
|
|
125
|
+
increment(this.headPredCounts, head);
|
|
126
|
+
if (rule.tail.length > 0) increment(this.headPredNonEmptyTailCounts, head);
|
|
127
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
128
|
+
const predicate = rule.getTailDecl(manager, index);
|
|
129
|
+
increment(this.tailPredCounts, predicate);
|
|
130
|
+
if (rule.isNegated[index]) this.predsWithNegOccurrence.add(predicate);
|
|
131
|
+
}
|
|
132
|
+
}
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
private isInliningAllowed(source: RuleSet, predicate: number) {
|
|
136
|
+
if (
|
|
137
|
+
source.isOutputPredicate(predicate) ||
|
|
138
|
+
this.predsWithNegOccurrence.has(predicate) ||
|
|
139
|
+
this.forbiddenPreds.has(predicate)
|
|
140
|
+
)
|
|
141
|
+
return false;
|
|
142
|
+
const headCount = this.headPredCounts.get(predicate) ?? 0;
|
|
143
|
+
return headCount <= 1 || ((this.tailPredCounts.get(predicate) ?? 0) <= 1 && headCount <= 4);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
private createAllowedRuleSet(source: RuleSet) {
|
|
147
|
+
const manager = this.context.manager;
|
|
148
|
+
const result = new RuleSet(this.context);
|
|
149
|
+
for (const rule of source.rules)
|
|
150
|
+
if (this.isInliningAllowed(source, rule.getDecl(manager))) result.addRule(rule);
|
|
151
|
+
result.close();
|
|
152
|
+
return result;
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
private forbidPredsFromCycles(rules: RuleSet) {
|
|
156
|
+
let isForbidden = false;
|
|
157
|
+
for (const stratum of rules.getStrats()) {
|
|
158
|
+
if (stratum.size === 1) continue;
|
|
159
|
+
this.forbiddenPreds.add(stratum.values().next().value as number);
|
|
160
|
+
isForbidden = true;
|
|
161
|
+
}
|
|
162
|
+
return isForbidden;
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
private forbidMultipleMultipliers(source: RuleSet, proposed: RuleSet) {
|
|
166
|
+
const manager = this.context.manager;
|
|
167
|
+
let isForbidden = false;
|
|
168
|
+
for (const stratum of proposed.getStrats()) {
|
|
169
|
+
const head = stratum.values().next().value as number;
|
|
170
|
+
let isMultiHead = (this.headPredCounts.get(head) ?? 0) > 1;
|
|
171
|
+
const isMultiOccurrence = (this.tailPredCounts.get(head) ?? 0) > 1;
|
|
172
|
+
nextPredicate: for (const rule of proposed.getPredicateRules(head))
|
|
173
|
+
for (let index = 0; index < rule.positiveSize; index++) {
|
|
174
|
+
const tailPredicate = rule.getTailDecl(manager, index);
|
|
175
|
+
if (!this.isInliningAllowed(source, tailPredicate)) continue;
|
|
176
|
+
const tailHeadCount = this.headPredCounts.get(tailPredicate) ?? 0;
|
|
177
|
+
if (tailHeadCount <= 1) continue;
|
|
178
|
+
if (isMultiHead) {
|
|
179
|
+
this.forbiddenPreds.add(head);
|
|
180
|
+
isForbidden = true;
|
|
181
|
+
break nextPredicate;
|
|
182
|
+
}
|
|
183
|
+
if (isMultiOccurrence) {
|
|
184
|
+
this.forbiddenPreds.add(tailPredicate);
|
|
185
|
+
isForbidden = true;
|
|
186
|
+
} else {
|
|
187
|
+
isMultiHead = true;
|
|
188
|
+
this.headPredCounts.set(head, (this.headPredCounts.get(head) ?? 0) * tailHeadCount);
|
|
189
|
+
}
|
|
190
|
+
}
|
|
191
|
+
}
|
|
192
|
+
for (const rule of source.rules) {
|
|
193
|
+
if (this.isInliningAllowed(source, rule.getDecl(manager))) continue;
|
|
194
|
+
let hasMultiHead = false;
|
|
195
|
+
for (let index = 0; index < rule.positiveSize; index++) {
|
|
196
|
+
const predicate = rule.getTailDecl(manager, index);
|
|
197
|
+
if (!this.isInliningAllowed(source, predicate)) continue;
|
|
198
|
+
if ((this.headPredCounts.get(predicate) ?? 0) <= 1) continue;
|
|
199
|
+
if (hasMultiHead) {
|
|
200
|
+
this.forbiddenPreds.add(predicate);
|
|
201
|
+
isForbidden = true;
|
|
202
|
+
} else hasMultiHead = true;
|
|
203
|
+
}
|
|
204
|
+
}
|
|
205
|
+
return isForbidden;
|
|
206
|
+
}
|
|
207
|
+
|
|
208
|
+
private planInlining(source: RuleSet) {
|
|
209
|
+
this.countPredOccurrences(source);
|
|
210
|
+
let candidates = this.createAllowedRuleSet(source);
|
|
211
|
+
while (this.forbidPredsFromCycles(candidates)) candidates = this.createAllowedRuleSet(source);
|
|
212
|
+
if (this.forbidMultipleMultipliers(source, candidates))
|
|
213
|
+
candidates = this.createAllowedRuleSet(source);
|
|
214
|
+
for (const stratum of candidates.getStrats())
|
|
215
|
+
for (const rule of candidates.getPredicateRules(stratum.values().next().value as number)) {
|
|
216
|
+
this.transformRule(source, rule, this.inlinedRules);
|
|
217
|
+
// Z3 does not catch the has_new_quantifier that plan_inlining throws, and aborts.
|
|
218
|
+
if (this.hasNewQuantifier)
|
|
219
|
+
throw new SmtUnsupportedError("inlining a rule with a quantifier");
|
|
220
|
+
}
|
|
221
|
+
for (const rule of this.inlinedRules.rules) this.modelConverter?.delRule(rule, L_UNDEF);
|
|
222
|
+
}
|
|
223
|
+
|
|
224
|
+
// Deviation from Z3: transform_rule keeps a rule that has a quantifier without inlining the rest
|
|
225
|
+
// of its tail, although the rules of those predicates are dropped, so Z3 answers unreachable for
|
|
226
|
+
// a reachable query (dl_mk_rule_inliner.cpp). The rest of the tail is inlined here.
|
|
227
|
+
private transformRule(source: RuleSet, original: Rule, target: RuleSet) {
|
|
228
|
+
const manager = this.context.manager;
|
|
229
|
+
let isModified = false;
|
|
230
|
+
const todo = [original];
|
|
231
|
+
for (let rule = todo.pop(); rule !== undefined; rule = todo.pop()) {
|
|
232
|
+
let index = 0;
|
|
233
|
+
while (
|
|
234
|
+
index < rule.positiveSize &&
|
|
235
|
+
!this.isInliningAllowed(source, rule.getTailDecl(manager, index))
|
|
236
|
+
)
|
|
237
|
+
index++;
|
|
238
|
+
if (index === rule.positiveSize) {
|
|
239
|
+
target.addRule(rule);
|
|
240
|
+
continue;
|
|
241
|
+
}
|
|
242
|
+
isModified = true;
|
|
243
|
+
for (const inlined of this.inlinedRules.getPredicateRules(rule.getTailDecl(manager, index))) {
|
|
244
|
+
const result = this.tryToInlineRule(rule, inlined, index);
|
|
245
|
+
if (this.hasNewQuantifier) return isModified;
|
|
246
|
+
if (result !== undefined) todo.push(result);
|
|
247
|
+
}
|
|
248
|
+
}
|
|
249
|
+
if (isModified) this.modelConverter?.delRule(original, L_UNDEF);
|
|
250
|
+
return isModified;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
private transformRules(source: RuleSet, target: RuleSet) {
|
|
254
|
+
const manager = this.context.manager;
|
|
255
|
+
let isDone = false;
|
|
256
|
+
for (const rule of source.rules) {
|
|
257
|
+
if (
|
|
258
|
+
!this.isInliningAllowed(source, rule.getDecl(manager)) &&
|
|
259
|
+
this.transformRule(source, rule, target)
|
|
260
|
+
)
|
|
261
|
+
isDone = true;
|
|
262
|
+
if (this.hasNewQuantifier) break;
|
|
263
|
+
}
|
|
264
|
+
if (isDone)
|
|
265
|
+
for (const rule of source.rules)
|
|
266
|
+
if (this.isInliningAllowed(source, rule.getDecl(manager)))
|
|
267
|
+
this.modelConverter?.delRule(rule, L_UNDEF);
|
|
268
|
+
return isDone;
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
private isOrientedRewriter(rule: Rule, rules: RuleSet) {
|
|
272
|
+
const manager = this.context.manager;
|
|
273
|
+
const head = rule.getDecl(manager);
|
|
274
|
+
const headStrat = rules.getPredicateStrat(head);
|
|
275
|
+
const headArity = manager.funcDecls[head].domain.length;
|
|
276
|
+
for (let index = 0; index < rule.positiveSize; index++) {
|
|
277
|
+
const predicate = rule.getTailDecl(manager, index);
|
|
278
|
+
if (rules.getPredicateStrat(predicate) !== headStrat) continue;
|
|
279
|
+
const arity = manager.funcDecls[predicate].domain.length;
|
|
280
|
+
if (
|
|
281
|
+
arity > headArity ||
|
|
282
|
+
(arity === headArity &&
|
|
283
|
+
manager.funcDecls[predicate].smallId >= manager.funcDecls[head].smallId)
|
|
284
|
+
)
|
|
285
|
+
return false;
|
|
286
|
+
}
|
|
287
|
+
return true;
|
|
288
|
+
}
|
|
289
|
+
|
|
290
|
+
// Returns undefined when nothing applies, or the replacement, where null deletes the rule.
|
|
291
|
+
private doEagerInliningRule(rule: Rule, rules: RuleSet): Rule | null | undefined {
|
|
292
|
+
const manager = this.context.manager;
|
|
293
|
+
if (rule.hasNegation()) return undefined;
|
|
294
|
+
const head = rule.getDecl(manager);
|
|
295
|
+
for (let index = 0; index < rule.positiveSize; index++) {
|
|
296
|
+
const predicate = rule.getTailDecl(manager, index);
|
|
297
|
+
if (predicate === head) continue;
|
|
298
|
+
const predicateRules = rules.getPredicateRules(predicate);
|
|
299
|
+
let candidate: Rule | undefined;
|
|
300
|
+
let isAmbiguous = false;
|
|
301
|
+
if (predicateRules.length === 1) candidate = predicateRules[0];
|
|
302
|
+
else if (predicateRules.length > 1)
|
|
303
|
+
for (const predicateRule of predicateRules) {
|
|
304
|
+
if (!this.unifier.unifyRules(rule, index, predicateRule)) continue;
|
|
305
|
+
if (candidate !== undefined) {
|
|
306
|
+
isAmbiguous = true;
|
|
307
|
+
break;
|
|
308
|
+
}
|
|
309
|
+
candidate = predicateRule;
|
|
310
|
+
}
|
|
311
|
+
if (isAmbiguous) continue;
|
|
312
|
+
if (candidate === undefined) {
|
|
313
|
+
this.modelConverter?.delRule(rule, L_FALSE);
|
|
314
|
+
return null;
|
|
315
|
+
}
|
|
316
|
+
if (!this.isOrientedRewriter(candidate, rules)) continue;
|
|
317
|
+
const inlined = this.tryToInlineRule(rule, candidate, index);
|
|
318
|
+
if (inlined !== undefined) return inlined;
|
|
319
|
+
this.modelConverter?.delRule(rule, L_FALSE);
|
|
320
|
+
return null;
|
|
321
|
+
}
|
|
322
|
+
return undefined;
|
|
323
|
+
}
|
|
324
|
+
|
|
325
|
+
private doEagerInlining(rules: RuleSet) {
|
|
326
|
+
const result = new RuleSet(this.context);
|
|
327
|
+
let isDone = false;
|
|
328
|
+
for (const original of rules.rules) {
|
|
329
|
+
let rule: Rule | null = original;
|
|
330
|
+
for (;;) {
|
|
331
|
+
const replacement: Rule | null | undefined = this.doEagerInliningRule(rule, rules);
|
|
332
|
+
if (replacement === undefined) break;
|
|
333
|
+
isDone = true;
|
|
334
|
+
rule = replacement;
|
|
335
|
+
if (rule === null) break;
|
|
336
|
+
}
|
|
337
|
+
if (rule !== null) result.addRule(rule);
|
|
338
|
+
}
|
|
339
|
+
return isDone ? result : undefined;
|
|
340
|
+
}
|
|
341
|
+
|
|
342
|
+
private addRule(source: RuleSet, rule: Rule, position: number) {
|
|
343
|
+
const manager = this.context.manager;
|
|
344
|
+
this.headVisitor.addPosition(rule.head, position);
|
|
345
|
+
if (source.isOutputPredicate(rule.getDecl(manager)))
|
|
346
|
+
this.headVisitor.canRemove[position] = false;
|
|
347
|
+
for (let index = 0; index < rule.uninterpretedSize; index++)
|
|
348
|
+
this.tailVisitor.addPosition(rule.tail[index], position);
|
|
349
|
+
this.headVisitor.canExpand[position] =
|
|
350
|
+
rule.uninterpretedSize === 1 &&
|
|
351
|
+
rule.positiveSize === 1 &&
|
|
352
|
+
!source.isOutputPredicate(rule.getTailDecl(manager, 0));
|
|
353
|
+
}
|
|
354
|
+
|
|
355
|
+
private delRule(rule: Rule, position: number) {
|
|
356
|
+
this.headVisitor.delPosition(rule.head, position);
|
|
357
|
+
for (let index = 0; index < rule.uninterpretedSize; index++)
|
|
358
|
+
this.tailVisitor.delPosition(rule.tail[index], position);
|
|
359
|
+
}
|
|
360
|
+
|
|
361
|
+
// substitution_tree::unify with a visitor that stops after the second unifier.
|
|
362
|
+
private getUnifiers(visitor: Visitor, expr: number) {
|
|
363
|
+
const unifiers: number[] = [];
|
|
364
|
+
const subst = new Substitution(this.context.manager);
|
|
365
|
+
for (const [indexed, positions] of visitor.positions) {
|
|
366
|
+
subst.reset();
|
|
367
|
+
if (!subst.unify(expr, 0, indexed, 1)) continue;
|
|
368
|
+
unifiers.push(...positions);
|
|
369
|
+
if (unifiers.length > 1) break;
|
|
370
|
+
}
|
|
371
|
+
return unifiers;
|
|
372
|
+
}
|
|
373
|
+
|
|
374
|
+
private inlineLinear(rules: RuleSet) {
|
|
375
|
+
let isDone = false;
|
|
376
|
+
const size = rules.rules.length;
|
|
377
|
+
this.headVisitor.reset(size);
|
|
378
|
+
this.tailVisitor.reset(size);
|
|
379
|
+
const accumulated = [...rules.rules];
|
|
380
|
+
for (let index = 0; index < size; index++) this.addRule(rules, accumulated[index], index);
|
|
381
|
+
const isValid = Array.from({ length: size }, () => true);
|
|
382
|
+
const isBranching = this.context.params.getBool("xform.inline_linear_branch", false);
|
|
383
|
+
const canRemove = this.headVisitor.canRemove;
|
|
384
|
+
const canExpand = this.headVisitor.canExpand;
|
|
385
|
+
for (let index = 0; index < size; index++)
|
|
386
|
+
for (;;) {
|
|
387
|
+
const rule = accumulated[index];
|
|
388
|
+
if (!isValid[index] || !canExpand[index]) break;
|
|
389
|
+
const headUnifiers = this.getUnifiers(this.headVisitor, rule.tail[0]);
|
|
390
|
+
if (headUnifiers.length !== 1) break;
|
|
391
|
+
const other = headUnifiers[0];
|
|
392
|
+
if (!canRemove[other] || !isValid[other] || index === other) break;
|
|
393
|
+
const otherRule = accumulated[other];
|
|
394
|
+
const tailUnifiers = this.getUnifiers(this.tailVisitor, otherRule.head);
|
|
395
|
+
if (!isBranching && tailUnifiers.length !== 1) break;
|
|
396
|
+
const result = this.tryToInlineRule(rule, otherRule, 0);
|
|
397
|
+
if (result === undefined) break;
|
|
398
|
+
isDone = true;
|
|
399
|
+
this.delRule(rule, index);
|
|
400
|
+
this.addRule(rules, result, index);
|
|
401
|
+
accumulated[index] = result;
|
|
402
|
+
canExpand[index] = canExpand[other];
|
|
403
|
+
if (tailUnifiers.length === 1) {
|
|
404
|
+
isValid[other] = false;
|
|
405
|
+
this.modelConverter?.delRule(otherRule, L_UNDEF);
|
|
406
|
+
this.delRule(otherRule, other);
|
|
407
|
+
}
|
|
408
|
+
}
|
|
409
|
+
if (!isDone) return undefined;
|
|
410
|
+
const result = new RuleSet(this.context);
|
|
411
|
+
for (let index = 0; index < size; index++)
|
|
412
|
+
if (isValid[index]) result.addRule(accumulated[index]);
|
|
413
|
+
result.inheritPredicates(rules);
|
|
414
|
+
return result;
|
|
415
|
+
}
|
|
416
|
+
|
|
417
|
+
apply(source: RuleSet) {
|
|
418
|
+
if (source.rules.length === 0) return undefined;
|
|
419
|
+
if (source.rules.some((rule) => this.context.ruleManager.hasQuantifiers(rule)))
|
|
420
|
+
return undefined;
|
|
421
|
+
this.hasNewQuantifier = false;
|
|
422
|
+
this.modelConverter =
|
|
423
|
+
this.context.modelConverters === undefined
|
|
424
|
+
? undefined
|
|
425
|
+
: new HornSubsumeModelConverter(this.context);
|
|
426
|
+
const converter = this.modelConverter;
|
|
427
|
+
let isDone = false;
|
|
428
|
+
let result = new RuleSet(this.context);
|
|
429
|
+
if (this.context.params.getBool("xform.inline_eager", true)) {
|
|
430
|
+
this.planInlining(source);
|
|
431
|
+
isDone = this.transformRules(source, result);
|
|
432
|
+
if (this.hasNewQuantifier) return undefined;
|
|
433
|
+
result.close();
|
|
434
|
+
const eager = this.doEagerInlining(result);
|
|
435
|
+
if (eager !== undefined) {
|
|
436
|
+
result = eager;
|
|
437
|
+
isDone = true;
|
|
438
|
+
}
|
|
439
|
+
}
|
|
440
|
+
if (isDone) result.inheritPredicates(source);
|
|
441
|
+
else result = RuleSet.copy(source);
|
|
442
|
+
if (this.context.params.getBool("xform.inline_linear", true)) {
|
|
443
|
+
const linear = this.inlineLinear(result);
|
|
444
|
+
if (linear !== undefined) {
|
|
445
|
+
result = linear;
|
|
446
|
+
isDone = true;
|
|
447
|
+
}
|
|
448
|
+
}
|
|
449
|
+
if (this.hasNewQuantifier) throw new SmtUnsupportedError("inlining a rule with a quantifier");
|
|
450
|
+
if (!isDone) return undefined;
|
|
451
|
+
if (converter !== undefined)
|
|
452
|
+
this.context.modelConverters?.push((model) => converter.apply(model));
|
|
453
|
+
return result;
|
|
454
|
+
}
|
|
455
|
+
}
|