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,1404 @@
|
|
|
1
|
+
import { SmtTacticError, SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { type AstManager, getSymbolName, KIND_VAR, OP_AND, OP_IMPLIES, SORT_BOOL } from "../ast";
|
|
3
|
+
import { flattenOrVector, pushNotOwned } from "../ast-util";
|
|
4
|
+
import { ObjHashtable, ObjMap } from "../hashtable";
|
|
5
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
6
|
+
import { ExprSafeReplace } from "../expr-safe-replace";
|
|
7
|
+
import { FuncInterp, ProtoModel } from "../proto-model";
|
|
8
|
+
import { RefVector } from "../ref-vector";
|
|
9
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
|
|
10
|
+
import { getFreeVarSorts, VarSubst } from "../var-subst";
|
|
11
|
+
import type { DatalogContext, FpParams } from "./dl-context";
|
|
12
|
+
import { blastTermIte } from "./dl-mk-elim-term-ite";
|
|
13
|
+
import type { Rule } from "./dl-rule";
|
|
14
|
+
import type { RuleSet } from "./dl-rule-set";
|
|
15
|
+
import { mkLemmaGeneralizers, type LemmaGeneralizer } from "./spacer-generalizers";
|
|
16
|
+
import { SpacerManager } from "./spacer-manager";
|
|
17
|
+
import { gpdrCreateSplitChildren, gpdrSolveCore } from "./spacer-pdr";
|
|
18
|
+
import { IucSolver, PropSolver } from "./spacer-prop-solver";
|
|
19
|
+
import {
|
|
20
|
+
computeImplicantLiterals,
|
|
21
|
+
flattenAnd,
|
|
22
|
+
INFTY_LEVEL,
|
|
23
|
+
isFalseIn,
|
|
24
|
+
isInftyLevel,
|
|
25
|
+
isTrueIn,
|
|
26
|
+
mkAndOf,
|
|
27
|
+
mkOrOf,
|
|
28
|
+
nextLevel,
|
|
29
|
+
pin,
|
|
30
|
+
prevLevel,
|
|
31
|
+
qeProject,
|
|
32
|
+
SpacerNormalizer,
|
|
33
|
+
sortByAstLt,
|
|
34
|
+
ZkConsts,
|
|
35
|
+
} from "./spacer-util";
|
|
36
|
+
|
|
37
|
+
export const L_GAVE_UP = 2;
|
|
38
|
+
|
|
39
|
+
class ReachFact {
|
|
40
|
+
tag = -1;
|
|
41
|
+
|
|
42
|
+
constructor(
|
|
43
|
+
readonly fact: number,
|
|
44
|
+
readonly auxVars: readonly number[],
|
|
45
|
+
readonly isInit = false,
|
|
46
|
+
) {}
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
export class Lemma {
|
|
50
|
+
body = -1;
|
|
51
|
+
cube: number[] = [];
|
|
52
|
+
pob: Pob | undefined;
|
|
53
|
+
ctp: ProtoModel | undefined;
|
|
54
|
+
level: number;
|
|
55
|
+
bumped = 0;
|
|
56
|
+
isBlocked = false;
|
|
57
|
+
|
|
58
|
+
constructor(
|
|
59
|
+
private context: SpacerContext,
|
|
60
|
+
level: number,
|
|
61
|
+
body = -1,
|
|
62
|
+
pob?: Pob,
|
|
63
|
+
) {
|
|
64
|
+
this.level = level;
|
|
65
|
+
this.pob = pob;
|
|
66
|
+
if (body !== -1) this.body = context.normalizer.normalize(body);
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
static fromCube(context: SpacerContext, pob: Pob, cube: readonly number[], level: number) {
|
|
70
|
+
const lemma = new Lemma(context, pob.level, -1, pob);
|
|
71
|
+
lemma.updateCube(pob, cube);
|
|
72
|
+
lemma.setLevel(level);
|
|
73
|
+
return lemma;
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
private get manager() {
|
|
77
|
+
return this.context.manager;
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
getExpr() {
|
|
81
|
+
if (this.body !== -1) return this.body;
|
|
82
|
+
const manager = this.manager;
|
|
83
|
+
const conj = mkAndOf(manager, this.getCube());
|
|
84
|
+
this.body = pushNotOwned(manager, this.context.normalizer.normalize(conj, false));
|
|
85
|
+
return this.body;
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
getCube() {
|
|
89
|
+
if (this.cube.length > 0) return this.cube;
|
|
90
|
+
const manager = this.manager;
|
|
91
|
+
const cube = this.pob !== undefined ? this.pob.post : pushNotOwned(manager, this.body);
|
|
92
|
+
this.cube = flattenAnd(manager, [cube]);
|
|
93
|
+
if (this.cube.length === 0) this.cube.push(manager.trueExpr);
|
|
94
|
+
else sortByAstLt(manager, this.cube);
|
|
95
|
+
return this.cube;
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
isFalse() {
|
|
99
|
+
const manager = this.manager;
|
|
100
|
+
if (this.cube.length === 1) return manager.isTrue(this.cube[0]);
|
|
101
|
+
if (this.body !== -1) return manager.isFalse(this.body);
|
|
102
|
+
if (this.pob !== undefined) return manager.isTrue(this.pob.post);
|
|
103
|
+
return false;
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
updateCube(pob: Pob | undefined, cube: readonly number[]) {
|
|
107
|
+
this.pob = pob;
|
|
108
|
+
this.cube = [...cube];
|
|
109
|
+
this.body = -1;
|
|
110
|
+
if (this.cube.length === 0) this.cube.push(this.manager.trueExpr);
|
|
111
|
+
if (cube.some((lit) => this.context.zkConsts.has(lit)))
|
|
112
|
+
throw new SmtUnsupportedError("quantified spacer lemmas");
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
setLevel(level: number) {
|
|
116
|
+
this.level = level;
|
|
117
|
+
}
|
|
118
|
+
|
|
119
|
+
isInductive() {
|
|
120
|
+
return isInftyLevel(this.level);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
hasCtp() {
|
|
124
|
+
return !this.isInductive() && this.ctp !== undefined;
|
|
125
|
+
}
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
const isLemmaLess = (manager: AstManager, first: Lemma, second: Lemma) =>
|
|
129
|
+
first.level !== second.level
|
|
130
|
+
? first.level < second.level
|
|
131
|
+
: manager.ids[first.getExpr()] < manager.ids[second.getExpr()];
|
|
132
|
+
|
|
133
|
+
export class Pob {
|
|
134
|
+
readonly id: number;
|
|
135
|
+
post = -1;
|
|
136
|
+
binding: number[] = [];
|
|
137
|
+
level: number;
|
|
138
|
+
depth: number;
|
|
139
|
+
isOpen = true;
|
|
140
|
+
isUsingFarkas = true;
|
|
141
|
+
isInQueue = false;
|
|
142
|
+
weakness = 0;
|
|
143
|
+
derivation: Derivation | undefined;
|
|
144
|
+
readonly kids: Pob[] = [];
|
|
145
|
+
readonly lemmas: Lemma[] = [];
|
|
146
|
+
|
|
147
|
+
constructor(
|
|
148
|
+
readonly parent: Pob | undefined,
|
|
149
|
+
readonly pt: PredTransformer,
|
|
150
|
+
level: number,
|
|
151
|
+
depth: number,
|
|
152
|
+
isAddingToParent = true,
|
|
153
|
+
) {
|
|
154
|
+
this.id = pt.nextPobId++;
|
|
155
|
+
this.level = level;
|
|
156
|
+
this.depth = depth;
|
|
157
|
+
if (isAddingToParent && parent !== undefined) parent.kids.push(this);
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
setPost(post: number, binding: readonly number[] = []) {
|
|
161
|
+
this.post = this.pt.context.normalizer.normalize(post, false);
|
|
162
|
+
this.binding = [...binding];
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
inherit(other: Pob) {
|
|
166
|
+
this.binding = [...other.binding];
|
|
167
|
+
this.level = other.level;
|
|
168
|
+
this.depth = other.depth;
|
|
169
|
+
this.isOpen = other.isOpen;
|
|
170
|
+
this.isUsingFarkas = other.isUsingFarkas;
|
|
171
|
+
this.weakness = other.weakness;
|
|
172
|
+
this.derivation = undefined;
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
close() {
|
|
176
|
+
if (!this.isOpen) return;
|
|
177
|
+
this.derivation = undefined;
|
|
178
|
+
this.isOpen = false;
|
|
179
|
+
for (const kid of this.kids) kid.close();
|
|
180
|
+
}
|
|
181
|
+
|
|
182
|
+
isClosed() {
|
|
183
|
+
return !this.isOpen;
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
incLevel() {
|
|
187
|
+
this.level++;
|
|
188
|
+
this.depth++;
|
|
189
|
+
this.weakness = 0;
|
|
190
|
+
}
|
|
191
|
+
}
|
|
192
|
+
|
|
193
|
+
const isPobLess = (manager: AstManager, first: Pob, second: Pob) => {
|
|
194
|
+
if (first.level !== second.level) return first.level < second.level;
|
|
195
|
+
if (first.depth !== second.depth) return first.depth < second.depth;
|
|
196
|
+
const getSize = (post: number) => (manager.getOp(post) === OP_AND ? manager.getNumArgs(post) : 1);
|
|
197
|
+
if (getSize(first.post) !== getSize(second.post))
|
|
198
|
+
return getSize(first.post) < getSize(second.post);
|
|
199
|
+
if (first.post !== second.post) return manager.ids[first.post] < manager.ids[second.post];
|
|
200
|
+
const firstHead = manager.funcDecls[first.pt.head].smallId;
|
|
201
|
+
const secondHead = manager.funcDecls[second.pt.head].smallId;
|
|
202
|
+
return firstHead !== secondHead ? firstHead < secondHead : first.id < second.id;
|
|
203
|
+
};
|
|
204
|
+
|
|
205
|
+
// A binary heap by isPobLess, which orders the proof obligations totally and reads nothing that
|
|
206
|
+
// changes while they are queued.
|
|
207
|
+
class PobQueue {
|
|
208
|
+
root: Pob | undefined;
|
|
209
|
+
maxLevel = 0;
|
|
210
|
+
minDepth = 0;
|
|
211
|
+
private data: Pob[] = [];
|
|
212
|
+
|
|
213
|
+
constructor(private manager: AstManager) {}
|
|
214
|
+
|
|
215
|
+
top() {
|
|
216
|
+
if (this.data.length === 0) return undefined;
|
|
217
|
+
const top = this.data[0];
|
|
218
|
+
if (top.level > this.maxLevel) return undefined;
|
|
219
|
+
if (top.level === this.maxLevel && top.depth > this.minDepth) return undefined;
|
|
220
|
+
return top;
|
|
221
|
+
}
|
|
222
|
+
|
|
223
|
+
pop() {
|
|
224
|
+
const data = this.data;
|
|
225
|
+
data[0].isInQueue = false;
|
|
226
|
+
const moved = data[data.length - 1];
|
|
227
|
+
data.pop();
|
|
228
|
+
if (data.length === 0) return;
|
|
229
|
+
let index = 0;
|
|
230
|
+
for (let left = 1; left < data.length; left = 2 * index + 1) {
|
|
231
|
+
const child =
|
|
232
|
+
left + 1 < data.length && isPobLess(this.manager, data[left + 1], data[left])
|
|
233
|
+
? left + 1
|
|
234
|
+
: left;
|
|
235
|
+
if (!isPobLess(this.manager, data[child], moved)) break;
|
|
236
|
+
data[index] = data[child];
|
|
237
|
+
index = child;
|
|
238
|
+
}
|
|
239
|
+
data[index] = moved;
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
setRoot(root: Pob) {
|
|
243
|
+
this.root = root;
|
|
244
|
+
this.maxLevel = root.level;
|
|
245
|
+
this.minDepth = root.depth;
|
|
246
|
+
this.reset();
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
reset() {
|
|
250
|
+
for (const pob of this.data) pob.isInQueue = false;
|
|
251
|
+
this.data = [];
|
|
252
|
+
if (this.root === undefined) return;
|
|
253
|
+
this.root.isInQueue = true;
|
|
254
|
+
this.data.push(this.root);
|
|
255
|
+
}
|
|
256
|
+
|
|
257
|
+
push(pob: Pob) {
|
|
258
|
+
if (pob.isInQueue) return;
|
|
259
|
+
pob.isInQueue = true;
|
|
260
|
+
const data = this.data;
|
|
261
|
+
let index = data.length;
|
|
262
|
+
data.push(pob);
|
|
263
|
+
while (index > 0) {
|
|
264
|
+
const parent = (index - 1) >> 1;
|
|
265
|
+
if (!isPobLess(this.manager, pob, data[parent])) break;
|
|
266
|
+
data[index] = data[parent];
|
|
267
|
+
index = parent;
|
|
268
|
+
}
|
|
269
|
+
data[index] = pob;
|
|
270
|
+
}
|
|
271
|
+
|
|
272
|
+
incLevel() {
|
|
273
|
+
this.maxLevel++;
|
|
274
|
+
this.minDepth++;
|
|
275
|
+
if (this.root === undefined || this.data.length > 0) return;
|
|
276
|
+
this.root.isInQueue = true;
|
|
277
|
+
this.data.push(this.root);
|
|
278
|
+
}
|
|
279
|
+
|
|
280
|
+
isRoot(pob: Pob) {
|
|
281
|
+
return this.root === pob;
|
|
282
|
+
}
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
interface Premise {
|
|
286
|
+
pt: PredTransformer;
|
|
287
|
+
oIndex: number;
|
|
288
|
+
summary: number;
|
|
289
|
+
isMust: boolean;
|
|
290
|
+
oVars: number[];
|
|
291
|
+
}
|
|
292
|
+
|
|
293
|
+
class Derivation {
|
|
294
|
+
private premises: Premise[] = [];
|
|
295
|
+
private active = 0;
|
|
296
|
+
|
|
297
|
+
constructor(
|
|
298
|
+
readonly parent: Pob,
|
|
299
|
+
private trans: number,
|
|
300
|
+
private evars: number[],
|
|
301
|
+
) {}
|
|
302
|
+
|
|
303
|
+
private get pt() {
|
|
304
|
+
return this.parent.pt;
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
private getOVars(pt: PredTransformer, oIndex: number, auxVars: readonly number[] | undefined) {
|
|
308
|
+
const spacer = pt.context.spacerManager;
|
|
309
|
+
return [
|
|
310
|
+
...pt.sig.map((decl) => spacer.constOf(spacer.o2o(decl, oIndex))),
|
|
311
|
+
...(auxVars ?? []).map((variable) =>
|
|
312
|
+
spacer.constOf(spacer.n2o(pt.manager.decls[variable], oIndex)),
|
|
313
|
+
),
|
|
314
|
+
];
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
addPremise(
|
|
318
|
+
pt: PredTransformer,
|
|
319
|
+
oIndex: number,
|
|
320
|
+
summary: number,
|
|
321
|
+
isMust: boolean,
|
|
322
|
+
auxVars: readonly number[] | undefined,
|
|
323
|
+
) {
|
|
324
|
+
this.premises.push({
|
|
325
|
+
pt,
|
|
326
|
+
oIndex,
|
|
327
|
+
summary,
|
|
328
|
+
isMust,
|
|
329
|
+
oVars: this.getOVars(pt, oIndex, auxVars),
|
|
330
|
+
});
|
|
331
|
+
}
|
|
332
|
+
|
|
333
|
+
createFirstChild(model: ProtoModel) {
|
|
334
|
+
if (this.premises.length === 0) return undefined;
|
|
335
|
+
this.active = 0;
|
|
336
|
+
return this.createNextChildWith(model);
|
|
337
|
+
}
|
|
338
|
+
|
|
339
|
+
private existSkolemize(fml: number, vars: readonly number[]) {
|
|
340
|
+
const manager = this.pt.manager;
|
|
341
|
+
if (vars.length === 0 || manager.isTrue(fml) || manager.isFalse(fml)) return;
|
|
342
|
+
throw new SmtUnsupportedError("existentially quantified spacer proof obligations");
|
|
343
|
+
}
|
|
344
|
+
|
|
345
|
+
private createNextChildWith(model: ProtoModel): Pob | undefined {
|
|
346
|
+
const manager = this.pt.manager;
|
|
347
|
+
const context = this.pt.context;
|
|
348
|
+
const summaries: number[] = [];
|
|
349
|
+
let vars: number[] = [];
|
|
350
|
+
while (this.active < this.premises.length && this.premises[this.active].isMust) {
|
|
351
|
+
summaries.push(this.premises[this.active].summary);
|
|
352
|
+
vars.push(...this.premises[this.active].oVars);
|
|
353
|
+
this.active++;
|
|
354
|
+
}
|
|
355
|
+
if (this.active >= this.premises.length) return undefined;
|
|
356
|
+
summaries.push(this.trans);
|
|
357
|
+
this.trans = mkAndOf(manager, summaries);
|
|
358
|
+
if (vars.length > 0) {
|
|
359
|
+
vars.push(...this.evars);
|
|
360
|
+
this.evars = [];
|
|
361
|
+
this.trans = this.pt.mbp(vars, this.trans, model, context.isUsingGroundPob);
|
|
362
|
+
this.evars.push(...vars);
|
|
363
|
+
vars = [];
|
|
364
|
+
}
|
|
365
|
+
if (!isTrueIn(model, this.premises[this.active].summary)) return undefined;
|
|
366
|
+
const rest: number[] = [];
|
|
367
|
+
for (let index = this.active + 1; index < this.premises.length; index++) {
|
|
368
|
+
rest.push(this.premises[index].summary);
|
|
369
|
+
vars.push(...this.premises[index].oVars);
|
|
370
|
+
}
|
|
371
|
+
rest.push(this.trans);
|
|
372
|
+
let post = mkAndOf(manager, rest);
|
|
373
|
+
vars.push(...this.evars);
|
|
374
|
+
if (vars.length > this.evars.length)
|
|
375
|
+
post = this.pt.mbp(vars, post, model, context.isUsingGroundPob);
|
|
376
|
+
if (vars.length > 0) this.existSkolemize(post, vars);
|
|
377
|
+
const premise = this.premises[this.active];
|
|
378
|
+
post = context.spacerManager.formulaO2n(post, premise.oIndex);
|
|
379
|
+
return premise.pt.mkPob(this.parent, prevLevel(this.parent.level), this.parent.depth, post);
|
|
380
|
+
}
|
|
381
|
+
|
|
382
|
+
createNextChild(): Pob | undefined {
|
|
383
|
+
if (this.active + 1 >= this.premises.length) return undefined;
|
|
384
|
+
const premise = this.premises[this.active];
|
|
385
|
+
const pt = premise.pt;
|
|
386
|
+
const context = pt.context;
|
|
387
|
+
const manager = pt.manager;
|
|
388
|
+
const spacer = context.spacerManager;
|
|
389
|
+
const summaries = this.premises.slice(this.active + 1).map((other) => other.summary);
|
|
390
|
+
const activeTrans = spacer.formulaO2n(this.trans, premise.oIndex);
|
|
391
|
+
summaries.push(activeTrans);
|
|
392
|
+
const model = pt.isMustReachable(mkAndOf(manager, summaries));
|
|
393
|
+
if (model === undefined) return undefined;
|
|
394
|
+
const reachFact = pt.getUsedRf(model);
|
|
395
|
+
const summary = mkAndOf(manager, computeImplicantLiterals(model, [reachFact.fact]));
|
|
396
|
+
premise.isMust = true;
|
|
397
|
+
premise.summary = spacer.formulaN2o(summary, premise.oIndex);
|
|
398
|
+
premise.oVars = this.getOVars(pt, premise.oIndex, reachFact.auxVars);
|
|
399
|
+
this.trans = mkAndOf(manager, [summary, activeTrans]);
|
|
400
|
+
const vars = [...reachFact.auxVars, ...pt.sig.map((decl) => spacer.constOf(spacer.o2n(decl)))];
|
|
401
|
+
if (vars.length > 0) {
|
|
402
|
+
vars.push(...this.evars);
|
|
403
|
+
this.evars = [];
|
|
404
|
+
this.trans = this.pt.mbp(vars, this.trans, model, context.isUsingGroundPob);
|
|
405
|
+
this.evars.push(...vars);
|
|
406
|
+
}
|
|
407
|
+
this.active++;
|
|
408
|
+
return this.createNextChildWith(model);
|
|
409
|
+
}
|
|
410
|
+
}
|
|
411
|
+
|
|
412
|
+
interface PtRule {
|
|
413
|
+
rule: Rule;
|
|
414
|
+
trans: number;
|
|
415
|
+
auxs: number[];
|
|
416
|
+
tag: number;
|
|
417
|
+
}
|
|
418
|
+
|
|
419
|
+
const isInitRule = (ptRule: PtRule) => ptRule.rule.uninterpretedSize === 0;
|
|
420
|
+
|
|
421
|
+
class PredTransformer {
|
|
422
|
+
readonly sig: number[] = [];
|
|
423
|
+
readonly uses: PredTransformer[] = [];
|
|
424
|
+
readonly ptRules = new Map<Rule, PtRule>();
|
|
425
|
+
readonly rules: Rule[] = [];
|
|
426
|
+
readonly solver: PropSolver;
|
|
427
|
+
private reachSolver: IucSolver;
|
|
428
|
+
private pobs = new Map<number, Pob[]>();
|
|
429
|
+
nextPobId = 0;
|
|
430
|
+
readonly lemmas: Lemma[] = [];
|
|
431
|
+
private frameSize = 0;
|
|
432
|
+
private isSorted = true;
|
|
433
|
+
readonly reachFacts: ReachFact[] = [];
|
|
434
|
+
private transitionClause: number[] = [];
|
|
435
|
+
private transition = -1;
|
|
436
|
+
private init = -1;
|
|
437
|
+
private extendLit: number;
|
|
438
|
+
private isAllInit = false;
|
|
439
|
+
readonly manager: AstManager;
|
|
440
|
+
|
|
441
|
+
constructor(
|
|
442
|
+
readonly context: SpacerContext,
|
|
443
|
+
readonly head: number,
|
|
444
|
+
) {
|
|
445
|
+
const manager = context.manager;
|
|
446
|
+
this.manager = manager;
|
|
447
|
+
const spacer = context.spacerManager;
|
|
448
|
+
this.reachSolver = new IucSolver(manager, spacer);
|
|
449
|
+
this.solver = new PropSolver(
|
|
450
|
+
manager,
|
|
451
|
+
spacer,
|
|
452
|
+
this.getHeadName(),
|
|
453
|
+
context.params.getUint("spacer.random_seed", 0),
|
|
454
|
+
);
|
|
455
|
+
manager.funcDecls[head].domain.forEach((sort, index) => {
|
|
456
|
+
const decl = spacer.mkFuncDecl(`${this.getHeadName()}_${index}`, [], sort);
|
|
457
|
+
this.sig.push(spacer.getOPred(decl, 0));
|
|
458
|
+
});
|
|
459
|
+
const ext = spacer.mkFuncDecl(`${this.getHeadName()}_ext0`, [], SORT_BOOL);
|
|
460
|
+
this.extendLit = pin(manager, manager.mkNot(spacer.constOf(spacer.getNPred(ext))));
|
|
461
|
+
}
|
|
462
|
+
|
|
463
|
+
private getHeadName() {
|
|
464
|
+
return getSymbolName(this.manager.funcDecls[this.head].name);
|
|
465
|
+
}
|
|
466
|
+
|
|
467
|
+
private get spacer() {
|
|
468
|
+
return this.context.spacerManager;
|
|
469
|
+
}
|
|
470
|
+
|
|
471
|
+
getPredecessors(rule: Rule) {
|
|
472
|
+
return rule.tail.slice(0, rule.uninterpretedSize).map((atom) => this.manager.decls[atom]);
|
|
473
|
+
}
|
|
474
|
+
|
|
475
|
+
getTransition(rule: Rule) {
|
|
476
|
+
return (this.ptRules.get(rule) as PtRule).trans;
|
|
477
|
+
}
|
|
478
|
+
|
|
479
|
+
getAuxVars(rule: Rule) {
|
|
480
|
+
return (this.ptRules.get(rule) as PtRule).auxs;
|
|
481
|
+
}
|
|
482
|
+
|
|
483
|
+
ensureLevel(level: number) {
|
|
484
|
+
if (isInftyLevel(level)) return;
|
|
485
|
+
while (this.frameSize <= level) {
|
|
486
|
+
this.frameSize++;
|
|
487
|
+
this.solver.addLevel();
|
|
488
|
+
}
|
|
489
|
+
}
|
|
490
|
+
|
|
491
|
+
// The model of the state when it is reachable.
|
|
492
|
+
isMustReachable(state: number) {
|
|
493
|
+
const manager = this.manager;
|
|
494
|
+
if (this.reachFacts.length === 0) return undefined;
|
|
495
|
+
const solver = this.reachSolver;
|
|
496
|
+
solver.push();
|
|
497
|
+
solver.assertExpr(state);
|
|
498
|
+
solver.assertExpr(manager.mkNot(this.getLastRfTag()));
|
|
499
|
+
const result = solver.checkSat([]);
|
|
500
|
+
const model = result === L_TRUE ? solver.getModel() : undefined;
|
|
501
|
+
solver.pop(1);
|
|
502
|
+
return model;
|
|
503
|
+
}
|
|
504
|
+
|
|
505
|
+
getUsedRf(model: ProtoModel) {
|
|
506
|
+
for (const reachFact of this.reachFacts) if (isFalseIn(model, reachFact.tag)) return reachFact;
|
|
507
|
+
throw new SmtTacticError("spacer found no used reach fact");
|
|
508
|
+
}
|
|
509
|
+
|
|
510
|
+
getUsedOriginRf(model: ProtoModel, oIndex: number) {
|
|
511
|
+
for (const reachFact of this.reachFacts)
|
|
512
|
+
if (isFalseIn(model, this.spacer.formulaN2o(reachFact.tag, oIndex))) return reachFact;
|
|
513
|
+
throw new SmtTacticError("spacer found no used origin reach fact");
|
|
514
|
+
}
|
|
515
|
+
|
|
516
|
+
private getAllUsedRf(model: ProtoModel, oIndex: number) {
|
|
517
|
+
return this.reachFacts.filter((reachFact) =>
|
|
518
|
+
isFalseIn(
|
|
519
|
+
model,
|
|
520
|
+
oIndex === -1 ? reachFact.tag : this.spacer.formulaN2o(reachFact.tag, oIndex),
|
|
521
|
+
),
|
|
522
|
+
);
|
|
523
|
+
}
|
|
524
|
+
|
|
525
|
+
findRuleOf(model: ProtoModel) {
|
|
526
|
+
for (const ptRule of this.ptRules.values())
|
|
527
|
+
if (this.manager.isTrue(model.eval(ptRule.tag, false))) return ptRule.rule;
|
|
528
|
+
return undefined;
|
|
529
|
+
}
|
|
530
|
+
|
|
531
|
+
findRule(model: ProtoModel) {
|
|
532
|
+
const manager = this.manager;
|
|
533
|
+
let rule: Rule | undefined;
|
|
534
|
+
let isConcrete = false;
|
|
535
|
+
let reachPredUsed: boolean[] = [];
|
|
536
|
+
for (const ptRule of this.ptRules.values()) {
|
|
537
|
+
if (!manager.isTrue(model.eval(ptRule.tag, false))) continue;
|
|
538
|
+
rule = ptRule.rule;
|
|
539
|
+
isConcrete = true;
|
|
540
|
+
reachPredUsed = [];
|
|
541
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
542
|
+
const pt = this.context.getPredTransformer(rule.getTailDecl(manager, index));
|
|
543
|
+
let isUsed = false;
|
|
544
|
+
if (pt.reachFacts.length === 0) isConcrete = false;
|
|
545
|
+
else {
|
|
546
|
+
const tag = this.spacer.formulaN2o(pt.getLastRfTag(), index);
|
|
547
|
+
isUsed = manager.isFalse(model.eval(tag, false));
|
|
548
|
+
isConcrete = isConcrete && isUsed;
|
|
549
|
+
}
|
|
550
|
+
reachPredUsed.push(isUsed);
|
|
551
|
+
}
|
|
552
|
+
if (isConcrete) break;
|
|
553
|
+
}
|
|
554
|
+
if (rule === undefined) isConcrete = true;
|
|
555
|
+
return { rule, isConcrete, reachPredUsed };
|
|
556
|
+
}
|
|
557
|
+
|
|
558
|
+
getFormulas(level: number) {
|
|
559
|
+
return mkAndOf(
|
|
560
|
+
this.manager,
|
|
561
|
+
this.lemmas.filter((lemma) => lemma.level >= level).map((lemma) => lemma.getExpr()),
|
|
562
|
+
);
|
|
563
|
+
}
|
|
564
|
+
|
|
565
|
+
private addLemmaCore(lemma: Lemma) {
|
|
566
|
+
const level = lemma.level;
|
|
567
|
+
const expr = lemma.getExpr();
|
|
568
|
+
if (!isInftyLevel(level)) this.ensureLevel(level);
|
|
569
|
+
this.solver.assertExpr(expr, level);
|
|
570
|
+
for (const use of this.uses) use.addLemmaFromChild(this, lemma, nextLevel(level));
|
|
571
|
+
}
|
|
572
|
+
|
|
573
|
+
private addLemmaFromChild(child: PredTransformer, lemma: Lemma, level: number) {
|
|
574
|
+
this.ensureLevel(level);
|
|
575
|
+
for (const fml of this.mkAssumptions(child.head, lemma.getExpr()))
|
|
576
|
+
this.solver.assertExpr(fml, level);
|
|
577
|
+
}
|
|
578
|
+
|
|
579
|
+
addLemma(lemma: Lemma) {
|
|
580
|
+
const manager = this.manager;
|
|
581
|
+
for (let index = 0; index < this.lemmas.length; index++) {
|
|
582
|
+
const old = this.lemmas[index];
|
|
583
|
+
if (old.getExpr() !== lemma.getExpr()) continue;
|
|
584
|
+
if (lemma.pob !== undefined && !lemma.pob.lemmas.includes(old)) lemma.pob.lemmas.push(old);
|
|
585
|
+
if (old.level >= lemma.level) {
|
|
586
|
+
if (isInftyLevel(old.level)) {
|
|
587
|
+
old.bumped++;
|
|
588
|
+
if (old.bumped >= 100) throw new SmtTacticError("Stuck on a lemma");
|
|
589
|
+
}
|
|
590
|
+
return false;
|
|
591
|
+
}
|
|
592
|
+
old.setLevel(lemma.level);
|
|
593
|
+
this.addLemmaCore(old);
|
|
594
|
+
for (
|
|
595
|
+
let next = index;
|
|
596
|
+
next + 1 < this.lemmas.length &&
|
|
597
|
+
isLemmaLess(manager, this.lemmas[next + 1], this.lemmas[next]);
|
|
598
|
+
next++
|
|
599
|
+
)
|
|
600
|
+
[this.lemmas[next], this.lemmas[next + 1]] = [this.lemmas[next + 1], this.lemmas[next]];
|
|
601
|
+
return true;
|
|
602
|
+
}
|
|
603
|
+
this.lemmas.push(lemma);
|
|
604
|
+
this.isSorted = false;
|
|
605
|
+
this.addLemmaCore(lemma);
|
|
606
|
+
lemma.pob?.lemmas.push(lemma);
|
|
607
|
+
return true;
|
|
608
|
+
}
|
|
609
|
+
|
|
610
|
+
private sortLemmas() {
|
|
611
|
+
if (this.isSorted) return;
|
|
612
|
+
this.isSorted = true;
|
|
613
|
+
const manager = this.manager;
|
|
614
|
+
this.lemmas.sort((first, second) =>
|
|
615
|
+
isLemmaLess(manager, first, second) ? -1 : isLemmaLess(manager, second, first) ? 1 : 0,
|
|
616
|
+
);
|
|
617
|
+
}
|
|
618
|
+
|
|
619
|
+
propagateToInfinity(level: number) {
|
|
620
|
+
for (const lemma of this.lemmas)
|
|
621
|
+
if (lemma.level >= level && !isInftyLevel(lemma.level)) {
|
|
622
|
+
lemma.setLevel(INFTY_LEVEL);
|
|
623
|
+
this.addLemmaCore(lemma);
|
|
624
|
+
this.isSorted = false;
|
|
625
|
+
}
|
|
626
|
+
}
|
|
627
|
+
|
|
628
|
+
propagateToNextLevel(level: number) {
|
|
629
|
+
const manager = this.manager;
|
|
630
|
+
this.sortLemmas();
|
|
631
|
+
let isAll = true;
|
|
632
|
+
if (this.lemmas.length === 0) return isAll;
|
|
633
|
+
const targetLevel = nextLevel(level);
|
|
634
|
+
this.ensureLevel(targetLevel);
|
|
635
|
+
for (let index = 0; index < this.lemmas.length && this.lemmas[index].level <= level;) {
|
|
636
|
+
const lemma = this.lemmas[index];
|
|
637
|
+
if (lemma.level < level) {
|
|
638
|
+
index++;
|
|
639
|
+
continue;
|
|
640
|
+
}
|
|
641
|
+
const solverLevel = this.isInvariant(targetLevel, lemma);
|
|
642
|
+
if (solverLevel !== undefined) {
|
|
643
|
+
lemma.setLevel(solverLevel);
|
|
644
|
+
this.addLemmaCore(lemma);
|
|
645
|
+
for (
|
|
646
|
+
let next = index;
|
|
647
|
+
next + 1 < this.lemmas.length &&
|
|
648
|
+
isLemmaLess(manager, this.lemmas[next + 1], this.lemmas[next]);
|
|
649
|
+
next++
|
|
650
|
+
)
|
|
651
|
+
[this.lemmas[next], this.lemmas[next + 1]] = [this.lemmas[next + 1], this.lemmas[next]];
|
|
652
|
+
} else {
|
|
653
|
+
isAll = false;
|
|
654
|
+
index++;
|
|
655
|
+
}
|
|
656
|
+
}
|
|
657
|
+
return isAll;
|
|
658
|
+
}
|
|
659
|
+
|
|
660
|
+
private mkFreshRfTag() {
|
|
661
|
+
const spacer = this.spacer;
|
|
662
|
+
const decl = spacer.mkFuncDecl(
|
|
663
|
+
`${this.getHeadName()}#reach_tag_${this.reachFacts.length}`,
|
|
664
|
+
[],
|
|
665
|
+
SORT_BOOL,
|
|
666
|
+
);
|
|
667
|
+
return spacer.constOf(spacer.getNPred(decl));
|
|
668
|
+
}
|
|
669
|
+
|
|
670
|
+
addRf(reachFact: ReachFact | undefined, isForcing = false) {
|
|
671
|
+
const manager = this.manager;
|
|
672
|
+
if (reachFact === undefined) return;
|
|
673
|
+
if (!isForcing && this.reachFacts.some((other) => other.fact === reachFact.fact)) return;
|
|
674
|
+
const lastTag = this.reachFacts.length > 0 ? this.getLastRfTag() : -1;
|
|
675
|
+
reachFact.tag = reachFact.isInit
|
|
676
|
+
? this.mkFreshRfTag()
|
|
677
|
+
: manager.getArg(this.extendInitial(reachFact.fact), 0);
|
|
678
|
+
this.reachFacts.push(reachFact);
|
|
679
|
+
const fml = mkOrOf(
|
|
680
|
+
manager,
|
|
681
|
+
lastTag === -1
|
|
682
|
+
? [reachFact.fact, reachFact.tag]
|
|
683
|
+
: [manager.mkNot(lastTag), reachFact.fact, reachFact.tag],
|
|
684
|
+
);
|
|
685
|
+
this.reachSolver.assertExpr(fml);
|
|
686
|
+
const fakeLemma = new Lemma(this.context, INFTY_LEVEL, fml);
|
|
687
|
+
for (const use of this.uses) use.addLemmaFromChild(this, fakeLemma, INFTY_LEVEL);
|
|
688
|
+
}
|
|
689
|
+
|
|
690
|
+
getLastRfTag() {
|
|
691
|
+
return this.reachFacts[this.reachFacts.length - 1].tag;
|
|
692
|
+
}
|
|
693
|
+
|
|
694
|
+
getOriginSummary(model: ProtoModel, level: number, oIndex: number, isMust: boolean) {
|
|
695
|
+
const manager = this.manager;
|
|
696
|
+
let auxVars: readonly number[] | undefined;
|
|
697
|
+
let summary: number;
|
|
698
|
+
if (!isMust) summary = this.getFormulas(level);
|
|
699
|
+
else {
|
|
700
|
+
const reachFact = this.getUsedOriginRf(model, oIndex);
|
|
701
|
+
summary = reachFact.fact;
|
|
702
|
+
auxVars = reachFact.auxVars;
|
|
703
|
+
}
|
|
704
|
+
const conjs = flattenAnd(manager, [this.spacer.formulaN2o(summary, oIndex)]);
|
|
705
|
+
if (conjs.some((conj) => !isTrueIn(model, conj))) return undefined;
|
|
706
|
+
return { summary: mkAndOf(manager, computeImplicantLiterals(model, conjs)), auxVars };
|
|
707
|
+
}
|
|
708
|
+
|
|
709
|
+
mbp(vars: number[], fml: number, model: ProtoModel, isForcing: boolean) {
|
|
710
|
+
return qeProject(this.manager, vars, fml, model, !isForcing);
|
|
711
|
+
}
|
|
712
|
+
|
|
713
|
+
isReachable(pob: Pob, core: number[] | undefined, isWantingModel: boolean) {
|
|
714
|
+
const manager = this.manager;
|
|
715
|
+
const context = this.context;
|
|
716
|
+
this.ensureLevel(pob.level);
|
|
717
|
+
const solver = this.solver;
|
|
718
|
+
return solver.withLevel(pob.level, () => {
|
|
719
|
+
const modelHolder = isWantingModel
|
|
720
|
+
? { value: undefined as ProtoModel | undefined }
|
|
721
|
+
: undefined;
|
|
722
|
+
solver.core = core;
|
|
723
|
+
solver.model = modelHolder;
|
|
724
|
+
const post = flattenAnd(manager, [pob.post]);
|
|
725
|
+
const reachAssumps: number[] = [];
|
|
726
|
+
if (pob.level > 0 && !this.isAllInit)
|
|
727
|
+
for (const ptRule of this.ptRules.values()) {
|
|
728
|
+
const predicates = this.getPredecessors(ptRule.rule);
|
|
729
|
+
for (let index = 0; index < predicates.length; index++) {
|
|
730
|
+
const pt = context.getPredTransformer(predicates[index]);
|
|
731
|
+
if (pt.reachFacts.length > 0)
|
|
732
|
+
reachAssumps.push(
|
|
733
|
+
pin(manager, manager.mkNot(this.spacer.formulaN2o(pt.getLastRfTag(), index))),
|
|
734
|
+
);
|
|
735
|
+
else {
|
|
736
|
+
reachAssumps.push(pin(manager, manager.mkNot(ptRule.tag)));
|
|
737
|
+
break;
|
|
738
|
+
}
|
|
739
|
+
}
|
|
740
|
+
}
|
|
741
|
+
const result = solver.checkAssumptions(post, reachAssumps, this.transitionClause, [
|
|
742
|
+
this.extendLit,
|
|
743
|
+
]);
|
|
744
|
+
const model = modelHolder?.value;
|
|
745
|
+
if (result === L_TRUE || result === L_UNDEF) {
|
|
746
|
+
if (core !== undefined) core.length = 0;
|
|
747
|
+
const found = model === undefined ? undefined : this.findRule(model);
|
|
748
|
+
return {
|
|
749
|
+
result,
|
|
750
|
+
model,
|
|
751
|
+
rule: found?.rule,
|
|
752
|
+
isConcrete: found?.isConcrete ?? false,
|
|
753
|
+
reachPredUsed: found?.reachPredUsed ?? [],
|
|
754
|
+
usesLevel: INFTY_LEVEL,
|
|
755
|
+
};
|
|
756
|
+
}
|
|
757
|
+
return {
|
|
758
|
+
result,
|
|
759
|
+
model,
|
|
760
|
+
rule: undefined,
|
|
761
|
+
isConcrete: false,
|
|
762
|
+
reachPredUsed: [] as boolean[],
|
|
763
|
+
usesLevel: solver.usesLevel,
|
|
764
|
+
};
|
|
765
|
+
});
|
|
766
|
+
}
|
|
767
|
+
|
|
768
|
+
private isCtpBlocked(lemma: Lemma) {
|
|
769
|
+
if (!this.context.isUsingCtp || !lemma.hasCtp()) return false;
|
|
770
|
+
const ctp = lemma.ctp as ProtoModel;
|
|
771
|
+
const rule = this.findRuleOf(ctp);
|
|
772
|
+
if (rule === undefined) {
|
|
773
|
+
lemma.isBlocked = true;
|
|
774
|
+
return true;
|
|
775
|
+
}
|
|
776
|
+
const predicates = this.getPredecessors(rule);
|
|
777
|
+
for (let index = 0; index < predicates.length; index++) {
|
|
778
|
+
const pt = this.context.getPredTransformer(predicates[index]);
|
|
779
|
+
const lemmas = this.spacer.formulaN2o(pt.getFormulas(lemma.level), index);
|
|
780
|
+
if (isFalseIn(ctp, lemmas)) return false;
|
|
781
|
+
}
|
|
782
|
+
return true;
|
|
783
|
+
}
|
|
784
|
+
|
|
785
|
+
// The level the lemma is invariant at, or undefined.
|
|
786
|
+
isInvariant(level: number, lemma: Lemma) {
|
|
787
|
+
if (lemma.isBlocked || this.isCtpBlocked(lemma)) return undefined;
|
|
788
|
+
const manager = this.manager;
|
|
789
|
+
const candidate = flattenAnd(manager, [pushNotOwned(manager, lemma.getExpr())]);
|
|
790
|
+
const solver = this.solver;
|
|
791
|
+
return solver.withLevel(level, () => {
|
|
792
|
+
const modelHolder = this.context.isUsingCtp
|
|
793
|
+
? { value: undefined as ProtoModel | undefined }
|
|
794
|
+
: undefined;
|
|
795
|
+
solver.core = undefined;
|
|
796
|
+
solver.model = modelHolder;
|
|
797
|
+
const result = solver.checkAssumptions(candidate, [], this.transitionClause, [
|
|
798
|
+
this.extendLit,
|
|
799
|
+
]);
|
|
800
|
+
if (result === L_FALSE) {
|
|
801
|
+
lemma.ctp = undefined;
|
|
802
|
+
return solver.usesLevel;
|
|
803
|
+
}
|
|
804
|
+
if (result === L_TRUE && modelHolder?.value !== undefined) lemma.ctp = modelHolder.value;
|
|
805
|
+
else lemma.ctp = undefined;
|
|
806
|
+
return undefined;
|
|
807
|
+
});
|
|
808
|
+
}
|
|
809
|
+
|
|
810
|
+
// Shrinks the state to a core and returns the level it is inductive at, or undefined.
|
|
811
|
+
checkInductive(level: number, state: number[]) {
|
|
812
|
+
const manager = this.manager;
|
|
813
|
+
const conj = this.mkAssumptions(
|
|
814
|
+
this.head,
|
|
815
|
+
pin(manager, manager.mkNot(mkAndOf(manager, state))),
|
|
816
|
+
);
|
|
817
|
+
conj.push(this.extendLit);
|
|
818
|
+
const solver = this.solver;
|
|
819
|
+
return solver.withLevel(level, () => {
|
|
820
|
+
const core: number[] = [];
|
|
821
|
+
solver.core = core;
|
|
822
|
+
solver.model = undefined;
|
|
823
|
+
const result = solver.checkAssumptions(state, [], this.transitionClause, conj);
|
|
824
|
+
if (result !== L_FALSE) return undefined;
|
|
825
|
+
state.length = 0;
|
|
826
|
+
state.push(...core);
|
|
827
|
+
return solver.usesLevel;
|
|
828
|
+
});
|
|
829
|
+
}
|
|
830
|
+
|
|
831
|
+
private mkAssumptions(head: number, fml: number) {
|
|
832
|
+
const manager = this.manager;
|
|
833
|
+
const result: number[] = [];
|
|
834
|
+
for (const ptRule of this.ptRules.values())
|
|
835
|
+
this.getPredecessors(ptRule.rule).forEach((predicate, index) => {
|
|
836
|
+
if (predicate !== head) return;
|
|
837
|
+
const implication = manager.mkApp(OP_IMPLIES, [ptRule.tag, fml], SORT_BOOL);
|
|
838
|
+
result.push(pin(manager, this.spacer.formulaN2o(pin(manager, implication), index)));
|
|
839
|
+
});
|
|
840
|
+
return result;
|
|
841
|
+
}
|
|
842
|
+
|
|
843
|
+
initialize(pts: Map<number, PredTransformer>) {
|
|
844
|
+
const context = this.context;
|
|
845
|
+
this.init = this.manager.falseExpr;
|
|
846
|
+
this.transition = this.manager.trueExpr;
|
|
847
|
+
this.initRules(pts);
|
|
848
|
+
this.transition = context.simplify(this.transition);
|
|
849
|
+
this.init = context.simplify(this.init);
|
|
850
|
+
this.solver.assertExpr(this.transition);
|
|
851
|
+
this.solver.assertExpr(this.init, 0);
|
|
852
|
+
}
|
|
853
|
+
|
|
854
|
+
initRfs() {
|
|
855
|
+
for (const ptRule of this.ptRules.values())
|
|
856
|
+
if (isInitRule(ptRule)) this.addRf(new ReachFact(ptRule.trans, ptRule.auxs, true));
|
|
857
|
+
}
|
|
858
|
+
|
|
859
|
+
private initRules(pts: Map<number, PredTransformer>) {
|
|
860
|
+
const manager = this.manager;
|
|
861
|
+
for (const rule of this.rules) this.initRule(pts, rule);
|
|
862
|
+
const notInits: number[] = [];
|
|
863
|
+
if (this.ptRules.size === 0) {
|
|
864
|
+
this.transition = manager.falseExpr;
|
|
865
|
+
this.transitionClause = [];
|
|
866
|
+
} else {
|
|
867
|
+
const transitions: number[] = [];
|
|
868
|
+
this.transitionClause = [manager.getArg(this.extendLit, 0)];
|
|
869
|
+
let index = 0;
|
|
870
|
+
for (const ptRule of this.ptRules.values()) {
|
|
871
|
+
ptRule.tag = this.spacer.mkConst(`${this.getHeadName()}__tr${index}`, SORT_BOOL);
|
|
872
|
+
this.transitionClause.push(ptRule.tag);
|
|
873
|
+
transitions.push(manager.mkApp(OP_IMPLIES, [ptRule.tag, ptRule.trans], SORT_BOOL));
|
|
874
|
+
if (!isInitRule(ptRule)) notInits.push(manager.mkNot(ptRule.tag));
|
|
875
|
+
index++;
|
|
876
|
+
}
|
|
877
|
+
if (!this.context.params.getBool("spacer.use_inc_clause", true)) {
|
|
878
|
+
transitions.push(manager.mkOr(this.transitionClause));
|
|
879
|
+
this.transitionClause = [];
|
|
880
|
+
}
|
|
881
|
+
this.transition = mkAndOf(manager, transitions);
|
|
882
|
+
}
|
|
883
|
+
this.init = mkAndOf(manager, notInits);
|
|
884
|
+
if (notInits.length === 0) this.isAllInit = true;
|
|
885
|
+
}
|
|
886
|
+
|
|
887
|
+
private initRule(pts: Map<number, PredTransformer>, rule: Rule) {
|
|
888
|
+
const manager = this.manager;
|
|
889
|
+
const context = this.context;
|
|
890
|
+
const side: number[] = [];
|
|
891
|
+
const varReprs: number[] = [];
|
|
892
|
+
const auxVars: number[] = [];
|
|
893
|
+
this.initAtom(pts, rule.head, varReprs, side, -1);
|
|
894
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
895
|
+
if (rule.isNegated[index])
|
|
896
|
+
throw new SmtTacticError("SPACER does not support negated predicates in rule tails");
|
|
897
|
+
this.initAtom(pts, rule.tail[index], varReprs, side, index);
|
|
898
|
+
}
|
|
899
|
+
let trans = mkAndOf(manager, rule.tail.slice(rule.uninterpretedSize));
|
|
900
|
+
getFreeVarSorts(manager, trans, manager.freeVarBounds[trans]).forEach((sort, index) => {
|
|
901
|
+
if (sort === undefined || (varReprs[index] ?? -1) !== -1) return;
|
|
902
|
+
const fresh = manager.mkFreshFuncDecl("aux", [], sort);
|
|
903
|
+
manager.incDeclRef(fresh);
|
|
904
|
+
const variable = this.spacer.constOf(this.spacer.getNPred(fresh));
|
|
905
|
+
while (varReprs.length <= index) varReprs.push(-1);
|
|
906
|
+
varReprs[index] = variable;
|
|
907
|
+
auxVars.push(variable);
|
|
908
|
+
});
|
|
909
|
+
const subst = new VarSubst(manager, false);
|
|
910
|
+
const substituted = pin(manager, subst.apply(trans, varReprs));
|
|
911
|
+
subst.release();
|
|
912
|
+
side.push(...flattenAnd(manager, [substituted]));
|
|
913
|
+
trans = context.simplify(mkAndOf(manager, side));
|
|
914
|
+
const inflation = context.params.getUint("spacer.blast_term_ite_inflation", 3);
|
|
915
|
+
if (inflation > 0) trans = context.simplify(blastTermIte(manager, trans, inflation));
|
|
916
|
+
if (rule.uninterpretedSize > 0 && !manager.isGroundApp(trans))
|
|
917
|
+
throw new SmtTacticError("spacer: quantifier in a recursive rule");
|
|
918
|
+
if (manager.isFalse(trans)) return;
|
|
919
|
+
if (!this.ptRules.has(rule)) this.ptRules.set(rule, { rule, trans, auxs: auxVars, tag: -1 });
|
|
920
|
+
}
|
|
921
|
+
|
|
922
|
+
private initAtom(
|
|
923
|
+
pts: Map<number, PredTransformer>,
|
|
924
|
+
atom: number,
|
|
925
|
+
varReprs: number[],
|
|
926
|
+
side: number[],
|
|
927
|
+
tailIndex: number,
|
|
928
|
+
) {
|
|
929
|
+
const manager = this.manager;
|
|
930
|
+
const spacer = this.spacer;
|
|
931
|
+
const pt = pts.get(manager.decls[atom]) as PredTransformer;
|
|
932
|
+
manager.getArgs(atom).forEach((arg, index) => {
|
|
933
|
+
const rep = spacer.constOf(
|
|
934
|
+
tailIndex === -1 ? spacer.o2n(pt.sig[index]) : spacer.o2o(pt.sig[index], tailIndex),
|
|
935
|
+
);
|
|
936
|
+
if (manager.kinds[arg] !== KIND_VAR) {
|
|
937
|
+
side.push(pin(manager, manager.mkEq(rep, arg)));
|
|
938
|
+
return;
|
|
939
|
+
}
|
|
940
|
+
const varIndex = manager.values[arg];
|
|
941
|
+
while (varReprs.length <= varIndex) varReprs.push(-1);
|
|
942
|
+
if (varReprs[varIndex] !== -1) side.push(pin(manager, manager.mkEq(rep, varReprs[varIndex])));
|
|
943
|
+
else varReprs[varIndex] = rep;
|
|
944
|
+
});
|
|
945
|
+
}
|
|
946
|
+
|
|
947
|
+
private extendInitial(expr: number) {
|
|
948
|
+
const manager = this.manager;
|
|
949
|
+
const spacer = this.spacer;
|
|
950
|
+
const fresh = manager.mkFreshFuncDecl(`${this.getHeadName()}_ext`, [], SORT_BOOL);
|
|
951
|
+
manager.incDeclRef(fresh);
|
|
952
|
+
const variable = spacer.constOf(spacer.getNPred(fresh));
|
|
953
|
+
this.solver.assertExpr(mkOrOf(manager, [this.extendLit, expr, variable]));
|
|
954
|
+
this.extendLit = pin(manager, manager.mkNot(variable));
|
|
955
|
+
return this.extendLit;
|
|
956
|
+
}
|
|
957
|
+
|
|
958
|
+
mkRf(model: ProtoModel, rule: Rule) {
|
|
959
|
+
const manager = this.manager;
|
|
960
|
+
const context = this.context;
|
|
961
|
+
const spacer = this.spacer;
|
|
962
|
+
const pathCons = [this.getTransition(rule)];
|
|
963
|
+
const vars: number[] = [];
|
|
964
|
+
this.getPredecessors(rule).forEach((predicate, index) => {
|
|
965
|
+
const pt = context.getPredTransformer(predicate);
|
|
966
|
+
const kid = pt.getUsedOriginRf(model, index);
|
|
967
|
+
pathCons.push(spacer.formulaN2o(kid.fact, index));
|
|
968
|
+
for (const decl of pt.sig) vars.push(spacer.constOf(spacer.o2o(decl, index)));
|
|
969
|
+
for (const variable of kid.auxVars)
|
|
970
|
+
vars.push(spacer.constOf(spacer.n2o(manager.decls[variable], index)));
|
|
971
|
+
});
|
|
972
|
+
const auxVars = this.getAuxVars(rule);
|
|
973
|
+
const isElimAux = context.params.getBool("spacer.elim_aux", true);
|
|
974
|
+
if (isElimAux) vars.push(...auxVars);
|
|
975
|
+
let result = mkAndOf(manager, pathCons);
|
|
976
|
+
if (context.params.getBool("spacer.reach_dnf", true))
|
|
977
|
+
result = mkAndOf(manager, computeImplicantLiterals(model, [result]));
|
|
978
|
+
result = this.mbp(vars, result, model, true);
|
|
979
|
+
return new ReachFact(result, isElimAux ? [] : auxVars);
|
|
980
|
+
}
|
|
981
|
+
|
|
982
|
+
isMdlRfConsistent(rule: Rule, model: ProtoModel) {
|
|
983
|
+
const context = this.context;
|
|
984
|
+
const predicates = this.getPredecessors(rule);
|
|
985
|
+
for (let index = 0; index < predicates.length; index++) {
|
|
986
|
+
const pt = context.getPredTransformer(predicates[index]);
|
|
987
|
+
let isAnyTrue = false;
|
|
988
|
+
const used = pt.getAllUsedRf(model, index);
|
|
989
|
+
for (const reachFact of used) {
|
|
990
|
+
if (!isTrueIn(model, this.spacer.formulaN2o(reachFact.fact, index)))
|
|
991
|
+
model.registerConst(this.manager.decls[reachFact.tag], this.manager.trueExpr);
|
|
992
|
+
else isAnyTrue = true;
|
|
993
|
+
}
|
|
994
|
+
if (used.length > 0 && !isAnyTrue) return false;
|
|
995
|
+
}
|
|
996
|
+
return true;
|
|
997
|
+
}
|
|
998
|
+
|
|
999
|
+
getAllUsedRfAll(model: ProtoModel) {
|
|
1000
|
+
return this.getAllUsedRf(model, -1);
|
|
1001
|
+
}
|
|
1002
|
+
|
|
1003
|
+
mkPob(
|
|
1004
|
+
parent: Pob | undefined,
|
|
1005
|
+
level: number,
|
|
1006
|
+
depth: number,
|
|
1007
|
+
post: number,
|
|
1008
|
+
binding: readonly number[] = [],
|
|
1009
|
+
) {
|
|
1010
|
+
const probe = new Pob(parent, this, level, depth, false);
|
|
1011
|
+
probe.setPost(post, binding);
|
|
1012
|
+
const existing = this.pobs.get(probe.post);
|
|
1013
|
+
if (existing !== undefined)
|
|
1014
|
+
for (const pob of existing)
|
|
1015
|
+
if (pob.parent === parent && !pob.isInQueue) {
|
|
1016
|
+
pob.inherit(probe);
|
|
1017
|
+
return pob;
|
|
1018
|
+
}
|
|
1019
|
+
const pob = new Pob(parent, this, level, depth);
|
|
1020
|
+
pob.setPost(post, binding);
|
|
1021
|
+
const list = this.pobs.get(pob.post);
|
|
1022
|
+
if (list === undefined) this.pobs.set(pob.post, [pob]);
|
|
1023
|
+
else list.push(pob);
|
|
1024
|
+
return pob;
|
|
1025
|
+
}
|
|
1026
|
+
}
|
|
1027
|
+
|
|
1028
|
+
export class SpacerContext {
|
|
1029
|
+
readonly spacerManager: SpacerManager;
|
|
1030
|
+
readonly normalizer: SpacerNormalizer;
|
|
1031
|
+
readonly zkConsts: ZkConsts;
|
|
1032
|
+
rels = new Map<number, PredTransformer>();
|
|
1033
|
+
queryPred = -1;
|
|
1034
|
+
query: PredTransformer | undefined;
|
|
1035
|
+
readonly pobQueue: PobQueue;
|
|
1036
|
+
expandedLevel = 0;
|
|
1037
|
+
private inductiveLevel = 0;
|
|
1038
|
+
private generalizers: LemmaGeneralizer[] = [];
|
|
1039
|
+
readonly isUsingCtp: boolean;
|
|
1040
|
+
readonly isUsingGroundPob: boolean;
|
|
1041
|
+
readonly isUsingGpdr: boolean;
|
|
1042
|
+
private isResettingObligationQueue: boolean;
|
|
1043
|
+
private isUsingDerivations: boolean;
|
|
1044
|
+
private isUsingPropagate: boolean;
|
|
1045
|
+
readonly maxLevel: number;
|
|
1046
|
+
readonly isPdrBfs: boolean;
|
|
1047
|
+
|
|
1048
|
+
readonly params: FpParams;
|
|
1049
|
+
readonly manager: AstManager;
|
|
1050
|
+
|
|
1051
|
+
constructor(readonly datalogContext: DatalogContext) {
|
|
1052
|
+
const params = datalogContext.params;
|
|
1053
|
+
const manager = datalogContext.manager;
|
|
1054
|
+
this.params = params;
|
|
1055
|
+
this.manager = manager;
|
|
1056
|
+
this.spacerManager = new SpacerManager(manager);
|
|
1057
|
+
this.normalizer = new SpacerNormalizer(manager);
|
|
1058
|
+
this.zkConsts = new ZkConsts(manager);
|
|
1059
|
+
this.pobQueue = new PobQueue(manager);
|
|
1060
|
+
this.isUsingCtp = params.getBool("spacer.ctp", true);
|
|
1061
|
+
this.isUsingGpdr = params.getBool("spacer.gpdr", false);
|
|
1062
|
+
this.isUsingGroundPob = this.isUsingGpdr || params.getBool("spacer.ground_pobs", true);
|
|
1063
|
+
this.isResettingObligationQueue =
|
|
1064
|
+
!this.isUsingGpdr && params.getBool("spacer.reset_pob_queue", true);
|
|
1065
|
+
this.isUsingDerivations = !this.isUsingGpdr && params.getBool("spacer.use_derivations", true);
|
|
1066
|
+
this.isUsingPropagate = params.getBool("spacer.propagate", true);
|
|
1067
|
+
this.maxLevel = params.getUint("spacer.max_level", 0xffffffff);
|
|
1068
|
+
this.isPdrBfs = params.getBool("spacer.gpdr.bfs", true);
|
|
1069
|
+
if (params.getBool("spacer.push_pob", false) && !this.isUsingGpdr)
|
|
1070
|
+
throw new SmtUnsupportedError("spacer.push_pob");
|
|
1071
|
+
if (!params.getBool("spacer.ground_pobs", true) && !this.isUsingGpdr)
|
|
1072
|
+
throw new SmtUnsupportedError("spacer with spacer.ground_pobs=false");
|
|
1073
|
+
if (params.getUint("spacer.order_children", 0) !== 0)
|
|
1074
|
+
throw new SmtUnsupportedError("spacer.order_children");
|
|
1075
|
+
if (params.getBool("spacer.global", false) || params.getBool("spacer.q3.use_qgen", false))
|
|
1076
|
+
throw new SmtUnsupportedError("the global and quantified spacer generalizers");
|
|
1077
|
+
}
|
|
1078
|
+
|
|
1079
|
+
simplify(expr: number) {
|
|
1080
|
+
return this.datalogContext.simplify(expr);
|
|
1081
|
+
}
|
|
1082
|
+
|
|
1083
|
+
getPredTransformer(decl: number) {
|
|
1084
|
+
return this.rels.get(decl) as PredTransformer;
|
|
1085
|
+
}
|
|
1086
|
+
|
|
1087
|
+
setQuery(queryPred: number) {
|
|
1088
|
+
this.queryPred = queryPred;
|
|
1089
|
+
}
|
|
1090
|
+
|
|
1091
|
+
updateRules(rules: RuleSet) {
|
|
1092
|
+
const manager = this.manager;
|
|
1093
|
+
// decl2rel and the grouped rules are tables that Z3 walks in slot order.
|
|
1094
|
+
const getHash = (decl: number) => manager.getDeclHash(decl);
|
|
1095
|
+
const heads = new ObjHashtable(getHash);
|
|
1096
|
+
for (const predicate of rules.getHeadPredicates()) heads.add(predicate);
|
|
1097
|
+
const table = new ObjMap<PredTransformer>(getHash);
|
|
1098
|
+
for (const predicate of heads) {
|
|
1099
|
+
const pt = new PredTransformer(this, predicate);
|
|
1100
|
+
table.set(predicate, pt);
|
|
1101
|
+
pt.rules.push(...rules.getPredicateRules(predicate));
|
|
1102
|
+
}
|
|
1103
|
+
for (const rule of rules.rules)
|
|
1104
|
+
for (let index = 0; index < rule.uninterpretedSize; index++) {
|
|
1105
|
+
const predicate = rule.getTailDecl(manager, index);
|
|
1106
|
+
if (!table.has(predicate)) table.set(predicate, new PredTransformer(this, predicate));
|
|
1107
|
+
}
|
|
1108
|
+
const rels = new Map(table);
|
|
1109
|
+
for (const [predicate, pt] of rels)
|
|
1110
|
+
for (const dependency of rules.deps.getDeps(predicate)) {
|
|
1111
|
+
const user = rels.get(dependency) as PredTransformer;
|
|
1112
|
+
if (!user.uses.includes(pt)) user.uses.push(pt);
|
|
1113
|
+
}
|
|
1114
|
+
for (const pt of rels.values()) pt.initialize(rels);
|
|
1115
|
+
for (const pt of rels.values()) pt.initRfs();
|
|
1116
|
+
this.rels = rels;
|
|
1117
|
+
this.query = undefined;
|
|
1118
|
+
this.generalizers = mkLemmaGeneralizers(this);
|
|
1119
|
+
}
|
|
1120
|
+
|
|
1121
|
+
solve(fromLevel: number) {
|
|
1122
|
+
return this.isUsingGpdr ? gpdrSolveCore(this) : this.solveCore(fromLevel);
|
|
1123
|
+
}
|
|
1124
|
+
|
|
1125
|
+
private solveCore(fromLevel: number) {
|
|
1126
|
+
const manager = this.manager;
|
|
1127
|
+
this.query = this.rels.get(this.queryPred);
|
|
1128
|
+
if (this.query === undefined) return L_FALSE;
|
|
1129
|
+
let level = fromLevel;
|
|
1130
|
+
const root = this.query.mkPob(undefined, fromLevel, 0, manager.trueExpr);
|
|
1131
|
+
this.pobQueue.setRoot(root);
|
|
1132
|
+
for (let index = fromLevel; index < this.maxLevel; index++) {
|
|
1133
|
+
manager.limit.checkpoint();
|
|
1134
|
+
this.expandedLevel = INFTY_LEVEL;
|
|
1135
|
+
const reachable = this.checkReachability();
|
|
1136
|
+
if (reachable !== L_FALSE) return reachable;
|
|
1137
|
+
if (level > 0 && this.isUsingPropagate && this.propagate(this.expandedLevel, level))
|
|
1138
|
+
return L_FALSE;
|
|
1139
|
+
this.pobQueue.incLevel();
|
|
1140
|
+
level = this.pobQueue.maxLevel;
|
|
1141
|
+
}
|
|
1142
|
+
this.datalogContext.isBounded = true;
|
|
1143
|
+
return L_UNDEF;
|
|
1144
|
+
}
|
|
1145
|
+
|
|
1146
|
+
// L_UNDEF when spacer gives up, where Z3 throws unknown_exception.
|
|
1147
|
+
private checkReachability() {
|
|
1148
|
+
const queue = this.pobQueue;
|
|
1149
|
+
let lastReachable: Pob | undefined;
|
|
1150
|
+
const newPobs: Pob[] = [];
|
|
1151
|
+
if (this.isResettingObligationQueue) queue.reset();
|
|
1152
|
+
while (queue.top() !== undefined) {
|
|
1153
|
+
this.manager.limit.checkpoint();
|
|
1154
|
+
while (lastReachable !== undefined) {
|
|
1155
|
+
const node: Pob = lastReachable;
|
|
1156
|
+
lastReachable = undefined;
|
|
1157
|
+
if (queue.isRoot(node)) return L_TRUE;
|
|
1158
|
+
const parent = node.parent as Pob;
|
|
1159
|
+
if (this.isReachablePob(parent)) {
|
|
1160
|
+
lastReachable = parent;
|
|
1161
|
+
parent.close();
|
|
1162
|
+
} else if (!parent.isClosed()) parent.weakness++;
|
|
1163
|
+
}
|
|
1164
|
+
while ((queue.top() as Pob).isClosed()) {
|
|
1165
|
+
const closed = queue.top() as Pob;
|
|
1166
|
+
queue.pop();
|
|
1167
|
+
if (queue.isRoot(closed)) return L_TRUE;
|
|
1168
|
+
}
|
|
1169
|
+
const node = queue.top() as Pob;
|
|
1170
|
+
queue.pop();
|
|
1171
|
+
switch (this.expandPob(node, newPobs)) {
|
|
1172
|
+
case L_TRUE:
|
|
1173
|
+
node.close();
|
|
1174
|
+
lastReachable = node;
|
|
1175
|
+
if (queue.isRoot(node)) return L_TRUE;
|
|
1176
|
+
break;
|
|
1177
|
+
case L_FALSE:
|
|
1178
|
+
if (queue.isRoot(node)) return L_FALSE;
|
|
1179
|
+
break;
|
|
1180
|
+
case L_GAVE_UP:
|
|
1181
|
+
return L_UNDEF;
|
|
1182
|
+
default:
|
|
1183
|
+
for (const pob of newPobs) queue.push(pob);
|
|
1184
|
+
}
|
|
1185
|
+
newPobs.length = 0;
|
|
1186
|
+
}
|
|
1187
|
+
throw new SmtTacticError("spacer ran out of proof obligations");
|
|
1188
|
+
}
|
|
1189
|
+
|
|
1190
|
+
private isReachablePob(pob: Pob): boolean {
|
|
1191
|
+
const saved = pob.level;
|
|
1192
|
+
pob.level = INFTY_LEVEL;
|
|
1193
|
+
const reach = pob.pt.isReachable(pob, undefined, true);
|
|
1194
|
+
pob.level = saved;
|
|
1195
|
+
if (reach.result !== L_TRUE || !reach.isConcrete) return false;
|
|
1196
|
+
if (reach.rule !== undefined && reach.rule.uninterpretedSize > 0)
|
|
1197
|
+
pob.pt.addRf(pob.pt.mkRf(reach.model as ProtoModel, reach.rule));
|
|
1198
|
+
const derivation = pob.derivation;
|
|
1199
|
+
pob.derivation = undefined;
|
|
1200
|
+
pob.close();
|
|
1201
|
+
const next = derivation?.createNextChild();
|
|
1202
|
+
if (next !== undefined) {
|
|
1203
|
+
next.derivation = derivation;
|
|
1204
|
+
if (this.pobQueue.top() === pob) this.pobQueue.pop();
|
|
1205
|
+
this.pobQueue.push(next);
|
|
1206
|
+
}
|
|
1207
|
+
return next !== undefined ? this.isReachablePob(next) : true;
|
|
1208
|
+
}
|
|
1209
|
+
|
|
1210
|
+
private isMdlRfConsistent(model: ProtoModel) {
|
|
1211
|
+
for (const pt of this.rels.values()) {
|
|
1212
|
+
let isAnyTrue = false;
|
|
1213
|
+
const used = pt.getAllUsedRfAll(model);
|
|
1214
|
+
for (const reachFact of used) {
|
|
1215
|
+
if (!isTrueIn(model, reachFact.fact))
|
|
1216
|
+
model.registerConst(this.manager.decls[reachFact.tag], this.manager.trueExpr);
|
|
1217
|
+
else isAnyTrue = true;
|
|
1218
|
+
}
|
|
1219
|
+
if (used.length > 0 && !isAnyTrue) return false;
|
|
1220
|
+
}
|
|
1221
|
+
return true;
|
|
1222
|
+
}
|
|
1223
|
+
|
|
1224
|
+
private handleUnknown(pob: Pob, rule: Rule | undefined, model: ProtoModel) {
|
|
1225
|
+
if (rule === undefined)
|
|
1226
|
+
return isTrueIn(model, pob.post) && this.isMdlRfConsistent(model) ? L_TRUE : L_UNDEF;
|
|
1227
|
+
return isTrueIn(model, pob.pt.getTransition(rule)) &&
|
|
1228
|
+
isTrueIn(model, pob.post) &&
|
|
1229
|
+
rule.uninterpretedSize === 0 &&
|
|
1230
|
+
pob.pt.isMdlRfConsistent(rule, model)
|
|
1231
|
+
? L_TRUE
|
|
1232
|
+
: L_UNDEF;
|
|
1233
|
+
}
|
|
1234
|
+
|
|
1235
|
+
expandPob(pob: Pob, out: Pob[]): number {
|
|
1236
|
+
const cube: number[] = [];
|
|
1237
|
+
const reach = pob.pt.isReachable(pob, cube, true);
|
|
1238
|
+
let result = reach.result;
|
|
1239
|
+
if (result === L_UNDEF && reach.model !== undefined)
|
|
1240
|
+
result = this.handleUnknown(pob, reach.rule, reach.model);
|
|
1241
|
+
this.manager.limit.checkpoint();
|
|
1242
|
+
switch (result) {
|
|
1243
|
+
case L_TRUE: {
|
|
1244
|
+
const model = reach.model as ProtoModel;
|
|
1245
|
+
if (reach.isConcrete) {
|
|
1246
|
+
const isRoot = this.pobQueue.isRoot(pob);
|
|
1247
|
+
if (reach.rule !== undefined && (reach.rule.uninterpretedSize > 0 || isRoot))
|
|
1248
|
+
pob.pt.addRf(pob.pt.mkRf(model, reach.rule), isRoot);
|
|
1249
|
+
const derivation = pob.derivation;
|
|
1250
|
+
pob.derivation = undefined;
|
|
1251
|
+
pob.close();
|
|
1252
|
+
const next = derivation?.createNextChild();
|
|
1253
|
+
if (next !== undefined) {
|
|
1254
|
+
next.derivation = derivation;
|
|
1255
|
+
out.push(next);
|
|
1256
|
+
}
|
|
1257
|
+
return next !== undefined ? L_UNDEF : L_TRUE;
|
|
1258
|
+
}
|
|
1259
|
+
if (this.createChildren(pob, reach.rule as Rule, model, reach.reachPredUsed, out)) {
|
|
1260
|
+
out.push(pob);
|
|
1261
|
+
return L_UNDEF;
|
|
1262
|
+
}
|
|
1263
|
+
if (pob.weakness < 10) {
|
|
1264
|
+
pob.weakness++;
|
|
1265
|
+
return this.expandPob(pob, out);
|
|
1266
|
+
}
|
|
1267
|
+
return L_GAVE_UP;
|
|
1268
|
+
}
|
|
1269
|
+
case L_FALSE: {
|
|
1270
|
+
if (pob.level < this.expandedLevel) this.expandedLevel = pob.level;
|
|
1271
|
+
const lemma = Lemma.fromCube(this, pob, cube, reach.usesLevel);
|
|
1272
|
+
for (const generalizer of this.generalizers) {
|
|
1273
|
+
if (!pob.isUsingFarkas || lemma.isFalse()) break;
|
|
1274
|
+
this.manager.limit.checkpoint();
|
|
1275
|
+
generalizer(lemma);
|
|
1276
|
+
}
|
|
1277
|
+
pob.pt.addLemma(lemma);
|
|
1278
|
+
pob.incLevel();
|
|
1279
|
+
out.push(pob);
|
|
1280
|
+
return L_FALSE;
|
|
1281
|
+
}
|
|
1282
|
+
default: {
|
|
1283
|
+
if (pob.weakness < 10) {
|
|
1284
|
+
if (reach.rule !== undefined && reach.rule.uninterpretedSize > 0) {
|
|
1285
|
+
const reachPredUsed = reach.reachPredUsed.map(() => false);
|
|
1286
|
+
if (
|
|
1287
|
+
this.createChildren(pob, reach.rule, reach.model as ProtoModel, reachPredUsed, out)
|
|
1288
|
+
) {
|
|
1289
|
+
out.push(pob);
|
|
1290
|
+
return L_UNDEF;
|
|
1291
|
+
}
|
|
1292
|
+
}
|
|
1293
|
+
pob.weakness++;
|
|
1294
|
+
return this.expandPob(pob, out);
|
|
1295
|
+
}
|
|
1296
|
+
return L_GAVE_UP;
|
|
1297
|
+
}
|
|
1298
|
+
}
|
|
1299
|
+
}
|
|
1300
|
+
|
|
1301
|
+
propagate(minLevel: number, maxLevel: number) {
|
|
1302
|
+
if (minLevel === INFTY_LEVEL) return false;
|
|
1303
|
+
for (let level = minLevel; ; level++) {
|
|
1304
|
+
this.manager.limit.checkpoint();
|
|
1305
|
+
let isAllPropagated = true;
|
|
1306
|
+
for (const pt of this.rels.values())
|
|
1307
|
+
isAllPropagated = pt.propagateToNextLevel(level) && isAllPropagated;
|
|
1308
|
+
if (!isAllPropagated) continue;
|
|
1309
|
+
for (const pt of this.rels.values()) pt.propagateToInfinity(level);
|
|
1310
|
+
if (level > maxLevel) return false;
|
|
1311
|
+
this.inductiveLevel = level;
|
|
1312
|
+
return true;
|
|
1313
|
+
}
|
|
1314
|
+
}
|
|
1315
|
+
|
|
1316
|
+
// context::get_model with get_level_property and inductive_property::to_model, before the
|
|
1317
|
+
// model converter.
|
|
1318
|
+
getModel() {
|
|
1319
|
+
const manager = this.manager;
|
|
1320
|
+
const model = new ProtoModel(manager);
|
|
1321
|
+
const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
|
|
1322
|
+
for (const pt of this.rels.values()) {
|
|
1323
|
+
if (pt.head === this.queryPred) continue;
|
|
1324
|
+
const clauses = flattenAnd(manager, [
|
|
1325
|
+
this.spacerManager.formulaN2o(pt.getFormulas(this.inductiveLevel), 0),
|
|
1326
|
+
]).map((clause) => {
|
|
1327
|
+
const disjuncts = new RefVector(manager);
|
|
1328
|
+
disjuncts.push(clause);
|
|
1329
|
+
flattenOrVector(manager, disjuncts);
|
|
1330
|
+
const fixed = pin(manager, rewriter.mkOr([...disjuncts.items]));
|
|
1331
|
+
disjuncts.reset();
|
|
1332
|
+
return fixed;
|
|
1333
|
+
});
|
|
1334
|
+
const replace = new ExprSafeReplace(manager);
|
|
1335
|
+
pt.sig.forEach((decl, index) =>
|
|
1336
|
+
replace.insert(
|
|
1337
|
+
this.spacerManager.constOf(decl),
|
|
1338
|
+
pin(manager, manager.mkVar(index, manager.funcDecls[decl].range)),
|
|
1339
|
+
),
|
|
1340
|
+
);
|
|
1341
|
+
const property = replace.apply(pin(manager, rewriter.mkAnd(clauses)));
|
|
1342
|
+
replace.release();
|
|
1343
|
+
if (pt.sig.length === 0) model.registerConst(pt.head, property);
|
|
1344
|
+
else {
|
|
1345
|
+
const interp = new FuncInterp(manager, pt.sig.length);
|
|
1346
|
+
interp.setElse(property);
|
|
1347
|
+
model.registerFunc(pt.head, interp);
|
|
1348
|
+
}
|
|
1349
|
+
manager.decRef(property);
|
|
1350
|
+
}
|
|
1351
|
+
rewriter.release();
|
|
1352
|
+
return model;
|
|
1353
|
+
}
|
|
1354
|
+
|
|
1355
|
+
createChildren(
|
|
1356
|
+
pob: Pob,
|
|
1357
|
+
rule: Rule,
|
|
1358
|
+
model: ProtoModel,
|
|
1359
|
+
reachPredUsed: readonly boolean[],
|
|
1360
|
+
out: Pob[],
|
|
1361
|
+
) {
|
|
1362
|
+
const manager = this.manager;
|
|
1363
|
+
const spacer = this.spacerManager;
|
|
1364
|
+
const pt = pob.pt;
|
|
1365
|
+
const predicates = pt.getPredecessors(rule);
|
|
1366
|
+
let phi = mkAndOf(manager, computeImplicantLiterals(model, [pt.getTransition(rule), pob.post]));
|
|
1367
|
+
const vars = [
|
|
1368
|
+
...pt.sig.map((decl) => spacer.constOf(spacer.o2n(decl))),
|
|
1369
|
+
...pt.getAuxVars(rule),
|
|
1370
|
+
];
|
|
1371
|
+
phi = pt.mbp(vars, phi, model, this.isUsingGroundPob);
|
|
1372
|
+
if (this.isUsingGpdr && predicates.length > 1) return gpdrCreateSplitChildren();
|
|
1373
|
+
const derivation = new Derivation(pob, phi, vars);
|
|
1374
|
+
for (let index = 0; index < predicates.length; index++) {
|
|
1375
|
+
const premisePt = this.getPredTransformer(predicates[index]);
|
|
1376
|
+
const summary = premisePt.getOriginSummary(
|
|
1377
|
+
model,
|
|
1378
|
+
prevLevel(pob.level),
|
|
1379
|
+
index,
|
|
1380
|
+
reachPredUsed[index],
|
|
1381
|
+
);
|
|
1382
|
+
if (summary === undefined) return false;
|
|
1383
|
+
derivation.addPremise(
|
|
1384
|
+
premisePt,
|
|
1385
|
+
index,
|
|
1386
|
+
summary.summary,
|
|
1387
|
+
reachPredUsed[index],
|
|
1388
|
+
summary.auxVars,
|
|
1389
|
+
);
|
|
1390
|
+
}
|
|
1391
|
+
const kid = derivation.createFirstChild(model);
|
|
1392
|
+
if (kid === undefined) return false;
|
|
1393
|
+
kid.derivation = derivation;
|
|
1394
|
+
if (!this.isUsingDerivations) kid.derivation = undefined;
|
|
1395
|
+
if (
|
|
1396
|
+
this.params.getBool("spacer.weak_abs", true) &&
|
|
1397
|
+
!this.isUsingGpdr &&
|
|
1398
|
+
(!isTrueIn(model, pt.getTransition(rule)) || !isTrueIn(model, pob.post))
|
|
1399
|
+
)
|
|
1400
|
+
kid.derivation = undefined;
|
|
1401
|
+
out.push(kid);
|
|
1402
|
+
return true;
|
|
1403
|
+
}
|
|
1404
|
+
}
|