tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -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 +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- 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 +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- 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 +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- 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 +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- 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 +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -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 +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- 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 +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -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 +1021 -658
- 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 -16
- 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 +626 -56
- 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 +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -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 +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -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 +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- 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 +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- 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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +179 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- 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 +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- 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 +382 -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 +495 -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 +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -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 +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -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 +21 -26
- 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 +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- 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 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- 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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +2107 -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 +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -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 +1210 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -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-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- 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 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- 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 +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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,340 @@
|
|
|
1
|
+
import { getSymbolName, KIND_VAR, OP_EQ, OP_ITE, SORT_BOOL } from "../ast";
|
|
2
|
+
import { flattenAndVector } from "../ast-util";
|
|
3
|
+
import { ObjMap } from "../hashtable";
|
|
4
|
+
import { FuncInterp, ProtoModel } from "../proto-model";
|
|
5
|
+
import { RefVector } from "../ref-vector";
|
|
6
|
+
import { getFreeVarSorts, VarSubst } from "../var-subst";
|
|
7
|
+
import type { DatalogContext } from "./dl-context";
|
|
8
|
+
import type { Rule } from "./dl-rule";
|
|
9
|
+
import { RuleSet } from "./dl-rule-set";
|
|
10
|
+
import type { RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
11
|
+
|
|
12
|
+
export class MkSlice implements RuleTransformerPlugin {
|
|
13
|
+
readonly priority = 1;
|
|
14
|
+
private sliceable: ObjMap<boolean[]>;
|
|
15
|
+
private input: boolean[] = [];
|
|
16
|
+
private output: boolean[] = [];
|
|
17
|
+
private isVarSliceable: boolean[] = [];
|
|
18
|
+
private solvedVars: number[] = [];
|
|
19
|
+
readonly predicates = new Map<number, number>();
|
|
20
|
+
// slice_model_converter::m_slice2old
|
|
21
|
+
private slice2old: ObjMap<number>;
|
|
22
|
+
|
|
23
|
+
constructor(private context: DatalogContext) {
|
|
24
|
+
this.sliceable = new ObjMap((decl) => context.manager.getDeclHash(decl));
|
|
25
|
+
this.slice2old = new ObjMap((decl) => context.manager.getDeclHash(decl));
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
private getPredicateSlice(predicate: number) {
|
|
29
|
+
const existing = this.sliceable.get(predicate);
|
|
30
|
+
if (existing !== undefined) return existing;
|
|
31
|
+
const slice = Array.from(
|
|
32
|
+
{ length: this.context.manager.funcDecls[predicate].domain.length },
|
|
33
|
+
() => true,
|
|
34
|
+
);
|
|
35
|
+
this.sliceable.set(predicate, slice);
|
|
36
|
+
return slice;
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
private addVar(index: number) {
|
|
40
|
+
while (this.input.length <= index) {
|
|
41
|
+
this.input.push(false);
|
|
42
|
+
this.output.push(false);
|
|
43
|
+
this.isVarSliceable.push(true);
|
|
44
|
+
this.solvedVars.push(-1);
|
|
45
|
+
}
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
private initVarsOf(atom: number, isOutput: boolean, isNegTail: boolean) {
|
|
49
|
+
const manager = this.context.manager;
|
|
50
|
+
const slice = this.getPredicateSlice(manager.decls[atom]);
|
|
51
|
+
manager.getArgs(atom).forEach((arg, index) => {
|
|
52
|
+
if (isNegTail) slice[index] = false;
|
|
53
|
+
if (manager.kinds[arg] !== KIND_VAR) {
|
|
54
|
+
slice[index] = false;
|
|
55
|
+
return;
|
|
56
|
+
}
|
|
57
|
+
const varIndex = manager.values[arg];
|
|
58
|
+
this.addVar(varIndex);
|
|
59
|
+
if (isOutput) this.output[varIndex] = true;
|
|
60
|
+
else this.input[varIndex] = true;
|
|
61
|
+
this.isVarSliceable[varIndex] = this.isVarSliceable[varIndex] && slice[index];
|
|
62
|
+
});
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
private initVars(rule: Rule) {
|
|
66
|
+
this.input = [];
|
|
67
|
+
this.output = [];
|
|
68
|
+
this.isVarSliceable = [];
|
|
69
|
+
this.solvedVars = [];
|
|
70
|
+
this.initVarsOf(rule.head, true, false);
|
|
71
|
+
for (let index = 0; index < rule.uninterpretedSize; index++)
|
|
72
|
+
this.initVarsOf(rule.tail[index], false, rule.isNegated[index]);
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
private getTailConjs(rule: Rule) {
|
|
76
|
+
const conjs = new RefVector(this.context.manager);
|
|
77
|
+
for (let index = rule.uninterpretedSize; index < rule.tail.length; index++)
|
|
78
|
+
conjs.push(rule.tail[index]);
|
|
79
|
+
flattenAndVector(this.context.manager, conjs);
|
|
80
|
+
return conjs;
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
private isOutputVar(index: number) {
|
|
84
|
+
return index < this.output.length && this.output[index] && !this.input[index];
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
private getEq(expr: number): { index: number; value: number } | undefined {
|
|
88
|
+
const manager = this.context.manager;
|
|
89
|
+
if (manager.getOp(expr) === OP_ITE) {
|
|
90
|
+
const thenEq = this.getEq(manager.getArg(expr, 1));
|
|
91
|
+
const elseEq = thenEq === undefined ? undefined : this.getEq(manager.getArg(expr, 2));
|
|
92
|
+
if (thenEq !== undefined && elseEq !== undefined && thenEq.index === elseEq.index)
|
|
93
|
+
return {
|
|
94
|
+
index: thenEq.index,
|
|
95
|
+
value: manager.mkApp(
|
|
96
|
+
OP_ITE,
|
|
97
|
+
[manager.getArg(expr, 0), thenEq.value, elseEq.value],
|
|
98
|
+
manager.sorts[thenEq.value],
|
|
99
|
+
),
|
|
100
|
+
};
|
|
101
|
+
}
|
|
102
|
+
if (manager.kinds[expr] === KIND_VAR)
|
|
103
|
+
return { index: manager.values[expr], value: manager.trueExpr };
|
|
104
|
+
// is_not rebinds the expression to its argument, so the equation under a negation is solved.
|
|
105
|
+
const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
|
|
106
|
+
if (atom !== expr && manager.kinds[atom] === KIND_VAR)
|
|
107
|
+
return { index: manager.values[atom], value: manager.falseExpr };
|
|
108
|
+
if (manager.getOp(atom) !== OP_EQ) return undefined;
|
|
109
|
+
const left = manager.getArg(atom, 0);
|
|
110
|
+
const right = manager.getArg(atom, 1);
|
|
111
|
+
if (manager.kinds[left] === KIND_VAR) return { index: manager.values[left], value: right };
|
|
112
|
+
if (manager.kinds[right] === KIND_VAR) return { index: manager.values[right], value: left };
|
|
113
|
+
return undefined;
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
private addFreeVars(result: Set<number>, expr: number) {
|
|
117
|
+
const manager = this.context.manager;
|
|
118
|
+
getFreeVarSorts(manager, expr, manager.freeVarBounds[expr]).forEach((sort, index) => {
|
|
119
|
+
if (sort !== undefined) result.add(index);
|
|
120
|
+
});
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
private filterUniqueVars(rule: Rule) {
|
|
124
|
+
const manager = this.context.manager;
|
|
125
|
+
const used = new Set<number>();
|
|
126
|
+
for (let index = 0; index < rule.uninterpretedSize; index++)
|
|
127
|
+
for (const arg of manager.getArgs(rule.tail[index])) {
|
|
128
|
+
if (manager.kinds[arg] !== KIND_VAR) continue;
|
|
129
|
+
const varIndex = manager.values[arg];
|
|
130
|
+
this.addVar(varIndex);
|
|
131
|
+
if (used.has(varIndex)) this.isVarSliceable[varIndex] = false;
|
|
132
|
+
else used.add(varIndex);
|
|
133
|
+
}
|
|
134
|
+
}
|
|
135
|
+
|
|
136
|
+
private solveVars(rule: Rule, used: Set<number>, parameters: Set<number>) {
|
|
137
|
+
const conjs = this.getTailConjs(rule);
|
|
138
|
+
for (const conj of conjs.items) {
|
|
139
|
+
const eq = this.getEq(conj);
|
|
140
|
+
if (eq === undefined || !this.isOutputVar(eq.index) || !this.isVarSliceable[eq.index]) {
|
|
141
|
+
this.addFreeVars(used, conj);
|
|
142
|
+
continue;
|
|
143
|
+
}
|
|
144
|
+
this.addVar(eq.index);
|
|
145
|
+
if (this.solvedVars[eq.index] === -1) {
|
|
146
|
+
this.addFreeVars(parameters, eq.value);
|
|
147
|
+
this.context.manager.incRef(eq.value);
|
|
148
|
+
this.solvedVars[eq.index] = eq.value;
|
|
149
|
+
} else {
|
|
150
|
+
this.addFreeVars(used, conj);
|
|
151
|
+
this.addFreeVars(used, this.solvedVars[eq.index]);
|
|
152
|
+
used.add(eq.index);
|
|
153
|
+
}
|
|
154
|
+
}
|
|
155
|
+
conjs.reset();
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
private finalizeVars(atom: number) {
|
|
159
|
+
const manager = this.context.manager;
|
|
160
|
+
let isChanged = false;
|
|
161
|
+
const slice = this.getPredicateSlice(manager.decls[atom]);
|
|
162
|
+
manager.getArgs(atom).forEach((arg, index) => {
|
|
163
|
+
if (
|
|
164
|
+
manager.kinds[arg] !== KIND_VAR ||
|
|
165
|
+
this.isVarSliceable[manager.values[arg]] ||
|
|
166
|
+
!slice[index]
|
|
167
|
+
)
|
|
168
|
+
return;
|
|
169
|
+
slice[index] = false;
|
|
170
|
+
isChanged = true;
|
|
171
|
+
});
|
|
172
|
+
return isChanged;
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
private pruneRule(rule: Rule) {
|
|
176
|
+
const manager = this.context.manager;
|
|
177
|
+
let isChanged = false;
|
|
178
|
+
this.initVars(rule);
|
|
179
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
180
|
+
const atom = rule.tail[index];
|
|
181
|
+
const slice = this.getPredicateSlice(manager.decls[atom]);
|
|
182
|
+
manager.getArgs(atom).forEach((arg, argIndex) => {
|
|
183
|
+
if (manager.kinds[arg] === KIND_VAR || !slice[argIndex]) return;
|
|
184
|
+
slice[argIndex] = false;
|
|
185
|
+
isChanged = true;
|
|
186
|
+
});
|
|
187
|
+
}
|
|
188
|
+
this.filterUniqueVars(rule);
|
|
189
|
+
const used = new Set<number>();
|
|
190
|
+
const parameters = new Set<number>();
|
|
191
|
+
this.solveVars(rule, used, parameters);
|
|
192
|
+
for (const index of used)
|
|
193
|
+
if (index < this.isVarSliceable.length) this.isVarSliceable[index] = false;
|
|
194
|
+
for (let index = 0; index < this.input.length; index++) {
|
|
195
|
+
if (!this.isVarSliceable[index]) continue;
|
|
196
|
+
const isInput = this.input[index];
|
|
197
|
+
const isOutput = this.output[index];
|
|
198
|
+
const solved = this.solvedVars[index];
|
|
199
|
+
if (isInput && isOutput) {
|
|
200
|
+
if (solved !== -1 || parameters.has(index)) this.isVarSliceable[index] = false;
|
|
201
|
+
} else if (isOutput) {
|
|
202
|
+
if (parameters.has(index) || (solved !== -1 && manager.kinds[solved] !== KIND_VAR))
|
|
203
|
+
this.isVarSliceable[index] = false;
|
|
204
|
+
}
|
|
205
|
+
}
|
|
206
|
+
if (this.finalizeVars(rule.head)) isChanged = true;
|
|
207
|
+
for (let index = 0; index < rule.uninterpretedSize; index++)
|
|
208
|
+
if (this.finalizeVars(rule.tail[index])) isChanged = true;
|
|
209
|
+
return isChanged;
|
|
210
|
+
}
|
|
211
|
+
|
|
212
|
+
private declarePredicates(source: RuleSet, target: RuleSet) {
|
|
213
|
+
const manager = this.context.manager;
|
|
214
|
+
let hasOutput = false;
|
|
215
|
+
for (const [predicate, slice] of this.sliceable) {
|
|
216
|
+
const domain = manager.funcDecls[predicate].domain.filter((_value, index) => !slice[index]);
|
|
217
|
+
if (domain.length < slice.length) {
|
|
218
|
+
const sliced = this.context.mkFreshHeadPredicate(
|
|
219
|
+
getSymbolName(manager.funcDecls[predicate].name),
|
|
220
|
+
"slice",
|
|
221
|
+
domain,
|
|
222
|
+
);
|
|
223
|
+
this.predicates.set(predicate, sliced);
|
|
224
|
+
target.inheritPredicate(source, predicate, sliced);
|
|
225
|
+
this.slice2old.set(sliced, predicate);
|
|
226
|
+
} else if (source.isOutputPredicate(predicate)) {
|
|
227
|
+
target.setOutputPredicate(predicate);
|
|
228
|
+
hasOutput = true;
|
|
229
|
+
}
|
|
230
|
+
}
|
|
231
|
+
if (!hasOutput) this.predicates.clear();
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
private updatePredicate(atom: number) {
|
|
235
|
+
const manager = this.context.manager;
|
|
236
|
+
const sliced = this.predicates.get(manager.decls[atom]);
|
|
237
|
+
if (sliced === undefined) return atom;
|
|
238
|
+
const slice = this.getPredicateSlice(manager.decls[atom]);
|
|
239
|
+
return manager.mkApp(
|
|
240
|
+
sliced,
|
|
241
|
+
manager.getArgs(atom).filter((_value, index) => !slice[index]),
|
|
242
|
+
SORT_BOOL,
|
|
243
|
+
);
|
|
244
|
+
}
|
|
245
|
+
|
|
246
|
+
private updateRule(rule: Rule, target: RuleSet) {
|
|
247
|
+
const manager = this.context.manager;
|
|
248
|
+
const isUpdated =
|
|
249
|
+
this.predicates.has(rule.getDecl(manager)) ||
|
|
250
|
+
rule.tail
|
|
251
|
+
.slice(0, rule.uninterpretedSize)
|
|
252
|
+
.some((atom) => this.predicates.has(manager.decls[atom]));
|
|
253
|
+
if (!isUpdated) {
|
|
254
|
+
target.addRule(rule);
|
|
255
|
+
return;
|
|
256
|
+
}
|
|
257
|
+
this.initVars(rule);
|
|
258
|
+
const head = this.updatePredicate(rule.head);
|
|
259
|
+
const tail = rule.tail
|
|
260
|
+
.slice(0, rule.uninterpretedSize)
|
|
261
|
+
.map((atom) => this.updatePredicate(atom));
|
|
262
|
+
const conjs = this.getTailConjs(rule);
|
|
263
|
+
tail.push(...conjs.items);
|
|
264
|
+
const ruleManager = this.context.ruleManager;
|
|
265
|
+
const updated = ruleManager.fixUnboundVars(ruleManager.mk(head, tail, [], rule.name), false);
|
|
266
|
+
conjs.reset();
|
|
267
|
+
target.addRule(updated);
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
apply(source: RuleSet) {
|
|
271
|
+
if (source.rules.some((rule) => this.context.ruleManager.hasQuantifiers(rule)))
|
|
272
|
+
return undefined;
|
|
273
|
+
this.predicates.clear();
|
|
274
|
+
let isChanged = true;
|
|
275
|
+
while (isChanged) {
|
|
276
|
+
isChanged = false;
|
|
277
|
+
for (const rule of source.rules) if (this.pruneRule(rule)) isChanged = true;
|
|
278
|
+
}
|
|
279
|
+
const result = new RuleSet(this.context);
|
|
280
|
+
this.declarePredicates(source, result);
|
|
281
|
+
if (this.predicates.size === 0) return undefined;
|
|
282
|
+
for (const rule of source.rules) this.updateRule(rule, result);
|
|
283
|
+
const slice2old = this.slice2old;
|
|
284
|
+
const sliceable = new Map([...this.sliceable].map((entry) => [entry[0], [...entry[1]]]));
|
|
285
|
+
this.context.modelConverters?.push((model) => this.convertModel(model, slice2old, sliceable));
|
|
286
|
+
return result;
|
|
287
|
+
}
|
|
288
|
+
|
|
289
|
+
// slice_model_converter::operator(): the interpretation of a sliced predicate over the
|
|
290
|
+
// arguments of the predicate it was sliced from.
|
|
291
|
+
private convertModel(
|
|
292
|
+
model: ProtoModel,
|
|
293
|
+
slice2old: ObjMap<number>,
|
|
294
|
+
sliceable: ReadonlyMap<number, boolean[]>,
|
|
295
|
+
) {
|
|
296
|
+
const manager = this.context.manager;
|
|
297
|
+
const oldModel = new ProtoModel(manager);
|
|
298
|
+
const varSubst = new VarSubst(manager, false);
|
|
299
|
+
for (const [sliced, predicate] of slice2old) {
|
|
300
|
+
// Z3 drops the interpretation of a predicate that has every argument sliced.
|
|
301
|
+
if (manager.funcDecls[sliced].domain.length === 0) continue;
|
|
302
|
+
const slice = sliceable.get(predicate) ?? [];
|
|
303
|
+
const domain = manager.funcDecls[predicate].domain;
|
|
304
|
+
const subst = domain
|
|
305
|
+
.map((sort, index) => manager.mkVar(index, sort))
|
|
306
|
+
.filter((_value, index) => !slice[index]);
|
|
307
|
+
const interp = model.funcInterps.get(sliced);
|
|
308
|
+
if (interp === undefined) continue;
|
|
309
|
+
const oldInterp = new FuncInterp(manager, slice.length);
|
|
310
|
+
if (interp.elseExpr !== null) {
|
|
311
|
+
const elseExpr = varSubst.apply(interp.elseExpr, subst);
|
|
312
|
+
oldInterp.setElse(elseExpr);
|
|
313
|
+
manager.decRef(elseExpr);
|
|
314
|
+
}
|
|
315
|
+
for (const entry of interp.entries) {
|
|
316
|
+
let next = 0;
|
|
317
|
+
const args = domain.map((sort, index) =>
|
|
318
|
+
slice[index] ? manager.mkVar(index, sort) : varSubst.apply(entry.args[next++], subst),
|
|
319
|
+
);
|
|
320
|
+
const result = varSubst.apply(entry.result, subst);
|
|
321
|
+
oldInterp.insertEntry(args, result);
|
|
322
|
+
manager.decRef(result);
|
|
323
|
+
args.forEach((arg, index) => {
|
|
324
|
+
if (!slice[index]) manager.decRef(arg);
|
|
325
|
+
});
|
|
326
|
+
}
|
|
327
|
+
oldModel.registerFunc(predicate, oldInterp);
|
|
328
|
+
}
|
|
329
|
+
for (const decl of model.getConstDecls()) {
|
|
330
|
+
const value = model.constInterps.get(decl);
|
|
331
|
+
if (value !== undefined && !slice2old.has(decl)) oldModel.registerConst(decl, value);
|
|
332
|
+
}
|
|
333
|
+
for (const decl of model.getFuncDecls()) {
|
|
334
|
+
const interp = model.funcInterps.get(decl);
|
|
335
|
+
if (interp !== undefined && !slice2old.has(decl)) oldModel.registerFunc(decl, interp.copy());
|
|
336
|
+
}
|
|
337
|
+
varSubst.release();
|
|
338
|
+
return oldModel;
|
|
339
|
+
}
|
|
340
|
+
}
|
|
@@ -0,0 +1,163 @@
|
|
|
1
|
+
import { KIND_VAR } from "../ast";
|
|
2
|
+
import { ObjHashtable } from "../hashtable";
|
|
3
|
+
import type { DatalogContext } from "./dl-context";
|
|
4
|
+
import type { Rule } from "./dl-rule";
|
|
5
|
+
import { RuleSet } from "./dl-rule-set";
|
|
6
|
+
import type { RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
7
|
+
|
|
8
|
+
const getRuleKey = (rule: Rule) =>
|
|
9
|
+
`${rule.head}|${rule.tail.join(",")}|${rule.isNegated.map(Number).join("")}`;
|
|
10
|
+
|
|
11
|
+
class RuleSubsumptionIndex {
|
|
12
|
+
private unconditionedHeads = new Set<number>();
|
|
13
|
+
private ruleKeys = new Set<string>();
|
|
14
|
+
|
|
15
|
+
add(rule: Rule) {
|
|
16
|
+
if (rule.tail.length === 0) this.unconditionedHeads.add(rule.head);
|
|
17
|
+
this.ruleKeys.add(getRuleKey(rule));
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
isSubsumedAtom(query: number) {
|
|
21
|
+
return this.unconditionedHeads.has(query);
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
isSubsumed(rule: Rule) {
|
|
25
|
+
return this.isSubsumedAtom(rule.head) || this.ruleKeys.has(getRuleKey(rule));
|
|
26
|
+
}
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
export class MkSubsumptionChecker implements RuleTransformerPlugin {
|
|
30
|
+
private totalRelations: ObjHashtable;
|
|
31
|
+
private definingRules = new Map<number, Rule>();
|
|
32
|
+
private hasNewTotalRule = false;
|
|
33
|
+
|
|
34
|
+
constructor(
|
|
35
|
+
private context: DatalogContext,
|
|
36
|
+
readonly priority: number,
|
|
37
|
+
) {
|
|
38
|
+
this.totalRelations = new ObjHashtable((decl) => context.manager.getDeclHash(decl));
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
private isTotalRule(rule: Rule) {
|
|
42
|
+
const manager = this.context.manager;
|
|
43
|
+
if (rule.tail.length !== 0) return false;
|
|
44
|
+
const headVars = new Set<number>();
|
|
45
|
+
for (const arg of manager.getArgs(rule.head)) {
|
|
46
|
+
if (manager.kinds[arg] !== KIND_VAR) return false;
|
|
47
|
+
if (headVars.has(manager.values[arg])) return false;
|
|
48
|
+
headVars.add(manager.values[arg]);
|
|
49
|
+
}
|
|
50
|
+
return true;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
private onDiscoveredTotalRelation(predicate: number, rule: Rule) {
|
|
54
|
+
this.totalRelations.add(predicate);
|
|
55
|
+
this.definingRules.set(predicate, rule);
|
|
56
|
+
this.hasNewTotalRule = true;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
private scanForTotalRules(rules: RuleSet) {
|
|
60
|
+
const manager = this.context.manager;
|
|
61
|
+
let isDiscovered = true;
|
|
62
|
+
while (isDiscovered) {
|
|
63
|
+
isDiscovered = false;
|
|
64
|
+
for (const rule of rules.rules) {
|
|
65
|
+
const head = rule.getDecl(manager);
|
|
66
|
+
if (!this.isTotalRule(rule) || this.totalRelations.has(head)) continue;
|
|
67
|
+
this.onDiscoveredTotalRelation(head, rule);
|
|
68
|
+
isDiscovered = true;
|
|
69
|
+
}
|
|
70
|
+
}
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
// Undefined drops the rule.
|
|
74
|
+
private transformRule(rule: Rule, index: RuleSubsumptionIndex): Rule | undefined {
|
|
75
|
+
const manager = this.context.manager;
|
|
76
|
+
if (rule.uninterpretedSize === 0) return rule;
|
|
77
|
+
const tail: number[] = [];
|
|
78
|
+
const isNegated: boolean[] = [];
|
|
79
|
+
for (let position = 0; position < rule.uninterpretedSize; position++) {
|
|
80
|
+
const atom = rule.tail[position];
|
|
81
|
+
const isNeg = rule.isNegated[position];
|
|
82
|
+
if (this.totalRelations.has(manager.decls[atom]) || index.isSubsumedAtom(atom)) {
|
|
83
|
+
if (isNeg) return undefined;
|
|
84
|
+
continue;
|
|
85
|
+
}
|
|
86
|
+
if (!isNeg && rule.head === atom) return undefined;
|
|
87
|
+
tail.push(atom);
|
|
88
|
+
isNegated.push(isNeg);
|
|
89
|
+
}
|
|
90
|
+
if (tail.length === rule.uninterpretedSize) return rule;
|
|
91
|
+
for (let position = rule.uninterpretedSize; position < rule.tail.length; position++) {
|
|
92
|
+
tail.push(rule.tail[position]);
|
|
93
|
+
isNegated.push(rule.isNegated[position]);
|
|
94
|
+
}
|
|
95
|
+
const ruleManager = this.context.ruleManager;
|
|
96
|
+
return ruleManager.fixUnboundVars(ruleManager.mk(rule.head, tail, isNegated, rule.name), true);
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
private transformRules(source: RuleSet, target: RuleSet) {
|
|
100
|
+
const manager = this.context.manager;
|
|
101
|
+
let isModified = false;
|
|
102
|
+
const includedTotalRelations = new Set<number>();
|
|
103
|
+
const index = new RuleSubsumptionIndex();
|
|
104
|
+
const rules = source.rules
|
|
105
|
+
.map((rule, position) => ({ rule, position }))
|
|
106
|
+
.sort(
|
|
107
|
+
(first, second) =>
|
|
108
|
+
first.rule.tail.length - second.rule.tail.length || first.position - second.position,
|
|
109
|
+
)
|
|
110
|
+
.map((entry) => entry.rule);
|
|
111
|
+
for (const rule of rules) {
|
|
112
|
+
const head = rule.getDecl(manager);
|
|
113
|
+
if (this.totalRelations.has(head)) {
|
|
114
|
+
if (!source.isOutputPredicate(head) || includedTotalRelations.has(head)) {
|
|
115
|
+
isModified = true;
|
|
116
|
+
continue;
|
|
117
|
+
}
|
|
118
|
+
const definingRule = this.definingRules.get(head) as Rule;
|
|
119
|
+
const totalityRule = this.transformRule(definingRule, index) as Rule;
|
|
120
|
+
if (totalityRule !== definingRule) isModified = true;
|
|
121
|
+
target.addRule(totalityRule);
|
|
122
|
+
includedTotalRelations.add(head);
|
|
123
|
+
continue;
|
|
124
|
+
}
|
|
125
|
+
const transformed = this.transformRule(rule, index);
|
|
126
|
+
if (transformed === undefined) {
|
|
127
|
+
isModified = true;
|
|
128
|
+
continue;
|
|
129
|
+
}
|
|
130
|
+
if (this.isTotalRule(transformed)) this.onDiscoveredTotalRelation(head, transformed);
|
|
131
|
+
if (index.isSubsumed(transformed)) {
|
|
132
|
+
isModified = true;
|
|
133
|
+
continue;
|
|
134
|
+
}
|
|
135
|
+
if (transformed !== rule) isModified = true;
|
|
136
|
+
target.addRule(transformed);
|
|
137
|
+
index.add(transformed);
|
|
138
|
+
}
|
|
139
|
+
target.inheritPredicates(source);
|
|
140
|
+
if (this.totalRelations.size > 0)
|
|
141
|
+
this.context.addGenericModelConverter(
|
|
142
|
+
[...this.totalRelations].map((decl) => ({ decl, def: manager.trueExpr })),
|
|
143
|
+
);
|
|
144
|
+
return isModified;
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
apply(source: RuleSet) {
|
|
148
|
+
if (!this.context.params.getBool("xform.subsumption_checker", true)) return undefined;
|
|
149
|
+
this.hasNewTotalRule = false;
|
|
150
|
+
this.scanForTotalRules(source);
|
|
151
|
+
this.hasNewTotalRule = false;
|
|
152
|
+
let result = new RuleSet(this.context);
|
|
153
|
+
const isModified = this.transformRules(source, result);
|
|
154
|
+
if (!this.hasNewTotalRule && !isModified) return undefined;
|
|
155
|
+
while (this.hasNewTotalRule) {
|
|
156
|
+
this.hasNewTotalRule = false;
|
|
157
|
+
const previous = result;
|
|
158
|
+
result = new RuleSet(this.context);
|
|
159
|
+
this.transformRules(previous, result);
|
|
160
|
+
}
|
|
161
|
+
return result;
|
|
162
|
+
}
|
|
163
|
+
}
|