tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
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 +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- 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 -1
- 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 +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- 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 +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- 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 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +25 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +56 -74
- package/src/runtime.ts +4 -0
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +2 -3
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +62 -152
- package/src/prover/isabelle/isar/statement.ts +0 -52
- 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
|
@@ -1,10 +1,31 @@
|
|
|
1
|
-
// Ported from Z3 (src/smt/smt_context.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import type { AssertedFormulas } from "./asserted-formulas";
|
|
3
|
-
import {
|
|
2
|
+
import {
|
|
3
|
+
AstManager,
|
|
4
|
+
FAMILY_ARITH,
|
|
5
|
+
FAMILY_ARRAY,
|
|
6
|
+
FAMILY_BASIC,
|
|
7
|
+
FAMILY_BV,
|
|
8
|
+
FAMILY_CHAR,
|
|
9
|
+
FAMILY_DATATYPE,
|
|
10
|
+
FAMILY_FINITE_SET,
|
|
11
|
+
FAMILY_FPA,
|
|
12
|
+
FAMILY_PB,
|
|
13
|
+
FAMILY_POLY,
|
|
14
|
+
FAMILY_RECFUN,
|
|
15
|
+
FAMILY_SEQ,
|
|
16
|
+
KIND_APP,
|
|
17
|
+
KIND_QUANTIFIER,
|
|
18
|
+
KIND_VAR,
|
|
19
|
+
OP_IMPLIES,
|
|
20
|
+
OP_ITE,
|
|
21
|
+
OP_NOT,
|
|
22
|
+
SORT_BOOL,
|
|
23
|
+
} from "./ast";
|
|
4
24
|
import { getCongruenceJustification, isCongruent } from "./cg-table";
|
|
5
25
|
import { BJustification, type Clause, CLS_LEARNED, CLS_TH_LEMMA, HEADER_SIZE } from "./clause";
|
|
6
26
|
import { ConflictResolution } from "./conflict-resolution";
|
|
7
27
|
import { DynAckManager } from "./dyn-ack";
|
|
28
|
+
import { FingerprintSet } from "./fingerprints";
|
|
8
29
|
import {
|
|
9
30
|
Enode,
|
|
10
31
|
EqConflictJustification,
|
|
@@ -26,34 +47,53 @@ import {
|
|
|
26
47
|
UNDO_TH_VAR,
|
|
27
48
|
} from "./internalizer";
|
|
28
49
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
29
|
-
import {
|
|
50
|
+
import { MaxCliques } from "./max-cliques";
|
|
51
|
+
import { BoolVar, getVar, isNegated, Literal, mkLiteral, negate, toBoolVar } from "./literal";
|
|
52
|
+
import type { MacroManager } from "./macro-finder";
|
|
30
53
|
import { mkModel } from "./model-generator";
|
|
54
|
+
import { TheoryRecfun } from "./theory-recfun";
|
|
31
55
|
import type { GeneratedModel } from "./model-generator";
|
|
32
56
|
import type { ProtoModel } from "./proto-model";
|
|
33
57
|
import { DefaultQuantifierManager } from "./quantifier-manager";
|
|
58
|
+
import { FC_CONTINUE, FC_DONE, FC_GIVEUP, Theory } from "./theory";
|
|
59
|
+
import { TheoryArray } from "./theory-array";
|
|
60
|
+
import { TheoryBv } from "./theory-bv";
|
|
61
|
+
import { TheoryFpa } from "./theory-fpa";
|
|
62
|
+
import { TheoryChar } from "./theory-char";
|
|
63
|
+
import { TheorySeq } from "./theory-seq";
|
|
64
|
+
import { TheoryDatatype } from "./theory-datatype";
|
|
65
|
+
import { TheoryFiniteSet } from "./theory-finite-set";
|
|
66
|
+
import { TheoryPb } from "./theory-pb";
|
|
67
|
+
import { TheoryPolymorphism } from "./theory-polymorphism";
|
|
34
68
|
import { TheoryLra } from "./theory-lra";
|
|
35
69
|
import { shrink } from "./array";
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
70
|
+
import {
|
|
71
|
+
getSmtConfig,
|
|
72
|
+
PS_ALWAYS_FALSE,
|
|
73
|
+
PS_CACHING_CONSERVATIVE,
|
|
74
|
+
PS_CACHING_CONSERVATIVE2,
|
|
75
|
+
PS_THEORY,
|
|
76
|
+
RS_GEOMETRIC,
|
|
77
|
+
RS_LUBY,
|
|
78
|
+
type SmtSetup,
|
|
79
|
+
} from "./smt-setup";
|
|
40
80
|
|
|
41
81
|
const ACTIVITY_LIMIT = 1e100;
|
|
42
82
|
const INV_ACTIVITY_LIMIT = 1e-100;
|
|
43
83
|
const INV_DECAY = 1.052;
|
|
44
84
|
const RESTART_INITIAL = 100;
|
|
45
|
-
const RESTART_FACTOR = 1.1;
|
|
46
85
|
const PHASE_CACHING_ON = 400;
|
|
47
86
|
const PHASE_CACHING_OFF = 100;
|
|
48
87
|
const AGILITY_FACTOR = 0.9999;
|
|
49
88
|
const LEMMA_GC_INITIAL = 5000;
|
|
50
|
-
const NUM_ARITH_FINAL_CHECK_LEVELS = 2;
|
|
51
89
|
const NEW_OLD_RATIO = 16;
|
|
52
90
|
const OLD_CLAUSE_ACTIVITY = 500;
|
|
53
91
|
const NEW_CLAUSE_RELEVANCY = 45;
|
|
54
92
|
const OLD_CLAUSE_RELEVANCY = 6;
|
|
55
93
|
const RESTART_AGILITY_THRESHOLD = 0.18;
|
|
56
94
|
|
|
95
|
+
export const MBQI_MAX_ITERATIONS = 1000;
|
|
96
|
+
|
|
57
97
|
export const CHECK_MODEL_SAT = 0;
|
|
58
98
|
export const CHECK_MODEL_UNKNOWN = 1;
|
|
59
99
|
export const CHECK_MODEL_RESTART = 2;
|
|
@@ -62,12 +102,14 @@ const FAILURE_OK = 0;
|
|
|
62
102
|
const FAILURE_THEORY = 1;
|
|
63
103
|
const FAILURE_QUANTIFIERS = 2;
|
|
64
104
|
const FAILURE_CANCELED = 3;
|
|
105
|
+
const FAILURE_NUM_CONFLICTS = 4;
|
|
65
106
|
|
|
66
107
|
type SearchFailure =
|
|
67
108
|
| typeof FAILURE_OK
|
|
68
109
|
| typeof FAILURE_THEORY
|
|
69
110
|
| typeof FAILURE_QUANTIFIERS
|
|
70
|
-
| typeof FAILURE_CANCELED
|
|
111
|
+
| typeof FAILURE_CANCELED
|
|
112
|
+
| typeof FAILURE_NUM_CONFLICTS;
|
|
71
113
|
|
|
72
114
|
type ModelState =
|
|
73
115
|
| { kind: "none" }
|
|
@@ -75,14 +117,52 @@ type ModelState =
|
|
|
75
117
|
| { kind: "proto"; generated: GeneratedModel }
|
|
76
118
|
| { kind: "final"; generated: GeneratedModel; model: ProtoModel };
|
|
77
119
|
|
|
78
|
-
|
|
120
|
+
const THEORY_MAKERS = new Map<number, (context: Context) => Theory>([
|
|
121
|
+
[FAMILY_ARITH, (context) => new TheoryLra(context)],
|
|
122
|
+
[FAMILY_ARRAY, (context) => new TheoryArray(context)],
|
|
123
|
+
[FAMILY_BV, (context) => new TheoryBv(context)],
|
|
124
|
+
[FAMILY_DATATYPE, (context) => new TheoryDatatype(context)],
|
|
125
|
+
[FAMILY_RECFUN, (context) => new TheoryRecfun(context)],
|
|
126
|
+
[FAMILY_SEQ, (context) => new TheorySeq(context)],
|
|
127
|
+
[FAMILY_CHAR, (context) => new TheoryChar(context)],
|
|
128
|
+
[FAMILY_FPA, (context) => new TheoryFpa(context)],
|
|
129
|
+
[FAMILY_FINITE_SET, (context) => new TheoryFiniteSet(context)],
|
|
130
|
+
[FAMILY_POLY, (context) => new TheoryPolymorphism(context)],
|
|
131
|
+
[FAMILY_PB, (context) => new TheoryPb(context)],
|
|
132
|
+
]);
|
|
133
|
+
|
|
134
|
+
// get_luby
|
|
135
|
+
const getLuby = (index: number): number => {
|
|
136
|
+
if (index === 1) return 1;
|
|
137
|
+
const exponent = Math.log(index + 1) / Math.log(2);
|
|
138
|
+
if (exponent === Math.floor(exponent + 0.5)) return 2 ** (exponent - 1);
|
|
139
|
+
return getLuby(index - 2 ** Math.floor(exponent) + 1);
|
|
140
|
+
};
|
|
141
|
+
|
|
142
|
+
const isValidAssumption = (manager: AstManager, expr: number) => {
|
|
143
|
+
if (manager.sorts[expr] !== SORT_BOOL) return false;
|
|
144
|
+
if (manager.isUninterpretedConst(expr)) return true;
|
|
145
|
+
if (manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0))) return true;
|
|
146
|
+
if (manager.kinds[expr] !== KIND_APP || expr === manager.falseExpr) return false;
|
|
147
|
+
if (expr === manager.trueExpr) return true;
|
|
148
|
+
return manager.getFamily(expr) !== FAMILY_BASIC && manager.getNumArgs(expr) === 0;
|
|
149
|
+
};
|
|
150
|
+
|
|
151
|
+
export interface SmtParams {
|
|
79
152
|
isMbqi: boolean;
|
|
153
|
+
mbqiMaxIterations: number;
|
|
80
154
|
relevancyLevel: 0 | 2;
|
|
155
|
+
// The model checker's auxiliary context pretends every array operation is supported.
|
|
156
|
+
isArrayFakeSupport?: boolean;
|
|
81
157
|
}
|
|
82
158
|
|
|
83
159
|
export class Context extends Internalizer {
|
|
84
|
-
|
|
160
|
+
arith: TheoryLra | undefined;
|
|
161
|
+
setup: SmtSetup | undefined;
|
|
162
|
+
readonly theories: Theory[] = [];
|
|
163
|
+
private theoryByFamily: (Theory | undefined)[] = [];
|
|
85
164
|
readonly qmanager: DefaultQuantifierManager;
|
|
165
|
+
readonly fingerprints = new FingerprintSet(this.manager);
|
|
86
166
|
readonly conflictResolution: ConflictResolution = new ConflictResolution(this);
|
|
87
167
|
private readonly dynAck = new DynAckManager(this);
|
|
88
168
|
private qhead = 0;
|
|
@@ -96,26 +176,71 @@ export class Context extends Internalizer {
|
|
|
96
176
|
private bvarInc = 1;
|
|
97
177
|
private agility = 0;
|
|
98
178
|
private numConflicts = 0;
|
|
179
|
+
maxConflicts = Infinity;
|
|
99
180
|
private numConflictsSinceRestart = 0;
|
|
100
181
|
private numConflictsSinceLemmaGc = 0;
|
|
101
182
|
private restartThreshold = RESTART_INITIAL;
|
|
102
183
|
private restartOuterThreshold = RESTART_INITIAL;
|
|
103
184
|
private isPhaseCacheOn = true;
|
|
104
185
|
private phaseCounter = 0;
|
|
186
|
+
private phaseDefault = false;
|
|
187
|
+
private lubyIndex = 1;
|
|
105
188
|
private finalCheckIndex = 0;
|
|
189
|
+
private literalAssumptions = new Map<Literal, number>();
|
|
190
|
+
unsatCore: number[] = [];
|
|
106
191
|
private r1ParentGenerations = new Map<Enode, number>();
|
|
107
192
|
private erasedGenerations = new Map<Enode, number>();
|
|
108
193
|
private lastSearchFailure: SearchFailure = FAILURE_OK;
|
|
194
|
+
private hasCaseSplit = true;
|
|
195
|
+
private incompleteTheories: Theory[] = [];
|
|
109
196
|
private modelState: ModelState = { kind: "none" };
|
|
197
|
+
private asserted: AssertedFormulas | undefined;
|
|
198
|
+
macros: MacroManager | undefined;
|
|
199
|
+
hasQuantifiers = false;
|
|
110
200
|
|
|
111
|
-
constructor(
|
|
112
|
-
|
|
201
|
+
constructor(
|
|
202
|
+
manager: AstManager,
|
|
203
|
+
readonly params: SmtParams,
|
|
204
|
+
) {
|
|
205
|
+
super(manager, params.relevancyLevel > 0);
|
|
113
206
|
this.qmanager = new DefaultQuantifierManager(this, params.isMbqi);
|
|
114
207
|
}
|
|
115
208
|
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
209
|
+
// setup_context and setup_components. The setup's theories come in its order, then setup_card's.
|
|
210
|
+
setupContext(
|
|
211
|
+
setup: SmtSetup | undefined,
|
|
212
|
+
isUsingStaticFeatures: boolean,
|
|
213
|
+
asserted: AssertedFormulas,
|
|
214
|
+
) {
|
|
215
|
+
const config = getSmtConfig(
|
|
216
|
+
this.manager,
|
|
217
|
+
setup,
|
|
218
|
+
isUsingStaticFeatures,
|
|
219
|
+
asserted.getFormulas(),
|
|
220
|
+
this.config,
|
|
221
|
+
);
|
|
222
|
+
this.setup = setup;
|
|
223
|
+
this.config = config;
|
|
224
|
+
if (config.relevancyLevel !== undefined) this.relevancy.isEnabled = config.relevancyLevel > 0;
|
|
225
|
+
for (const family of config.theories)
|
|
226
|
+
if (family !== FAMILY_POLY || this.manager.hasTypeVars) this.registerFamily(family);
|
|
227
|
+
this.registerFamily(FAMILY_PB);
|
|
228
|
+
asserted.setup(config);
|
|
229
|
+
}
|
|
230
|
+
|
|
231
|
+
// register_plugin keeps the theory a family already has.
|
|
232
|
+
registerFamily(family: number) {
|
|
233
|
+
if (this.getTheory(family) !== undefined) return;
|
|
234
|
+
const theory = THEORY_MAKERS.get(family)!(this);
|
|
235
|
+
if (theory instanceof TheoryLra) this.arith = theory;
|
|
236
|
+
this.theories.push(theory);
|
|
237
|
+
this.theoryByFamily[theory.id] = theory;
|
|
238
|
+
theory.init();
|
|
239
|
+
for (let level = 0; level < this.scopeLevel; level++) theory.pushScopeEh();
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
getTheory(family: number) {
|
|
243
|
+
return family < 0 ? undefined : this.theoryByFamily[family];
|
|
119
244
|
}
|
|
120
245
|
|
|
121
246
|
checkCanceled() {
|
|
@@ -136,7 +261,7 @@ export class Context extends Internalizer {
|
|
|
136
261
|
this.justifications[boolVar] = justification;
|
|
137
262
|
this.setLevel(boolVar, this.scopeLevel);
|
|
138
263
|
const isNegative = isNegated(literal);
|
|
139
|
-
if (this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
|
|
264
|
+
if (this.config.isRestartAdaptive && this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
|
|
140
265
|
this.agility *= AGILITY_FACTOR;
|
|
141
266
|
if (!isDecision && this.hasBoolVarFlag(boolVar, BV_PHASE) === isNegative)
|
|
142
267
|
this.agility += 1 - AGILITY_FACTOR;
|
|
@@ -244,7 +369,7 @@ export class Context extends Internalizer {
|
|
|
244
369
|
}
|
|
245
370
|
}
|
|
246
371
|
} else if (this.hasBoolVarFlag(boolVar, BV_THEORY))
|
|
247
|
-
this.
|
|
372
|
+
this.getTheory(this.getBoolVarTheory(boolVar))?.assignEh(boolVar, value === L_TRUE);
|
|
248
373
|
else if (this.hasBoolVarFlag(boolVar, BV_QUANTIFIER) && value === L_TRUE)
|
|
249
374
|
this.qmanager.assignEh(this.boolVar2Expr[boolVar]);
|
|
250
375
|
if (this.isInconsistent()) return false;
|
|
@@ -294,8 +419,14 @@ export class Context extends Internalizer {
|
|
|
294
419
|
if (this.manager.kinds[expr] !== KIND_APP) return;
|
|
295
420
|
const node = this.exprToEnode[expr];
|
|
296
421
|
if (node !== undefined) this.qmanager.relevantEh(node);
|
|
297
|
-
|
|
298
|
-
|
|
422
|
+
const propagated = this.getTheory(this.manager.getFamily(expr));
|
|
423
|
+
propagated?.relevantEh(expr);
|
|
424
|
+
if (node === undefined || node.thVar < 0) return;
|
|
425
|
+
if (this.theoryByFamily[node.thId] !== propagated)
|
|
426
|
+
this.theoryByFamily[node.thId]?.relevantEh(expr);
|
|
427
|
+
for (let cell = node.thNext; cell !== null; cell = cell.next)
|
|
428
|
+
if (this.theoryByFamily[cell.thId] !== propagated)
|
|
429
|
+
this.theoryByFamily[cell.thId]?.relevantEh(expr);
|
|
299
430
|
}
|
|
300
431
|
|
|
301
432
|
private propagateRelevancy(qhead: number) {
|
|
@@ -308,25 +439,38 @@ export class Context extends Internalizer {
|
|
|
308
439
|
|
|
309
440
|
private propagateThEqs() {
|
|
310
441
|
const queue = this.thEqQueue;
|
|
311
|
-
for (let index = 0; index < queue.length && !this.isInconsistent(); index +=
|
|
312
|
-
this.
|
|
442
|
+
for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
|
|
443
|
+
this.theoryByFamily[queue[index]]?.newEqEh(queue[index + 1], queue[index + 2]);
|
|
313
444
|
this.thEqQueue = [];
|
|
314
445
|
}
|
|
315
446
|
|
|
316
447
|
private propagateThDiseqs() {
|
|
317
448
|
const queue = this.thDiseqQueue;
|
|
318
|
-
for (let index = 0; index < queue.length && !this.isInconsistent(); index +=
|
|
319
|
-
this.
|
|
449
|
+
for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
|
|
450
|
+
this.theoryByFamily[queue[index]]?.newDiseqEh(queue[index + 1], queue[index + 2]);
|
|
320
451
|
this.thDiseqQueue = [];
|
|
321
452
|
}
|
|
322
453
|
|
|
454
|
+
private canTheoriesPropagate() {
|
|
455
|
+
for (const theory of this.theories) if (theory.canPropagate()) return true;
|
|
456
|
+
return false;
|
|
457
|
+
}
|
|
458
|
+
|
|
459
|
+
private propagateTheories() {
|
|
460
|
+
for (const theory of this.theories) {
|
|
461
|
+
theory.propagate();
|
|
462
|
+
if (this.isInconsistent()) return false;
|
|
463
|
+
}
|
|
464
|
+
return true;
|
|
465
|
+
}
|
|
466
|
+
|
|
323
467
|
canPropagate() {
|
|
324
468
|
return (
|
|
325
469
|
this.qhead !== this.assignedLiterals.length ||
|
|
326
470
|
this.relevancy.canPropagate() ||
|
|
327
471
|
this.atomPropagationQueue.length > 0 ||
|
|
328
472
|
this.qmanager.canPropagate() ||
|
|
329
|
-
this.
|
|
473
|
+
this.canTheoriesPropagate() ||
|
|
330
474
|
this.eqPropagationQueue.length > 0 ||
|
|
331
475
|
this.thEqQueue.length > 0 ||
|
|
332
476
|
this.thDiseqQueue.length > 0
|
|
@@ -345,8 +489,7 @@ export class Context extends Internalizer {
|
|
|
345
489
|
this.propagateThEqs();
|
|
346
490
|
this.propagateThDiseqs();
|
|
347
491
|
if (this.isInconsistent()) return false;
|
|
348
|
-
this.
|
|
349
|
-
if (this.isInconsistent()) return false;
|
|
492
|
+
if (!this.propagateTheories()) return false;
|
|
350
493
|
if (!this.checkCanceled()) this.qmanager.propagate();
|
|
351
494
|
if (this.isInconsistent()) return false;
|
|
352
495
|
if (this.isResourceLimitExceeded()) {
|
|
@@ -357,9 +500,12 @@ export class Context extends Internalizer {
|
|
|
357
500
|
}
|
|
358
501
|
}
|
|
359
502
|
|
|
360
|
-
private getClosestVar(start: Enode) {
|
|
361
|
-
|
|
362
|
-
|
|
503
|
+
private getClosestVar(start: Enode, thId: number) {
|
|
504
|
+
if (thId < 0) return -1;
|
|
505
|
+
for (let node: Enode | null = start; node !== null; node = node.transTarget) {
|
|
506
|
+
const thVar = node.getThVar(thId);
|
|
507
|
+
if (thVar >= 0) return thVar;
|
|
508
|
+
}
|
|
363
509
|
return -1;
|
|
364
510
|
}
|
|
365
511
|
|
|
@@ -379,17 +525,19 @@ export class Context extends Internalizer {
|
|
|
379
525
|
}
|
|
380
526
|
}
|
|
381
527
|
|
|
382
|
-
private pushNewThEq(first: number, second: number) {
|
|
383
|
-
this.thEqQueue.push(first, second);
|
|
528
|
+
private pushNewThEq(thId: number, first: number, second: number) {
|
|
529
|
+
this.thEqQueue.push(thId, first, second);
|
|
384
530
|
}
|
|
385
531
|
|
|
386
|
-
private pushNewThDiseq(first: number, second: number) {
|
|
387
|
-
const theory = this.
|
|
532
|
+
private pushNewThDiseq(thId: number, first: number, second: number) {
|
|
533
|
+
const theory = this.theoryByFamily[thId];
|
|
534
|
+
if (theory === undefined) return;
|
|
388
535
|
if (theory.getEnode(first).isInterpreted && theory.getEnode(second).isInterpreted) return;
|
|
389
|
-
this.thDiseqQueue.push(first, second);
|
|
536
|
+
this.thDiseqQueue.push(thId, first, second);
|
|
390
537
|
}
|
|
391
538
|
|
|
392
|
-
private pushNewThDiseqs(root: Enode, thVar: number) {
|
|
539
|
+
private pushNewThDiseqs(root: Enode, thVar: number, thId: number) {
|
|
540
|
+
if (!this.theoryByFamily[thId]?.useDiseqs()) return;
|
|
393
541
|
for (const parent of root.parents) {
|
|
394
542
|
if (!parent.isEq) continue;
|
|
395
543
|
if (this.assignment[mkLiteral(this.getBoolVar(parent.owner))] !== L_FALSE) continue;
|
|
@@ -400,10 +548,10 @@ export class Context extends Internalizer {
|
|
|
400
548
|
lhs = rhs;
|
|
401
549
|
rhs = saved;
|
|
402
550
|
}
|
|
403
|
-
const rhsVar = this.getClosestVar(rhs);
|
|
404
|
-
const lhsVar = this.getClosestVar(lhs);
|
|
551
|
+
const rhsVar = this.getClosestVar(rhs, thId);
|
|
552
|
+
const lhsVar = this.getClosestVar(lhs, thId);
|
|
405
553
|
const finalVar = lhsVar >= 0 ? lhsVar : thVar;
|
|
406
|
-
if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(finalVar, rhsVar);
|
|
554
|
+
if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(thId, finalVar, rhsVar);
|
|
407
555
|
}
|
|
408
556
|
}
|
|
409
557
|
|
|
@@ -411,38 +559,65 @@ export class Context extends Internalizer {
|
|
|
411
559
|
const r2 = n2.root;
|
|
412
560
|
const r1 = n1.root;
|
|
413
561
|
if (r1.thVar < 0 && r2.thVar < 0) return;
|
|
414
|
-
const
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
|
|
562
|
+
const fromTheory =
|
|
563
|
+
justification.kind === "justification" ? justification.justification.fromTheory : -1;
|
|
564
|
+
if (r2.thNext === null && r1.thNext === null) {
|
|
565
|
+
const t2 = r2.thId;
|
|
566
|
+
const t1 = r1.thId;
|
|
567
|
+
const v2 = this.getClosestVar(n2, t2);
|
|
568
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
569
|
+
if (v2 >= 0 && v1 >= 0) {
|
|
570
|
+
if (t1 === t2) {
|
|
571
|
+
if (t1 !== fromTheory) this.pushNewThEq(t1, v2, v1);
|
|
572
|
+
return;
|
|
573
|
+
}
|
|
574
|
+
r2.addThVar(v1, t1);
|
|
575
|
+
this.pushNewThDiseqs(r2, v1, t1);
|
|
576
|
+
this.pushNewThDiseqs(r1, v2, t2);
|
|
577
|
+
} else if (v1 < 0 && v2 >= 0) this.pushNewThDiseqs(r1, v2, t2);
|
|
578
|
+
else if (v1 >= 0 && v2 < 0) {
|
|
579
|
+
r2.thVar = v1;
|
|
580
|
+
r2.thId = t1;
|
|
581
|
+
this.pushNewThDiseqs(r2, v1, t1);
|
|
582
|
+
}
|
|
583
|
+
return;
|
|
423
584
|
}
|
|
424
|
-
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
585
|
+
r2.forEachThVar((t2) => {
|
|
586
|
+
const v2 = this.getClosestVar(n2, t2);
|
|
587
|
+
const v1 = this.getClosestVar(n1, t2);
|
|
588
|
+
if (v1 >= 0) {
|
|
589
|
+
if (t2 !== fromTheory) this.pushNewThEq(t2, v2, v1);
|
|
590
|
+
} else this.pushNewThDiseqs(r1, v2, t2);
|
|
591
|
+
});
|
|
592
|
+
r1.forEachThVar((t1) => {
|
|
593
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
594
|
+
if (r2.getThVar(t1) >= 0) return;
|
|
595
|
+
r2.addThVar(v1, t1);
|
|
596
|
+
this.pushNewThDiseqs(r2, v1, t1);
|
|
597
|
+
});
|
|
598
|
+
}
|
|
599
|
+
|
|
600
|
+
attachThVar(node: Enode, theory: Theory, thVar: number) {
|
|
601
|
+
const thId = theory.id;
|
|
602
|
+
const oldVar = node.getThVar(thId);
|
|
428
603
|
if (oldVar >= 0) {
|
|
429
|
-
node.thVar
|
|
604
|
+
node.replaceThVar(thVar, thId);
|
|
430
605
|
this.pushTrail(() => {
|
|
431
|
-
node.
|
|
606
|
+
node.replaceThVar(oldVar, thId);
|
|
432
607
|
});
|
|
433
|
-
this.pushNewThEq(thVar, oldVar);
|
|
608
|
+
this.pushNewThEq(thId, thVar, oldVar);
|
|
434
609
|
return;
|
|
435
610
|
}
|
|
436
611
|
const root = node.root;
|
|
437
|
-
const rootVar = root.
|
|
438
|
-
node.thVar
|
|
439
|
-
this.trailInts.push(
|
|
612
|
+
const rootVar = root.getThVar(thId);
|
|
613
|
+
node.addThVar(thVar, thId);
|
|
614
|
+
this.trailInts.push(thId);
|
|
440
615
|
this.trailNodes.push(node);
|
|
441
616
|
this.trailKinds.push(UNDO_TH_VAR);
|
|
442
617
|
if (rootVar < 0) {
|
|
443
|
-
if (root !== node) root.thVar
|
|
444
|
-
this.pushNewThDiseqs(root, thVar);
|
|
445
|
-
} else if (root !== node) this.pushNewThEq(rootVar, thVar);
|
|
618
|
+
if (root !== node) root.addThVar(thVar, thId);
|
|
619
|
+
this.pushNewThDiseqs(root, thVar, thId);
|
|
620
|
+
} else if (root !== node) this.pushNewThEq(thId, rootVar, thVar);
|
|
446
621
|
}
|
|
447
622
|
|
|
448
623
|
addEq(inputN1: Enode, inputN2: Enode, justification: EqJustification) {
|
|
@@ -555,9 +730,10 @@ export class Context extends Internalizer {
|
|
|
555
730
|
}
|
|
556
731
|
case UNDO_TH_VAR: {
|
|
557
732
|
const node = this.popTrailNode();
|
|
558
|
-
const
|
|
559
|
-
|
|
560
|
-
|
|
733
|
+
const thId = this.popTrailInt();
|
|
734
|
+
const thVar = node.getThVar(thId);
|
|
735
|
+
node.delThVar(thId);
|
|
736
|
+
if (node.root !== node && node.root.getThVar(thId) === thVar) node.root.delThVar(thId);
|
|
561
737
|
return;
|
|
562
738
|
}
|
|
563
739
|
default:
|
|
@@ -601,7 +777,12 @@ export class Context extends Internalizer {
|
|
|
601
777
|
parent.cg = congruent;
|
|
602
778
|
if (congruent === parent) parent.generation = generation;
|
|
603
779
|
}
|
|
604
|
-
if (r2.
|
|
780
|
+
if (r2.thNext === null) {
|
|
781
|
+
if (r2.thVar >= 0 && this.theoryByFamily[r2.thId]?.getEnode(r2.thVar).root !== r2) {
|
|
782
|
+
r2.thVar = -1;
|
|
783
|
+
r2.thId = -1;
|
|
784
|
+
}
|
|
785
|
+
} else r2.restoreThVars((thId, thVar) => this.theoryByFamily[thId]?.getEnode(thVar) ?? r2);
|
|
605
786
|
n1.transTarget = null;
|
|
606
787
|
this.invertTrans(r1);
|
|
607
788
|
}
|
|
@@ -643,13 +824,38 @@ export class Context extends Internalizer {
|
|
|
643
824
|
private addDiseq(n1: Enode, n2: Enode) {
|
|
644
825
|
const r1 = n1.root;
|
|
645
826
|
const r2 = n2.root;
|
|
646
|
-
if (r1 === r2) return r1.
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
827
|
+
if (r1 === r2) return this.theoryByFamily[r1.thId]?.useDiseqs() ?? false;
|
|
828
|
+
if (r1.thNext === null && r2.thNext === null) {
|
|
829
|
+
const t1 = r1.thId;
|
|
830
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
831
|
+
const v2 = this.getClosestVar(n2, t1);
|
|
832
|
+
if (v1 >= 0 && v2 >= 0 && t1 === r2.thId && this.theoryByFamily[t1]?.useDiseqs())
|
|
833
|
+
this.pushNewThDiseq(t1, v1, v2);
|
|
834
|
+
return true;
|
|
835
|
+
}
|
|
836
|
+
r1.forEachThVar((t1) => {
|
|
837
|
+
if (!this.theoryByFamily[t1]?.useDiseqs()) return;
|
|
838
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
839
|
+
const v2 = this.getClosestVar(n2, t1);
|
|
840
|
+
if (v2 >= 0) this.pushNewThDiseq(t1, v1, v2);
|
|
841
|
+
});
|
|
650
842
|
return true;
|
|
651
843
|
}
|
|
652
844
|
|
|
845
|
+
isShared(node: Enode) {
|
|
846
|
+
const root = node.root;
|
|
847
|
+
if (this.manager.getOp(root.owner) === OP_ITE) return true;
|
|
848
|
+
if (root.thVar < 0) return false;
|
|
849
|
+
if (root.thNext !== null) return true;
|
|
850
|
+
if (this.qmanager.isShared(root)) return true;
|
|
851
|
+
for (const parent of root.parents) {
|
|
852
|
+
const family = this.manager.getFamily(parent.owner);
|
|
853
|
+
if (family === root.thId || family === FAMILY_BASIC) continue;
|
|
854
|
+
if (!this.getTheory(family)?.isBetaRedex(parent, root)) return true;
|
|
855
|
+
}
|
|
856
|
+
return this.getTheory(root.thId)?.isShared(root.thVar) ?? false;
|
|
857
|
+
}
|
|
858
|
+
|
|
653
859
|
assumeEq(lhs: Enode, rhs: Enode) {
|
|
654
860
|
if (lhs.root === rhs.root) return false;
|
|
655
861
|
const eq = this.mkEqAtom(lhs.owner, rhs.owner);
|
|
@@ -659,7 +865,10 @@ export class Context extends Internalizer {
|
|
|
659
865
|
const boolVar = this.getBoolVar(eq);
|
|
660
866
|
this.setBoolVarFlag(boolVar, BV_EQ, true);
|
|
661
867
|
this.setTrueFirstFlag(boolVar);
|
|
662
|
-
this.
|
|
868
|
+
this.getTheory(this.manager.getSortFamily(this.manager.sorts[lhs.owner]))?.internalizeEqEh(
|
|
869
|
+
eq,
|
|
870
|
+
boolVar,
|
|
871
|
+
);
|
|
663
872
|
isNew = true;
|
|
664
873
|
}
|
|
665
874
|
const boolVar = this.getBoolVar(eq);
|
|
@@ -685,14 +894,15 @@ export class Context extends Internalizer {
|
|
|
685
894
|
this.caseSplitQueue.activityIncreased(boolVar);
|
|
686
895
|
}
|
|
687
896
|
|
|
688
|
-
|
|
897
|
+
pushScope() {
|
|
689
898
|
this.scopeLevel++;
|
|
690
899
|
this.scopeAssignedLimits.push(this.assignedLiterals.length);
|
|
691
900
|
this.scopeAuxClauseLimits.push(this.auxClauses.length);
|
|
692
901
|
this.scopeTrailLimits.push(this.trailKinds.length);
|
|
693
902
|
this.relevancy.push();
|
|
694
903
|
this.qmanager.push();
|
|
695
|
-
this.
|
|
904
|
+
this.fingerprints.push();
|
|
905
|
+
for (const theory of this.theories) theory.pushScopeEh();
|
|
696
906
|
}
|
|
697
907
|
|
|
698
908
|
private cacheGenerationOfExpr(expr: number, newLevel: number, visited: Set<number>) {
|
|
@@ -750,6 +960,7 @@ export class Context extends Internalizer {
|
|
|
750
960
|
const newLevel = this.scopeLevel - numScopes;
|
|
751
961
|
this.cacheGeneration(newLevel, visited);
|
|
752
962
|
this.qmanager.pop(numScopes);
|
|
963
|
+
this.fingerprints.pop(numScopes);
|
|
753
964
|
if (newLevel < this.baseLevel) {
|
|
754
965
|
this.deleteClauses(this.lemmas, this.baseScopeLemmaLimits[newLevel]);
|
|
755
966
|
shrink(this.baseScopeLemmaLimits, newLevel);
|
|
@@ -759,7 +970,7 @@ export class Context extends Internalizer {
|
|
|
759
970
|
this.relevancy.pop(numScopes);
|
|
760
971
|
this.unassignVars(this.scopeAssignedLimits[newLevel]);
|
|
761
972
|
this.popTrail(this.scopeTrailLimits[newLevel]);
|
|
762
|
-
this.theory.popScopeEh(numScopes);
|
|
973
|
+
for (const theory of this.theories) theory.popScopeEh(numScopes);
|
|
763
974
|
this.eqPropagationQueue = [];
|
|
764
975
|
this.thEqQueue = [];
|
|
765
976
|
this.thDiseqQueue = [];
|
|
@@ -777,7 +988,7 @@ export class Context extends Internalizer {
|
|
|
777
988
|
return numBoolVars;
|
|
778
989
|
}
|
|
779
990
|
|
|
780
|
-
|
|
991
|
+
popScope(numScopes: number) {
|
|
781
992
|
this.popScopeCore(numScopes, new Set());
|
|
782
993
|
this.cachedGeneration.clear();
|
|
783
994
|
}
|
|
@@ -875,11 +1086,17 @@ export class Context extends Internalizer {
|
|
|
875
1086
|
private guess(boolVar: BoolVar) {
|
|
876
1087
|
if (this.manager.kinds[this.boolVar2Expr[boolVar]] === KIND_QUANTIFIER) return false;
|
|
877
1088
|
if (this.hasBoolVarFlag(boolVar, BV_TRUE_FIRST)) return true;
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
1089
|
+
const phaseSelection = this.config.phaseSelection;
|
|
1090
|
+
if (phaseSelection === PS_ALWAYS_FALSE) return false;
|
|
1091
|
+
const isPhaseAvailable = this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE);
|
|
1092
|
+
if (phaseSelection === PS_THEORY) {
|
|
1093
|
+
const phase = this.getTheory(this.getBoolVarTheory(boolVar))?.getPhase(boolVar) ?? L_UNDEF;
|
|
1094
|
+
if (phase !== L_UNDEF) return phase === L_TRUE;
|
|
1095
|
+
return isPhaseAvailable ? this.hasBoolVarFlag(boolVar, BV_PHASE) : this.phaseDefault;
|
|
1096
|
+
}
|
|
1097
|
+
return this.isPhaseCacheOn && isPhaseAvailable
|
|
1098
|
+
? this.hasBoolVarFlag(boolVar, BV_PHASE)
|
|
1099
|
+
: this.phaseDefault;
|
|
883
1100
|
}
|
|
884
1101
|
|
|
885
1102
|
private updatePhaseCacheCounter() {
|
|
@@ -887,18 +1104,27 @@ export class Context extends Internalizer {
|
|
|
887
1104
|
if (this.phaseCounter < (this.isPhaseCacheOn ? PHASE_CACHING_ON : PHASE_CACHING_OFF)) return;
|
|
888
1105
|
this.phaseCounter = 0;
|
|
889
1106
|
this.isPhaseCacheOn = !this.isPhaseCacheOn;
|
|
1107
|
+
if (this.config.phaseSelection === PS_CACHING_CONSERVATIVE2)
|
|
1108
|
+
this.phaseDefault = !this.phaseDefault;
|
|
890
1109
|
}
|
|
891
1110
|
|
|
892
1111
|
private decide() {
|
|
893
1112
|
const boolVar = this.caseSplitQueue.nextCaseSplit();
|
|
894
|
-
if (boolVar === undefined)
|
|
1113
|
+
if (boolVar === undefined) {
|
|
1114
|
+
const hadCaseSplit = this.hasCaseSplit;
|
|
1115
|
+
this.pushTrail(() => {
|
|
1116
|
+
this.hasCaseSplit = hadCaseSplit;
|
|
1117
|
+
});
|
|
1118
|
+
this.hasCaseSplit = false;
|
|
1119
|
+
return false;
|
|
1120
|
+
}
|
|
895
1121
|
const isPositive = this.guess(boolVar);
|
|
896
1122
|
this.pushScope();
|
|
897
1123
|
this.assign(mkLiteral(boolVar, !isPositive), "axiom", true);
|
|
898
1124
|
return true;
|
|
899
1125
|
}
|
|
900
1126
|
|
|
901
|
-
|
|
1127
|
+
resolveConflict() {
|
|
902
1128
|
this.numConflicts++;
|
|
903
1129
|
this.numConflictsSinceRestart++;
|
|
904
1130
|
this.numConflictsSinceLemmaGc++;
|
|
@@ -906,9 +1132,15 @@ export class Context extends Internalizer {
|
|
|
906
1132
|
this.eqPropagationQueue = [];
|
|
907
1133
|
this.thEqQueue = [];
|
|
908
1134
|
this.thDiseqQueue = [];
|
|
1135
|
+
const phaseSelection = this.config.phaseSelection;
|
|
909
1136
|
const head = this.scopeLevel === 0 ? 0 : this.scopeAssignedLimits[this.scopeLevel - 1];
|
|
910
|
-
|
|
911
|
-
|
|
1137
|
+
if (
|
|
1138
|
+
phaseSelection === PS_THEORY ||
|
|
1139
|
+
phaseSelection === PS_CACHING_CONSERVATIVE ||
|
|
1140
|
+
phaseSelection === PS_CACHING_CONSERVATIVE2
|
|
1141
|
+
)
|
|
1142
|
+
for (let index = head; index < this.assignedLiterals.length; index++)
|
|
1143
|
+
this.setBoolVarFlag(getVar(this.assignedLiterals[index]), BV_PHASE_AVAILABLE, false);
|
|
912
1144
|
const resolution = this.conflictResolution;
|
|
913
1145
|
if (
|
|
914
1146
|
this.conflict === null ||
|
|
@@ -954,19 +1186,18 @@ export class Context extends Internalizer {
|
|
|
954
1186
|
let failure: SearchFailure = FAILURE_OK;
|
|
955
1187
|
let level = 1;
|
|
956
1188
|
let maxLevel = 1;
|
|
1189
|
+
this.incompleteTheories = [];
|
|
957
1190
|
for (;;) {
|
|
958
|
-
const
|
|
959
|
-
|
|
960
|
-
if (
|
|
961
|
-
|
|
962
|
-
this.getRandomValue();
|
|
963
|
-
}
|
|
964
|
-
const check = isTheory ? this.theory.finalCheckEh(level) : qmanager.finalCheckEh(true);
|
|
965
|
-
if (isTheory) maxLevel = Math.max(maxLevel, NUM_ARITH_FINAL_CHECK_LEVELS);
|
|
966
|
-
const isCanceled = isTheory && this.checkCanceled();
|
|
1191
|
+
const theory = this.theories[this.finalCheckIndex];
|
|
1192
|
+
const check = theory === undefined ? qmanager.finalCheckEh(true) : theory.finalCheckEh(level);
|
|
1193
|
+
if (theory !== undefined) maxLevel = Math.max(maxLevel, theory.numFinalCheckLevels());
|
|
1194
|
+
const isCanceled = theory === this.arith && this.checkCanceled();
|
|
967
1195
|
if (isCanceled) failure = FAILURE_CANCELED;
|
|
968
|
-
else if (
|
|
969
|
-
|
|
1196
|
+
else if (theory !== undefined && check === FC_GIVEUP) {
|
|
1197
|
+
failure = FAILURE_THEORY;
|
|
1198
|
+
if (!this.incompleteTheories.includes(theory)) this.incompleteTheories.push(theory);
|
|
1199
|
+
}
|
|
1200
|
+
this.finalCheckIndex = (this.finalCheckIndex + 1) % (this.theories.length + 1);
|
|
970
1201
|
if (check === FC_CONTINUE) return FC_CONTINUE;
|
|
971
1202
|
if (check === FC_GIVEUP || isCanceled) result = FC_GIVEUP;
|
|
972
1203
|
if (this.finalCheckIndex !== oldIndex) continue;
|
|
@@ -974,13 +1205,14 @@ export class Context extends Internalizer {
|
|
|
974
1205
|
level++;
|
|
975
1206
|
result = FC_DONE;
|
|
976
1207
|
failure = FAILURE_OK;
|
|
1208
|
+
this.incompleteTheories = [];
|
|
977
1209
|
}
|
|
978
1210
|
if (this.canPropagate()) return FC_CONTINUE;
|
|
979
1211
|
if (result === FC_GIVEUP && failure !== FAILURE_OK) this.lastSearchFailure = failure;
|
|
980
1212
|
return result;
|
|
981
1213
|
}
|
|
982
1214
|
|
|
983
|
-
|
|
1215
|
+
boundedSearch() {
|
|
984
1216
|
for (;;) {
|
|
985
1217
|
while (!this.propagate()) {
|
|
986
1218
|
if (!this.resolveConflict()) return L_FALSE;
|
|
@@ -991,6 +1223,10 @@ export class Context extends Internalizer {
|
|
|
991
1223
|
this.scopeLevel - this.baseLevel > 2
|
|
992
1224
|
)
|
|
993
1225
|
return L_UNDEF;
|
|
1226
|
+
if (this.numConflicts > this.maxConflicts) {
|
|
1227
|
+
this.lastSearchFailure = FAILURE_NUM_CONFLICTS;
|
|
1228
|
+
return L_UNDEF;
|
|
1229
|
+
}
|
|
994
1230
|
}
|
|
995
1231
|
if (this.numConflictsSinceLemmaGc > LEMMA_GC_INITIAL) this.delInactiveLemmas();
|
|
996
1232
|
this.dynAck.propagateEh();
|
|
@@ -1035,13 +1271,41 @@ export class Context extends Internalizer {
|
|
|
1035
1271
|
return generated;
|
|
1036
1272
|
}
|
|
1037
1273
|
|
|
1274
|
+
getLastFailureMessage() {
|
|
1275
|
+
if (this.lastSearchFailure === FAILURE_CANCELED) return "canceled";
|
|
1276
|
+
if (this.lastSearchFailure === FAILURE_NUM_CONFLICTS) return "max-conflicts-reached";
|
|
1277
|
+
if (this.lastSearchFailure === FAILURE_QUANTIFIERS) return "(incomplete quantifiers)";
|
|
1278
|
+
if (this.lastSearchFailure === FAILURE_THEORY)
|
|
1279
|
+
return `(incomplete (theory${this.incompleteTheories.map((theory) => ` ${theory.name}`).join("")}))`;
|
|
1280
|
+
return "unknown";
|
|
1281
|
+
}
|
|
1282
|
+
|
|
1283
|
+
private hasCaseSplits() {
|
|
1284
|
+
if (!this.hasCaseSplit) return false;
|
|
1285
|
+
for (let index = this.numBoolVars; index-- > 0;)
|
|
1286
|
+
if (
|
|
1287
|
+
this.isRelevant(this.boolVar2Expr[index]) &&
|
|
1288
|
+
this.assignment[mkLiteral(toBoolVar(index))] === L_UNDEF
|
|
1289
|
+
)
|
|
1290
|
+
return true;
|
|
1291
|
+
return false;
|
|
1292
|
+
}
|
|
1293
|
+
|
|
1294
|
+
isQuantifierIncomplete() {
|
|
1295
|
+
return this.lastSearchFailure === FAILURE_QUANTIFIERS;
|
|
1296
|
+
}
|
|
1297
|
+
|
|
1298
|
+
// Z3's update_model always answers false, after it recomputes a final state for the next model.
|
|
1299
|
+
updateModel() {
|
|
1300
|
+
if (!this.hasCaseSplits() && this.finalCheck() === FC_DONE) this.resetModel();
|
|
1301
|
+
}
|
|
1302
|
+
|
|
1038
1303
|
getModel() {
|
|
1039
1304
|
if (this.modelState.kind === "final") return this.modelState.model;
|
|
1040
1305
|
const generated =
|
|
1041
1306
|
this.modelState.kind === "proto" ? this.modelState.generated : this.mkProtoModel();
|
|
1042
1307
|
const model = generated.model.mkModel();
|
|
1043
|
-
|
|
1044
|
-
if (!model.constInterps.has(entry[0])) model.registerConst(entry[0], entry[1]);
|
|
1308
|
+
model.addRecFuns();
|
|
1045
1309
|
model.incRef();
|
|
1046
1310
|
this.modelState = { kind: "final", generated, model };
|
|
1047
1311
|
return model;
|
|
@@ -1071,7 +1335,7 @@ export class Context extends Internalizer {
|
|
|
1071
1335
|
this.lastSearchFailure !== FAILURE_THEORY ||
|
|
1072
1336
|
status === L_FALSE ||
|
|
1073
1337
|
this.isInconsistent() ||
|
|
1074
|
-
|
|
1338
|
+
qmanager.quantifiers.length === 0 ||
|
|
1075
1339
|
!qmanager.isModelBased()
|
|
1076
1340
|
)
|
|
1077
1341
|
return status;
|
|
@@ -1083,7 +1347,7 @@ export class Context extends Internalizer {
|
|
|
1083
1347
|
isForcedRestart = true;
|
|
1084
1348
|
}
|
|
1085
1349
|
if (status === L_FALSE) return L_FALSE;
|
|
1086
|
-
if (status === L_TRUE &&
|
|
1350
|
+
if (status === L_TRUE && qmanager.quantifiers.length === 0) return L_TRUE;
|
|
1087
1351
|
if (status === L_TRUE) {
|
|
1088
1352
|
const generated = this.mkProtoModel();
|
|
1089
1353
|
const result = qmanager.isModelBased()
|
|
@@ -1095,17 +1359,15 @@ export class Context extends Internalizer {
|
|
|
1095
1359
|
return L_UNDEF;
|
|
1096
1360
|
}
|
|
1097
1361
|
}
|
|
1098
|
-
|
|
1099
|
-
|
|
1100
|
-
|
|
1101
|
-
|
|
1102
|
-
|
|
1103
|
-
|
|
1104
|
-
|
|
1105
|
-
this.numConflictsSinceRestart = 0;
|
|
1106
|
-
if (isForcedRestart || status === L_TRUE || this.agility < RESTART_AGILITY_THRESHOLD) {
|
|
1362
|
+
this.incLimits();
|
|
1363
|
+
if (
|
|
1364
|
+
isForcedRestart ||
|
|
1365
|
+
status === L_TRUE ||
|
|
1366
|
+
!this.config.isRestartAdaptive ||
|
|
1367
|
+
this.agility < RESTART_AGILITY_THRESHOLD
|
|
1368
|
+
) {
|
|
1107
1369
|
if (this.scopeLevel > currentLevel) this.popScope(this.scopeLevel - currentLevel);
|
|
1108
|
-
if (!this.isInconsistent())
|
|
1370
|
+
for (const theory of this.theories) if (!this.isInconsistent()) theory.restartEh();
|
|
1109
1371
|
if (!this.isInconsistent()) qmanager.restartEh();
|
|
1110
1372
|
if (this.isInconsistent()) {
|
|
1111
1373
|
this.resolveConflict();
|
|
@@ -1115,6 +1377,28 @@ export class Context extends Internalizer {
|
|
|
1115
1377
|
return undefined;
|
|
1116
1378
|
}
|
|
1117
1379
|
|
|
1380
|
+
incLimits() {
|
|
1381
|
+
const config = this.config;
|
|
1382
|
+
if (this.numConflictsSinceRestart >= this.restartThreshold) {
|
|
1383
|
+
if (config.restartStrategy === RS_LUBY) {
|
|
1384
|
+
this.lubyIndex++;
|
|
1385
|
+
this.restartThreshold = getLuby(this.lubyIndex) * RESTART_INITIAL;
|
|
1386
|
+
} else {
|
|
1387
|
+
this.restartThreshold = Math.trunc(this.restartThreshold * config.restartFactor);
|
|
1388
|
+
if (
|
|
1389
|
+
config.restartStrategy !== RS_GEOMETRIC &&
|
|
1390
|
+
this.restartThreshold > this.restartOuterThreshold
|
|
1391
|
+
) {
|
|
1392
|
+
this.restartThreshold = RESTART_INITIAL;
|
|
1393
|
+
this.restartOuterThreshold = Math.trunc(
|
|
1394
|
+
this.restartOuterThreshold * config.restartFactor,
|
|
1395
|
+
);
|
|
1396
|
+
}
|
|
1397
|
+
}
|
|
1398
|
+
}
|
|
1399
|
+
this.numConflictsSinceRestart = 0;
|
|
1400
|
+
}
|
|
1401
|
+
|
|
1118
1402
|
private isDeletable(clause: Clause) {
|
|
1119
1403
|
const store = this.clauses;
|
|
1120
1404
|
if (store.isReinit(clause)) return false;
|
|
@@ -1177,7 +1461,26 @@ export class Context extends Internalizer {
|
|
|
1177
1461
|
if (this.scopeLevel > this.baseLevel) this.popScope(this.scopeLevel - this.baseLevel);
|
|
1178
1462
|
}
|
|
1179
1463
|
|
|
1464
|
+
popToSearchLevel() {
|
|
1465
|
+
if (this.scopeLevel > this.searchLevel) this.popScope(this.scopeLevel - this.searchLevel);
|
|
1466
|
+
}
|
|
1467
|
+
|
|
1468
|
+
hasSearchFailure() {
|
|
1469
|
+
return this.lastSearchFailure !== FAILURE_OK;
|
|
1470
|
+
}
|
|
1471
|
+
|
|
1472
|
+
resetConflict() {
|
|
1473
|
+
this.conflict = null;
|
|
1474
|
+
}
|
|
1475
|
+
|
|
1476
|
+
getNumAssertedFormulas() {
|
|
1477
|
+
return this.asserted?.getNumFormulas() ?? 0;
|
|
1478
|
+
}
|
|
1479
|
+
|
|
1180
1480
|
internalizeAssertions(asserted: AssertedFormulas) {
|
|
1481
|
+
this.asserted = asserted;
|
|
1482
|
+
this.macros = asserted.macros;
|
|
1483
|
+
this.hasQuantifiers = asserted.hasQuantifiers;
|
|
1181
1484
|
const formulas = asserted.reduce();
|
|
1182
1485
|
if (asserted.isInconsistent) {
|
|
1183
1486
|
this.setConflict("axiom", null);
|
|
@@ -1189,34 +1492,132 @@ export class Context extends Internalizer {
|
|
|
1189
1492
|
}
|
|
1190
1493
|
}
|
|
1191
1494
|
|
|
1192
|
-
initAssumptions(assumptions: number[]) {
|
|
1495
|
+
initAssumptions(assumptions: number[], asserted: AssertedFormulas) {
|
|
1496
|
+
this.literalAssumptions.clear();
|
|
1497
|
+
for (const assumption of this.unsatCore) this.manager.decRef(assumption);
|
|
1498
|
+
this.unsatCore = [];
|
|
1193
1499
|
if (assumptions.length > 0) {
|
|
1194
1500
|
this.propagate();
|
|
1195
1501
|
if (this.isInconsistent()) return;
|
|
1196
1502
|
this.delInactiveLemmas();
|
|
1197
1503
|
this.pushScope();
|
|
1198
|
-
|
|
1504
|
+
const manager = this.manager;
|
|
1505
|
+
const proxies = assumptions.map((assumption) => {
|
|
1506
|
+
if (isValidAssumption(manager, assumption)) return assumption;
|
|
1507
|
+
const proxy = manager.mkFreshConst(null, SORT_BOOL);
|
|
1508
|
+
asserted.assertExpr(manager.mkApp(OP_IMPLIES, [proxy, assumption], SORT_BOOL));
|
|
1509
|
+
return proxy;
|
|
1510
|
+
});
|
|
1511
|
+
this.internalizeAssertions(asserted);
|
|
1512
|
+
for (const [index, proxy] of proxies.entries()) {
|
|
1199
1513
|
if (this.isInconsistent()) break;
|
|
1200
|
-
|
|
1514
|
+
if (proxy === manager.trueExpr) continue;
|
|
1515
|
+
this.internalizeAssertion(proxy, 0);
|
|
1516
|
+
const literal = this.getLiteral(proxy);
|
|
1517
|
+
if (literal === this.trueLiteral || literal === this.falseLiteral) continue;
|
|
1518
|
+
this.literalAssumptions.set(literal, assumptions[index]);
|
|
1201
1519
|
}
|
|
1202
1520
|
}
|
|
1203
1521
|
this.searchLevel = this.scopeLevel;
|
|
1204
1522
|
}
|
|
1205
1523
|
|
|
1524
|
+
addTheoryAssumptions(assumptions: number[]) {
|
|
1525
|
+
for (const theory of this.theories) theory.addTheoryAssumptions(assumptions);
|
|
1526
|
+
}
|
|
1527
|
+
|
|
1528
|
+
checkResearching(asserted: AssertedFormulas, assumptions: readonly number[]) {
|
|
1529
|
+
let result: number;
|
|
1530
|
+
for (;;) {
|
|
1531
|
+
this.popToBaseLevel();
|
|
1532
|
+
this.internalizeAssertions(asserted);
|
|
1533
|
+
const all = [...assumptions];
|
|
1534
|
+
this.addTheoryAssumptions(all);
|
|
1535
|
+
this.initAssumptions(all, asserted);
|
|
1536
|
+
result = this.mkUnsatCore(this.search());
|
|
1537
|
+
if (result !== L_FALSE || this.unsatCore.length === 0) return result;
|
|
1538
|
+
if (!this.theories.some((theory) => theory.shouldResearch(this.unsatCore))) return result;
|
|
1539
|
+
}
|
|
1540
|
+
}
|
|
1541
|
+
|
|
1542
|
+
findMutexes(vars: readonly number[]) {
|
|
1543
|
+
const manager = this.manager;
|
|
1544
|
+
const cliques = new MaxCliques((index) => index ^ 1);
|
|
1545
|
+
const literals: number[] = [];
|
|
1546
|
+
for (const variable of vars) {
|
|
1547
|
+
const isNot = manager.getOp(variable) === OP_NOT;
|
|
1548
|
+
const atom = isNot ? manager.getArg(variable, 0) : variable;
|
|
1549
|
+
const boolVar = this.findBoolVar(atom);
|
|
1550
|
+
if (boolVar !== undefined) literals.push(mkLiteral(boolVar, isNot));
|
|
1551
|
+
}
|
|
1552
|
+
for (let index = 0; index < this.binaryWatches.length; index++)
|
|
1553
|
+
for (const other of this.binaryWatches[index] ?? []) {
|
|
1554
|
+
const source = index ^ 1;
|
|
1555
|
+
if (source < other) cliques.addEdge(source, other);
|
|
1556
|
+
}
|
|
1557
|
+
return cliques.cliques2(literals).map((mutex) =>
|
|
1558
|
+
mutex.map((index) => {
|
|
1559
|
+
const literal = index as Literal;
|
|
1560
|
+
if (literal === this.trueLiteral) return manager.trueExpr;
|
|
1561
|
+
if (literal === this.falseLiteral) return manager.falseExpr;
|
|
1562
|
+
const atom = this.boolVar2Expr[getVar(literal)];
|
|
1563
|
+
return isNegated(literal) ? manager.mkApp(OP_NOT, [atom], SORT_BOOL) : atom;
|
|
1564
|
+
}),
|
|
1565
|
+
);
|
|
1566
|
+
}
|
|
1567
|
+
|
|
1568
|
+
isAssumption(boolVar: BoolVar) {
|
|
1569
|
+
return (
|
|
1570
|
+
this.literalAssumptions.has(mkLiteral(boolVar)) ||
|
|
1571
|
+
this.literalAssumptions.has(mkLiteral(boolVar, true))
|
|
1572
|
+
);
|
|
1573
|
+
}
|
|
1574
|
+
|
|
1575
|
+
isTrackingAssumptions() {
|
|
1576
|
+
return this.literalAssumptions.size > 0 && this.searchLevel > this.baseLevel;
|
|
1577
|
+
}
|
|
1578
|
+
|
|
1579
|
+
mkUnsatCore(result: number) {
|
|
1580
|
+
if (result !== L_FALSE || !this.isTrackingAssumptions()) return result;
|
|
1581
|
+
const literalAssumptions = this.literalAssumptions;
|
|
1582
|
+
const found = new Set<Literal>();
|
|
1583
|
+
const core: number[] = [];
|
|
1584
|
+
for (const literal of this.conflictResolution.unsatCore) {
|
|
1585
|
+
const assumed = literalAssumptions.has(literal) ? literal : negate(literal);
|
|
1586
|
+
const assumption = literalAssumptions.get(assumed);
|
|
1587
|
+
if (assumption === undefined || found.has(assumed)) continue;
|
|
1588
|
+
found.add(assumed);
|
|
1589
|
+
this.manager.incRef(assumption);
|
|
1590
|
+
core.push(assumption);
|
|
1591
|
+
}
|
|
1592
|
+
literalAssumptions.clear();
|
|
1593
|
+
this.popToBaseLevel();
|
|
1594
|
+
this.searchLevel = this.baseLevel;
|
|
1595
|
+
const ids = this.manager.ids;
|
|
1596
|
+
this.unsatCore = core.sort((left, right) => ids[left] - ids[right]);
|
|
1597
|
+
return L_FALSE;
|
|
1598
|
+
}
|
|
1599
|
+
|
|
1206
1600
|
search() {
|
|
1207
|
-
if (this.isInconsistent())
|
|
1601
|
+
if (this.isInconsistent()) {
|
|
1602
|
+
this.resolveConflict();
|
|
1603
|
+
return L_FALSE;
|
|
1604
|
+
}
|
|
1208
1605
|
this.resetModel();
|
|
1209
|
-
this.theory.initSearchEh();
|
|
1606
|
+
for (const theory of this.theories) theory.initSearchEh();
|
|
1210
1607
|
this.qmanager.initSearchEh();
|
|
1211
1608
|
this.dynAck.initSearchEh();
|
|
1609
|
+
this.incompleteTheories = [];
|
|
1212
1610
|
this.numConflicts = 0;
|
|
1213
1611
|
this.numConflictsSinceRestart = 0;
|
|
1214
1612
|
this.numConflictsSinceLemmaGc = 0;
|
|
1215
1613
|
this.restartThreshold = RESTART_INITIAL;
|
|
1216
1614
|
this.restartOuterThreshold = RESTART_INITIAL;
|
|
1217
1615
|
this.agility = 0;
|
|
1616
|
+
this.lubyIndex = 1;
|
|
1218
1617
|
this.finalCheckIndex = 0;
|
|
1219
1618
|
this.lastSearchFailure = FAILURE_OK;
|
|
1619
|
+
this.phaseDefault = false;
|
|
1620
|
+
if (this.manager.hasTypeVars) this.registerFamily(FAMILY_POLY);
|
|
1220
1621
|
this.isSearching = true;
|
|
1221
1622
|
const currentLevel = this.scopeLevel;
|
|
1222
1623
|
let result: number | undefined;
|