tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- 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 +797 -782
- 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 +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -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 +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -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 +590 -311
- package/src/liveness.ts +180 -124
- 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 +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- 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 +119 -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 +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- 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 +224 -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 +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- 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 +31 -74
- 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 +1 -44
- 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 +0 -2
- 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 +1026 -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 +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -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 +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +26 -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 +112 -132
- 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 +345 -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 +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- 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 +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- 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 +91 -135
- 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 +22 -72
- 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 +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- 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 +309 -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 +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -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/qe-arith-plugin.ts +1098 -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 +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -23
- 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 +261 -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 +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- 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 +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- 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 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- 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 +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -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 +67 -185
- package/src/runtime.ts +26 -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 +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- 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 +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- 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 +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -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/typed-tier.ts +6535 -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 +832 -484
- 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,167 @@
|
|
|
1
|
+
import { ObjHashtable, ObjMap } from "../hashtable";
|
|
2
|
+
import type { DatalogContext } from "./dl-context";
|
|
3
|
+
import type { Rule } from "./dl-rule";
|
|
4
|
+
import { HornSubsumeModelConverter } from "./horn-subsume-model-converter";
|
|
5
|
+
import { RuleSet } from "./dl-rule-set";
|
|
6
|
+
import type { RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
7
|
+
|
|
8
|
+
export class MkCoiFilter implements RuleTransformerPlugin {
|
|
9
|
+
constructor(
|
|
10
|
+
private context: DatalogContext,
|
|
11
|
+
readonly priority = 45000,
|
|
12
|
+
) {}
|
|
13
|
+
|
|
14
|
+
apply(source: RuleSet) {
|
|
15
|
+
const topDown = this.topDown(source);
|
|
16
|
+
return this.bottomUp(topDown ?? source) ?? topDown;
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
// dataflow_engine<reachability_info>::run_bottom_up: whether the rules of a predicate can
|
|
20
|
+
// derive a fact, for the predicates the engine reached.
|
|
21
|
+
private runBottomUp(source: RuleSet) {
|
|
22
|
+
const manager = this.context.manager;
|
|
23
|
+
const getHash = (decl: number) => manager.getDeclHash(decl);
|
|
24
|
+
const facts = new ObjMap<boolean>(getHash);
|
|
25
|
+
const body2rules = new Map<number, Rule[]>();
|
|
26
|
+
const todos = [new ObjHashtable(getHash), new ObjHashtable(getHash)];
|
|
27
|
+
let todoIndex = 0;
|
|
28
|
+
for (const rule of source.rules) {
|
|
29
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
30
|
+
const decl = rule.getTailDecl(manager, index);
|
|
31
|
+
const users = body2rules.get(decl);
|
|
32
|
+
if (users === undefined) body2rules.set(decl, [rule]);
|
|
33
|
+
else users.push(rule);
|
|
34
|
+
}
|
|
35
|
+
const head = rule.getDecl(manager);
|
|
36
|
+
if (rule.positiveSize !== 0 || facts.get(head) === true) continue;
|
|
37
|
+
facts.set(head, true);
|
|
38
|
+
todos[todoIndex].add(head);
|
|
39
|
+
}
|
|
40
|
+
while (todos[todoIndex].size > 0) {
|
|
41
|
+
for (const decl of todos[todoIndex])
|
|
42
|
+
for (const rule of body2rules.get(decl) ?? []) {
|
|
43
|
+
const head = rule.getDecl(manager);
|
|
44
|
+
if (!facts.has(head)) facts.set(head, false);
|
|
45
|
+
if (facts.get(head) === true) continue;
|
|
46
|
+
let isFiring = true;
|
|
47
|
+
for (let index = 0; isFiring && index < rule.positiveSize; index++)
|
|
48
|
+
isFiring = facts.get(rule.getTailDecl(manager, index)) === true;
|
|
49
|
+
if (!isFiring) continue;
|
|
50
|
+
facts.set(head, true);
|
|
51
|
+
todos[1 - todoIndex].add(head);
|
|
52
|
+
}
|
|
53
|
+
todos[todoIndex] = new ObjHashtable(getHash);
|
|
54
|
+
todoIndex = 1 - todoIndex;
|
|
55
|
+
}
|
|
56
|
+
return facts;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
private bottomUp(source: RuleSet) {
|
|
60
|
+
const manager = this.context.manager;
|
|
61
|
+
const facts = this.runBottomUp(source);
|
|
62
|
+
const unreachable = new ObjHashtable((decl) => manager.getDeclHash(decl));
|
|
63
|
+
const result = new RuleSet(this.context);
|
|
64
|
+
result.inheritPredicates(source);
|
|
65
|
+
for (const rule of source.rules) {
|
|
66
|
+
let isContained = true;
|
|
67
|
+
let newTail: number[] | undefined;
|
|
68
|
+
let newNegated: boolean[] = [];
|
|
69
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
70
|
+
const isReachable = facts.get(rule.getTailDecl(manager, index)) === true;
|
|
71
|
+
if (!isReachable) unreachable.add(rule.getTailDecl(manager, index));
|
|
72
|
+
if (rule.isNegated[index]) {
|
|
73
|
+
if (!isReachable && newTail === undefined) {
|
|
74
|
+
newTail = rule.tail.slice(0, index);
|
|
75
|
+
newNegated = rule.isNegated.slice(0, index);
|
|
76
|
+
} else if (isReachable && newTail !== undefined) {
|
|
77
|
+
newTail.push(rule.tail[index]);
|
|
78
|
+
newNegated.push(true);
|
|
79
|
+
}
|
|
80
|
+
} else if (!isReachable) {
|
|
81
|
+
isContained = false;
|
|
82
|
+
break;
|
|
83
|
+
}
|
|
84
|
+
}
|
|
85
|
+
if (!isContained) continue;
|
|
86
|
+
if (newTail === undefined) {
|
|
87
|
+
result.addRule(rule);
|
|
88
|
+
continue;
|
|
89
|
+
}
|
|
90
|
+
for (let index = rule.uninterpretedSize; index < rule.tail.length; index++) {
|
|
91
|
+
newTail.push(rule.tail[index]);
|
|
92
|
+
newNegated.push(false);
|
|
93
|
+
}
|
|
94
|
+
result.addRule(this.context.ruleManager.mk(rule.head, newTail, newNegated, "", false));
|
|
95
|
+
}
|
|
96
|
+
if (result.rules.length === source.rules.length) return undefined;
|
|
97
|
+
result.close();
|
|
98
|
+
if (this.context.modelConverters !== undefined) {
|
|
99
|
+
for (const [decl, isReachable] of facts) if (!isReachable) unreachable.add(decl);
|
|
100
|
+
this.context.addGenericModelConverter(
|
|
101
|
+
[...unreachable].map((decl) => ({ decl, def: manager.falseExpr })),
|
|
102
|
+
);
|
|
103
|
+
}
|
|
104
|
+
return result;
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
// The predicates that the output predicates depend on.
|
|
108
|
+
private getTopDownReachable(source: RuleSet) {
|
|
109
|
+
const manager = this.context.manager;
|
|
110
|
+
const reachable = new Set<number>();
|
|
111
|
+
const todo: number[] = [];
|
|
112
|
+
for (const predicate of source.outputPredicates)
|
|
113
|
+
if (source.getPredicateRules(predicate).length > 0 && !reachable.has(predicate)) {
|
|
114
|
+
reachable.add(predicate);
|
|
115
|
+
todo.push(predicate);
|
|
116
|
+
}
|
|
117
|
+
for (let predicate = todo.pop(); predicate !== undefined; predicate = todo.pop())
|
|
118
|
+
for (const rule of source.getPredicateRules(predicate))
|
|
119
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
120
|
+
const tail = rule.getTailDecl(manager, index);
|
|
121
|
+
if (reachable.has(tail)) continue;
|
|
122
|
+
reachable.add(tail);
|
|
123
|
+
todo.push(tail);
|
|
124
|
+
}
|
|
125
|
+
return reachable;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
private topDown(source: RuleSet) {
|
|
129
|
+
const manager = this.context.manager;
|
|
130
|
+
const reachable = this.getTopDownReachable(source);
|
|
131
|
+
const result = new RuleSet(this.context);
|
|
132
|
+
result.inheritPredicates(source);
|
|
133
|
+
const seen = new Set<number>();
|
|
134
|
+
const prunedPreds = new ObjHashtable((decl) => manager.getDeclHash(decl));
|
|
135
|
+
for (const rule of source.rules) {
|
|
136
|
+
const predicate = rule.getDecl(manager);
|
|
137
|
+
if (seen.has(predicate)) continue;
|
|
138
|
+
seen.add(predicate);
|
|
139
|
+
if (reachable.has(predicate)) {
|
|
140
|
+
for (const kept of source.getPredicateRules(predicate)) result.addRule(kept);
|
|
141
|
+
continue;
|
|
142
|
+
}
|
|
143
|
+
if (this.context.modelConverters === undefined) continue;
|
|
144
|
+
for (const pruned of source.getPredicateRules(predicate))
|
|
145
|
+
for (let index = 0; index < pruned.uninterpretedSize; index++)
|
|
146
|
+
if (pruned.getTailDecl(manager, index) !== predicate) return undefined;
|
|
147
|
+
prunedPreds.add(predicate);
|
|
148
|
+
}
|
|
149
|
+
if (result.rules.length === source.rules.length) return undefined;
|
|
150
|
+
if (this.context.modelConverters !== undefined && prunedPreds.size > 0) {
|
|
151
|
+
const horn = new HornSubsumeModelConverter(this.context);
|
|
152
|
+
this.context.addGenericModelConverter(
|
|
153
|
+
[...prunedPreds].map((decl) => ({
|
|
154
|
+
decl,
|
|
155
|
+
def: manager.mkOr(
|
|
156
|
+
source
|
|
157
|
+
.getPredicateRules(decl)
|
|
158
|
+
.map((rule) =>
|
|
159
|
+
horn.mkHorn(rule.head, manager.mkAnd(rule.tail.slice(rule.uninterpretedSize))),
|
|
160
|
+
),
|
|
161
|
+
),
|
|
162
|
+
})),
|
|
163
|
+
);
|
|
164
|
+
}
|
|
165
|
+
return result;
|
|
166
|
+
}
|
|
167
|
+
}
|
|
@@ -0,0 +1,125 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { type AstManager, KIND_APP, KIND_QUANTIFIER, OP_ITE, SORT_BOOL } from "../ast";
|
|
3
|
+
import { flattenAndVector, getNumExprs } from "../ast-util";
|
|
4
|
+
import { RefVector } from "../ref-vector";
|
|
5
|
+
import { type Rewrite, RewriterTpl } from "../rewriter-tpl";
|
|
6
|
+
import type { DatalogContext } from "./dl-context";
|
|
7
|
+
import type { Rule } from "./dl-rule";
|
|
8
|
+
import { RuleSet } from "./dl-rule-set";
|
|
9
|
+
import type { RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
10
|
+
|
|
11
|
+
class BlastTermIte extends RewriterTpl {
|
|
12
|
+
numFresh = 0;
|
|
13
|
+
|
|
14
|
+
constructor(
|
|
15
|
+
manager: AstManager,
|
|
16
|
+
private maxInflation: number,
|
|
17
|
+
private initTermSize: number,
|
|
18
|
+
) {
|
|
19
|
+
super(manager);
|
|
20
|
+
}
|
|
21
|
+
|
|
22
|
+
reduceApp(decl: number, args: number[], sort: number): number | Rewrite {
|
|
23
|
+
const manager = this.manager;
|
|
24
|
+
if (decl === OP_ITE) return -1;
|
|
25
|
+
// The product wraps as Z3's unsigned one does.
|
|
26
|
+
if (
|
|
27
|
+
this.maxInflation < 0xffffffff &&
|
|
28
|
+
this.initTermSize > 0 &&
|
|
29
|
+
Math.imul(this.maxInflation, this.initTermSize) >>> 0 < this.numFresh
|
|
30
|
+
)
|
|
31
|
+
return -1;
|
|
32
|
+
for (let index = 0; index < args.length; index++) {
|
|
33
|
+
const arg = args[index];
|
|
34
|
+
if (manager.sorts[arg] === SORT_BOOL || manager.getOp(arg) !== OP_ITE) continue;
|
|
35
|
+
const thenArgs = [...args];
|
|
36
|
+
thenArgs[index] = manager.getArg(arg, 1);
|
|
37
|
+
const thenApp = manager.mkApp(decl, thenArgs, sort);
|
|
38
|
+
if (manager.getArg(arg, 1) === manager.getArg(arg, 2)) {
|
|
39
|
+
manager.incRef(thenApp);
|
|
40
|
+
return { expr: thenApp, depth: 1 };
|
|
41
|
+
}
|
|
42
|
+
const elseArgs = [...args];
|
|
43
|
+
elseArgs[index] = manager.getArg(arg, 2);
|
|
44
|
+
const result = manager.mkApp(
|
|
45
|
+
OP_ITE,
|
|
46
|
+
[manager.getArg(arg, 0), thenApp, manager.mkApp(decl, elseArgs, sort)],
|
|
47
|
+
sort,
|
|
48
|
+
);
|
|
49
|
+
manager.incRef(result);
|
|
50
|
+
this.numFresh++;
|
|
51
|
+
return { expr: result, depth: 3 };
|
|
52
|
+
}
|
|
53
|
+
return -1;
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
// The result comes with a reference.
|
|
58
|
+
export const blastTermIte = (manager: AstManager, fml: number, maxInflation: number) => {
|
|
59
|
+
const blaster = new BlastTermIte(manager, maxInflation, getNumExprs(manager, fml));
|
|
60
|
+
const result = blaster.rewrite(fml);
|
|
61
|
+
blaster.release();
|
|
62
|
+
return result;
|
|
63
|
+
};
|
|
64
|
+
|
|
65
|
+
const hasTermIte = (manager: AstManager, root: number) => {
|
|
66
|
+
const visited = new Set<number>();
|
|
67
|
+
const todo = [root];
|
|
68
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
69
|
+
if (visited.has(expr)) continue;
|
|
70
|
+
visited.add(expr);
|
|
71
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
|
|
72
|
+
if (manager.kinds[expr] !== KIND_APP) continue;
|
|
73
|
+
if (manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL) return true;
|
|
74
|
+
manager.pushArgs(expr, todo);
|
|
75
|
+
}
|
|
76
|
+
return false;
|
|
77
|
+
};
|
|
78
|
+
|
|
79
|
+
export class MkElimTermIte implements RuleTransformerPlugin {
|
|
80
|
+
constructor(
|
|
81
|
+
private context: DatalogContext,
|
|
82
|
+
readonly priority: number,
|
|
83
|
+
) {}
|
|
84
|
+
|
|
85
|
+
private elim(rule: Rule, rules: RuleSet) {
|
|
86
|
+
const context = this.context;
|
|
87
|
+
const manager = context.manager;
|
|
88
|
+
const conjs = new RefVector(manager);
|
|
89
|
+
for (const literal of rule.tail.slice(rule.uninterpretedSize)) conjs.push(literal);
|
|
90
|
+
flattenAndVector(manager, conjs);
|
|
91
|
+
const body = manager.mkAnd(conjs.items);
|
|
92
|
+
manager.incRef(body);
|
|
93
|
+
conjs.reset();
|
|
94
|
+
if (!hasTermIte(manager, body)) {
|
|
95
|
+
rules.addRule(rule);
|
|
96
|
+
return false;
|
|
97
|
+
}
|
|
98
|
+
const blasted = blastTermIte(
|
|
99
|
+
manager,
|
|
100
|
+
body,
|
|
101
|
+
context.params.getUint("xform.elim_term_ite.inflation", 3),
|
|
102
|
+
);
|
|
103
|
+
const simplified = context.simplify(blasted);
|
|
104
|
+
if (hasTermIte(manager, simplified))
|
|
105
|
+
throw new SmtUnsupportedError("eliminating the term if-then-else of a Horn rule");
|
|
106
|
+
conjs.push(simplified);
|
|
107
|
+
flattenAndVector(manager, conjs);
|
|
108
|
+
const tail = [
|
|
109
|
+
...rule.tail.slice(0, rule.uninterpretedSize),
|
|
110
|
+
...conjs.items.map((conj) => context.ruleManager.ensureApp(conj)),
|
|
111
|
+
];
|
|
112
|
+
conjs.reset();
|
|
113
|
+
rules.addRule(context.ruleManager.mk(rule.head, tail, [], rule.name, false));
|
|
114
|
+
return true;
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
apply(source: RuleSet) {
|
|
118
|
+
if (!this.context.params.getBool("xform.elim_term_ite", false)) return undefined;
|
|
119
|
+
const rules = new RuleSet(this.context);
|
|
120
|
+
rules.inheritPredicates(source);
|
|
121
|
+
let isChanged = false;
|
|
122
|
+
for (const rule of source.rules) if (this.elim(rule, rules)) isChanged = true;
|
|
123
|
+
return isChanged ? rules : undefined;
|
|
124
|
+
}
|
|
125
|
+
}
|
|
@@ -0,0 +1,299 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
KIND_VAR,
|
|
5
|
+
OP_AND,
|
|
6
|
+
OP_EQ,
|
|
7
|
+
OP_NOT,
|
|
8
|
+
OP_OR,
|
|
9
|
+
SORT_BOOL,
|
|
10
|
+
} from "../ast";
|
|
11
|
+
import { flattenAndVector } from "../ast-util";
|
|
12
|
+
import { RefVector } from "../ref-vector";
|
|
13
|
+
import { type Rewrite, RewriterTpl } from "../rewriter-tpl";
|
|
14
|
+
import type { DatalogContext } from "./dl-context";
|
|
15
|
+
import type { Rule } from "./dl-rule";
|
|
16
|
+
import { RuleSet } from "./dl-rule-set";
|
|
17
|
+
import { removeDuplicateTails, type RuleTransformerPlugin } from "./dl-rule-transformer";
|
|
18
|
+
import { Substitution } from "./substitution";
|
|
19
|
+
|
|
20
|
+
const compare = (first: number, second: number) => (first > second ? 1 : first === second ? 0 : -1);
|
|
21
|
+
|
|
22
|
+
class Normalizer extends RewriterTpl {
|
|
23
|
+
constructor(
|
|
24
|
+
manager: AstManager,
|
|
25
|
+
private context: DatalogContext,
|
|
26
|
+
) {
|
|
27
|
+
super(manager);
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
private stripNot(expr: number) {
|
|
31
|
+
const manager = this.manager;
|
|
32
|
+
return manager.isNot(expr)
|
|
33
|
+
? { expr: manager.getArg(expr, 0), isNeg: true }
|
|
34
|
+
: { expr, isNeg: false };
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
private compareExprs(firstExpr: number, secondExpr: number, depth: number): number {
|
|
38
|
+
const manager = this.manager;
|
|
39
|
+
if (firstExpr === secondExpr) return 0;
|
|
40
|
+
const first = this.stripNot(firstExpr);
|
|
41
|
+
const second = this.stripNot(secondExpr);
|
|
42
|
+
if (first.expr === second.expr) return compare(Number(first.isNeg), Number(second.isNeg));
|
|
43
|
+
const isFirstApp = manager.kinds[first.expr] === KIND_APP;
|
|
44
|
+
const isSecondApp = manager.kinds[second.expr] === KIND_APP;
|
|
45
|
+
if (!isFirstApp && !isSecondApp)
|
|
46
|
+
return compare(manager.ids[first.expr], manager.ids[second.expr]);
|
|
47
|
+
if (!isFirstApp) return -1;
|
|
48
|
+
if (!isSecondApp) return 1;
|
|
49
|
+
const firstDecl = manager.getDeclId(first.expr);
|
|
50
|
+
const secondDecl = manager.getDeclId(second.expr);
|
|
51
|
+
if (manager.decls[first.expr] !== manager.decls[second.expr] || firstDecl !== secondDecl)
|
|
52
|
+
return compare(firstDecl, secondDecl);
|
|
53
|
+
const numArgs = manager.getNumArgs(first.expr);
|
|
54
|
+
if (numArgs !== manager.getNumArgs(second.expr))
|
|
55
|
+
return compare(numArgs, manager.getNumArgs(second.expr));
|
|
56
|
+
if (depth === 0) return compare(manager.ids[first.expr], manager.ids[second.expr]);
|
|
57
|
+
let negComparison = 0;
|
|
58
|
+
for (let index = 0; index < numArgs; index++) {
|
|
59
|
+
const firstArg = this.stripNot(manager.getArg(first.expr, index));
|
|
60
|
+
const secondArg = this.stripNot(manager.getArg(second.expr, index));
|
|
61
|
+
if (negComparison === 0 && firstArg.isNeg !== secondArg.isNeg)
|
|
62
|
+
negComparison = firstArg.isNeg ? -1 : 1;
|
|
63
|
+
const result = this.compareExprs(firstArg.expr, secondArg.expr, depth - 1);
|
|
64
|
+
if (result !== 0) return result;
|
|
65
|
+
}
|
|
66
|
+
if (negComparison !== 0) return negComparison;
|
|
67
|
+
return compare(manager.ids[first.expr], manager.ids[second.expr]);
|
|
68
|
+
}
|
|
69
|
+
|
|
70
|
+
private getPair(expr: number, isConjunction: boolean) {
|
|
71
|
+
const manager = this.manager;
|
|
72
|
+
return manager.getOp(expr) === (isConjunction ? OP_AND : OP_OR) &&
|
|
73
|
+
manager.getNumArgs(expr) === 2
|
|
74
|
+
? manager.getArgs(expr)
|
|
75
|
+
: undefined;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
private detectEquivalence(first: number[], second: number[], isInsideDisjunction: boolean) {
|
|
79
|
+
const manager = this.manager;
|
|
80
|
+
if (manager.isNot(first[0]) === manager.isNot(second[0])) return -1;
|
|
81
|
+
if (manager.isNot(first[1]) === manager.isNot(second[1])) return -1;
|
|
82
|
+
let firstBare = -1;
|
|
83
|
+
for (const [one, other] of [
|
|
84
|
+
[first[0], second[0]],
|
|
85
|
+
[second[0], first[0]],
|
|
86
|
+
])
|
|
87
|
+
if (manager.isNot(one)) {
|
|
88
|
+
firstBare = manager.getArg(one, 0);
|
|
89
|
+
if (other !== firstBare) return -1;
|
|
90
|
+
}
|
|
91
|
+
let secondBare = -1;
|
|
92
|
+
for (const [one, other] of [
|
|
93
|
+
[first[1], second[1]],
|
|
94
|
+
[second[1], first[1]],
|
|
95
|
+
])
|
|
96
|
+
if (manager.isNot(one)) {
|
|
97
|
+
secondBare = manager.getArg(one, 0);
|
|
98
|
+
if (other !== secondBare) return -1;
|
|
99
|
+
}
|
|
100
|
+
if (manager.sorts[firstBare] !== SORT_BOOL || manager.sorts[secondBare] !== SORT_BOOL)
|
|
101
|
+
return -1;
|
|
102
|
+
const isNegsTogether = manager.isNot(first[0]) === manager.isNot(first[1]);
|
|
103
|
+
return isNegsTogether === isInsideDisjunction
|
|
104
|
+
? manager.mkEq(firstBare, secondBare)
|
|
105
|
+
: manager.mkEq(firstBare, manager.mkNot(secondBare));
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
private detectEquivalences(args: number[], isInsideDisjunction: boolean) {
|
|
109
|
+
let previous: number[] | undefined;
|
|
110
|
+
let previousIndex = 0;
|
|
111
|
+
let writeIndex = 0;
|
|
112
|
+
let readIndex = 0;
|
|
113
|
+
while (readIndex < args.length) {
|
|
114
|
+
const expr = args[readIndex];
|
|
115
|
+
const pair = this.getPair(expr, isInsideDisjunction);
|
|
116
|
+
if (pair !== undefined) {
|
|
117
|
+
const equivalence =
|
|
118
|
+
previous === undefined ? -1 : this.detectEquivalence(previous, pair, isInsideDisjunction);
|
|
119
|
+
if (equivalence !== -1) {
|
|
120
|
+
previous = undefined;
|
|
121
|
+
args[previousIndex] = equivalence;
|
|
122
|
+
readIndex++;
|
|
123
|
+
continue;
|
|
124
|
+
}
|
|
125
|
+
previous = pair;
|
|
126
|
+
previousIndex = writeIndex;
|
|
127
|
+
} else previous = undefined;
|
|
128
|
+
args[writeIndex++] = expr;
|
|
129
|
+
readIndex++;
|
|
130
|
+
}
|
|
131
|
+
args.length = writeIndex;
|
|
132
|
+
return readIndex !== writeIndex;
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
reduceApp(decl: number, args: number[], _sort: number): number | Rewrite {
|
|
136
|
+
const manager = this.manager;
|
|
137
|
+
const op = manager.funcDecls[decl].op;
|
|
138
|
+
if (op === OP_NOT) {
|
|
139
|
+
const argOp = manager.getOp(args[0]);
|
|
140
|
+
if (argOp !== OP_AND && argOp !== OP_OR) return -1;
|
|
141
|
+
const negated = manager.getArgs(args[0]).map((arg) => this.context.rewriter.mkNot(arg));
|
|
142
|
+
const result = argOp === OP_AND ? manager.mkOr(negated) : manager.mkAnd(negated);
|
|
143
|
+
manager.incRef(result);
|
|
144
|
+
return { expr: result, depth: 2 };
|
|
145
|
+
}
|
|
146
|
+
if (op !== OP_AND && op !== OP_OR) return -1;
|
|
147
|
+
const result = (() => {
|
|
148
|
+
if (args.length === 0)
|
|
149
|
+
return { expr: op === OP_AND ? manager.trueExpr : manager.falseExpr, isRewritten: false };
|
|
150
|
+
if (args.length === 1) return { expr: args[0], isRewritten: false };
|
|
151
|
+
const sorted = [...args].sort((first, second) =>
|
|
152
|
+
this.compareExprs(first, second, 4) === -1
|
|
153
|
+
? -1
|
|
154
|
+
: this.compareExprs(second, first, 4) === -1
|
|
155
|
+
? 1
|
|
156
|
+
: 0,
|
|
157
|
+
);
|
|
158
|
+
const unique = sorted.filter((arg, index) => index === 0 || arg !== sorted[index - 1]);
|
|
159
|
+
const isRewritten = this.detectEquivalences(unique, op === OP_OR);
|
|
160
|
+
return {
|
|
161
|
+
expr:
|
|
162
|
+
unique.length === 1
|
|
163
|
+
? unique[0]
|
|
164
|
+
: op === OP_AND
|
|
165
|
+
? manager.mkAnd(unique)
|
|
166
|
+
: manager.mkOr(unique),
|
|
167
|
+
isRewritten,
|
|
168
|
+
};
|
|
169
|
+
})();
|
|
170
|
+
manager.incRef(result.expr);
|
|
171
|
+
return result.isRewritten ? { expr: result.expr, depth: 1 } : result.expr;
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
export class MkInterpTailSimplifier implements RuleTransformerPlugin {
|
|
176
|
+
private normalizer: Normalizer;
|
|
177
|
+
|
|
178
|
+
constructor(
|
|
179
|
+
private context: DatalogContext,
|
|
180
|
+
readonly priority = 40000,
|
|
181
|
+
) {
|
|
182
|
+
this.normalizer = new Normalizer(context.manager, context);
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
private simplifyExpr(expr: number) {
|
|
186
|
+
const first = this.context.simplify(expr);
|
|
187
|
+
const normalized = this.normalizer.rewrite(first);
|
|
188
|
+
return this.context.simplify(normalized);
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
private propagateVariableEquivalences(rule: Rule): Rule | undefined {
|
|
192
|
+
const context = this.context;
|
|
193
|
+
const manager = context.manager;
|
|
194
|
+
if (!context.params.getBool("xform.tail_simplifier_pve", true)) return undefined;
|
|
195
|
+
if (rule.uninterpretedSize === rule.tail.length) return undefined;
|
|
196
|
+
const todo = rule.tail.slice(rule.uninterpretedSize);
|
|
197
|
+
const subst = new Substitution(manager);
|
|
198
|
+
let isFound = false;
|
|
199
|
+
const isFlex = (expr: number) => manager.kinds[expr] === KIND_VAR || manager.isValue(expr);
|
|
200
|
+
const tryUnify = (first: number, second: number) => {
|
|
201
|
+
if (subst.unify(subst.apply(first, 0), 0, subst.apply(second, 0), 0)) isFound = true;
|
|
202
|
+
};
|
|
203
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
204
|
+
let isNeg = manager.isNot(current);
|
|
205
|
+
const term = isNeg ? manager.getArg(current, 0) : current;
|
|
206
|
+
const op = manager.getOp(term);
|
|
207
|
+
if (manager.kinds[term] === KIND_VAR)
|
|
208
|
+
tryUnify(term, isNeg ? manager.falseExpr : manager.trueExpr);
|
|
209
|
+
else if (!isNeg && op === OP_AND) manager.pushArgs(term, todo);
|
|
210
|
+
else if (
|
|
211
|
+
!isNeg &&
|
|
212
|
+
op === OP_EQ &&
|
|
213
|
+
isFlex(manager.getArg(term, 0)) &&
|
|
214
|
+
isFlex(manager.getArg(term, 1))
|
|
215
|
+
)
|
|
216
|
+
tryUnify(manager.getArg(term, 0), manager.getArg(term, 1));
|
|
217
|
+
else if (op === OP_EQ && manager.sorts[manager.getArg(term, 0)] === SORT_BOOL) {
|
|
218
|
+
let first = manager.getArg(term, 0);
|
|
219
|
+
let second = manager.getArg(term, 1);
|
|
220
|
+
while (manager.isNot(first)) {
|
|
221
|
+
first = manager.getArg(first, 0);
|
|
222
|
+
isNeg = !isNeg;
|
|
223
|
+
}
|
|
224
|
+
while (manager.isNot(second)) {
|
|
225
|
+
second = manager.getArg(second, 0);
|
|
226
|
+
isNeg = !isNeg;
|
|
227
|
+
}
|
|
228
|
+
if (manager.kinds[first] !== KIND_VAR) [first, second] = [second, first];
|
|
229
|
+
if (!isFlex(first) || !isFlex(second)) continue;
|
|
230
|
+
if (manager.kinds[first] === KIND_VAR && !isNeg) tryUnify(first, second);
|
|
231
|
+
else if (manager.kinds[first] === KIND_VAR && isNeg && manager.isTrue(second))
|
|
232
|
+
tryUnify(first, manager.falseExpr);
|
|
233
|
+
else if (manager.kinds[first] === KIND_VAR && isNeg && manager.isFalse(second))
|
|
234
|
+
tryUnify(first, manager.trueExpr);
|
|
235
|
+
}
|
|
236
|
+
}
|
|
237
|
+
if (!isFound) return undefined;
|
|
238
|
+
const tail = rule.tail.map((literal) => subst.apply(literal, 0));
|
|
239
|
+
const isNegated = [...rule.isNegated];
|
|
240
|
+
removeDuplicateTails(tail, isNegated);
|
|
241
|
+
const result = context.ruleManager.mk(subst.apply(rule.head, 0), tail, isNegated, rule.name);
|
|
242
|
+
context.ruleManager.normVars(result);
|
|
243
|
+
return result;
|
|
244
|
+
}
|
|
245
|
+
|
|
246
|
+
// Undefined drops the rule, whose interpreted tail simplified to false.
|
|
247
|
+
transformRule(original: Rule): Rule | undefined {
|
|
248
|
+
const context = this.context;
|
|
249
|
+
const manager = context.manager;
|
|
250
|
+
if (context.ruleManager.hasQuantifiers(original)) return original;
|
|
251
|
+
let rule = original;
|
|
252
|
+
for (;;) {
|
|
253
|
+
const uninterpretedSize = rule.uninterpretedSize;
|
|
254
|
+
if (uninterpretedSize === rule.tail.length) return rule;
|
|
255
|
+
const tail = rule.tail.slice(0, uninterpretedSize);
|
|
256
|
+
const isNegated = rule.isNegated.slice(0, uninterpretedSize);
|
|
257
|
+
const isSingle = uninterpretedSize + 1 === rule.tail.length;
|
|
258
|
+
const interpretedTail = isSingle
|
|
259
|
+
? rule.tail[uninterpretedSize]
|
|
260
|
+
: manager.mkAnd(rule.tail.slice(uninterpretedSize));
|
|
261
|
+
const simplified = this.simplifyExpr(interpretedTail);
|
|
262
|
+
const isModified = !isSingle || interpretedTail !== simplified;
|
|
263
|
+
if (manager.isFalse(simplified)) return undefined;
|
|
264
|
+
let result = rule;
|
|
265
|
+
if (isModified) {
|
|
266
|
+
const conjs = new RefVector(manager);
|
|
267
|
+
conjs.push(simplified);
|
|
268
|
+
flattenAndVector(manager, conjs);
|
|
269
|
+
for (const conj of conjs.items) {
|
|
270
|
+
tail.push(context.ruleManager.ensureApp(conj));
|
|
271
|
+
isNegated.push(false);
|
|
272
|
+
}
|
|
273
|
+
conjs.reset();
|
|
274
|
+
result = context.ruleManager.mk(rule.head, tail, isNegated, rule.name);
|
|
275
|
+
}
|
|
276
|
+
const propagated = this.propagateVariableEquivalences(result);
|
|
277
|
+
if (propagated === undefined) return result;
|
|
278
|
+
rule = propagated;
|
|
279
|
+
}
|
|
280
|
+
}
|
|
281
|
+
|
|
282
|
+
apply(source: RuleSet) {
|
|
283
|
+
if (source.rules.length === 0) return undefined;
|
|
284
|
+
const result = new RuleSet(this.context);
|
|
285
|
+
let isModified = false;
|
|
286
|
+
for (const rule of source.rules) {
|
|
287
|
+
const transformed = this.transformRule(rule);
|
|
288
|
+
if (transformed === undefined) {
|
|
289
|
+
isModified = true;
|
|
290
|
+
continue;
|
|
291
|
+
}
|
|
292
|
+
if (transformed !== rule) isModified = true;
|
|
293
|
+
result.addRule(transformed);
|
|
294
|
+
}
|
|
295
|
+
if (!isModified) return undefined;
|
|
296
|
+
result.inheritPredicates(source);
|
|
297
|
+
return result;
|
|
298
|
+
}
|
|
299
|
+
}
|