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,107 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_USER,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_VAR,
|
|
6
|
+
OP_DT_ACCESSOR,
|
|
7
|
+
OP_DT_CONSTRUCTOR,
|
|
8
|
+
OP_DT_IS,
|
|
9
|
+
OP_DT_RECOGNISER,
|
|
10
|
+
} from "./ast";
|
|
11
|
+
import { getSubterms, isDefinedApp } from "./recfun-decl-plugin";
|
|
12
|
+
import type { Rewrite } from "./rewriter-tpl";
|
|
13
|
+
import { VarSubst } from "./var-subst";
|
|
14
|
+
|
|
15
|
+
const getRhs = (manager: AstManager, decl: number) => manager.recFunDefs.get(decl)?.rhs ?? -1;
|
|
16
|
+
|
|
17
|
+
const isFunMacro = (manager: AstManager, decl: number) =>
|
|
18
|
+
manager.recFunDefs.get(decl)?.cases.length === 1;
|
|
19
|
+
|
|
20
|
+
// Leaves cycles through unconditional bodies to the resource-limited theory solver.
|
|
21
|
+
const isOnMacroCycle = (manager: AstManager, decl: number) => {
|
|
22
|
+
const todo = [decl];
|
|
23
|
+
const visited = new Set(todo);
|
|
24
|
+
for (let index = 0; index < todo.length; index++) {
|
|
25
|
+
for (const term of getSubterms(manager, getRhs(manager, todo[index]))) {
|
|
26
|
+
if (!isDefinedApp(manager, term)) continue;
|
|
27
|
+
const callee = manager.decls[term];
|
|
28
|
+
if (callee === decl) return true;
|
|
29
|
+
if (isFunMacro(manager, callee) && !visited.has(callee)) {
|
|
30
|
+
visited.add(callee);
|
|
31
|
+
todo.push(callee);
|
|
32
|
+
}
|
|
33
|
+
}
|
|
34
|
+
}
|
|
35
|
+
return false;
|
|
36
|
+
};
|
|
37
|
+
|
|
38
|
+
const isDecreasingArg = (
|
|
39
|
+
manager: AstManager,
|
|
40
|
+
decl: number,
|
|
41
|
+
position: number,
|
|
42
|
+
isAnyAccessorAllowed: boolean,
|
|
43
|
+
) => {
|
|
44
|
+
const body = getRhs(manager, decl);
|
|
45
|
+
if (body === -1 || manager.hasQuantifierFlags[body]) return false;
|
|
46
|
+
const index = manager.funcDecls[decl].domain.length - position - 1;
|
|
47
|
+
const isParameter = (expr: number) =>
|
|
48
|
+
manager.kinds[expr] === KIND_VAR && manager.values[expr] === index;
|
|
49
|
+
const subterms = getSubterms(manager, body);
|
|
50
|
+
let decreasing = -1;
|
|
51
|
+
for (const term of subterms) {
|
|
52
|
+
if (manager.kinds[term] !== KIND_APP || !manager.getArgs(term).some(isParameter)) continue;
|
|
53
|
+
const op = manager.getOp(term);
|
|
54
|
+
if (op !== OP_DT_ACCESSOR && op !== OP_DT_IS && op !== OP_DT_RECOGNISER) return false;
|
|
55
|
+
if (op !== OP_DT_ACCESSOR) continue;
|
|
56
|
+
if (!isAnyAccessorAllowed && decreasing !== -1 && manager.decls[term] !== decreasing)
|
|
57
|
+
return false;
|
|
58
|
+
decreasing = manager.decls[term];
|
|
59
|
+
}
|
|
60
|
+
if (!isAnyAccessorAllowed) return true;
|
|
61
|
+
if (decreasing === -1) return false;
|
|
62
|
+
for (const term of subterms) {
|
|
63
|
+
if (manager.kinds[term] !== KIND_APP || manager.decls[term] !== decl) continue;
|
|
64
|
+
let arg = manager.getArg(term, position);
|
|
65
|
+
let isStrict = false;
|
|
66
|
+
while (manager.getOp(arg) === OP_DT_ACCESSOR) {
|
|
67
|
+
arg = manager.getArg(arg, 0);
|
|
68
|
+
isStrict = true;
|
|
69
|
+
}
|
|
70
|
+
if (!isStrict || !isParameter(arg)) return false;
|
|
71
|
+
}
|
|
72
|
+
return true;
|
|
73
|
+
};
|
|
74
|
+
|
|
75
|
+
// recfun_rewriter::mk_app_core, which unfolds a body with uninterpreted functions only with
|
|
76
|
+
// unfold_recursive_functions, which only the model evaluator sets.
|
|
77
|
+
export const mkRecFunApp = (
|
|
78
|
+
manager: AstManager,
|
|
79
|
+
decl: number,
|
|
80
|
+
args: number[],
|
|
81
|
+
isUnfolding = false,
|
|
82
|
+
): Rewrite | undefined => {
|
|
83
|
+
const body = getRhs(manager, decl);
|
|
84
|
+
if (args.length === 0 || body === -1) return undefined;
|
|
85
|
+
if (isFunMacro(manager, decl) && isOnMacroCycle(manager, decl)) return undefined;
|
|
86
|
+
if (
|
|
87
|
+
!isUnfolding &&
|
|
88
|
+
getSubterms(manager, body).some(
|
|
89
|
+
(term) => manager.kinds[term] === KIND_APP && manager.getFamily(term) === FAMILY_USER,
|
|
90
|
+
)
|
|
91
|
+
)
|
|
92
|
+
return undefined;
|
|
93
|
+
const isSafe =
|
|
94
|
+
args.every((arg) => manager.isValue(arg)) ||
|
|
95
|
+
(!manager.hasQuantifierFlags[body] &&
|
|
96
|
+
args.some(
|
|
97
|
+
(arg, position) =>
|
|
98
|
+
manager.getOp(arg) === OP_DT_CONSTRUCTOR &&
|
|
99
|
+
isDecreasingArg(manager, decl, position, manager.isGroundApp(arg)),
|
|
100
|
+
));
|
|
101
|
+
if (!isSafe) return undefined;
|
|
102
|
+
const subst = new VarSubst(manager, true);
|
|
103
|
+
const result = subst.apply(body, args);
|
|
104
|
+
subst.release();
|
|
105
|
+
manager.releaseLater(result);
|
|
106
|
+
return { expr: result, depth: Infinity };
|
|
107
|
+
};
|
|
@@ -0,0 +1,225 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_USER,
|
|
5
|
+
KIND_APP,
|
|
6
|
+
KIND_QUANTIFIER,
|
|
7
|
+
OP_AS_ARRAY,
|
|
8
|
+
OP_BADD,
|
|
9
|
+
OP_BV_NUM,
|
|
10
|
+
OP_ITE,
|
|
11
|
+
} from "./ast";
|
|
12
|
+
import type { Definition, Goal } from "./goal";
|
|
13
|
+
import { combineHash, hashU } from "./hash";
|
|
14
|
+
import { ObjMap } from "./hashtable";
|
|
15
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
16
|
+
|
|
17
|
+
const GOLDEN_RATIO = 0x9e3779b9;
|
|
18
|
+
|
|
19
|
+
interface ArgFuncs {
|
|
20
|
+
byKey: Map<string, number>;
|
|
21
|
+
funcs: ObjMap<number>;
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
const forEachSubterm = (manager: AstManager, goal: Goal, visit: (expr: number) => void) => {
|
|
25
|
+
const visited = new Set<number>();
|
|
26
|
+
for (const form of goal.forms.items) {
|
|
27
|
+
manager.limit.checkpoint();
|
|
28
|
+
const todo = [form];
|
|
29
|
+
while (todo.length > 0) {
|
|
30
|
+
const expr = todo[todo.length - 1];
|
|
31
|
+
if (visited.has(expr)) {
|
|
32
|
+
todo.pop();
|
|
33
|
+
continue;
|
|
34
|
+
}
|
|
35
|
+
const children =
|
|
36
|
+
manager.kinds[expr] === KIND_QUANTIFIER
|
|
37
|
+
? [
|
|
38
|
+
manager.getQuantifier(expr).body,
|
|
39
|
+
...manager.getQuantifier(expr).patterns,
|
|
40
|
+
...manager.getQuantifier(expr).noPatterns,
|
|
41
|
+
]
|
|
42
|
+
: manager.kinds[expr] === KIND_APP
|
|
43
|
+
? manager.getArgs(expr)
|
|
44
|
+
: [];
|
|
45
|
+
const pending = children.filter((child) => !visited.has(child));
|
|
46
|
+
if (pending.length > 0) {
|
|
47
|
+
todo.push(...pending.toReversed());
|
|
48
|
+
continue;
|
|
49
|
+
}
|
|
50
|
+
todo.pop();
|
|
51
|
+
visited.add(expr);
|
|
52
|
+
visit(expr);
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
};
|
|
56
|
+
|
|
57
|
+
// may_be_unique: the base of a bit-vector offset, or the term itself, is null for a unique value.
|
|
58
|
+
const getUniqueBase = (manager: AstManager, expr: number) => {
|
|
59
|
+
if (manager.isUniqueValue(expr)) return null;
|
|
60
|
+
const isOffset =
|
|
61
|
+
manager.getOp(expr) === OP_BADD &&
|
|
62
|
+
manager.getNumArgs(expr) === 2 &&
|
|
63
|
+
manager.getOp(manager.getArg(expr, 0)) === OP_BV_NUM;
|
|
64
|
+
const base = isOffset ? manager.getArg(expr, 1) : expr;
|
|
65
|
+
return manager.isGround(base) ? base : undefined;
|
|
66
|
+
};
|
|
67
|
+
|
|
68
|
+
const isUserApp = (manager: AstManager, expr: number) =>
|
|
69
|
+
manager.kinds[expr] === KIND_APP &&
|
|
70
|
+
manager.getNumArgs(expr) > 0 &&
|
|
71
|
+
manager.funcDecls[manager.decls[expr]].family === FAMILY_USER;
|
|
72
|
+
|
|
73
|
+
const getArgsHash = (manager: AstManager, app: number, bits: boolean[]) => {
|
|
74
|
+
let hash = GOLDEN_RATIO;
|
|
75
|
+
for (const [index, arg] of manager.getArgs(app).entries())
|
|
76
|
+
if (bits[index]) hash = combineHash(hashU(hash), hashU(manager.ids[arg]));
|
|
77
|
+
return hash;
|
|
78
|
+
};
|
|
79
|
+
|
|
80
|
+
class ReduceArgsRewriter extends RewriterTpl {
|
|
81
|
+
readonly declToArgFuncs: ObjMap<ArgFuncs>;
|
|
82
|
+
|
|
83
|
+
constructor(
|
|
84
|
+
manager: AstManager,
|
|
85
|
+
private declToArgs: Map<number, boolean[]>,
|
|
86
|
+
) {
|
|
87
|
+
super(manager);
|
|
88
|
+
this.declToArgFuncs = new ObjMap((decl) => manager.getDeclHash(decl));
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
checkMaxSteps() {
|
|
92
|
+
this.manager.limit.checkpoint();
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
reduceApp(decl: number, args: number[], sort: number) {
|
|
96
|
+
const manager = this.manager;
|
|
97
|
+
const funcDecl = manager.funcDecls[decl];
|
|
98
|
+
if (funcDecl.domain.length === 0 || funcDecl.family !== FAMILY_USER) return -1;
|
|
99
|
+
const bits = this.declToArgs.get(decl);
|
|
100
|
+
if (bits === undefined) return -1;
|
|
101
|
+
let argFuncs = this.declToArgFuncs.get(decl);
|
|
102
|
+
if (argFuncs === undefined) {
|
|
103
|
+
argFuncs = {
|
|
104
|
+
byKey: new Map(),
|
|
105
|
+
funcs: new ObjMap((app) => getArgsHash(manager, app, bits)),
|
|
106
|
+
};
|
|
107
|
+
this.declToArgFuncs.set(decl, argFuncs);
|
|
108
|
+
}
|
|
109
|
+
const app = manager.mkApp(decl, args, sort);
|
|
110
|
+
manager.incRef(app);
|
|
111
|
+
const key = args.filter((_arg, index) => bits[index]).join(",");
|
|
112
|
+
const representative = argFuncs.byKey.get(key);
|
|
113
|
+
const newDecl =
|
|
114
|
+
representative === undefined
|
|
115
|
+
? manager.mkFreshFuncDecl(
|
|
116
|
+
funcDecl.name,
|
|
117
|
+
funcDecl.domain.filter((_sort, index) => !bits[index]),
|
|
118
|
+
funcDecl.range,
|
|
119
|
+
)
|
|
120
|
+
: (argFuncs.funcs.get(representative) as number);
|
|
121
|
+
if (representative === undefined) {
|
|
122
|
+
argFuncs.byKey.set(key, app);
|
|
123
|
+
argFuncs.funcs.set(app, newDecl);
|
|
124
|
+
manager.incRef(app);
|
|
125
|
+
manager.incDeclRef(newDecl);
|
|
126
|
+
}
|
|
127
|
+
const result = manager.mkApp(
|
|
128
|
+
newDecl,
|
|
129
|
+
args.filter((_arg, index) => !bits[index]),
|
|
130
|
+
sort,
|
|
131
|
+
);
|
|
132
|
+
manager.incRef(result);
|
|
133
|
+
manager.decRef(app);
|
|
134
|
+
return result;
|
|
135
|
+
}
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
const getDefinitions = (
|
|
139
|
+
manager: AstManager,
|
|
140
|
+
declToArgs: Map<number, boolean[]>,
|
|
141
|
+
declToArgFuncs: ObjMap<ArgFuncs>,
|
|
142
|
+
) => {
|
|
143
|
+
const definitions: Definition[] = [];
|
|
144
|
+
for (const argFuncs of declToArgFuncs.entries())
|
|
145
|
+
for (const newDecl of argFuncs[1].funcs.entries())
|
|
146
|
+
definitions.push({ decl: newDecl[1], def: -1 });
|
|
147
|
+
for (const [decl, argFuncs] of declToArgFuncs.entries()) {
|
|
148
|
+
const funcDecl = manager.funcDecls[decl];
|
|
149
|
+
const bits = declToArgs.get(decl) as boolean[];
|
|
150
|
+
const vars = funcDecl.domain.map((sort, index) => manager.mkVar(index, sort));
|
|
151
|
+
const newArgs = vars.filter((_var, index) => !bits[index]);
|
|
152
|
+
let def = -1;
|
|
153
|
+
for (const [app, newDecl] of argFuncs.funcs.entries()) {
|
|
154
|
+
const newApp = manager.mkApp(newDecl, newArgs, funcDecl.range);
|
|
155
|
+
if (def === -1) {
|
|
156
|
+
def = newApp;
|
|
157
|
+
continue;
|
|
158
|
+
}
|
|
159
|
+
const eqs = vars.flatMap((variable, index) =>
|
|
160
|
+
bits[index] ? [manager.mkEq(variable, manager.getArg(app, index))] : [],
|
|
161
|
+
);
|
|
162
|
+
def = manager.mkApp(OP_ITE, [manager.mkAnd(eqs), newApp, def], funcDecl.range);
|
|
163
|
+
}
|
|
164
|
+
definitions.push({ decl, def });
|
|
165
|
+
}
|
|
166
|
+
return definitions;
|
|
167
|
+
};
|
|
168
|
+
|
|
169
|
+
const reduce = (manager: AstManager, goal: Goal) => {
|
|
170
|
+
if (goal.isInconsistent) return;
|
|
171
|
+
const nonCandidates = new Set<number>();
|
|
172
|
+
forEachSubterm(manager, goal, (expr) => {
|
|
173
|
+
if (manager.kinds[expr] !== KIND_APP) return;
|
|
174
|
+
if (manager.getOp(expr) === OP_AS_ARRAY) {
|
|
175
|
+
nonCandidates.add(manager.funcDecls[manager.decls[expr]].parameters[0]);
|
|
176
|
+
return;
|
|
177
|
+
}
|
|
178
|
+
if (!isUserApp(manager, expr) || nonCandidates.has(manager.decls[expr])) return;
|
|
179
|
+
if (manager.getArgs(expr).some((arg) => getUniqueBase(manager, arg) !== undefined)) return;
|
|
180
|
+
nonCandidates.add(manager.decls[expr]);
|
|
181
|
+
});
|
|
182
|
+
const declToArgs = new Map<number, boolean[]>();
|
|
183
|
+
const declToBases = new Map<number, (number | null | undefined)[]>();
|
|
184
|
+
forEachSubterm(manager, goal, (expr) => {
|
|
185
|
+
if (!isUserApp(manager, expr) || nonCandidates.has(manager.decls[expr])) return;
|
|
186
|
+
const decl = manager.decls[expr];
|
|
187
|
+
const bases = manager.getArgs(expr).map((arg) => getUniqueBase(manager, arg));
|
|
188
|
+
const bits = declToArgs.get(decl);
|
|
189
|
+
if (bits === undefined) {
|
|
190
|
+
declToArgs.set(
|
|
191
|
+
decl,
|
|
192
|
+
bases.map((base) => base !== undefined),
|
|
193
|
+
);
|
|
194
|
+
declToBases.set(decl, bases);
|
|
195
|
+
return;
|
|
196
|
+
}
|
|
197
|
+
const firstBases = declToBases.get(decl) as (number | null | undefined)[];
|
|
198
|
+
for (const [index, base] of bases.entries())
|
|
199
|
+
bits[index] = bits[index] && base !== undefined && firstBases[index] === base;
|
|
200
|
+
});
|
|
201
|
+
for (const [decl, bits] of declToArgs) if (!bits.includes(true)) declToArgs.delete(decl);
|
|
202
|
+
if (declToArgs.size === 0) return;
|
|
203
|
+
const rewriter = new ReduceArgsRewriter(manager, declToArgs);
|
|
204
|
+
const end = goal.forms.size;
|
|
205
|
+
for (let index = 0; index < end && !goal.isInconsistent; index++) {
|
|
206
|
+
const rewritten = rewriter.rewrite(goal.forms.items[index]);
|
|
207
|
+
goal.update(index, rewritten);
|
|
208
|
+
manager.decRef(rewritten);
|
|
209
|
+
}
|
|
210
|
+
const definitions = getDefinitions(manager, declToArgs, rewriter.declToArgFuncs);
|
|
211
|
+
goal.addDefinitions(definitions);
|
|
212
|
+
rewriter.release();
|
|
213
|
+
for (const argFuncs of rewriter.declToArgFuncs.entries())
|
|
214
|
+
for (const [app, newDecl] of argFuncs[1].funcs.entries()) {
|
|
215
|
+
manager.decRef(app);
|
|
216
|
+
manager.decDeclRef(newDecl);
|
|
217
|
+
}
|
|
218
|
+
};
|
|
219
|
+
|
|
220
|
+
export const reduceArgs = (manager: AstManager, goal: Goal) => {
|
|
221
|
+
if (goal.isCoresEnabled)
|
|
222
|
+
throw new SmtTacticError("reduce-args does not support unsat core production");
|
|
223
|
+
if (!goal.isProofsEnabled) reduce(manager, goal);
|
|
224
|
+
goal.depth++;
|
|
225
|
+
};
|
|
@@ -0,0 +1,119 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import { type AstManager, OP_CONCAT, OP_SIGN_EXT, OP_SLEQ } from "./ast";
|
|
3
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
4
|
+
import type { Definition, Goal } from "./goal";
|
|
5
|
+
import { ObjMap } from "./hashtable";
|
|
6
|
+
import { SubstReplacer } from "./solve-eqs";
|
|
7
|
+
|
|
8
|
+
const getSigned = (value: bigint, size: number) => {
|
|
9
|
+
const modulus = 1n << BigInt(size);
|
|
10
|
+
const reduced = ((value % modulus) + modulus) % modulus;
|
|
11
|
+
return reduced >= modulus >> 1n ? reduced - modulus : reduced;
|
|
12
|
+
};
|
|
13
|
+
|
|
14
|
+
const getNumBits = (value: bigint) => value.toString(2).length;
|
|
15
|
+
|
|
16
|
+
const collectBounds = (manager: AstManager, goal: Goal) => {
|
|
17
|
+
const getHash = (expr: number) => manager.hashes[expr];
|
|
18
|
+
const lowers = new ObjMap<bigint>(getHash);
|
|
19
|
+
const uppers = new ObjMap<bigint>(getHash);
|
|
20
|
+
const setLower = (variable: number, value: bigint) => {
|
|
21
|
+
const old = lowers.get(variable);
|
|
22
|
+
lowers.set(variable, old === undefined || old < value ? value : old);
|
|
23
|
+
};
|
|
24
|
+
const setUpper = (variable: number, value: bigint) => {
|
|
25
|
+
const old = uppers.get(variable);
|
|
26
|
+
uppers.set(variable, old === undefined || value < old ? value : old);
|
|
27
|
+
};
|
|
28
|
+
for (const form of goal.forms.items) {
|
|
29
|
+
const isNegated = manager.isNot(form);
|
|
30
|
+
const atom = isNegated ? manager.getArg(form, 0) : form;
|
|
31
|
+
if (manager.getOp(atom) !== OP_SLEQ) continue;
|
|
32
|
+
const lhs = manager.getArg(atom, 0);
|
|
33
|
+
const rhs = manager.getArg(atom, 1);
|
|
34
|
+
const size = manager.getBvSize(manager.sorts[lhs]);
|
|
35
|
+
if (manager.isUninterpretedConst(lhs) && manager.isBvNumeral(rhs)) {
|
|
36
|
+
const value = getSigned(manager.getBvNumeralValue(rhs), size);
|
|
37
|
+
if (!isNegated) setUpper(lhs, value);
|
|
38
|
+
else if (getSigned(value + 1n, size) === value + 1n) setLower(lhs, value + 1n);
|
|
39
|
+
} else if (manager.isUninterpretedConst(rhs) && manager.isBvNumeral(lhs)) {
|
|
40
|
+
const value = getSigned(manager.getBvNumeralValue(lhs), size);
|
|
41
|
+
if (!isNegated) setLower(rhs, value);
|
|
42
|
+
else if (getSigned(value - 1n, size) === value - 1n) setUpper(rhs, value - 1n);
|
|
43
|
+
}
|
|
44
|
+
}
|
|
45
|
+
return { lowers, uppers };
|
|
46
|
+
};
|
|
47
|
+
|
|
48
|
+
// Z3 also keeps unsigned bounds, but only code it compiles out collects them.
|
|
49
|
+
export const runReduceBvSize = (manager: AstManager) => (goal: Goal) => {
|
|
50
|
+
if (goal.isProofsEnabled)
|
|
51
|
+
throw new SmtTacticError("bv-size-reduction does not support proof production");
|
|
52
|
+
if (goal.isCoresEnabled)
|
|
53
|
+
throw new SmtTacticError("bv-size-reduction does not support unsat core production");
|
|
54
|
+
goal.depth++;
|
|
55
|
+
if (goal.isInconsistent) return [goal];
|
|
56
|
+
const bounds = collectBounds(manager, goal);
|
|
57
|
+
const substitution = new ObjMap<number>((expr) => manager.hashes[expr]);
|
|
58
|
+
const definitions: Definition[] = [];
|
|
59
|
+
const hidden: Definition[] = [];
|
|
60
|
+
const replacer = new SubstReplacer(manager, substitution);
|
|
61
|
+
let isInfeasible = false;
|
|
62
|
+
if (bounds.lowers.size > 0 && bounds.uppers.size > 0)
|
|
63
|
+
for (const [variable, lower] of bounds.lowers) {
|
|
64
|
+
const upper = bounds.uppers.get(variable);
|
|
65
|
+
if (upper === undefined) continue;
|
|
66
|
+
if (lower > upper) {
|
|
67
|
+
isInfeasible = true;
|
|
68
|
+
break;
|
|
69
|
+
}
|
|
70
|
+
const size = manager.getBvSize(manager.sorts[variable]);
|
|
71
|
+
const width =
|
|
72
|
+
lower >= 0n
|
|
73
|
+
? getNumBits(upper)
|
|
74
|
+
: upper < 0n
|
|
75
|
+
? getNumBits(-lower)
|
|
76
|
+
: Math.max(getNumBits(-lower), getNumBits(upper)) + 1;
|
|
77
|
+
const fresh =
|
|
78
|
+
lower === upper || width >= size ? -1 : manager.mkFreshConst(null, manager.mkBvSort(width));
|
|
79
|
+
if (fresh !== -1) hidden.push({ decl: manager.decls[fresh], def: -1 });
|
|
80
|
+
const def =
|
|
81
|
+
lower === upper
|
|
82
|
+
? manager.mkBvNumeral(lower, size)
|
|
83
|
+
: fresh === -1
|
|
84
|
+
? -1
|
|
85
|
+
: lower < 0n && upper >= 0n
|
|
86
|
+
? mkBvApp(manager, OP_SIGN_EXT, [fresh], [size - width])
|
|
87
|
+
: mkBvApp(manager, OP_CONCAT, [
|
|
88
|
+
manager.mkBvNumeral(lower < 0n ? -1n : 0n, size - width),
|
|
89
|
+
fresh,
|
|
90
|
+
]);
|
|
91
|
+
if (def === -1) continue;
|
|
92
|
+
manager.incRef(variable);
|
|
93
|
+
manager.incRef(def);
|
|
94
|
+
substitution.set(variable, def);
|
|
95
|
+
definitions.push({ decl: manager.decls[variable], def });
|
|
96
|
+
}
|
|
97
|
+
if (isInfeasible) goal.assert(manager.falseExpr);
|
|
98
|
+
else if (substitution.size > 0) {
|
|
99
|
+
let rewritten = -1;
|
|
100
|
+
const size = goal.forms.size;
|
|
101
|
+
for (let index = 0; index < size && !goal.isInconsistent; index++) {
|
|
102
|
+
const next = replacer.rewrite(goal.forms.items[index]);
|
|
103
|
+
if (rewritten !== -1) manager.decRef(rewritten);
|
|
104
|
+
rewritten = next;
|
|
105
|
+
goal.update(index, rewritten);
|
|
106
|
+
}
|
|
107
|
+
if (!goal.isInconsistent) {
|
|
108
|
+
if (hidden.length > 0) goal.addDefinitions(hidden);
|
|
109
|
+
goal.addDefinitions(definitions);
|
|
110
|
+
}
|
|
111
|
+
if (rewritten !== -1) manager.decRef(rewritten);
|
|
112
|
+
}
|
|
113
|
+
for (const [variable, def] of substitution) {
|
|
114
|
+
manager.decRef(variable);
|
|
115
|
+
manager.decRef(def);
|
|
116
|
+
}
|
|
117
|
+
replacer.release();
|
|
118
|
+
return [goal];
|
|
119
|
+
};
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/util/ref_vector.h), MIT license, see z3-license.txt. expr_ref_vector: a vector
|
|
2
|
-
// that holds a reference to each expression in it, with -1 for Z3's null pointer.
|
|
3
1
|
import type { AstManager } from "./ast";
|
|
4
2
|
|
|
5
3
|
export class RefVector {
|
|
@@ -24,7 +22,6 @@ export class RefVector {
|
|
|
24
22
|
this.items.push(expr);
|
|
25
23
|
}
|
|
26
24
|
|
|
27
|
-
// push_back(expr_ref&&): takes over a reference the caller owns.
|
|
28
25
|
pushOwned(expr: number) {
|
|
29
26
|
this.items.push(expr);
|
|
30
27
|
}
|
|
@@ -35,7 +32,6 @@ export class RefVector {
|
|
|
35
32
|
this.items[index] = expr;
|
|
36
33
|
}
|
|
37
34
|
|
|
38
|
-
// operator=(expr_ref&&): takes over a reference the caller owns.
|
|
39
35
|
setOwned(index: number, expr: number) {
|
|
40
36
|
this.decRef(this.items[index]);
|
|
41
37
|
this.items[index] = expr;
|
|
@@ -45,12 +41,10 @@ export class RefVector {
|
|
|
45
41
|
this.decRef(this.items.pop() as number);
|
|
46
42
|
}
|
|
47
43
|
|
|
48
|
-
// shrink: releases the removed expressions in order.
|
|
49
44
|
shrink(size: number) {
|
|
50
45
|
for (const expr of this.items.splice(size)) this.decRef(expr);
|
|
51
46
|
}
|
|
52
47
|
|
|
53
|
-
// resize: a larger vector is filled with null pointers.
|
|
54
48
|
resize(size: number) {
|
|
55
49
|
if (size < this.items.length) this.shrink(size);
|
|
56
50
|
while (this.items.length < size) this.items.push(-1);
|
|
@@ -1,7 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
// z3-license.txt. Relevancy level 2: only subterms that the current assignment needs are relevant,
|
|
3
|
-
// and E-matching and the theories only look at relevant terms.
|
|
4
|
-
import { AstManager, KIND_APP, OP_AND, OP_IMPLIES, OP_ITE, OP_OR } from "./ast";
|
|
1
|
+
import { type AstManager, KIND_APP, OP_AND, OP_IMPLIES, OP_ITE, OP_OR } from "./ast";
|
|
5
2
|
import type { Enode } from "./enode";
|
|
6
3
|
import { shrink } from "./array";
|
|
7
4
|
|
|
@@ -9,7 +6,6 @@ type RelevancyHandler = () => void;
|
|
|
9
6
|
|
|
10
7
|
interface RelevancyContext {
|
|
11
8
|
manager: AstManager;
|
|
12
|
-
// lbool as 1, -1 or 0.
|
|
13
9
|
findAssignment(expr: number): number;
|
|
14
10
|
findEnode(expr: number): Enode | undefined;
|
|
15
11
|
relevantEh(expr: number): void;
|
|
@@ -21,13 +17,8 @@ const TRAIL_HANDLER = 2;
|
|
|
21
17
|
|
|
22
18
|
export class RelevancyPropagator {
|
|
23
19
|
private qhead = 0;
|
|
24
|
-
// m_relevant_exprs: the relevant expressions in the order they were marked, which it holds.
|
|
25
20
|
private relevantExprs: number[] = [];
|
|
26
|
-
// A flag per expression, which grows with the expressions marked.
|
|
27
21
|
private isRelevantFlags = new Uint8Array(1024);
|
|
28
|
-
// The watches and handlers of each expression, by trail kind, are lists of cons cells like Z3's
|
|
29
|
-
// relevancy_ehs. A trail entry is the cell it pushed: its handler and the list it extends. heads
|
|
30
|
-
// holds, at 3 * expr + kind, one past the trail index of the list's first cell, or 0.
|
|
31
22
|
private heads = new Int32Array(3072);
|
|
32
23
|
private trailKinds: number[] = [];
|
|
33
24
|
private trailExprs: number[] = [];
|
|
@@ -36,10 +27,9 @@ export class RelevancyPropagator {
|
|
|
36
27
|
private scopes: number[] = [];
|
|
37
28
|
private isPropagating = false;
|
|
38
29
|
|
|
39
|
-
// At relevancy level 0 every expression is relevant and nothing propagates.
|
|
40
30
|
constructor(
|
|
41
31
|
private context: RelevancyContext,
|
|
42
|
-
|
|
32
|
+
public isEnabled: boolean,
|
|
43
33
|
) {}
|
|
44
34
|
|
|
45
35
|
isRelevant(expr: number) {
|
|
@@ -71,7 +61,6 @@ export class RelevancyPropagator {
|
|
|
71
61
|
this.pushTrail(value ? TRAIL_POS_WATCH : TRAIL_NEG_WATCH, expr, handler);
|
|
72
62
|
}
|
|
73
63
|
|
|
74
|
-
// push_trail: the trail holds its expressions. The cell goes in front of the expression's list.
|
|
75
64
|
private pushTrail(kind: number, expr: number, handler: RelevancyHandler) {
|
|
76
65
|
this.context.manager.incRef(expr);
|
|
77
66
|
const head = 3 * expr + kind;
|
|
@@ -87,8 +76,6 @@ export class RelevancyPropagator {
|
|
|
87
76
|
this.heads[head] = this.trailKinds.length;
|
|
88
77
|
}
|
|
89
78
|
|
|
90
|
-
// Runs the list of a kind and expression from its first cell, so the latest handler runs first.
|
|
91
|
-
// Handlers that a run adds go in front of the cell it started from, so the run skips them.
|
|
92
79
|
private runList(kind: number, expr: number) {
|
|
93
80
|
const head = 3 * expr + kind;
|
|
94
81
|
if (head >= this.heads.length) return;
|
|
@@ -135,7 +122,6 @@ export class RelevancyPropagator {
|
|
|
135
122
|
this.context.relevantEh(expr);
|
|
136
123
|
}
|
|
137
124
|
|
|
138
|
-
// Marks expr and every member of its equivalence class as relevant.
|
|
139
125
|
markAsRelevant(expr: number) {
|
|
140
126
|
if (this.isRelevant(expr)) return;
|
|
141
127
|
const node = this.context.findEnode(expr);
|