tla-ts 0.0.9 → 0.0.10-dev.094b9b512
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +40 -37
- package/dist/deciders.js +47 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- 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 +2658 -410
- package/dist/prove.js +2657 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +48 -62
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +599 -754
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +208 -54
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +309 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +14 -53
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +169 -335
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +103 -153
- package/src/liveness.ts +150 -109
- package/src/obligations/action.ts +18 -43
- package/src/obligations/anonymize.ts +119 -90
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +2 -2
- package/src/obligations/expression.ts +38 -25
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +67 -63
- package/src/obligations/index.ts +38 -20
- package/src/obligations/levels.ts +28 -17
- package/src/obligations/module.ts +29 -54
- package/src/obligations/normalize.ts +31 -36
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +53 -25
- package/src/obligations/printer.ts +90 -57
- package/src/obligations/proof.ts +4 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +58 -62
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +51 -27
- package/src/obligations/substitution.ts +2 -4
- package/src/obligations/temporal.ts +13 -19
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +57 -71
- package/src/parser.ts +961 -387
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +19 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -62
- package/src/prover/isabelle/isar/attrib.ts +219 -0
- package/src/prover/isabelle/isar/context.ts +336 -0
- package/src/prover/isabelle/isar/induct.ts +392 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +513 -225
- package/src/prover/isabelle/isar/proof.ts +569 -23
- package/src/prover/isabelle/isar/rule-cases.ts +234 -0
- package/src/prover/isabelle/isar/theory.ts +490 -89
- package/src/prover/isabelle/isar/toplevel.ts +341 -0
- package/src/prover/isabelle/isar/type-check.ts +100 -37
- package/src/prover/isabelle/provers/blast/blast.ts +17 -104
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +59 -60
- package/src/prover/isabelle/provers/hypsubst.ts +28 -51
- package/src/prover/isabelle/pure/bicompose.ts +25 -38
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +3 -17
- package/src/prover/isabelle/pure/drule.ts +96 -44
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +2 -8
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +2 -15
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +16 -15
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
- package/src/prover/isabelle/pure/rewriter.ts +32 -73
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +28 -15
- package/src/prover/isabelle/pure/table.ts +3 -32
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +48 -47
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +27 -47
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +18 -24
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +46 -43
- package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +32 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +137 -83
- package/src/prover/prep/normalize.ts +38 -36
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +371 -132
- package/src/prover/ptl/decide.ts +104 -44
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +61 -29
- package/src/prover/smt/data.ts +497 -387
- package/src/prover/smt/encode.ts +156 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1025 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
- package/src/prover/smt/solver/ackr-helper.ts +182 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
- package/src/prover/smt/solver/aig-tactic.ts +43 -0
- package/src/prover/smt/solver/aig.ts +890 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -48
- package/src/prover/smt/solver/arith-terms.ts +123 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
- package/src/prover/smt/solver/array-rewriter.ts +312 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -57
- package/src/prover/smt/solver/ast-lt.ts +166 -21
- package/src/prover/smt/solver/ast-util.ts +161 -7
- package/src/prover/smt/solver/ast.ts +1466 -178
- package/src/prover/smt/solver/auf-solver.ts +8 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
- package/src/prover/smt/solver/bit-blaster.ts +874 -0
- package/src/prover/smt/solver/bound-manager.ts +186 -0
- package/src/prover/smt/solver/bound-simplifier.ts +602 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
- package/src/prover/smt/solver/bv1-blast.ts +224 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
- package/src/prover/smt/solver/card2bv.ts +112 -0
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +28 -34
- package/src/prover/smt/solver/check-logic.ts +326 -0
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
- package/src/prover/smt/solver/conflict-resolution.ts +79 -12
- package/src/prover/smt/solver/context.ts +510 -175
- package/src/prover/smt/solver/ctx-simplify.ts +34 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
- package/src/prover/smt/solver/demodulator.ts +789 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
- package/src/prover/smt/solver/der.ts +40 -30
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +67 -0
- package/src/prover/smt/solver/dom-simplify.ts +513 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +4 -35
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
- package/src/prover/smt/solver/enode.ts +93 -22
- package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
- package/src/prover/smt/solver/euf/array-solver.ts +308 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
- package/src/prover/smt/solver/euf/egraph.ts +885 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
- package/src/prover/smt/solver/euf/mam.ts +1094 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +343 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
- package/src/prover/smt/solver/expr2polynomial.ts +147 -0
- package/src/prover/smt/solver/factor.ts +152 -0
- package/src/prover/smt/solver/fd-solver.ts +269 -0
- package/src/prover/smt/solver/fingerprints.ts +16 -26
- package/src/prover/smt/solver/fix-dl-var.ts +149 -0
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/fm-tactic.ts +873 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
- package/src/prover/smt/solver/goal.ts +177 -28
- package/src/prover/smt/solver/goal2nlsat.ts +191 -0
- package/src/prover/smt/solver/guard-set.ts +220 -0
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +27 -23
- package/src/prover/smt/solver/inf-eps.ts +64 -0
- package/src/prover/smt/solver/inj-axiom.ts +102 -0
- package/src/prover/smt/solver/internalizer.ts +72 -130
- package/src/prover/smt/solver/lackr.ts +383 -0
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/lia2card.ts +269 -0
- package/src/prover/smt/solver/lia2pb.ts +141 -0
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/logic-tactics.ts +349 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +24 -27
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +18 -39
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +69 -132
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +6 -5
- package/src/prover/smt/solver/macro-finder.ts +533 -0
- package/src/prover/smt/solver/mam-compiler.ts +117 -126
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
- package/src/prover/smt/solver/max-cliques.ts +107 -0
- package/src/prover/smt/solver/maxcore.ts +318 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
- package/src/prover/smt/solver/maxlex.ts +123 -0
- package/src/prover/smt/solver/maxsmt-base.ts +99 -0
- package/src/prover/smt/solver/maxsmt.ts +93 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
- package/src/prover/smt/solver/model-based-opt.ts +845 -0
- package/src/prover/smt/solver/model-checker.ts +20 -62
- package/src/prover/smt/solver/model-evaluator.ts +186 -39
- package/src/prover/smt/solver/model-finder.ts +15 -32
- package/src/prover/smt/solver/model-generator.ts +57 -40
- package/src/prover/smt/solver/model-macro-solver.ts +58 -111
- package/src/prover/smt/solver/model-printer.ts +215 -0
- package/src/prover/smt/solver/mpf.ts +712 -0
- package/src/prover/smt/solver/mus.ts +52 -0
- package/src/prover/smt/solver/muz/dl-context.ts +362 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
- package/src/prover/smt/solver/muz/substitution.ts +154 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
- package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +61 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
- package/src/prover/smt/solver/nlsat/solver.ts +227 -99
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
- package/src/prover/smt/solver/nnf.ts +108 -60
- package/src/prover/smt/solver/normalize-bounds.ts +54 -0
- package/src/prover/smt/solver/occf.ts +98 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +366 -0
- package/src/prover/smt/solver/opt-pareto.ts +284 -0
- package/src/prover/smt/solver/opt-preprocess.ts +102 -0
- package/src/prover/smt/solver/opt-solver.ts +300 -0
- package/src/prover/smt/solver/opt-value.ts +56 -0
- package/src/prover/smt/solver/optsmt.ts +691 -0
- package/src/prover/smt/solver/parallel-tactic.ts +301 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -23
- package/src/prover/smt/solver/pb-rewriter.ts +296 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
- package/src/prover/smt/solver/poly-rewriter.ts +203 -77
- package/src/prover/smt/solver/probes.ts +514 -0
- package/src/prover/smt/solver/propagate-values.ts +34 -30
- package/src/prover/smt/solver/proto-model.ts +648 -63
- package/src/prover/smt/solver/pull-quant.ts +29 -23
- package/src/prover/smt/solver/purify-arith.ts +598 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
- package/src/prover/smt/solver/qe-lite-der.ts +3 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
- package/src/prover/smt/solver/qe-lite.ts +40 -49
- package/src/prover/smt/solver/qe-mbp.ts +281 -0
- package/src/prover/smt/solver/qe.ts +1508 -0
- package/src/prover/smt/solver/qel.ts +26 -0
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/qsat.ts +840 -0
- package/src/prover/smt/solver/quant-hoist.ts +195 -0
- package/src/prover/smt/solver/quant-tactics.ts +18 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
- package/src/prover/smt/solver/quantifier-manager.ts +9 -23
- package/src/prover/smt/solver/quasi-macros.ts +254 -0
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +29 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
- package/src/prover/smt/solver/reduce-args.ts +226 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +3 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
- package/src/prover/smt/solver/rewriter.ts +478 -120
- package/src/prover/smt/solver/rlimit.ts +27 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
- package/src/prover/smt/solver/sat/big.ts +178 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
- package/src/prover/smt/solver/sat/clause.ts +221 -0
- package/src/prover/smt/solver/sat/cleaner.ts +96 -0
- package/src/prover/smt/solver/sat/config.ts +125 -0
- package/src/prover/smt/solver/sat/consequences.ts +204 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
- package/src/prover/smt/solver/sat/model-converter.ts +156 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
- package/src/prover/smt/solver/sat/probing.ts +169 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
- package/src/prover/smt/solver/sat/scc.ts +143 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
- package/src/prover/smt/solver/sat/solver.ts +2128 -0
- package/src/prover/smt/solver/sat/var-queue.ts +119 -0
- package/src/prover/smt/solver/sat/watch-list.ts +136 -0
- package/src/prover/smt/solver/search-tree.ts +285 -0
- package/src/prover/smt/solver/seq-axioms.ts +1013 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
- package/src/prover/smt/solver/seq-derive.ts +1303 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
- package/src/prover/smt/solver/seq-factory.ts +91 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
- package/src/prover/smt/solver/seq-re-util.ts +777 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
- package/src/prover/smt/solver/seq-regex-live.ts +202 -0
- package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
- package/src/prover/smt/solver/seq-skolem.ts +318 -0
- package/src/prover/smt/solver/seq-subset.ts +166 -0
- package/src/prover/smt/solver/seq-view-witness.ts +355 -0
- package/src/prover/smt/solver/smt-consequences.ts +299 -0
- package/src/prover/smt/solver/smt-kernel.ts +85 -0
- package/src/prover/smt/solver/smt-logics.ts +67 -0
- package/src/prover/smt/solver/smt-setup.ts +492 -0
- package/src/prover/smt/solver/smt2-printer.ts +767 -0
- package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
- package/src/prover/smt/solver/smtlib-script.ts +1493 -0
- package/src/prover/smt/solver/solve-eqs.ts +931 -0
- package/src/prover/smt/solver/solver.ts +120 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +319 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/tactic.ts +1936 -0
- package/src/prover/smt/solver/term-enumeration.ts +206 -0
- package/src/prover/smt/solver/theory-array.ts +1275 -0
- package/src/prover/smt/solver/theory-bv.ts +1239 -0
- package/src/prover/smt/solver/theory-char.ts +356 -0
- package/src/prover/smt/solver/theory-datatype.ts +599 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +422 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
- package/src/prover/smt/solver/theory-lra-model.ts +24 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
- package/src/prover/smt/solver/theory-lra-state.ts +7 -27
- package/src/prover/smt/solver/theory-lra.ts +194 -8
- package/src/prover/smt/solver/theory-pb.ts +932 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
- package/src/prover/smt/solver/theory-recfun.ts +308 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
- package/src/prover/smt/solver/theory-seq-state.ts +880 -0
- package/src/prover/smt/solver/theory-seq.ts +984 -0
- package/src/prover/smt/solver/theory.ts +175 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
- package/src/prover/smt/solver/var-subst.ts +33 -35
- package/src/prover/smt/table.ts +1 -9
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -15
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +2 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +8 -26
- package/src/prover/zenon/index-table.ts +26 -57
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +36 -64
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -20
- package/src/prover/zenon/mltoll.ts +66 -104
- package/src/prover/zenon/node.ts +20 -14
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +10 -12
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +11 -33
- package/src/prover/zenon/tla/functions.ts +59 -31
- package/src/prover/zenon/tla/llproof.ts +67 -76
- package/src/prover/zenon/tla/records.ts +57 -33
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +88 -57
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +66 -64
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -184
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +541 -163
- package/src/simulate.ts +709 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -31
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +266 -99
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/tlaps-module.ts +0 -510
|
@@ -0,0 +1,158 @@
|
|
|
1
|
+
// Ported from Z3 (src/muz/transforms/dl_mk_subsumption_checker.cpp,
|
|
2
|
+
// src/muz/base/dl_rule_subsumption_index.cpp), MIT license, see z3-license.txt.
|
|
3
|
+
import { KIND_VAR } from "../ast";
|
|
4
|
+
import type { DatalogContext } from "./dl-context";
|
|
5
|
+
import type { Rule } from "./dl-rule";
|
|
6
|
+
import { RuleSet } from "./dl-rule-set";
|
|
7
|
+
import type { RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
8
|
+
|
|
9
|
+
const getRuleKey = (rule: Rule) =>
|
|
10
|
+
`${rule.head}|${rule.tail.join(",")}|${rule.isNegated.map(Number).join("")}`;
|
|
11
|
+
|
|
12
|
+
class RuleSubsumptionIndex {
|
|
13
|
+
private unconditionedHeads = new Set<number>();
|
|
14
|
+
private ruleKeys = new Set<string>();
|
|
15
|
+
|
|
16
|
+
add(rule: Rule) {
|
|
17
|
+
if (rule.tail.length === 0) this.unconditionedHeads.add(rule.head);
|
|
18
|
+
this.ruleKeys.add(getRuleKey(rule));
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
isSubsumedAtom(query: number) {
|
|
22
|
+
return this.unconditionedHeads.has(query);
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
isSubsumed(rule: Rule) {
|
|
26
|
+
return this.isSubsumedAtom(rule.head) || this.ruleKeys.has(getRuleKey(rule));
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
export class MkSubsumptionChecker implements RuleTransformerPlugin {
|
|
31
|
+
private totalRelations = new Set<number>();
|
|
32
|
+
private definingRules = new Map<number, Rule>();
|
|
33
|
+
private hasNewTotalRule = false;
|
|
34
|
+
|
|
35
|
+
constructor(
|
|
36
|
+
private context: DatalogContext,
|
|
37
|
+
readonly priority: number,
|
|
38
|
+
) {}
|
|
39
|
+
|
|
40
|
+
private isTotalRule(rule: Rule) {
|
|
41
|
+
const manager = this.context.manager;
|
|
42
|
+
if (rule.tail.length !== 0) return false;
|
|
43
|
+
const headVars = new Set<number>();
|
|
44
|
+
for (const arg of manager.getArgs(rule.head)) {
|
|
45
|
+
if (manager.kinds[arg] !== KIND_VAR) return false;
|
|
46
|
+
if (headVars.has(manager.values[arg])) return false;
|
|
47
|
+
headVars.add(manager.values[arg]);
|
|
48
|
+
}
|
|
49
|
+
return true;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
private onDiscoveredTotalRelation(predicate: number, rule: Rule) {
|
|
53
|
+
this.totalRelations.add(predicate);
|
|
54
|
+
this.definingRules.set(predicate, rule);
|
|
55
|
+
this.hasNewTotalRule = true;
|
|
56
|
+
}
|
|
57
|
+
|
|
58
|
+
private scanForTotalRules(rules: RuleSet) {
|
|
59
|
+
const manager = this.context.manager;
|
|
60
|
+
let isDiscovered = true;
|
|
61
|
+
while (isDiscovered) {
|
|
62
|
+
isDiscovered = false;
|
|
63
|
+
for (const rule of rules.rules) {
|
|
64
|
+
const head = rule.getDecl(manager);
|
|
65
|
+
if (!this.isTotalRule(rule) || this.totalRelations.has(head)) continue;
|
|
66
|
+
this.onDiscoveredTotalRelation(head, rule);
|
|
67
|
+
isDiscovered = true;
|
|
68
|
+
}
|
|
69
|
+
}
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
// Undefined drops the rule.
|
|
73
|
+
private transformRule(rule: Rule, index: RuleSubsumptionIndex): Rule | undefined {
|
|
74
|
+
const manager = this.context.manager;
|
|
75
|
+
if (rule.uninterpretedSize === 0) return rule;
|
|
76
|
+
const tail: number[] = [];
|
|
77
|
+
const isNegated: boolean[] = [];
|
|
78
|
+
for (let position = 0; position < rule.uninterpretedSize; position++) {
|
|
79
|
+
const atom = rule.tail[position];
|
|
80
|
+
const isNeg = rule.isNegated[position];
|
|
81
|
+
if (this.totalRelations.has(manager.decls[atom]) || index.isSubsumedAtom(atom)) {
|
|
82
|
+
if (isNeg) return undefined;
|
|
83
|
+
continue;
|
|
84
|
+
}
|
|
85
|
+
if (!isNeg && rule.head === atom) return undefined;
|
|
86
|
+
tail.push(atom);
|
|
87
|
+
isNegated.push(isNeg);
|
|
88
|
+
}
|
|
89
|
+
if (tail.length === rule.uninterpretedSize) return rule;
|
|
90
|
+
for (let position = rule.uninterpretedSize; position < rule.tail.length; position++) {
|
|
91
|
+
tail.push(rule.tail[position]);
|
|
92
|
+
isNegated.push(rule.isNegated[position]);
|
|
93
|
+
}
|
|
94
|
+
const ruleManager = this.context.ruleManager;
|
|
95
|
+
return ruleManager.fixUnboundVars(ruleManager.mk(rule.head, tail, isNegated, rule.name), true);
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
private transformRules(source: RuleSet, target: RuleSet) {
|
|
99
|
+
const manager = this.context.manager;
|
|
100
|
+
let isModified = false;
|
|
101
|
+
const includedTotalRelations = new Set<number>();
|
|
102
|
+
const index = new RuleSubsumptionIndex();
|
|
103
|
+
const rules = source.rules
|
|
104
|
+
.map((rule, position) => ({ rule, position }))
|
|
105
|
+
.sort(
|
|
106
|
+
(first, second) =>
|
|
107
|
+
first.rule.tail.length - second.rule.tail.length || first.position - second.position,
|
|
108
|
+
)
|
|
109
|
+
.map((entry) => entry.rule);
|
|
110
|
+
for (const rule of rules) {
|
|
111
|
+
const head = rule.getDecl(manager);
|
|
112
|
+
if (this.totalRelations.has(head)) {
|
|
113
|
+
if (!source.isOutputPredicate(head) || includedTotalRelations.has(head)) {
|
|
114
|
+
isModified = true;
|
|
115
|
+
continue;
|
|
116
|
+
}
|
|
117
|
+
const definingRule = this.definingRules.get(head) as Rule;
|
|
118
|
+
const totalityRule = this.transformRule(definingRule, index) as Rule;
|
|
119
|
+
if (totalityRule !== definingRule) isModified = true;
|
|
120
|
+
target.addRule(totalityRule);
|
|
121
|
+
includedTotalRelations.add(head);
|
|
122
|
+
continue;
|
|
123
|
+
}
|
|
124
|
+
const transformed = this.transformRule(rule, index);
|
|
125
|
+
if (transformed === undefined) {
|
|
126
|
+
isModified = true;
|
|
127
|
+
continue;
|
|
128
|
+
}
|
|
129
|
+
if (this.isTotalRule(transformed)) this.onDiscoveredTotalRelation(head, transformed);
|
|
130
|
+
if (index.isSubsumed(transformed)) {
|
|
131
|
+
isModified = true;
|
|
132
|
+
continue;
|
|
133
|
+
}
|
|
134
|
+
if (transformed !== rule) isModified = true;
|
|
135
|
+
target.addRule(transformed);
|
|
136
|
+
index.add(transformed);
|
|
137
|
+
}
|
|
138
|
+
target.inheritPredicates(source);
|
|
139
|
+
return isModified;
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
apply(source: RuleSet) {
|
|
143
|
+
if (!this.context.params.getBool("xform.subsumption_checker", true)) return undefined;
|
|
144
|
+
this.hasNewTotalRule = false;
|
|
145
|
+
this.scanForTotalRules(source);
|
|
146
|
+
this.hasNewTotalRule = false;
|
|
147
|
+
let result = new RuleSet(this.context);
|
|
148
|
+
const isModified = this.transformRules(source, result);
|
|
149
|
+
if (!this.hasNewTotalRule && !isModified) return undefined;
|
|
150
|
+
while (this.hasNewTotalRule) {
|
|
151
|
+
this.hasNewTotalRule = false;
|
|
152
|
+
const previous = result;
|
|
153
|
+
result = new RuleSet(this.context);
|
|
154
|
+
this.transformRules(previous, result);
|
|
155
|
+
}
|
|
156
|
+
return result;
|
|
157
|
+
}
|
|
158
|
+
}
|
|
@@ -0,0 +1,303 @@
|
|
|
1
|
+
// Ported from Z3 (src/muz/base/dl_rule_set.cpp), MIT license, see z3-license.txt.
|
|
2
|
+
import { SmtTacticError } from "../../../../errors";
|
|
3
|
+
import { type AstManager, KIND_APP, KIND_QUANTIFIER } from "../ast";
|
|
4
|
+
import type { DatalogContext } from "./dl-context";
|
|
5
|
+
import type { Rule } from "./dl-rule";
|
|
6
|
+
|
|
7
|
+
// For each predicate, the predicates its rules depend on. Every predicate in a set is a key.
|
|
8
|
+
class RuleDependencies {
|
|
9
|
+
readonly data = new Map<number, Set<number>>();
|
|
10
|
+
|
|
11
|
+
constructor(private context: DatalogContext) {}
|
|
12
|
+
|
|
13
|
+
private ensureKey(predicate: number) {
|
|
14
|
+
const existing = this.data.get(predicate);
|
|
15
|
+
if (existing !== undefined) return existing;
|
|
16
|
+
const created = new Set<number>();
|
|
17
|
+
this.data.set(predicate, created);
|
|
18
|
+
return created;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
populate(rules: readonly Rule[]) {
|
|
22
|
+
for (const rule of rules) this.populateRule(rule);
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
private populateRule(rule: Rule) {
|
|
26
|
+
const manager = this.context.manager;
|
|
27
|
+
const dependencies = this.ensureKey(rule.getDecl(manager));
|
|
28
|
+
const visited = new Set<number>();
|
|
29
|
+
const todo = [...rule.tail];
|
|
30
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
31
|
+
if (visited.has(expr)) continue;
|
|
32
|
+
visited.add(expr);
|
|
33
|
+
const kind = manager.kinds[expr];
|
|
34
|
+
if (kind === KIND_APP) {
|
|
35
|
+
const decl = manager.decls[expr];
|
|
36
|
+
if (this.context.isPredicateDecl(decl)) {
|
|
37
|
+
dependencies.add(decl);
|
|
38
|
+
this.ensureKey(decl);
|
|
39
|
+
}
|
|
40
|
+
manager.pushArgs(expr, todo);
|
|
41
|
+
} else if (kind === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
|
|
42
|
+
}
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
getDeps(predicate: number) {
|
|
46
|
+
return this.data.get(predicate) ?? EMPTY_SET;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
reset() {
|
|
50
|
+
this.data.clear();
|
|
51
|
+
}
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
const EMPTY_SET: ReadonlySet<number> = new Set();
|
|
55
|
+
|
|
56
|
+
// Strongly connected components of the dependencies, topologically sorted so that later strata
|
|
57
|
+
// depend only on earlier ones.
|
|
58
|
+
class RuleStratifier {
|
|
59
|
+
readonly strats: Set<number>[] = [];
|
|
60
|
+
private predStrats = new Map<number, number>();
|
|
61
|
+
private preorder = new Map<number, number>();
|
|
62
|
+
private componentNums = new Map<number, number>();
|
|
63
|
+
private components: (Set<number> | undefined)[] = [];
|
|
64
|
+
private stackS: number[] = [];
|
|
65
|
+
private stackP: number[] = [];
|
|
66
|
+
private nextPreorder = 0;
|
|
67
|
+
private firstPreorder = 0;
|
|
68
|
+
|
|
69
|
+
constructor(private deps: RuleDependencies) {
|
|
70
|
+
this.process();
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
getPredicateStrat(predicate: number) {
|
|
74
|
+
return this.predStrats.get(predicate) ?? 0;
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
private traverse(element: number) {
|
|
78
|
+
const number = this.preorder.get(element);
|
|
79
|
+
if (number !== undefined) {
|
|
80
|
+
if (number < this.firstPreorder || this.componentNums.has(element)) return;
|
|
81
|
+
while (this.stackP.length > 0) {
|
|
82
|
+
if ((this.preorder.get(this.stackP[this.stackP.length - 1]) ?? 0) <= number) break;
|
|
83
|
+
this.stackP.pop();
|
|
84
|
+
}
|
|
85
|
+
return;
|
|
86
|
+
}
|
|
87
|
+
this.preorder.set(element, this.nextPreorder++);
|
|
88
|
+
this.stackS.push(element);
|
|
89
|
+
this.stackP.push(element);
|
|
90
|
+
for (const child of this.deps.getDeps(element)) this.traverse(child);
|
|
91
|
+
if (element !== this.stackP[this.stackP.length - 1]) return;
|
|
92
|
+
const componentNum = this.components.length;
|
|
93
|
+
const component = new Set<number>();
|
|
94
|
+
this.components.push(component);
|
|
95
|
+
for (;;) {
|
|
96
|
+
const popped = this.stackS.pop() as number;
|
|
97
|
+
component.add(popped);
|
|
98
|
+
this.componentNums.set(popped, componentNum);
|
|
99
|
+
if (popped === element) break;
|
|
100
|
+
}
|
|
101
|
+
this.stackP.pop();
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
private process() {
|
|
105
|
+
const deps = this.deps.data;
|
|
106
|
+
if (deps.size === 0) return;
|
|
107
|
+
for (const element of deps.keys()) {
|
|
108
|
+
this.firstPreorder = this.nextPreorder;
|
|
109
|
+
this.traverse(element);
|
|
110
|
+
}
|
|
111
|
+
const inDegrees = this.components.map(() => 0);
|
|
112
|
+
for (const [element, outEdges] of deps) {
|
|
113
|
+
const elementComponent = this.componentNums.get(element) as number;
|
|
114
|
+
for (const target of outEdges) {
|
|
115
|
+
const targetComponent = this.componentNums.get(target) as number;
|
|
116
|
+
if (elementComponent !== targetComponent) inDegrees[targetComponent]++;
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
this.components.forEach((component, index) => {
|
|
120
|
+
if (inDegrees[index] !== 0 || component === undefined) return;
|
|
121
|
+
this.strats.push(component);
|
|
122
|
+
this.components[index] = undefined;
|
|
123
|
+
});
|
|
124
|
+
for (let index = 0; index < this.strats.length; index++)
|
|
125
|
+
for (const element of this.strats[index])
|
|
126
|
+
for (const target of this.deps.getDeps(element)) {
|
|
127
|
+
const targetComponent = this.componentNums.get(target) as number;
|
|
128
|
+
const component = this.components[targetComponent];
|
|
129
|
+
if (component === undefined) continue;
|
|
130
|
+
inDegrees[targetComponent]--;
|
|
131
|
+
if (inDegrees[targetComponent] !== 0) continue;
|
|
132
|
+
this.strats.push(component);
|
|
133
|
+
this.components[targetComponent] = undefined;
|
|
134
|
+
}
|
|
135
|
+
this.strats.reverse();
|
|
136
|
+
this.strats.forEach((component, index) => {
|
|
137
|
+
for (const element of component) this.predStrats.set(element, index);
|
|
138
|
+
});
|
|
139
|
+
}
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
export class RuleSet {
|
|
143
|
+
rules: Rule[] = [];
|
|
144
|
+
private head2rules = new Map<number, Rule[]>();
|
|
145
|
+
readonly deps: RuleDependencies;
|
|
146
|
+
private stratifier: RuleStratifier | undefined;
|
|
147
|
+
outputPredicates = new Set<number>();
|
|
148
|
+
private orig2pred = new Map<number, number>();
|
|
149
|
+
private pred2orig = new Map<number, number>();
|
|
150
|
+
|
|
151
|
+
constructor(readonly context: DatalogContext) {
|
|
152
|
+
this.deps = new RuleDependencies(context);
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
static copy(other: RuleSet) {
|
|
156
|
+
const copied = new RuleSet(other.context);
|
|
157
|
+
copied.addRules(other);
|
|
158
|
+
if (other.stratifier !== undefined && !copied.close())
|
|
159
|
+
throw new SmtTacticError("the copy of a stratified rule set is not stratified");
|
|
160
|
+
return copied;
|
|
161
|
+
}
|
|
162
|
+
|
|
163
|
+
get manager(): AstManager {
|
|
164
|
+
return this.context.manager;
|
|
165
|
+
}
|
|
166
|
+
|
|
167
|
+
reset() {
|
|
168
|
+
this.rules = [];
|
|
169
|
+
this.head2rules.clear();
|
|
170
|
+
this.deps.reset();
|
|
171
|
+
this.stratifier = undefined;
|
|
172
|
+
this.outputPredicates = new Set();
|
|
173
|
+
this.orig2pred.clear();
|
|
174
|
+
this.pred2orig.clear();
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
getOrig(predicate: number) {
|
|
178
|
+
return this.pred2orig.get(predicate) ?? predicate;
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
getPred(orig: number) {
|
|
182
|
+
return this.orig2pred.get(orig) ?? orig;
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
inheritPredicates(other: RuleSet) {
|
|
186
|
+
for (const predicate of other.outputPredicates) this.outputPredicates.add(predicate);
|
|
187
|
+
for (const [orig, predicate] of other.orig2pred) this.orig2pred.set(orig, predicate);
|
|
188
|
+
for (const [predicate, orig] of other.pred2orig) this.pred2orig.set(predicate, orig);
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
inheritPredicate(other: RuleSet, orig: number, predicate: number) {
|
|
192
|
+
if (other.isOutputPredicate(orig)) this.setOutputPredicate(predicate);
|
|
193
|
+
const original = other.getOrig(orig);
|
|
194
|
+
this.orig2pred.set(original, predicate);
|
|
195
|
+
this.pred2orig.set(predicate, original);
|
|
196
|
+
}
|
|
197
|
+
|
|
198
|
+
addRule(rule: Rule) {
|
|
199
|
+
this.rules.push(rule);
|
|
200
|
+
const decl = rule.getDecl(this.manager);
|
|
201
|
+
const existing = this.head2rules.get(decl);
|
|
202
|
+
if (existing === undefined) this.head2rules.set(decl, [rule]);
|
|
203
|
+
else existing.push(rule);
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
delRule(rule: Rule) {
|
|
207
|
+
const remove = (rules: Rule[]) => {
|
|
208
|
+
for (let index = rules.length - 1; index >= 0; index--) {
|
|
209
|
+
if (rules[index] !== rule) continue;
|
|
210
|
+
rules[index] = rules[rules.length - 1];
|
|
211
|
+
rules.pop();
|
|
212
|
+
break;
|
|
213
|
+
}
|
|
214
|
+
};
|
|
215
|
+
remove(this.head2rules.get(rule.getDecl(this.manager)) ?? []);
|
|
216
|
+
remove(this.rules);
|
|
217
|
+
}
|
|
218
|
+
|
|
219
|
+
replaceRule(rule: Rule, other: Rule) {
|
|
220
|
+
const replace = (rules: Rule[]) => {
|
|
221
|
+
for (let index = rules.length - 1; index >= 0; index--) {
|
|
222
|
+
if (rules[index] !== rule) continue;
|
|
223
|
+
rules[index] = other;
|
|
224
|
+
break;
|
|
225
|
+
}
|
|
226
|
+
};
|
|
227
|
+
replace(this.head2rules.get(rule.getDecl(this.manager)) ?? []);
|
|
228
|
+
replace(this.rules);
|
|
229
|
+
}
|
|
230
|
+
|
|
231
|
+
isClosed() {
|
|
232
|
+
return this.stratifier !== undefined;
|
|
233
|
+
}
|
|
234
|
+
|
|
235
|
+
ensureClosed() {
|
|
236
|
+
if (!this.isClosed() && !this.close())
|
|
237
|
+
throw new SmtTacticError("the rule set is not stratified");
|
|
238
|
+
}
|
|
239
|
+
|
|
240
|
+
close() {
|
|
241
|
+
this.deps.populate(this.rules);
|
|
242
|
+
this.stratifier = new RuleStratifier(this.deps);
|
|
243
|
+
if (this.isStratifiedNegation()) return true;
|
|
244
|
+
this.stratifier = undefined;
|
|
245
|
+
this.deps.reset();
|
|
246
|
+
return false;
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
reopen() {
|
|
250
|
+
if (!this.isClosed()) return;
|
|
251
|
+
this.stratifier = undefined;
|
|
252
|
+
this.deps.reset();
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
private isStratifiedNegation() {
|
|
256
|
+
const manager = this.manager;
|
|
257
|
+
for (const rule of this.rules) {
|
|
258
|
+
const headStrat = this.getPredicateStrat(rule.getDecl(manager));
|
|
259
|
+
for (let index = rule.positiveSize; index < rule.uninterpretedSize; index++)
|
|
260
|
+
if (this.getPredicateStrat(rule.getTailDecl(manager, index)) === headStrat) return false;
|
|
261
|
+
}
|
|
262
|
+
return true;
|
|
263
|
+
}
|
|
264
|
+
|
|
265
|
+
replaceRules(source: RuleSet) {
|
|
266
|
+
if (source === this) return;
|
|
267
|
+
this.reset();
|
|
268
|
+
this.addRules(source);
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
addRules(source: RuleSet) {
|
|
272
|
+
for (const rule of source.rules) this.addRule(rule);
|
|
273
|
+
this.inheritPredicates(source);
|
|
274
|
+
}
|
|
275
|
+
|
|
276
|
+
getPredicateRules(predicate: number): readonly Rule[] {
|
|
277
|
+
return this.head2rules.get(predicate) ?? [];
|
|
278
|
+
}
|
|
279
|
+
|
|
280
|
+
getHeadPredicates() {
|
|
281
|
+
return this.head2rules.keys();
|
|
282
|
+
}
|
|
283
|
+
|
|
284
|
+
getStrats() {
|
|
285
|
+
return this.stratifier?.strats ?? [];
|
|
286
|
+
}
|
|
287
|
+
|
|
288
|
+
getPredicateStrat(predicate: number) {
|
|
289
|
+
return this.stratifier?.getPredicateStrat(predicate) ?? 0;
|
|
290
|
+
}
|
|
291
|
+
|
|
292
|
+
isOutputPredicate(predicate: number) {
|
|
293
|
+
return this.outputPredicates.has(predicate);
|
|
294
|
+
}
|
|
295
|
+
|
|
296
|
+
setOutputPredicate(predicate: number) {
|
|
297
|
+
this.outputPredicates.add(predicate);
|
|
298
|
+
}
|
|
299
|
+
|
|
300
|
+
getOutputPredicate() {
|
|
301
|
+
return this.outputPredicates.values().next().value as number;
|
|
302
|
+
}
|
|
303
|
+
}
|
|
@@ -0,0 +1,127 @@
|
|
|
1
|
+
// Ported from Z3 (src/muz/base/dl_rule_transformer.cpp, src/muz/transforms/dl_transforms.cpp), MIT
|
|
2
|
+
// license, see z3-license.txt.
|
|
3
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
4
|
+
import type { DatalogContext } from "./dl-context";
|
|
5
|
+
import { MkBitBlast } from "./dl-mk-bit-blast";
|
|
6
|
+
import { MkCoiFilter } from "./dl-mk-coi-filter";
|
|
7
|
+
import { MkElimTermIte } from "./dl-mk-elim-term-ite";
|
|
8
|
+
import { MkInterpTailSimplifier } from "./dl-mk-interp-tail-simplifier";
|
|
9
|
+
import { MkRuleInliner } from "./dl-mk-rule-inliner";
|
|
10
|
+
import { MkSubsumptionChecker } from "./dl-mk-subsumption-checker";
|
|
11
|
+
import { RuleSet } from "./dl-rule-set";
|
|
12
|
+
|
|
13
|
+
export interface RuleTransformerPlugin {
|
|
14
|
+
readonly priority: number;
|
|
15
|
+
readonly canDestratifyNegation?: boolean;
|
|
16
|
+
apply(source: RuleSet): RuleSet | undefined;
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
export const removeDuplicateTails = (tail: number[], isNegated: boolean[]) => {
|
|
20
|
+
const seen = [new Set<number>(), new Set<number>()];
|
|
21
|
+
let index = 0;
|
|
22
|
+
while (index < tail.length) {
|
|
23
|
+
const set = seen[isNegated[index] ? 1 : 0];
|
|
24
|
+
if (!set.has(tail[index])) {
|
|
25
|
+
set.add(tail[index]);
|
|
26
|
+
index++;
|
|
27
|
+
continue;
|
|
28
|
+
}
|
|
29
|
+
if (index !== tail.length - 1) {
|
|
30
|
+
tail[index] = tail[tail.length - 1];
|
|
31
|
+
isNegated[index] = isNegated[isNegated.length - 1];
|
|
32
|
+
}
|
|
33
|
+
tail.pop();
|
|
34
|
+
isNegated.pop();
|
|
35
|
+
}
|
|
36
|
+
};
|
|
37
|
+
|
|
38
|
+
// Plugins with the same priority keep the order they were registered in.
|
|
39
|
+
export const transformRules = (context: DatalogContext, plugins: RuleTransformerPlugin[]) => {
|
|
40
|
+
const ordered = plugins
|
|
41
|
+
.map((plugin, index) => ({ plugin, index }))
|
|
42
|
+
.sort(
|
|
43
|
+
(first, second) =>
|
|
44
|
+
second.plugin.priority - first.plugin.priority || first.index - second.index,
|
|
45
|
+
)
|
|
46
|
+
.map((entry) => entry.plugin);
|
|
47
|
+
let isModified = false;
|
|
48
|
+
let rules = RuleSet.copy(context.ruleSet);
|
|
49
|
+
for (const plugin of ordered) {
|
|
50
|
+
context.manager.limit.checkpoint();
|
|
51
|
+
const result = plugin.apply(rules);
|
|
52
|
+
if (result === undefined) continue;
|
|
53
|
+
if (plugin.canDestratifyNegation === true && !result.isClosed() && !result.close()) continue;
|
|
54
|
+
isModified = true;
|
|
55
|
+
rules = result;
|
|
56
|
+
rules.ensureClosed();
|
|
57
|
+
}
|
|
58
|
+
if (!isModified) return;
|
|
59
|
+
context.ruleSet.replaceRules(rules);
|
|
60
|
+
context.ruleSet.ensureClosed();
|
|
61
|
+
};
|
|
62
|
+
|
|
63
|
+
class MkGuard implements RuleTransformerPlugin {
|
|
64
|
+
constructor(
|
|
65
|
+
readonly priority: number,
|
|
66
|
+
private isEnabled: boolean,
|
|
67
|
+
private name: string,
|
|
68
|
+
) {}
|
|
69
|
+
|
|
70
|
+
apply() {
|
|
71
|
+
if (this.isEnabled) throw new SmtUnsupportedError(`the Horn transformation ${this.name}`);
|
|
72
|
+
return undefined;
|
|
73
|
+
}
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
export const applyDefaultTransformation = (context: DatalogContext) =>
|
|
77
|
+
context.withoutBindingVariables(() => {
|
|
78
|
+
const params = context.params;
|
|
79
|
+
context.ensureClosed();
|
|
80
|
+
const isSubsuming = params.getBool("datalog.subsumption", true);
|
|
81
|
+
if (
|
|
82
|
+
params.getBool("xform.instantiate_arrays", false) ||
|
|
83
|
+
params.getBool("xform.transform_arrays", false) ||
|
|
84
|
+
params.getBool("xform.quantify_arrays", false) ||
|
|
85
|
+
params.getBool("xform.magic", false)
|
|
86
|
+
)
|
|
87
|
+
throw new SmtUnsupportedError("the Horn array and magic set transformations");
|
|
88
|
+
const plugins: RuleTransformerPlugin[] = [
|
|
89
|
+
new MkCoiFilter(context),
|
|
90
|
+
new MkInterpTailSimplifier(context),
|
|
91
|
+
new MkGuard(
|
|
92
|
+
37000,
|
|
93
|
+
params.getBool("xform.instantiate_quantifiers", false),
|
|
94
|
+
"instantiate_quantifiers",
|
|
95
|
+
),
|
|
96
|
+
];
|
|
97
|
+
if (isSubsuming) plugins.push(new MkSubsumptionChecker(context, 35005));
|
|
98
|
+
plugins.push(
|
|
99
|
+
new MkRuleInliner(context, 35000),
|
|
100
|
+
new MkCoiFilter(context, 34990),
|
|
101
|
+
new MkInterpTailSimplifier(context, 34980),
|
|
102
|
+
);
|
|
103
|
+
if (isSubsuming) plugins.push(new MkSubsumptionChecker(context, 34975));
|
|
104
|
+
plugins.push(
|
|
105
|
+
new MkRuleInliner(context, 34970),
|
|
106
|
+
new MkCoiFilter(context, 34960),
|
|
107
|
+
new MkInterpTailSimplifier(context, 34950),
|
|
108
|
+
);
|
|
109
|
+
if (isSubsuming)
|
|
110
|
+
plugins.push(
|
|
111
|
+
new MkSubsumptionChecker(context, 34940),
|
|
112
|
+
new MkRuleInliner(context, 34930),
|
|
113
|
+
new MkSubsumptionChecker(context, 34920),
|
|
114
|
+
new MkRuleInliner(context, 34910),
|
|
115
|
+
new MkSubsumptionChecker(context, 34900),
|
|
116
|
+
new MkRuleInliner(context, 34890),
|
|
117
|
+
new MkSubsumptionChecker(context, 34880),
|
|
118
|
+
);
|
|
119
|
+
else plugins.push(new MkRuleInliner(context, 34930));
|
|
120
|
+
plugins.push(
|
|
121
|
+
new MkBitBlast(context, 35000),
|
|
122
|
+
new MkGuard(36030, params.getBool("xform.scale", false), "scale"),
|
|
123
|
+
new MkGuard(35999, params.getBool("xform.array_blast", false), "array_blast"),
|
|
124
|
+
new MkElimTermIte(context, 35010),
|
|
125
|
+
);
|
|
126
|
+
transformRules(context, plugins);
|
|
127
|
+
});
|