tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,2127 @@
|
|
|
1
|
+
import { SmtCanceledError } from "../../../../errors";
|
|
2
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
3
|
+
import { RandomGen } from "../random-gen";
|
|
4
|
+
import type { ResourceLimit } from "../rlimit";
|
|
5
|
+
import { AsymmBranch } from "./asymm-branch";
|
|
6
|
+
import { Cleaner } from "./cleaner";
|
|
7
|
+
import { ClauseArena, NULL_LITERAL, UINT_MAX } from "./clause";
|
|
8
|
+
import {
|
|
9
|
+
GC_DYN_PSM,
|
|
10
|
+
GC_GLUE,
|
|
11
|
+
GC_GLUE_PSM,
|
|
12
|
+
GC_PSM,
|
|
13
|
+
GC_PSM_GLUE,
|
|
14
|
+
getSatConfig,
|
|
15
|
+
PS_ALWAYS_FALSE,
|
|
16
|
+
PS_ALWAYS_TRUE,
|
|
17
|
+
PS_BASIC_CACHING,
|
|
18
|
+
PS_FROZEN,
|
|
19
|
+
PS_RANDOM,
|
|
20
|
+
PS_SAT_CACHING,
|
|
21
|
+
RS_EMA,
|
|
22
|
+
RS_GEOMETRIC,
|
|
23
|
+
RS_LUBY,
|
|
24
|
+
type SatConfig,
|
|
25
|
+
type SatParams,
|
|
26
|
+
} from "./config";
|
|
27
|
+
import { MaxCliques } from "../max-cliques";
|
|
28
|
+
import { ModelConverter } from "./model-converter";
|
|
29
|
+
import { Probing } from "./probing";
|
|
30
|
+
import { Scc } from "./scc";
|
|
31
|
+
import { Simplifier } from "./simplifier";
|
|
32
|
+
import { VarQueue } from "./var-queue";
|
|
33
|
+
import { WATCH_BINARY, WATCH_EXT_CONSTRAINT, WatchList, mkClauseWatch } from "./watch-list";
|
|
34
|
+
|
|
35
|
+
export const JUSTIFICATION_NONE = 0;
|
|
36
|
+
export const JUSTIFICATION_BINARY = 1;
|
|
37
|
+
export const JUSTIFICATION_CLAUSE = 2;
|
|
38
|
+
export const JUSTIFICATION_EXT = 3;
|
|
39
|
+
|
|
40
|
+
export const CR_DONE = 0;
|
|
41
|
+
export const CR_CONTINUE = 1;
|
|
42
|
+
export const CR_GIVEUP = 2;
|
|
43
|
+
|
|
44
|
+
export interface SatExtension {
|
|
45
|
+
propagated(lit: number, index: number): boolean;
|
|
46
|
+
unitPropagate?(): boolean;
|
|
47
|
+
canPropagate?(): boolean;
|
|
48
|
+
asserted?(lit: number): void;
|
|
49
|
+
check?(): number;
|
|
50
|
+
getReasonUnknown?(): string;
|
|
51
|
+
getPhase?(boolVar: number): number;
|
|
52
|
+
initSearch?(): void;
|
|
53
|
+
preSimplify?(): void;
|
|
54
|
+
isExternal?(boolVar: number): boolean;
|
|
55
|
+
setEliminated?(boolVar: number): void;
|
|
56
|
+
getAntecedents(lit: number, index: number, antecedents: number[]): void;
|
|
57
|
+
resolveConflict(): number;
|
|
58
|
+
push(): void;
|
|
59
|
+
pop(numScopes: number): void;
|
|
60
|
+
userPush?(): void;
|
|
61
|
+
userPop?(numScopes: number): void;
|
|
62
|
+
popReinit(): void;
|
|
63
|
+
simplify(): void;
|
|
64
|
+
gc(): void;
|
|
65
|
+
setRoot(lit: number, root: number): boolean;
|
|
66
|
+
flushRoots(): void;
|
|
67
|
+
initUseList(useVars: Set<number>): void;
|
|
68
|
+
findMutexes(lits: number[], mutexes: number[][]): void;
|
|
69
|
+
toFormulas(lit2expr: (lit: number) => number, formulas: number[]): void;
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
const RANDOM_MAX_VALUE = 0x7fff;
|
|
73
|
+
|
|
74
|
+
const S_SAT = 0;
|
|
75
|
+
const S_UNSAT = 1;
|
|
76
|
+
|
|
77
|
+
export class Ema {
|
|
78
|
+
private beta = 1;
|
|
79
|
+
value = 0;
|
|
80
|
+
private period = 0;
|
|
81
|
+
private wait = 0;
|
|
82
|
+
|
|
83
|
+
constructor(private alpha = 0) {}
|
|
84
|
+
|
|
85
|
+
setAlpha(alpha: number) {
|
|
86
|
+
this.alpha = alpha;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
update(sample: number) {
|
|
90
|
+
this.value += this.beta * (sample - this.value);
|
|
91
|
+
if (this.beta <= this.alpha || this.wait-- !== 0) return;
|
|
92
|
+
this.period = 2 * (this.period + 1) - 1;
|
|
93
|
+
this.wait = this.period;
|
|
94
|
+
this.beta *= 0.5;
|
|
95
|
+
if (this.beta < this.alpha) this.beta = this.alpha;
|
|
96
|
+
}
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
interface Scope {
|
|
100
|
+
trailLim: number;
|
|
101
|
+
clausesToReinitLim: number;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
const getLuby = (index: number) => {
|
|
105
|
+
let size = 1;
|
|
106
|
+
let sequence = 0;
|
|
107
|
+
while (size < index) {
|
|
108
|
+
sequence++;
|
|
109
|
+
size = 2 * size + 1;
|
|
110
|
+
}
|
|
111
|
+
let remaining = index - 1;
|
|
112
|
+
while (size - 1 !== remaining) {
|
|
113
|
+
size = (size - 1) >> 1;
|
|
114
|
+
sequence--;
|
|
115
|
+
remaining %= size;
|
|
116
|
+
}
|
|
117
|
+
return 2 ** sequence;
|
|
118
|
+
};
|
|
119
|
+
|
|
120
|
+
const sortClauses = (clauses: number[], isLess: (first: number, second: number) => boolean) =>
|
|
121
|
+
clauses.sort((first, second) => (isLess(first, second) ? -1 : isLess(second, first) ? 1 : 0));
|
|
122
|
+
|
|
123
|
+
export class Solver {
|
|
124
|
+
config: SatConfig;
|
|
125
|
+
rand: RandomGen;
|
|
126
|
+
arena = new ClauseArena();
|
|
127
|
+
cleaner: Cleaner;
|
|
128
|
+
mc = new ModelConverter();
|
|
129
|
+
simplifier: Simplifier;
|
|
130
|
+
scc: Scc;
|
|
131
|
+
asymmBranch: AsymmBranch;
|
|
132
|
+
probing: Probing;
|
|
133
|
+
ext: SatExtension | null = null;
|
|
134
|
+
isProbing = false;
|
|
135
|
+
private isGivenUp = false;
|
|
136
|
+
private activeVars: number[] = [];
|
|
137
|
+
private varsLim: number[] = [];
|
|
138
|
+
varsToReinit: number[] = [];
|
|
139
|
+
model = new Int8Array(0);
|
|
140
|
+
isModelCurrent = false;
|
|
141
|
+
isInconsistent = false;
|
|
142
|
+
isSearching = false;
|
|
143
|
+
conflictJustLevel = 0;
|
|
144
|
+
conflictLevel = 0;
|
|
145
|
+
conflictVal = 0;
|
|
146
|
+
conflictKind = JUSTIFICATION_NONE;
|
|
147
|
+
notL = NULL_LITERAL;
|
|
148
|
+
clauses: number[] = [];
|
|
149
|
+
learned: number[] = [];
|
|
150
|
+
numFrozen = 0;
|
|
151
|
+
watches: WatchList[] = [];
|
|
152
|
+
assignment = new Int8Array(16);
|
|
153
|
+
justLevel = new Uint32Array(8);
|
|
154
|
+
private varCount = 0;
|
|
155
|
+
justVal: number[] = [];
|
|
156
|
+
justKind: number[] = [];
|
|
157
|
+
mark: boolean[] = [];
|
|
158
|
+
litMark: boolean[] = [];
|
|
159
|
+
eliminated: boolean[] = [];
|
|
160
|
+
external: boolean[] = [];
|
|
161
|
+
varScope: number[] = [];
|
|
162
|
+
touched: number[] = [];
|
|
163
|
+
touchIndex = 0;
|
|
164
|
+
replayAssign: number[] = [];
|
|
165
|
+
activity: number[] = [];
|
|
166
|
+
activityInc = 128;
|
|
167
|
+
phase: boolean[] = [];
|
|
168
|
+
bestPhase: boolean[] = [];
|
|
169
|
+
prevPhase: boolean[] = [];
|
|
170
|
+
phaseBirthdate: number[] = [];
|
|
171
|
+
bestPhaseBirthdate: number[] = [];
|
|
172
|
+
assignedSinceGc: boolean[] = [];
|
|
173
|
+
searchState = S_UNSAT;
|
|
174
|
+
searchUnsatConflicts = 0;
|
|
175
|
+
searchSatConflicts = 0;
|
|
176
|
+
searchNextToggle = 0;
|
|
177
|
+
phaseCounter = 0;
|
|
178
|
+
bestPhaseSize = 0;
|
|
179
|
+
rephaseLim = 0;
|
|
180
|
+
rephaseInc = 0;
|
|
181
|
+
rephaseCount = 0;
|
|
182
|
+
caseSplitQueue: VarQueue;
|
|
183
|
+
qhead = 0;
|
|
184
|
+
scopeLvl = 0;
|
|
185
|
+
searchLvl = 0;
|
|
186
|
+
fastGlueAvg = new Ema();
|
|
187
|
+
slowGlueAvg = new Ema();
|
|
188
|
+
fastGlueBackup = new Ema();
|
|
189
|
+
slowGlueBackup = new Ema();
|
|
190
|
+
trailAvg = new Ema();
|
|
191
|
+
trail: number[] = [];
|
|
192
|
+
clausesToReinit: number[] = [];
|
|
193
|
+
reasonUnknown = "";
|
|
194
|
+
visited: number[] = [];
|
|
195
|
+
visitedTimestamp = 0;
|
|
196
|
+
scopes: Scope[] = [];
|
|
197
|
+
core: number[] = [];
|
|
198
|
+
conflicts = 0;
|
|
199
|
+
decisions = 0;
|
|
200
|
+
conflictsSinceInit = 0;
|
|
201
|
+
restarts = 0;
|
|
202
|
+
conflictsSinceRestart = 0;
|
|
203
|
+
isForcingConflictAnalysis = false;
|
|
204
|
+
simplifications = 0;
|
|
205
|
+
restartThreshold = 0;
|
|
206
|
+
lubyIndex = 0;
|
|
207
|
+
conflictsSinceGc = 0;
|
|
208
|
+
gcThreshold = 0;
|
|
209
|
+
defragThreshold = 0;
|
|
210
|
+
gcClauses = 0;
|
|
211
|
+
minDTk = 0;
|
|
212
|
+
nextSimplify = 0;
|
|
213
|
+
isSimplifyEnabled = true;
|
|
214
|
+
isRestartEnabled = true;
|
|
215
|
+
lemma: number[] = [];
|
|
216
|
+
private incremental: boolean;
|
|
217
|
+
private assumptions: number[] = [];
|
|
218
|
+
private assumptionSet = new Set<number>();
|
|
219
|
+
readonly userScopeLiterals: number[] = [];
|
|
220
|
+
private diffLevels: boolean[] = [];
|
|
221
|
+
private unmark: number[] = [];
|
|
222
|
+
private lvlSet = 0;
|
|
223
|
+
private lemmaMinStack: number[] = [];
|
|
224
|
+
|
|
225
|
+
constructor(
|
|
226
|
+
readonly params: SatParams,
|
|
227
|
+
readonly limit: ResourceLimit,
|
|
228
|
+
isIncremental = false,
|
|
229
|
+
) {
|
|
230
|
+
this.incremental = isIncremental;
|
|
231
|
+
this.config = getSatConfig(params);
|
|
232
|
+
this.rand = new RandomGen(this.config.randomSeed);
|
|
233
|
+
this.caseSplitQueue = new VarQueue(this.activity);
|
|
234
|
+
this.cleaner = new Cleaner(this);
|
|
235
|
+
this.simplifier = new Simplifier(this, params);
|
|
236
|
+
this.scc = new Scc(this, this.config);
|
|
237
|
+
this.asymmBranch = new AsymmBranch(this, params);
|
|
238
|
+
this.probing = new Probing(this, params);
|
|
239
|
+
this.updateParams();
|
|
240
|
+
this.mkVar(false);
|
|
241
|
+
}
|
|
242
|
+
|
|
243
|
+
private updateParams() {
|
|
244
|
+
this.fastGlueAvg.setAlpha(this.config.fastGlueAvg);
|
|
245
|
+
this.slowGlueAvg.setAlpha(this.config.slowGlueAvg);
|
|
246
|
+
this.fastGlueBackup.setAlpha(this.config.fastGlueAvg);
|
|
247
|
+
this.slowGlueBackup.setAlpha(this.config.slowGlueAvg);
|
|
248
|
+
this.trailAvg.setAlpha(this.config.slowGlueAvg);
|
|
249
|
+
}
|
|
250
|
+
|
|
251
|
+
numVars() {
|
|
252
|
+
return this.varCount;
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
value(lit: number) {
|
|
256
|
+
return this.assignment[lit];
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
valueVar(boolVar: number) {
|
|
260
|
+
return this.assignment[2 * boolVar];
|
|
261
|
+
}
|
|
262
|
+
|
|
263
|
+
lvl(lit: number) {
|
|
264
|
+
return this.justLevel[lit >> 1];
|
|
265
|
+
}
|
|
266
|
+
|
|
267
|
+
lvlVar(boolVar: number) {
|
|
268
|
+
return this.justLevel[boolVar];
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
atBaseLvl() {
|
|
272
|
+
return this.scopeLvl === 0;
|
|
273
|
+
}
|
|
274
|
+
|
|
275
|
+
isExternal(boolVar: number) {
|
|
276
|
+
return this.external[boolVar];
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
wasEliminated(boolVar: number) {
|
|
280
|
+
return this.eliminated[boolVar];
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
getWlist(lit: number) {
|
|
284
|
+
return this.watches[lit];
|
|
285
|
+
}
|
|
286
|
+
|
|
287
|
+
initTrailSize() {
|
|
288
|
+
return this.atBaseLvl() ? this.trail.length : this.scopes[0].trailLim;
|
|
289
|
+
}
|
|
290
|
+
|
|
291
|
+
isAssumption(boolVar: number) {
|
|
292
|
+
return this.isAssumptionLit(2 * boolVar) || this.isAssumptionLit(2 * boolVar + 1);
|
|
293
|
+
}
|
|
294
|
+
|
|
295
|
+
private isAssumptionLit(lit: number) {
|
|
296
|
+
return this.trackingAssumptions() && this.assumptionSet.has(lit);
|
|
297
|
+
}
|
|
298
|
+
|
|
299
|
+
isIncremental() {
|
|
300
|
+
return this.incremental;
|
|
301
|
+
}
|
|
302
|
+
|
|
303
|
+
trackingAssumptions() {
|
|
304
|
+
return this.assumptions.length > 0 || this.userScopeLiterals.length > 0;
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
setExternal(boolVar: number) {
|
|
308
|
+
this.external[boolVar] = true;
|
|
309
|
+
}
|
|
310
|
+
|
|
311
|
+
initVisited() {
|
|
312
|
+
const size = 2 * this.numVars();
|
|
313
|
+
while (this.visited.length < size) this.visited.push(0);
|
|
314
|
+
this.visitedTimestamp++;
|
|
315
|
+
}
|
|
316
|
+
|
|
317
|
+
isVisited(lit: number) {
|
|
318
|
+
return this.visited[lit] === this.visitedTimestamp;
|
|
319
|
+
}
|
|
320
|
+
|
|
321
|
+
markVisited(lit: number) {
|
|
322
|
+
this.visited[lit] = this.visitedTimestamp;
|
|
323
|
+
}
|
|
324
|
+
|
|
325
|
+
checkpoint() {
|
|
326
|
+
if (!this.limit.inc()) {
|
|
327
|
+
this.isModelCurrent = false;
|
|
328
|
+
this.reasonUnknown = "sat.canceled";
|
|
329
|
+
throw new SmtCanceledError();
|
|
330
|
+
}
|
|
331
|
+
}
|
|
332
|
+
|
|
333
|
+
mkVar(isExternal: boolean) {
|
|
334
|
+
this.isModelCurrent = false;
|
|
335
|
+
const boolVar = this.varCount++;
|
|
336
|
+
this.activeVars.push(boolVar);
|
|
337
|
+
if (boolVar === this.justLevel.length) {
|
|
338
|
+
const assignment = new Int8Array(4 * boolVar);
|
|
339
|
+
assignment.set(this.assignment);
|
|
340
|
+
this.assignment = assignment;
|
|
341
|
+
const justLevel = new Uint32Array(2 * boolVar);
|
|
342
|
+
justLevel.set(this.justLevel);
|
|
343
|
+
this.justLevel = justLevel;
|
|
344
|
+
}
|
|
345
|
+
this.watches.push(new WatchList(), new WatchList());
|
|
346
|
+
this.justLevel[boolVar] = UINT_MAX;
|
|
347
|
+
this.justVal.push(0);
|
|
348
|
+
this.justKind.push(JUSTIFICATION_NONE);
|
|
349
|
+
this.eliminated.push(false);
|
|
350
|
+
this.external.push(isExternal);
|
|
351
|
+
this.varScope.push(this.scopeLvl);
|
|
352
|
+
this.touched.push(0);
|
|
353
|
+
this.activity.push(0);
|
|
354
|
+
this.mark.push(false);
|
|
355
|
+
this.litMark.push(false, false);
|
|
356
|
+
this.phase.push(false);
|
|
357
|
+
this.bestPhase.push(false);
|
|
358
|
+
this.prevPhase.push(false);
|
|
359
|
+
this.phaseBirthdate.push(0);
|
|
360
|
+
this.bestPhaseBirthdate.push(0);
|
|
361
|
+
this.assignedSinceGc.push(false);
|
|
362
|
+
this.caseSplitQueue.mkVar(boolVar);
|
|
363
|
+
this.simplifier.insertElimTodo(boolVar);
|
|
364
|
+
return boolVar;
|
|
365
|
+
}
|
|
366
|
+
|
|
367
|
+
setEliminated(boolVar: number, isEliminated: boolean) {
|
|
368
|
+
if (this.eliminated[boolVar] === isEliminated) return;
|
|
369
|
+
this.eliminated[boolVar] = isEliminated;
|
|
370
|
+
if (isEliminated) this.ext?.setEliminated?.(boolVar);
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
setNonExternal(boolVar: number) {
|
|
374
|
+
this.external[boolVar] = false;
|
|
375
|
+
}
|
|
376
|
+
|
|
377
|
+
private isExtPropagating() {
|
|
378
|
+
return this.ext !== null && (!this.isProbing || this.atBaseLvl());
|
|
379
|
+
}
|
|
380
|
+
|
|
381
|
+
get numUserScopes() {
|
|
382
|
+
return this.userScopeLiterals.length;
|
|
383
|
+
}
|
|
384
|
+
|
|
385
|
+
mkClause(lits: number[], isLearned = false, isTheory = false) {
|
|
386
|
+
this.isModelCurrent = false;
|
|
387
|
+
return this.mkClauseCore(
|
|
388
|
+
this.userScopeLiterals.length === 0 ? lits : [...lits, ...this.userScopeLiterals],
|
|
389
|
+
isLearned,
|
|
390
|
+
isTheory,
|
|
391
|
+
);
|
|
392
|
+
}
|
|
393
|
+
|
|
394
|
+
delClause(clause: number) {
|
|
395
|
+
if (this.arena.isFrozen(clause)) this.numFrozen--;
|
|
396
|
+
this.arena.delClause(clause);
|
|
397
|
+
}
|
|
398
|
+
|
|
399
|
+
mkClauseCore(lits: number[], isRedundant: boolean, isTheory = false): number {
|
|
400
|
+
if ((!isRedundant || isTheory) && !this.simplifyClause(lits)) return -1;
|
|
401
|
+
switch (lits.length) {
|
|
402
|
+
case 0:
|
|
403
|
+
this.setConflict();
|
|
404
|
+
return -1;
|
|
405
|
+
case 1:
|
|
406
|
+
this.assign(lits[0], 0, JUSTIFICATION_NONE, 0);
|
|
407
|
+
return -1;
|
|
408
|
+
case 2:
|
|
409
|
+
this.mkBinClause(lits[0], lits[1], isRedundant);
|
|
410
|
+
return -1;
|
|
411
|
+
default:
|
|
412
|
+
return this.mkNaryClause(lits, isRedundant, isTheory);
|
|
413
|
+
}
|
|
414
|
+
}
|
|
415
|
+
|
|
416
|
+
mkBinClause(first: number, second: number, isRedundant: boolean) {
|
|
417
|
+
this.touched[first >> 1] = this.touchIndex;
|
|
418
|
+
this.touched[second >> 1] = this.touchIndex;
|
|
419
|
+
if (
|
|
420
|
+
isRedundant &&
|
|
421
|
+
this.getWlist(first ^ 1).findBinary(second ^ 1) !== -1 &&
|
|
422
|
+
this.value(first) === L_UNDEF
|
|
423
|
+
) {
|
|
424
|
+
this.assignUnit(first);
|
|
425
|
+
return;
|
|
426
|
+
}
|
|
427
|
+
if (
|
|
428
|
+
isRedundant &&
|
|
429
|
+
this.getWlist(second ^ 1).findBinary(first ^ 1) !== -1 &&
|
|
430
|
+
this.value(second) === L_UNDEF
|
|
431
|
+
) {
|
|
432
|
+
this.assignUnit(second);
|
|
433
|
+
return;
|
|
434
|
+
}
|
|
435
|
+
const found = isRedundant ? this.getWlist(first ^ 1).findBinary(second) : -1;
|
|
436
|
+
if (found !== -1) {
|
|
437
|
+
if (this.propagateBinClause(first, second) && !this.atBaseLvl() && !isRedundant)
|
|
438
|
+
this.pushReinitBinary(first, second);
|
|
439
|
+
else if (this.hasVariablesToReinitBinary(first, second)) this.pushReinitBinary(first, second);
|
|
440
|
+
return;
|
|
441
|
+
}
|
|
442
|
+
if (this.propagateBinClause(first, second)) {
|
|
443
|
+
if (!this.atBaseLvl()) this.pushReinitBinary(first, second);
|
|
444
|
+
else return;
|
|
445
|
+
} else if (this.hasVariablesToReinitBinary(first, second)) this.pushReinitBinary(first, second);
|
|
446
|
+
this.getWlist(first ^ 1).pushBinary(second, isRedundant);
|
|
447
|
+
this.getWlist(second ^ 1).pushBinary(first, isRedundant);
|
|
448
|
+
}
|
|
449
|
+
|
|
450
|
+
private hasVariablesToReinit(clause: number) {
|
|
451
|
+
const arena = this.arena;
|
|
452
|
+
for (let index = 0; index < arena.size[clause]; index++)
|
|
453
|
+
if (this.varScope[arena.get(clause, index) >> 1] > 0) return true;
|
|
454
|
+
return false;
|
|
455
|
+
}
|
|
456
|
+
|
|
457
|
+
private hasVariablesToReinitBinary(first: number, second: number) {
|
|
458
|
+
if (this.atBaseLvl()) return false;
|
|
459
|
+
return this.varScope[first >> 1] > 0 || this.varScope[second >> 1] > 0;
|
|
460
|
+
}
|
|
461
|
+
|
|
462
|
+
propagateBinClause(first: number, second: number) {
|
|
463
|
+
if (this.value(second) === L_FALSE && this.value(first) !== L_TRUE) {
|
|
464
|
+
this.assign(first, this.lvl(second), JUSTIFICATION_BINARY, second);
|
|
465
|
+
return true;
|
|
466
|
+
}
|
|
467
|
+
if (this.value(first) === L_FALSE && this.value(second) !== L_TRUE) {
|
|
468
|
+
this.assign(second, this.lvl(first), JUSTIFICATION_BINARY, first);
|
|
469
|
+
return true;
|
|
470
|
+
}
|
|
471
|
+
return false;
|
|
472
|
+
}
|
|
473
|
+
|
|
474
|
+
pushReinitStack(clause: number) {
|
|
475
|
+
this.clausesToReinit.push(clause, NULL_LITERAL);
|
|
476
|
+
this.arena.setReinitStack(clause, true);
|
|
477
|
+
}
|
|
478
|
+
|
|
479
|
+
private pushReinitBinary(first: number, second: number) {
|
|
480
|
+
this.clausesToReinit.push(first, second);
|
|
481
|
+
}
|
|
482
|
+
|
|
483
|
+
private mkNaryClause(lits: number[], isRedundant: boolean, isTheory: boolean) {
|
|
484
|
+
const clause = this.arena.mkClause(lits, lits.length, isRedundant);
|
|
485
|
+
const isReinit = this.attachNaryClause(clause, isRedundant && !isTheory);
|
|
486
|
+
if (isReinit || this.hasVariablesToReinit(clause)) this.pushReinitStack(clause);
|
|
487
|
+
if (isRedundant) this.learned.push(clause);
|
|
488
|
+
else this.clauses.push(clause);
|
|
489
|
+
for (const lit of lits) this.touched[lit >> 1] = this.touchIndex;
|
|
490
|
+
return clause;
|
|
491
|
+
}
|
|
492
|
+
|
|
493
|
+
private attachNaryClause(clause: number, isAsserting: boolean) {
|
|
494
|
+
const arena = this.arena;
|
|
495
|
+
let isReinit = false;
|
|
496
|
+
if (!this.atBaseLvl()) {
|
|
497
|
+
if (isAsserting) arena.swap(clause, 1, this.selectLearnedWatchLit(clause));
|
|
498
|
+
else {
|
|
499
|
+
arena.swap(clause, 0, this.selectWatchLit(clause, 0));
|
|
500
|
+
arena.swap(clause, 1, this.selectWatchLit(clause, 1));
|
|
501
|
+
}
|
|
502
|
+
const size = arena.size[clause];
|
|
503
|
+
if (this.value(arena.get(clause, 0)) === L_FALSE) {
|
|
504
|
+
let level = this.lvl(arena.get(clause, 0));
|
|
505
|
+
for (let index = size; index-- > 2;)
|
|
506
|
+
level = Math.max(level, this.lvl(arena.get(clause, index)));
|
|
507
|
+
this.assign(arena.get(clause, 1), level, JUSTIFICATION_CLAUSE, clause);
|
|
508
|
+
isReinit ||= !arena.isLearned(clause);
|
|
509
|
+
} else if (this.value(arena.get(clause, 1)) === L_FALSE) {
|
|
510
|
+
let level = this.lvl(arena.get(clause, 1));
|
|
511
|
+
for (let index = size; index-- > 2;)
|
|
512
|
+
level = Math.max(level, this.lvl(arena.get(clause, index)));
|
|
513
|
+
this.assign(arena.get(clause, 0), level, JUSTIFICATION_CLAUSE, clause);
|
|
514
|
+
isReinit ||= !arena.isLearned(clause);
|
|
515
|
+
}
|
|
516
|
+
}
|
|
517
|
+
const blockedLit = arena.get(clause, arena.size[clause] >> 1);
|
|
518
|
+
this.watches[arena.get(clause, 0) ^ 1].pushClause(blockedLit, clause);
|
|
519
|
+
this.watches[arena.get(clause, 1) ^ 1].pushClause(blockedLit, clause);
|
|
520
|
+
return isReinit;
|
|
521
|
+
}
|
|
522
|
+
|
|
523
|
+
attachClause(clause: number) {
|
|
524
|
+
return this.attachNaryClause(
|
|
525
|
+
clause,
|
|
526
|
+
this.arena.isLearned(clause) && !this.arena.isOnReinitStack(clause),
|
|
527
|
+
);
|
|
528
|
+
}
|
|
529
|
+
|
|
530
|
+
shrink(clause: number, oldSize: number, newSize: number) {
|
|
531
|
+
if (oldSize === newSize) return;
|
|
532
|
+
this.arena.shrink(clause, newSize);
|
|
533
|
+
for (let index = 0; index < newSize; index++)
|
|
534
|
+
this.touched[this.arena.get(clause, index) >> 1] = this.touchIndex;
|
|
535
|
+
}
|
|
536
|
+
|
|
537
|
+
setPhase(boolVar: number, isPositive: boolean) {
|
|
538
|
+
if (this.phase[boolVar] !== isPositive) this.phaseBirthdate[boolVar] = this.conflicts;
|
|
539
|
+
this.phase[boolVar] = isPositive;
|
|
540
|
+
}
|
|
541
|
+
|
|
542
|
+
setBestPhase(boolVar: number, isPositive: boolean) {
|
|
543
|
+
if (this.bestPhase[boolVar] !== isPositive) this.bestPhaseBirthdate[boolVar] = this.conflicts;
|
|
544
|
+
this.bestPhase[boolVar] = isPositive;
|
|
545
|
+
}
|
|
546
|
+
|
|
547
|
+
setPhaseLiteral(lit: number) {
|
|
548
|
+
if (lit >> 1 >= this.numVars()) return;
|
|
549
|
+
this.setPhase(lit >> 1, (lit & 1) === 0);
|
|
550
|
+
this.setBestPhase(lit >> 1, (lit & 1) === 0);
|
|
551
|
+
}
|
|
552
|
+
|
|
553
|
+
private shouldDefrag() {
|
|
554
|
+
if (this.defragThreshold > 0) this.defragThreshold--;
|
|
555
|
+
return this.defragThreshold === 0 && this.config.isGcDefrag;
|
|
556
|
+
}
|
|
557
|
+
|
|
558
|
+
private defragClauses() {
|
|
559
|
+
this.defragThreshold = 2;
|
|
560
|
+
this.pop(this.scopeLvl);
|
|
561
|
+
const source = this.arena;
|
|
562
|
+
const target = new ClauseArena();
|
|
563
|
+
const newClauses: number[] = [];
|
|
564
|
+
const newLearned: number[] = [];
|
|
565
|
+
const newIds = new Map<number, number>();
|
|
566
|
+
for (const clause of this.clauses) source.unmarkUsed(clause);
|
|
567
|
+
for (const clause of this.learned) source.unmarkUsed(clause);
|
|
568
|
+
const vars: number[] = [];
|
|
569
|
+
for (let boolVar = 0; boolVar < this.numVars(); boolVar++) vars.push(boolVar);
|
|
570
|
+
vars.sort((first, second) => this.activity[second] - this.activity[first]);
|
|
571
|
+
const copy = (clause: number) => {
|
|
572
|
+
const id = target.copyClause(source, clause);
|
|
573
|
+
(source.isLearned(clause) ? newLearned : newClauses).push(id);
|
|
574
|
+
return id;
|
|
575
|
+
};
|
|
576
|
+
for (const boolVar of vars)
|
|
577
|
+
for (const lit of [2 * boolVar, 2 * boolVar + 1]) {
|
|
578
|
+
const wlist = this.watches[lit];
|
|
579
|
+
for (let index = 0; index < wlist.size; index++) {
|
|
580
|
+
if (!wlist.isClause(index)) continue;
|
|
581
|
+
const clause = wlist.getClause(index);
|
|
582
|
+
const id = newIds.get(clause) ?? copy(clause);
|
|
583
|
+
newIds.set(clause, id);
|
|
584
|
+
wlist.setClause(index, wlist.getBlockedLiteral(index), id);
|
|
585
|
+
}
|
|
586
|
+
}
|
|
587
|
+
for (const clause of this.clauses) if (!newIds.has(clause)) copy(clause);
|
|
588
|
+
for (const clause of this.learned) if (!newIds.has(clause)) copy(clause);
|
|
589
|
+
this.clauses = newClauses;
|
|
590
|
+
this.learned = newLearned;
|
|
591
|
+
this.arena = target;
|
|
592
|
+
this.reinitAssumptions();
|
|
593
|
+
}
|
|
594
|
+
|
|
595
|
+
private selectWatchLit(clause: number, startingAt: number) {
|
|
596
|
+
const arena = this.arena;
|
|
597
|
+
let minTrueIndex = -1;
|
|
598
|
+
let maxFalseIndex = -1;
|
|
599
|
+
let unknownIndex = -1;
|
|
600
|
+
for (let index = startingAt; index < arena.size[clause]; index++) {
|
|
601
|
+
const lit = arena.get(clause, index);
|
|
602
|
+
switch (this.value(lit)) {
|
|
603
|
+
case L_FALSE:
|
|
604
|
+
if (maxFalseIndex === -1 || this.lvl(lit) > this.lvl(arena.get(clause, maxFalseIndex)))
|
|
605
|
+
maxFalseIndex = index;
|
|
606
|
+
break;
|
|
607
|
+
case L_UNDEF:
|
|
608
|
+
unknownIndex = index;
|
|
609
|
+
break;
|
|
610
|
+
case L_TRUE:
|
|
611
|
+
if (minTrueIndex === -1 || this.lvl(lit) < this.lvl(arena.get(clause, minTrueIndex)))
|
|
612
|
+
minTrueIndex = index;
|
|
613
|
+
break;
|
|
614
|
+
}
|
|
615
|
+
}
|
|
616
|
+
if (minTrueIndex !== -1) return minTrueIndex;
|
|
617
|
+
if (unknownIndex !== -1) return unknownIndex;
|
|
618
|
+
return maxFalseIndex;
|
|
619
|
+
}
|
|
620
|
+
|
|
621
|
+
private selectLearnedWatchLit(clause: number) {
|
|
622
|
+
const arena = this.arena;
|
|
623
|
+
let maxFalseIndex = -1;
|
|
624
|
+
for (let index = 1; index < arena.size[clause]; index++)
|
|
625
|
+
if (
|
|
626
|
+
maxFalseIndex === -1 ||
|
|
627
|
+
this.lvl(arena.get(clause, index)) > this.lvl(arena.get(clause, maxFalseIndex))
|
|
628
|
+
)
|
|
629
|
+
maxFalseIndex = index;
|
|
630
|
+
return maxFalseIndex;
|
|
631
|
+
}
|
|
632
|
+
|
|
633
|
+
private simplifyClause(lits: number[]) {
|
|
634
|
+
const isLvl0 = this.atBaseLvl();
|
|
635
|
+
lits.sort((first, second) => first - second);
|
|
636
|
+
let previous = NULL_LITERAL;
|
|
637
|
+
let next = 0;
|
|
638
|
+
for (let index = 0; index < lits.length; index++) {
|
|
639
|
+
const current = lits[index];
|
|
640
|
+
const value = !isLvl0 && this.lvl(current) > 0 ? L_UNDEF : this.value(current);
|
|
641
|
+
if (value === L_TRUE) return false;
|
|
642
|
+
if (value === L_FALSE) continue;
|
|
643
|
+
if (current === (previous ^ 1)) return false;
|
|
644
|
+
if (current !== previous) {
|
|
645
|
+
previous = current;
|
|
646
|
+
if (index !== next) {
|
|
647
|
+
lits[index] = lits[next];
|
|
648
|
+
lits[next] = current;
|
|
649
|
+
}
|
|
650
|
+
next++;
|
|
651
|
+
}
|
|
652
|
+
}
|
|
653
|
+
lits.length = next;
|
|
654
|
+
return true;
|
|
655
|
+
}
|
|
656
|
+
|
|
657
|
+
setLearned1(first: number, second: number, isRedundant: boolean) {
|
|
658
|
+
const wlist = this.getWlist(first ^ 1);
|
|
659
|
+
for (let index = 0; index < wlist.size; index++)
|
|
660
|
+
if (wlist.isBinary(index) && wlist.getLiteral(index) === second && !wlist.isLearned(index)) {
|
|
661
|
+
wlist.setLearned(index, isRedundant);
|
|
662
|
+
return;
|
|
663
|
+
}
|
|
664
|
+
}
|
|
665
|
+
|
|
666
|
+
detachClause(clause: number) {
|
|
667
|
+
this.getWlist(this.arena.get(clause, 0) ^ 1).eraseClause(clause);
|
|
668
|
+
this.getWlist(this.arena.get(clause, 1) ^ 1).eraseClause(clause);
|
|
669
|
+
}
|
|
670
|
+
|
|
671
|
+
setConflict(level = 0, kind = JUSTIFICATION_NONE, val = 0, notL = NULL_LITERAL) {
|
|
672
|
+
if (this.isInconsistent) return;
|
|
673
|
+
this.isInconsistent = true;
|
|
674
|
+
this.conflictJustLevel = level;
|
|
675
|
+
this.conflictKind = kind;
|
|
676
|
+
this.conflictVal = val;
|
|
677
|
+
this.notL = notL;
|
|
678
|
+
}
|
|
679
|
+
|
|
680
|
+
assign(lit: number, level: number, kind: number, val: number) {
|
|
681
|
+
switch (this.value(lit)) {
|
|
682
|
+
case L_FALSE:
|
|
683
|
+
this.setConflict(level, kind, val, lit ^ 1);
|
|
684
|
+
break;
|
|
685
|
+
case L_UNDEF:
|
|
686
|
+
this.assignCore(lit, level, kind, val);
|
|
687
|
+
break;
|
|
688
|
+
case L_TRUE:
|
|
689
|
+
if (level === 0 && this.lvl(lit) !== 0) {
|
|
690
|
+
this.justLevel[lit >> 1] = 0;
|
|
691
|
+
this.justKind[lit >> 1] = kind;
|
|
692
|
+
this.justVal[lit >> 1] = val;
|
|
693
|
+
}
|
|
694
|
+
break;
|
|
695
|
+
}
|
|
696
|
+
}
|
|
697
|
+
|
|
698
|
+
assignUnit(lit: number) {
|
|
699
|
+
this.assign(lit, 0, JUSTIFICATION_NONE, 0);
|
|
700
|
+
}
|
|
701
|
+
|
|
702
|
+
assignScoped(lit: number) {
|
|
703
|
+
this.assign(lit, this.scopeLvl, JUSTIFICATION_NONE, 0);
|
|
704
|
+
}
|
|
705
|
+
|
|
706
|
+
assignCore(lit: number, level: number, kind: number, val: number) {
|
|
707
|
+
const boolVar = lit >> 1;
|
|
708
|
+
this.assignment[lit] = L_TRUE;
|
|
709
|
+
this.assignment[lit ^ 1] = L_FALSE;
|
|
710
|
+
this.justLevel[boolVar] = level;
|
|
711
|
+
this.justKind[boolVar] = level === 0 ? JUSTIFICATION_NONE : kind;
|
|
712
|
+
this.justVal[boolVar] = level === 0 ? 0 : val;
|
|
713
|
+
this.setPhase(boolVar, (lit & 1) === 0);
|
|
714
|
+
this.assignedSinceGc[boolVar] = true;
|
|
715
|
+
this.trail.push(lit);
|
|
716
|
+
}
|
|
717
|
+
|
|
718
|
+
propagate(isUpdating: boolean) {
|
|
719
|
+
if (this.isExtPropagating()) this.ext?.unitPropagate?.();
|
|
720
|
+
while (this.qhead < this.trail.length && !this.isInconsistent) {
|
|
721
|
+
do {
|
|
722
|
+
this.checkpoint();
|
|
723
|
+
this.cleaner.dec();
|
|
724
|
+
const lit = this.trail[this.qhead];
|
|
725
|
+
this.qhead++;
|
|
726
|
+
if (!this.propagateLiteral(lit, isUpdating)) return false;
|
|
727
|
+
} while (this.qhead < this.trail.length);
|
|
728
|
+
if (this.isExtPropagating()) this.ext?.unitPropagate?.();
|
|
729
|
+
}
|
|
730
|
+
return !this.isInconsistent;
|
|
731
|
+
}
|
|
732
|
+
|
|
733
|
+
private propagateClause(clause: number, isUpdating: boolean, assignLevel: number, first: number) {
|
|
734
|
+
const arena = this.arena;
|
|
735
|
+
arena.markUsed(clause);
|
|
736
|
+
this.assignCore(first, assignLevel, JUSTIFICATION_CLAUSE, clause);
|
|
737
|
+
if (isUpdating && arena.isLearned(clause) && arena.glue[clause] > 2) {
|
|
738
|
+
const glue = this.numDiffLevelsBelow(clause, arena.glue[clause] - 1);
|
|
739
|
+
if (glue !== -1) arena.setGlue(clause, glue);
|
|
740
|
+
}
|
|
741
|
+
}
|
|
742
|
+
|
|
743
|
+
private propagateLiteral(lit: number, isUpdating: boolean) {
|
|
744
|
+
const arena = this.arena;
|
|
745
|
+
const lits = arena.lits;
|
|
746
|
+
const starts = arena.start;
|
|
747
|
+
const sizes = arena.size;
|
|
748
|
+
const assignment = this.assignment;
|
|
749
|
+
const justLevel = this.justLevel;
|
|
750
|
+
const currLevel = justLevel[lit >> 1];
|
|
751
|
+
const notL = lit ^ 1;
|
|
752
|
+
const wlist = this.watches[lit];
|
|
753
|
+
let data = wlist.data;
|
|
754
|
+
this.asymmBranch.dec(wlist.size);
|
|
755
|
+
this.probing.dec(wlist.size);
|
|
756
|
+
const end = wlist.size;
|
|
757
|
+
let target = 0;
|
|
758
|
+
for (let index = 0; index < end; index++) {
|
|
759
|
+
const val1 = data[2 * index];
|
|
760
|
+
const val2 = data[2 * index + 1];
|
|
761
|
+
if ((val2 & 3) === WATCH_BINARY) {
|
|
762
|
+
const value = assignment[val1];
|
|
763
|
+
if (value === L_FALSE) {
|
|
764
|
+
for (; index < end; index++, target++) wlist.copy(target, index);
|
|
765
|
+
wlist.setEnd(target);
|
|
766
|
+
this.setConflict(currLevel, JUSTIFICATION_BINARY, notL, val1 ^ 1);
|
|
767
|
+
return false;
|
|
768
|
+
}
|
|
769
|
+
if (value === L_UNDEF) this.assignCore(val1, currLevel, JUSTIFICATION_BINARY, notL);
|
|
770
|
+
data[2 * target] = val1;
|
|
771
|
+
data[2 * target + 1] = val2;
|
|
772
|
+
target++;
|
|
773
|
+
continue;
|
|
774
|
+
}
|
|
775
|
+
if ((val2 & 3) === WATCH_EXT_CONSTRAINT) {
|
|
776
|
+
const isKept = (this.ext as SatExtension).propagated(lit, val1);
|
|
777
|
+
data = wlist.data;
|
|
778
|
+
if (this.isInconsistent) {
|
|
779
|
+
if (!isKept) index++;
|
|
780
|
+
for (; index < end; index++, target++) wlist.copy(target, index);
|
|
781
|
+
wlist.setEnd(target);
|
|
782
|
+
return false;
|
|
783
|
+
}
|
|
784
|
+
if (isKept) {
|
|
785
|
+
data[2 * target] = val1;
|
|
786
|
+
data[2 * target + 1] = val2;
|
|
787
|
+
target++;
|
|
788
|
+
}
|
|
789
|
+
continue;
|
|
790
|
+
}
|
|
791
|
+
if (assignment[val2 >> 2] === L_TRUE) {
|
|
792
|
+
data[2 * target] = val1;
|
|
793
|
+
data[2 * target + 1] = val2;
|
|
794
|
+
target++;
|
|
795
|
+
continue;
|
|
796
|
+
}
|
|
797
|
+
const clause = val1;
|
|
798
|
+
const base = starts[clause];
|
|
799
|
+
if (lits[base] === notL) {
|
|
800
|
+
lits[base] = lits[base + 1];
|
|
801
|
+
lits[base + 1] = notL;
|
|
802
|
+
}
|
|
803
|
+
const size = sizes[clause];
|
|
804
|
+
if (arena.wasRemoved(clause) || size === 1 || lits[base + 1] !== notL) {
|
|
805
|
+
data[2 * target] = val1;
|
|
806
|
+
data[2 * target + 1] = val2;
|
|
807
|
+
target++;
|
|
808
|
+
continue;
|
|
809
|
+
}
|
|
810
|
+
const first = lits[base];
|
|
811
|
+
const firstValue = assignment[first];
|
|
812
|
+
if (firstValue === L_TRUE) {
|
|
813
|
+
data[2 * target] = clause;
|
|
814
|
+
data[2 * target + 1] = mkClauseWatch(first);
|
|
815
|
+
target++;
|
|
816
|
+
continue;
|
|
817
|
+
}
|
|
818
|
+
let undefIndex = 0;
|
|
819
|
+
let assignLevel = currLevel;
|
|
820
|
+
let maxIndex = 1;
|
|
821
|
+
let numUndef = 0;
|
|
822
|
+
let isSatisfied = false;
|
|
823
|
+
for (let position = 2; position < size && numUndef <= 1; position++) {
|
|
824
|
+
const other = lits[base + position];
|
|
825
|
+
const value = assignment[other];
|
|
826
|
+
if (value === L_TRUE) {
|
|
827
|
+
data[2 * target] = clause;
|
|
828
|
+
data[2 * target + 1] = mkClauseWatch(other);
|
|
829
|
+
target++;
|
|
830
|
+
isSatisfied = true;
|
|
831
|
+
break;
|
|
832
|
+
}
|
|
833
|
+
if (value === L_UNDEF) {
|
|
834
|
+
undefIndex = position;
|
|
835
|
+
numUndef++;
|
|
836
|
+
continue;
|
|
837
|
+
}
|
|
838
|
+
const level = justLevel[other >> 1];
|
|
839
|
+
if (level > assignLevel) {
|
|
840
|
+
assignLevel = level;
|
|
841
|
+
maxIndex = position;
|
|
842
|
+
}
|
|
843
|
+
}
|
|
844
|
+
if (isSatisfied) continue;
|
|
845
|
+
if (firstValue === L_FALSE) assignLevel = Math.max(assignLevel, justLevel[first >> 1]);
|
|
846
|
+
if (undefIndex !== 0) {
|
|
847
|
+
this.setWatch(clause, undefIndex);
|
|
848
|
+
if (firstValue === L_FALSE && numUndef === 1) {
|
|
849
|
+
arena.swap(clause, 0, 1);
|
|
850
|
+
this.propagateClause(clause, isUpdating, assignLevel, lits[base]);
|
|
851
|
+
}
|
|
852
|
+
continue;
|
|
853
|
+
}
|
|
854
|
+
if (firstValue === L_FALSE) {
|
|
855
|
+
arena.markUsed(clause);
|
|
856
|
+
for (; index < end; index++, target++) wlist.copy(target, index);
|
|
857
|
+
wlist.setEnd(target);
|
|
858
|
+
this.setConflict(assignLevel, JUSTIFICATION_CLAUSE, clause);
|
|
859
|
+
return false;
|
|
860
|
+
}
|
|
861
|
+
if (maxIndex !== 1) this.setWatch(clause, maxIndex);
|
|
862
|
+
else {
|
|
863
|
+
data[2 * target] = val1;
|
|
864
|
+
data[2 * target + 1] = val2;
|
|
865
|
+
target++;
|
|
866
|
+
}
|
|
867
|
+
this.propagateClause(clause, isUpdating, assignLevel, first);
|
|
868
|
+
}
|
|
869
|
+
wlist.setEnd(target);
|
|
870
|
+
if (this.external[lit >> 1] && this.isExtPropagating()) this.ext?.asserted?.(lit);
|
|
871
|
+
return true;
|
|
872
|
+
}
|
|
873
|
+
|
|
874
|
+
private setWatch(clause: number, index: number) {
|
|
875
|
+
this.arena.swap(clause, 1, index);
|
|
876
|
+
this.watches[this.arena.get(clause, 1) ^ 1].pushClause(this.arena.get(clause, 0), clause);
|
|
877
|
+
}
|
|
878
|
+
|
|
879
|
+
check(assumptions: readonly number[] = []) {
|
|
880
|
+
this.reasonUnknown = "no reason given";
|
|
881
|
+
this.popToBaseLevel();
|
|
882
|
+
this.isSearching = true;
|
|
883
|
+
this.isGivenUp = false;
|
|
884
|
+
try {
|
|
885
|
+
this.initSearch();
|
|
886
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
887
|
+
this.propagate(false);
|
|
888
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
889
|
+
this.initAssumptions(assumptions);
|
|
890
|
+
this.propagate(false);
|
|
891
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
892
|
+
if (this.config.isForcingCleanup) this.doCleanup(true);
|
|
893
|
+
if (this.config.isGcBurst) {
|
|
894
|
+
this.conflictsSinceGc = this.gcThreshold + 1;
|
|
895
|
+
this.doGc();
|
|
896
|
+
}
|
|
897
|
+
if (this.config.isEnablingPreSimplify) {
|
|
898
|
+
this.doSimplify();
|
|
899
|
+
if (this.checkInconsistent()) return L_FALSE;
|
|
900
|
+
}
|
|
901
|
+
if (this.config.maxConflicts === 0) return L_UNDEF;
|
|
902
|
+
if (this.config.maxConflicts > 0 && this.config.burstSearch > 0) {
|
|
903
|
+
this.restartThreshold = this.config.burstSearch;
|
|
904
|
+
const result = this.boundedSearch();
|
|
905
|
+
if (result !== L_UNDEF || this.isGivenUp) return result;
|
|
906
|
+
this.popReinit(this.scopeLvl);
|
|
907
|
+
this.conflictsSinceRestart = 0;
|
|
908
|
+
this.restartThreshold = this.config.restartInitial;
|
|
909
|
+
}
|
|
910
|
+
return this.basicSearch();
|
|
911
|
+
} finally {
|
|
912
|
+
this.isSearching = false;
|
|
913
|
+
}
|
|
914
|
+
}
|
|
915
|
+
|
|
916
|
+
checkInconsistent() {
|
|
917
|
+
if (!this.isInconsistent) return false;
|
|
918
|
+
if (this.trackingAssumptions() && this.scopeLvl === this.searchLvl) this.resolveConflict();
|
|
919
|
+
return true;
|
|
920
|
+
}
|
|
921
|
+
|
|
922
|
+
resolveConflict() {
|
|
923
|
+
for (;;) {
|
|
924
|
+
if (this.resolveConflictCore() === L_FALSE) return false;
|
|
925
|
+
if (!this.isInconsistent) return true;
|
|
926
|
+
}
|
|
927
|
+
}
|
|
928
|
+
|
|
929
|
+
initAssumptions(lits: readonly number[]) {
|
|
930
|
+
if (lits.length === 0 && this.userScopeLiterals.length === 0) return;
|
|
931
|
+
this.resetAssumptions();
|
|
932
|
+
this.push();
|
|
933
|
+
this.propagate(false);
|
|
934
|
+
if (this.isInconsistent) return;
|
|
935
|
+
for (let index = 0; !this.isInconsistent && index < this.userScopeLiterals.length; index++)
|
|
936
|
+
this.assignScoped(this.userScopeLiterals[index] ^ 1);
|
|
937
|
+
for (let index = 0; !this.isInconsistent && index < lits.length; index++) {
|
|
938
|
+
const lit = lits[index];
|
|
939
|
+
this.setExternal(lit >> 1);
|
|
940
|
+
this.addAssumption(lit);
|
|
941
|
+
this.assignScoped(lit);
|
|
942
|
+
}
|
|
943
|
+
this.searchLvl = this.scopeLvl;
|
|
944
|
+
}
|
|
945
|
+
|
|
946
|
+
private resetAssumptions() {
|
|
947
|
+
this.assumptions = [];
|
|
948
|
+
this.assumptionSet.clear();
|
|
949
|
+
}
|
|
950
|
+
|
|
951
|
+
addAssumption(lit: number) {
|
|
952
|
+
this.assumptionSet.add(lit);
|
|
953
|
+
this.assumptions.push(lit);
|
|
954
|
+
this.setExternal(lit >> 1);
|
|
955
|
+
}
|
|
956
|
+
|
|
957
|
+
private reinitAssumptions() {
|
|
958
|
+
if (!this.trackingAssumptions() || !this.atBaseLvl() || this.isInconsistent) return;
|
|
959
|
+
if (!this.propagate(false)) return;
|
|
960
|
+
this.push();
|
|
961
|
+
for (const lit of this.userScopeLiterals) {
|
|
962
|
+
if (this.isInconsistent) break;
|
|
963
|
+
this.assignScoped(lit ^ 1);
|
|
964
|
+
}
|
|
965
|
+
for (const lit of this.assumptions) {
|
|
966
|
+
if (this.isInconsistent) break;
|
|
967
|
+
this.assignScoped(lit);
|
|
968
|
+
}
|
|
969
|
+
if (!this.isInconsistent) this.propagate(false);
|
|
970
|
+
}
|
|
971
|
+
|
|
972
|
+
private processAntecedentForUnsatCore(antecedent: number) {
|
|
973
|
+
const boolVar = antecedent >> 1;
|
|
974
|
+
if (this.mark[boolVar]) return;
|
|
975
|
+
this.mark[boolVar] = true;
|
|
976
|
+
this.unmark.push(boolVar);
|
|
977
|
+
if (this.isAssumptionLit(antecedent)) this.core.push(antecedent);
|
|
978
|
+
}
|
|
979
|
+
|
|
980
|
+
private processConsequentForUnsatCore(consequent: number, kind: number, val: number) {
|
|
981
|
+
if (kind === JUSTIFICATION_BINARY) {
|
|
982
|
+
this.processAntecedentForUnsatCore(val ^ 1);
|
|
983
|
+
return;
|
|
984
|
+
}
|
|
985
|
+
if (kind === JUSTIFICATION_EXT) {
|
|
986
|
+
for (const lit of this.getExtAntecedents(consequent, val))
|
|
987
|
+
this.processAntecedentForUnsatCore(lit);
|
|
988
|
+
return;
|
|
989
|
+
}
|
|
990
|
+
if (kind !== JUSTIFICATION_CLAUSE) return;
|
|
991
|
+
const arena = this.arena;
|
|
992
|
+
let position = 0;
|
|
993
|
+
if (consequent !== NULL_LITERAL) {
|
|
994
|
+
if (arena.get(val, 0) === consequent) position = 1;
|
|
995
|
+
else {
|
|
996
|
+
this.processAntecedentForUnsatCore(arena.get(val, 0) ^ 1);
|
|
997
|
+
position = 2;
|
|
998
|
+
}
|
|
999
|
+
}
|
|
1000
|
+
for (; position < arena.size[val]; position++)
|
|
1001
|
+
this.processAntecedentForUnsatCore(arena.get(val, position) ^ 1);
|
|
1002
|
+
}
|
|
1003
|
+
|
|
1004
|
+
private resolveConflictForUnsatCore() {
|
|
1005
|
+
this.core = [];
|
|
1006
|
+
if (this.conflictLevel === 0) return;
|
|
1007
|
+
const oldSize = this.unmark.length;
|
|
1008
|
+
let index = this.skipLiteralsAboveConflictLevel();
|
|
1009
|
+
let consequent = this.notL;
|
|
1010
|
+
if (this.notL !== NULL_LITERAL) {
|
|
1011
|
+
const boolVar = this.notL >> 1;
|
|
1012
|
+
this.processAntecedentForUnsatCore(this.notL);
|
|
1013
|
+
if (this.isAssumptionLit(this.notL ^ 1)) this.core.push(this.notL ^ 1);
|
|
1014
|
+
else
|
|
1015
|
+
this.processConsequentForUnsatCore(
|
|
1016
|
+
this.notL,
|
|
1017
|
+
this.justKind[boolVar],
|
|
1018
|
+
this.justVal[boolVar],
|
|
1019
|
+
);
|
|
1020
|
+
consequent = this.notL ^ 1;
|
|
1021
|
+
}
|
|
1022
|
+
let kind = this.conflictKind;
|
|
1023
|
+
let val = this.conflictVal;
|
|
1024
|
+
const initSize = this.initTrailSize();
|
|
1025
|
+
for (;;) {
|
|
1026
|
+
this.processConsequentForUnsatCore(consequent, kind, val);
|
|
1027
|
+
while (index >= initSize) {
|
|
1028
|
+
consequent = this.trail[index];
|
|
1029
|
+
if (this.mark[consequent >> 1] && this.lvl(consequent) === this.conflictLevel) break;
|
|
1030
|
+
index--;
|
|
1031
|
+
}
|
|
1032
|
+
if (index < initSize) break;
|
|
1033
|
+
kind = this.justKind[consequent >> 1];
|
|
1034
|
+
val = this.justVal[consequent >> 1];
|
|
1035
|
+
index--;
|
|
1036
|
+
}
|
|
1037
|
+
this.resetUnmark(oldSize);
|
|
1038
|
+
if (this.core.length > 1) this.core = this.core.filter((lit) => this.lvl(lit) > 0);
|
|
1039
|
+
}
|
|
1040
|
+
|
|
1041
|
+
// max_cliques over the binary clauses, the largest mutexes first.
|
|
1042
|
+
findMutexes(lits: readonly number[]) {
|
|
1043
|
+
const remaining = [...lits];
|
|
1044
|
+
const extMutexes: number[][] = [];
|
|
1045
|
+
this.ext?.findMutexes(remaining, extMutexes);
|
|
1046
|
+
const cliques = new MaxCliques((index) => index ^ 1);
|
|
1047
|
+
const seen = new Set<string>();
|
|
1048
|
+
for (let index = 0; index < this.watches.length; index++) {
|
|
1049
|
+
const first = index ^ 1;
|
|
1050
|
+
const wlist = this.watches[index];
|
|
1051
|
+
for (let position = 0; position < wlist.size; position++) {
|
|
1052
|
+
if (!wlist.isBinary(position)) continue;
|
|
1053
|
+
const second = wlist.getLiteral(position);
|
|
1054
|
+
const key = `${first},${second}`;
|
|
1055
|
+
if (first > second || seen.has(key)) continue;
|
|
1056
|
+
seen.add(key);
|
|
1057
|
+
cliques.addEdge(first, second);
|
|
1058
|
+
}
|
|
1059
|
+
}
|
|
1060
|
+
const mutexes = cliques.cliques2(remaining);
|
|
1061
|
+
const sorted: number[][][] = [];
|
|
1062
|
+
for (const mutex of mutexes) (sorted[mutex.length] ??= []).push(mutex);
|
|
1063
|
+
const result = extMutexes;
|
|
1064
|
+
for (let size = sorted.length; size-- > 0;) result.push(...(sorted[size] ?? []));
|
|
1065
|
+
return result;
|
|
1066
|
+
}
|
|
1067
|
+
|
|
1068
|
+
private shouldCancel() {
|
|
1069
|
+
if (!this.limit.inc()) {
|
|
1070
|
+
this.isModelCurrent = false;
|
|
1071
|
+
this.reasonUnknown = "sat.canceled";
|
|
1072
|
+
return true;
|
|
1073
|
+
}
|
|
1074
|
+
if (this.config.restartMax <= this.restarts) {
|
|
1075
|
+
this.reasonUnknown = "sat.max.restarts";
|
|
1076
|
+
return true;
|
|
1077
|
+
}
|
|
1078
|
+
if (this.config.inprocessMax <= this.simplifications) {
|
|
1079
|
+
this.reasonUnknown = "sat.max.inprocess";
|
|
1080
|
+
return true;
|
|
1081
|
+
}
|
|
1082
|
+
return this.reachedMaxConflicts();
|
|
1083
|
+
}
|
|
1084
|
+
|
|
1085
|
+
private reachedMaxConflicts() {
|
|
1086
|
+
if (this.config.maxConflicts === 0 || this.conflictsSinceInit > this.config.maxConflicts) {
|
|
1087
|
+
this.reasonUnknown = "sat.max.conflicts";
|
|
1088
|
+
return !this.isInconsistent;
|
|
1089
|
+
}
|
|
1090
|
+
return false;
|
|
1091
|
+
}
|
|
1092
|
+
|
|
1093
|
+
private nextVar() {
|
|
1094
|
+
if (this.rand.next() < Math.trunc(this.config.randomFreq * RANDOM_MAX_VALUE)) {
|
|
1095
|
+
if (this.numVars() === 0) return -1;
|
|
1096
|
+
const next = this.rand.next() % this.numVars();
|
|
1097
|
+
if (this.valueVar(next) === L_UNDEF && !this.wasEliminated(next)) return next;
|
|
1098
|
+
}
|
|
1099
|
+
while (!this.caseSplitQueue.isEmpty()) {
|
|
1100
|
+
const next = this.caseSplitQueue.nextVar();
|
|
1101
|
+
if (this.valueVar(next) === L_UNDEF && !this.wasEliminated(next)) return next;
|
|
1102
|
+
}
|
|
1103
|
+
return -1;
|
|
1104
|
+
}
|
|
1105
|
+
|
|
1106
|
+
private guess(next: number) {
|
|
1107
|
+
const extPhase = this.ext?.getPhase?.(next) ?? L_UNDEF;
|
|
1108
|
+
if (extPhase !== L_UNDEF) return extPhase === L_TRUE;
|
|
1109
|
+
switch (this.config.phase) {
|
|
1110
|
+
case PS_ALWAYS_TRUE:
|
|
1111
|
+
return true;
|
|
1112
|
+
case PS_ALWAYS_FALSE:
|
|
1113
|
+
return false;
|
|
1114
|
+
case PS_BASIC_CACHING:
|
|
1115
|
+
return this.phase[next];
|
|
1116
|
+
case PS_FROZEN:
|
|
1117
|
+
return this.bestPhase[next];
|
|
1118
|
+
case PS_SAT_CACHING:
|
|
1119
|
+
return this.searchState === S_UNSAT ? this.phase[next] : this.bestPhase[next];
|
|
1120
|
+
default:
|
|
1121
|
+
return this.rand.next() % 2 === 0;
|
|
1122
|
+
}
|
|
1123
|
+
}
|
|
1124
|
+
|
|
1125
|
+
private decide() {
|
|
1126
|
+
const next = this.nextVar();
|
|
1127
|
+
if (next === -1) return false;
|
|
1128
|
+
this.push();
|
|
1129
|
+
this.decisions++;
|
|
1130
|
+
this.assignScoped(2 * next + (this.guess(next) ? 0 : 1));
|
|
1131
|
+
return true;
|
|
1132
|
+
}
|
|
1133
|
+
|
|
1134
|
+
boundedSearch() {
|
|
1135
|
+
this.isSimplifyEnabled = false;
|
|
1136
|
+
this.isRestartEnabled = false;
|
|
1137
|
+
try {
|
|
1138
|
+
return this.basicSearch();
|
|
1139
|
+
} finally {
|
|
1140
|
+
this.isSimplifyEnabled = true;
|
|
1141
|
+
this.isRestartEnabled = true;
|
|
1142
|
+
}
|
|
1143
|
+
}
|
|
1144
|
+
|
|
1145
|
+
private basicSearch() {
|
|
1146
|
+
let result = L_UNDEF;
|
|
1147
|
+
while (result === L_UNDEF && !this.isGivenUp && !this.shouldCancel()) {
|
|
1148
|
+
if (this.isInconsistent) result = this.resolveConflictCore();
|
|
1149
|
+
else if (this.qhead < this.trail.length || this.ext?.canPropagate?.() === true)
|
|
1150
|
+
this.propagate(true);
|
|
1151
|
+
else if (this.doCleanup(false)) continue;
|
|
1152
|
+
else if (this.shouldGc()) this.doGc();
|
|
1153
|
+
else if (this.shouldRephase()) this.doRephase();
|
|
1154
|
+
else if (this.shouldRestart()) {
|
|
1155
|
+
if (!this.isRestartEnabled) return L_UNDEF;
|
|
1156
|
+
this.doRestart(!this.config.isRestartFast);
|
|
1157
|
+
} else if (this.shouldSimplify()) this.doSimplify();
|
|
1158
|
+
else if (!this.decide()) result = this.finalCheck();
|
|
1159
|
+
}
|
|
1160
|
+
return result;
|
|
1161
|
+
}
|
|
1162
|
+
|
|
1163
|
+
private finalCheck() {
|
|
1164
|
+
const ext = this.ext;
|
|
1165
|
+
if (ext?.check === undefined) {
|
|
1166
|
+
this.mkModel();
|
|
1167
|
+
return L_TRUE;
|
|
1168
|
+
}
|
|
1169
|
+
switch (ext.check()) {
|
|
1170
|
+
case CR_DONE:
|
|
1171
|
+
this.mkModel();
|
|
1172
|
+
return L_TRUE;
|
|
1173
|
+
case CR_GIVEUP:
|
|
1174
|
+
this.reasonUnknown = ext.getReasonUnknown?.() ?? "unknown";
|
|
1175
|
+
this.isGivenUp = true;
|
|
1176
|
+
return L_UNDEF;
|
|
1177
|
+
default:
|
|
1178
|
+
return L_UNDEF;
|
|
1179
|
+
}
|
|
1180
|
+
}
|
|
1181
|
+
|
|
1182
|
+
initSearch() {
|
|
1183
|
+
this.isModelCurrent = false;
|
|
1184
|
+
this.phaseCounter = 0;
|
|
1185
|
+
this.searchState = S_UNSAT;
|
|
1186
|
+
this.searchUnsatConflicts = this.config.searchUnsatConflicts;
|
|
1187
|
+
this.searchSatConflicts = this.config.searchSatConflicts;
|
|
1188
|
+
this.searchNextToggle = this.searchUnsatConflicts;
|
|
1189
|
+
this.bestPhaseSize = 0;
|
|
1190
|
+
this.rephaseLim = 0;
|
|
1191
|
+
this.rephaseInc = 0;
|
|
1192
|
+
this.conflictsSinceRestart = 0;
|
|
1193
|
+
this.isForcingConflictAnalysis = false;
|
|
1194
|
+
this.restartThreshold = this.config.restartInitial;
|
|
1195
|
+
this.lubyIndex = 1;
|
|
1196
|
+
this.gcThreshold = this.config.gcInitial;
|
|
1197
|
+
this.defragThreshold = 2;
|
|
1198
|
+
this.restarts = 0;
|
|
1199
|
+
this.simplifications = 0;
|
|
1200
|
+
this.conflictsSinceInit = 0;
|
|
1201
|
+
this.nextSimplify = this.config.simplifyDelay;
|
|
1202
|
+
this.minDTk = 1;
|
|
1203
|
+
this.searchLvl = 0;
|
|
1204
|
+
if (this.learned.length <= 2 * this.clauses.length) this.conflictsSinceGc = 0;
|
|
1205
|
+
this.asymmBranch.initSearch();
|
|
1206
|
+
this.core = [];
|
|
1207
|
+
this.simplifier.initSearch();
|
|
1208
|
+
this.ext?.initSearch?.();
|
|
1209
|
+
}
|
|
1210
|
+
|
|
1211
|
+
private shouldSimplify() {
|
|
1212
|
+
return this.conflictsSinceInit >= this.nextSimplify && this.isSimplifyEnabled;
|
|
1213
|
+
}
|
|
1214
|
+
|
|
1215
|
+
doSimplify() {
|
|
1216
|
+
if (!this.shouldSimplify()) return;
|
|
1217
|
+
this.simplifications++;
|
|
1218
|
+
this.pop(this.scopeLvl);
|
|
1219
|
+
this.cleaner.run(this.config.isForcingCleanup);
|
|
1220
|
+
this.scc.run();
|
|
1221
|
+
this.ext?.preSimplify?.();
|
|
1222
|
+
this.simplifier.run(false);
|
|
1223
|
+
if (this.learned.length > 0) this.simplifier.run(true);
|
|
1224
|
+
this.sortWatchLits();
|
|
1225
|
+
this.ext?.simplify();
|
|
1226
|
+
this.probing.run(false);
|
|
1227
|
+
this.asymmBranch.run(false);
|
|
1228
|
+
this.reinitAssumptions();
|
|
1229
|
+
if (this.isInconsistent) return;
|
|
1230
|
+
if (this.nextSimplify === 0) this.nextSimplify = this.config.nextSimplify1;
|
|
1231
|
+
else {
|
|
1232
|
+
this.nextSimplify = Math.trunc(this.conflictsSinceInit * this.config.simplifyMult2);
|
|
1233
|
+
if (this.nextSimplify > this.conflictsSinceInit + this.config.simplifyMax)
|
|
1234
|
+
this.nextSimplify = this.conflictsSinceInit + this.config.simplifyMax;
|
|
1235
|
+
}
|
|
1236
|
+
}
|
|
1237
|
+
|
|
1238
|
+
private sortWatchLits() {
|
|
1239
|
+
for (const wlist of this.watches) wlist.sortBinariesFirst();
|
|
1240
|
+
}
|
|
1241
|
+
|
|
1242
|
+
private mkModel() {
|
|
1243
|
+
this.isModelCurrent = true;
|
|
1244
|
+
const numVars = this.numVars();
|
|
1245
|
+
this.model = new Int8Array(numVars);
|
|
1246
|
+
for (let boolVar = 0; boolVar < numVars; boolVar++) {
|
|
1247
|
+
if (this.wasEliminated(boolVar)) continue;
|
|
1248
|
+
this.model[boolVar] = this.valueVar(boolVar);
|
|
1249
|
+
const isTrue = this.valueVar(boolVar) === L_TRUE;
|
|
1250
|
+
this.setPhase(boolVar, isTrue);
|
|
1251
|
+
this.setBestPhase(boolVar, isTrue);
|
|
1252
|
+
}
|
|
1253
|
+
this.mc.apply(this.model);
|
|
1254
|
+
}
|
|
1255
|
+
|
|
1256
|
+
private shouldRestart() {
|
|
1257
|
+
if (this.conflictsSinceRestart <= this.restartThreshold) return false;
|
|
1258
|
+
if (this.scopeLvl < 2 + this.searchLvl) return false;
|
|
1259
|
+
if (this.caseSplitQueue.isEmpty()) return false;
|
|
1260
|
+
if (this.config.restart !== RS_EMA) return true;
|
|
1261
|
+
return (
|
|
1262
|
+
this.fastGlueAvg.value + this.searchLvl <= this.scopeLvl &&
|
|
1263
|
+
this.config.restartMargin * this.slowGlueAvg.value <= this.fastGlueAvg.value
|
|
1264
|
+
);
|
|
1265
|
+
}
|
|
1266
|
+
|
|
1267
|
+
doRestart(isToBase: boolean) {
|
|
1268
|
+
this.restarts++;
|
|
1269
|
+
this.popReinit(this.restartLevel(isToBase));
|
|
1270
|
+
this.setNextRestart();
|
|
1271
|
+
}
|
|
1272
|
+
|
|
1273
|
+
private restartLevel(isToBase: boolean) {
|
|
1274
|
+
if (isToBase || this.scopeLvl === this.searchLvl) return this.scopeLvl - this.searchLvl;
|
|
1275
|
+
const next = this.caseSplitQueue.minVar();
|
|
1276
|
+
let level = this.searchLvl;
|
|
1277
|
+
while (
|
|
1278
|
+
level < this.scopeLvl &&
|
|
1279
|
+
this.caseSplitQueue.isMoreActive(this.trail[this.scopes[level].trailLim] >> 1, next)
|
|
1280
|
+
)
|
|
1281
|
+
level++;
|
|
1282
|
+
return level - this.searchLvl;
|
|
1283
|
+
}
|
|
1284
|
+
|
|
1285
|
+
private setNextRestart() {
|
|
1286
|
+
this.conflictsSinceRestart = 0;
|
|
1287
|
+
switch (this.config.restart) {
|
|
1288
|
+
case RS_GEOMETRIC:
|
|
1289
|
+
this.restartThreshold = Math.trunc(this.restartThreshold * this.config.restartFactor);
|
|
1290
|
+
break;
|
|
1291
|
+
case RS_LUBY:
|
|
1292
|
+
this.lubyIndex++;
|
|
1293
|
+
this.restartThreshold = this.config.restartInitial * getLuby(this.lubyIndex);
|
|
1294
|
+
break;
|
|
1295
|
+
case RS_EMA:
|
|
1296
|
+
this.restartThreshold = this.config.restartInitial;
|
|
1297
|
+
break;
|
|
1298
|
+
}
|
|
1299
|
+
}
|
|
1300
|
+
|
|
1301
|
+
private resolveConflictCore() {
|
|
1302
|
+
this.conflictsSinceInit++;
|
|
1303
|
+
this.conflictsSinceRestart++;
|
|
1304
|
+
this.conflictsSinceGc++;
|
|
1305
|
+
this.conflicts++;
|
|
1306
|
+
const conflict = this.getMaxLvl(this.notL, this.conflictKind, this.conflictVal);
|
|
1307
|
+
this.conflictLevel = conflict.level;
|
|
1308
|
+
if (
|
|
1309
|
+
this.conflictLevel <= 1 &&
|
|
1310
|
+
(this.assumptions.length > 0 || this.userScopeLiterals.length > 0)
|
|
1311
|
+
) {
|
|
1312
|
+
this.resolveConflictForUnsatCore();
|
|
1313
|
+
return L_FALSE;
|
|
1314
|
+
}
|
|
1315
|
+
if (this.conflictLevel === 0) return L_FALSE;
|
|
1316
|
+
if (this.allowBacktracking() && conflict.isUniqueMax && !this.isForcingConflictAnalysis) {
|
|
1317
|
+
this.popReinit(this.scopeLvl - this.conflictLevel + 1);
|
|
1318
|
+
this.isForcingConflictAnalysis = true;
|
|
1319
|
+
return L_UNDEF;
|
|
1320
|
+
}
|
|
1321
|
+
this.isForcingConflictAnalysis = false;
|
|
1322
|
+
this.updatePhaseOfVars();
|
|
1323
|
+
if (this.ext !== null) {
|
|
1324
|
+
const result = this.ext.resolveConflict();
|
|
1325
|
+
if (result === L_TRUE) {
|
|
1326
|
+
this.learnLemmaAndBackjump();
|
|
1327
|
+
return L_UNDEF;
|
|
1328
|
+
}
|
|
1329
|
+
if (result === L_FALSE) return L_UNDEF;
|
|
1330
|
+
}
|
|
1331
|
+
this.lemma = [NULL_LITERAL];
|
|
1332
|
+
let index = this.skipLiteralsAboveConflictLevel();
|
|
1333
|
+
let numMarks = 0;
|
|
1334
|
+
let consequent = NULL_LITERAL;
|
|
1335
|
+
let kind = this.conflictKind;
|
|
1336
|
+
let val = this.conflictVal;
|
|
1337
|
+
if (this.notL !== NULL_LITERAL) {
|
|
1338
|
+
numMarks = this.processAntecedent(this.notL, numMarks);
|
|
1339
|
+
consequent = this.notL ^ 1;
|
|
1340
|
+
}
|
|
1341
|
+
do {
|
|
1342
|
+
if (kind === JUSTIFICATION_BINARY) numMarks = this.processAntecedent(val ^ 1, numMarks);
|
|
1343
|
+
else if (kind === JUSTIFICATION_CLAUSE) {
|
|
1344
|
+
const arena = this.arena;
|
|
1345
|
+
let position = 0;
|
|
1346
|
+
if (consequent !== NULL_LITERAL) {
|
|
1347
|
+
if (arena.get(val, 0) === consequent) position = 1;
|
|
1348
|
+
else {
|
|
1349
|
+
numMarks = this.processAntecedent(arena.get(val, 0) ^ 1, numMarks);
|
|
1350
|
+
position = 2;
|
|
1351
|
+
}
|
|
1352
|
+
}
|
|
1353
|
+
for (; position < arena.size[val]; position++)
|
|
1354
|
+
numMarks = this.processAntecedent(arena.get(val, position) ^ 1, numMarks);
|
|
1355
|
+
} else if (kind === JUSTIFICATION_EXT)
|
|
1356
|
+
for (const lit of this.getExtAntecedents(consequent, val))
|
|
1357
|
+
numMarks = this.processAntecedent(lit, numMarks);
|
|
1358
|
+
let boolVar: number;
|
|
1359
|
+
for (;;) {
|
|
1360
|
+
consequent = this.trail[index];
|
|
1361
|
+
boolVar = consequent >> 1;
|
|
1362
|
+
if (this.mark[boolVar] && this.lvlVar(boolVar) === this.conflictLevel) break;
|
|
1363
|
+
index--;
|
|
1364
|
+
}
|
|
1365
|
+
kind = this.justKind[boolVar];
|
|
1366
|
+
val = this.justVal[boolVar];
|
|
1367
|
+
index--;
|
|
1368
|
+
numMarks--;
|
|
1369
|
+
this.mark[boolVar] = false;
|
|
1370
|
+
} while (numMarks > 0);
|
|
1371
|
+
this.lemma[0] = consequent ^ 1;
|
|
1372
|
+
this.learnLemmaAndBackjump();
|
|
1373
|
+
return L_UNDEF;
|
|
1374
|
+
}
|
|
1375
|
+
|
|
1376
|
+
private learnLemmaAndBackjump() {
|
|
1377
|
+
if (this.config.isMinimizingLemmas) {
|
|
1378
|
+
this.minimizeLemma();
|
|
1379
|
+
this.resetLemmaVarMarks();
|
|
1380
|
+
if (this.config.isDynSubRes) this.dynSubRes();
|
|
1381
|
+
} else this.resetLemmaVarMarks();
|
|
1382
|
+
const lemma = this.lemma;
|
|
1383
|
+
let backtrackLvl = this.lvl(lemma[0]);
|
|
1384
|
+
let backjumpLvl = 0;
|
|
1385
|
+
for (let index = lemma.length; index-- > 1;)
|
|
1386
|
+
backjumpLvl = Math.max(this.lvl(lemma[index]), backjumpLvl);
|
|
1387
|
+
if (backtrackLvl < backjumpLvl) {
|
|
1388
|
+
backtrackLvl = backjumpLvl;
|
|
1389
|
+
for (let index = lemma.length; index-- > 1;)
|
|
1390
|
+
if (this.lvl(lemma[index]) === backjumpLvl) {
|
|
1391
|
+
const lit = lemma[index];
|
|
1392
|
+
lemma[index] = lemma[0];
|
|
1393
|
+
lemma[0] = lit;
|
|
1394
|
+
break;
|
|
1395
|
+
}
|
|
1396
|
+
}
|
|
1397
|
+
const glue = this.numDiffLevels(lemma);
|
|
1398
|
+
this.fastGlueAvg.update(glue);
|
|
1399
|
+
this.slowGlueAvg.update(glue);
|
|
1400
|
+
const numScopes = this.scopeLvl - backjumpLvl;
|
|
1401
|
+
if (this.useBackjumping(numScopes)) this.popReinit(numScopes);
|
|
1402
|
+
else this.popReinit(this.scopeLvl - backtrackLvl + 1);
|
|
1403
|
+
const clause = this.mkClauseCore(lemma, true);
|
|
1404
|
+
if (clause !== -1) this.arena.setGlue(clause, glue);
|
|
1405
|
+
this.lemma = [];
|
|
1406
|
+
this.activityInc = Math.trunc(((this.activityInc * this.config.variableDecay) % 2 ** 32) / 100);
|
|
1407
|
+
this.updatePhaseCounters();
|
|
1408
|
+
}
|
|
1409
|
+
|
|
1410
|
+
private useBackjumping(numScopes: number) {
|
|
1411
|
+
return numScopes > 0 && (numScopes <= this.config.backtrackScopes || !this.allowBacktracking());
|
|
1412
|
+
}
|
|
1413
|
+
|
|
1414
|
+
private allowBacktracking() {
|
|
1415
|
+
return this.conflictsSinceInit > this.config.backtrackInitConflicts;
|
|
1416
|
+
}
|
|
1417
|
+
|
|
1418
|
+
getMaxLvl(notL: number, kind: number, val: number) {
|
|
1419
|
+
let isUniqueMax = true;
|
|
1420
|
+
let level = notL !== NULL_LITERAL ? this.lvl(notL) : 0;
|
|
1421
|
+
const update = (lit: number) => {
|
|
1422
|
+
const litLevel = this.lvl(lit);
|
|
1423
|
+
if (litLevel < level) return;
|
|
1424
|
+
isUniqueMax = litLevel > level;
|
|
1425
|
+
level = litLevel;
|
|
1426
|
+
};
|
|
1427
|
+
if (kind === JUSTIFICATION_NONE) level = Math.max(level, this.conflictJustLevel);
|
|
1428
|
+
else if (kind === JUSTIFICATION_BINARY) update(val);
|
|
1429
|
+
else if (kind === JUSTIFICATION_EXT)
|
|
1430
|
+
for (const lit of this.getExtAntecedents(notL === NULL_LITERAL ? notL : notL ^ 1, val))
|
|
1431
|
+
update(lit);
|
|
1432
|
+
else
|
|
1433
|
+
for (let index = 0; index < this.arena.size[val]; index++) update(this.arena.get(val, index));
|
|
1434
|
+
return { level, isUniqueMax };
|
|
1435
|
+
}
|
|
1436
|
+
|
|
1437
|
+
private getExtAntecedents(consequent: number, index: number) {
|
|
1438
|
+
const antecedents: number[] = [];
|
|
1439
|
+
(this.ext as SatExtension).getAntecedents(consequent, index, antecedents);
|
|
1440
|
+
return antecedents;
|
|
1441
|
+
}
|
|
1442
|
+
|
|
1443
|
+
private skipLiteralsAboveConflictLevel() {
|
|
1444
|
+
let index = this.trail.length;
|
|
1445
|
+
if (index === 0) return index;
|
|
1446
|
+
index--;
|
|
1447
|
+
while (this.lvl(this.trail[index]) > this.conflictLevel) index--;
|
|
1448
|
+
return index;
|
|
1449
|
+
}
|
|
1450
|
+
|
|
1451
|
+
private processAntecedent(antecedent: number, numMarks: number) {
|
|
1452
|
+
const boolVar = antecedent >> 1;
|
|
1453
|
+
const varLvl = this.lvlVar(boolVar);
|
|
1454
|
+
if (this.mark[boolVar] || varLvl <= 0) return numMarks;
|
|
1455
|
+
this.mark[boolVar] = true;
|
|
1456
|
+
this.incActivity(boolVar);
|
|
1457
|
+
if (varLvl === this.conflictLevel) return numMarks + 1;
|
|
1458
|
+
this.lemma.push(antecedent ^ 1);
|
|
1459
|
+
return numMarks;
|
|
1460
|
+
}
|
|
1461
|
+
|
|
1462
|
+
private isTwoPhase() {
|
|
1463
|
+
return this.config.phase === PS_SAT_CACHING;
|
|
1464
|
+
}
|
|
1465
|
+
|
|
1466
|
+
private isSatPhase() {
|
|
1467
|
+
return this.isTwoPhase() && this.searchState === S_SAT;
|
|
1468
|
+
}
|
|
1469
|
+
|
|
1470
|
+
private updatePhaseOfVars() {
|
|
1471
|
+
if (this.config.phase === PS_FROZEN) return;
|
|
1472
|
+
const fromLvl = this.conflictLevel;
|
|
1473
|
+
const head = fromLvl === 0 ? 0 : this.scopes[fromLvl - 1].trailLim;
|
|
1474
|
+
for (let index = head; index < this.trail.length; index++)
|
|
1475
|
+
this.setPhase(this.trail[index] >> 1, this.rand.next() % 2 === 0);
|
|
1476
|
+
if (this.isSatPhase() && head >= this.bestPhaseSize) {
|
|
1477
|
+
this.bestPhaseSize = head;
|
|
1478
|
+
for (let index = 0; index < head; index++) {
|
|
1479
|
+
const boolVar = this.trail[index] >> 1;
|
|
1480
|
+
this.setBestPhase(boolVar, this.phase[boolVar]);
|
|
1481
|
+
}
|
|
1482
|
+
}
|
|
1483
|
+
}
|
|
1484
|
+
|
|
1485
|
+
private shouldToggleSearchState() {
|
|
1486
|
+
if (this.searchState === S_UNSAT) this.trailAvg.update(this.trail.length);
|
|
1487
|
+
return (
|
|
1488
|
+
this.phaseCounter >= this.searchNextToggle &&
|
|
1489
|
+
(this.searchState === S_SAT || this.trail.length > 0.5 * this.trailAvg.value)
|
|
1490
|
+
);
|
|
1491
|
+
}
|
|
1492
|
+
|
|
1493
|
+
private doToggleSearchState() {
|
|
1494
|
+
if (this.isTwoPhase()) {
|
|
1495
|
+
this.bestPhaseSize = 0;
|
|
1496
|
+
[this.fastGlueBackup, this.fastGlueAvg] = [this.fastGlueAvg, this.fastGlueBackup];
|
|
1497
|
+
[this.slowGlueBackup, this.slowGlueAvg] = [this.slowGlueAvg, this.slowGlueBackup];
|
|
1498
|
+
if (this.searchState === S_SAT) this.searchUnsatConflicts += this.config.searchUnsatConflicts;
|
|
1499
|
+
else this.searchSatConflicts += this.config.searchSatConflicts;
|
|
1500
|
+
}
|
|
1501
|
+
if (this.searchState === S_UNSAT) {
|
|
1502
|
+
this.searchState = S_SAT;
|
|
1503
|
+
this.searchNextToggle = this.searchSatConflicts;
|
|
1504
|
+
} else {
|
|
1505
|
+
this.searchState = S_UNSAT;
|
|
1506
|
+
this.searchNextToggle = this.searchUnsatConflicts;
|
|
1507
|
+
}
|
|
1508
|
+
this.phaseCounter = 0;
|
|
1509
|
+
}
|
|
1510
|
+
|
|
1511
|
+
private shouldRephase() {
|
|
1512
|
+
return this.conflictsSinceInit > this.rephaseLim;
|
|
1513
|
+
}
|
|
1514
|
+
|
|
1515
|
+
private doRephase() {
|
|
1516
|
+
const size = this.phase.length;
|
|
1517
|
+
switch (this.config.phase) {
|
|
1518
|
+
case PS_ALWAYS_TRUE:
|
|
1519
|
+
for (let index = 0; index < size; index++) this.setPhase(index, true);
|
|
1520
|
+
break;
|
|
1521
|
+
case PS_ALWAYS_FALSE:
|
|
1522
|
+
for (let index = 0; index < size; index++) this.setPhase(index, false);
|
|
1523
|
+
break;
|
|
1524
|
+
case PS_BASIC_CACHING:
|
|
1525
|
+
switch (this.rephaseCount % 4) {
|
|
1526
|
+
case 0:
|
|
1527
|
+
for (let index = 0; index < size; index++)
|
|
1528
|
+
this.setPhase(index, this.rand.next() % 2 === 0);
|
|
1529
|
+
break;
|
|
1530
|
+
case 1:
|
|
1531
|
+
for (let index = 0; index < size; index++) this.setPhase(index, false);
|
|
1532
|
+
break;
|
|
1533
|
+
case 2:
|
|
1534
|
+
for (let index = 0; index < size; index++) this.setPhase(index, !this.phase[index]);
|
|
1535
|
+
break;
|
|
1536
|
+
}
|
|
1537
|
+
break;
|
|
1538
|
+
case PS_SAT_CACHING:
|
|
1539
|
+
if (this.searchState === S_SAT)
|
|
1540
|
+
for (let index = 0; index < size; index++) this.setPhase(index, this.bestPhase[index]);
|
|
1541
|
+
break;
|
|
1542
|
+
case PS_RANDOM:
|
|
1543
|
+
for (let index = 0; index < size; index++) this.setPhase(index, this.rand.next() % 2 === 0);
|
|
1544
|
+
break;
|
|
1545
|
+
}
|
|
1546
|
+
this.rephaseInc += this.config.rephaseBase;
|
|
1547
|
+
this.rephaseLim += this.rephaseInc;
|
|
1548
|
+
this.rephaseCount++;
|
|
1549
|
+
}
|
|
1550
|
+
|
|
1551
|
+
private updatePhaseCounters() {
|
|
1552
|
+
this.phaseCounter++;
|
|
1553
|
+
if (this.shouldToggleSearchState()) this.doToggleSearchState();
|
|
1554
|
+
}
|
|
1555
|
+
|
|
1556
|
+
numDiffLevels(lits: number[]) {
|
|
1557
|
+
let result = 0;
|
|
1558
|
+
for (const lit of lits) {
|
|
1559
|
+
const litLvl = this.lvl(lit);
|
|
1560
|
+
if (!this.diffLevels[litLvl]) {
|
|
1561
|
+
this.diffLevels[litLvl] = true;
|
|
1562
|
+
result++;
|
|
1563
|
+
}
|
|
1564
|
+
}
|
|
1565
|
+
for (const lit of lits) this.diffLevels[this.lvl(lit)] = false;
|
|
1566
|
+
return result;
|
|
1567
|
+
}
|
|
1568
|
+
|
|
1569
|
+
numDiffFalseLevelsBelow(lits: number[], maxGlue: number) {
|
|
1570
|
+
let glue = 0;
|
|
1571
|
+
let index = 0;
|
|
1572
|
+
for (; index < lits.length && glue < maxGlue; index++) {
|
|
1573
|
+
if (this.value(lits[index]) !== L_FALSE) continue;
|
|
1574
|
+
const litLvl = this.lvl(lits[index]);
|
|
1575
|
+
if (!this.diffLevels[litLvl]) {
|
|
1576
|
+
this.diffLevels[litLvl] = true;
|
|
1577
|
+
glue++;
|
|
1578
|
+
}
|
|
1579
|
+
}
|
|
1580
|
+
while (index-- > 0)
|
|
1581
|
+
if (this.value(lits[index]) === L_FALSE) this.diffLevels[this.lvl(lits[index])] = false;
|
|
1582
|
+
return glue < maxGlue ? glue : -1;
|
|
1583
|
+
}
|
|
1584
|
+
|
|
1585
|
+
private numDiffLevelsBelow(clause: number, maxGlue: number) {
|
|
1586
|
+
const arena = this.arena;
|
|
1587
|
+
let glue = 0;
|
|
1588
|
+
let index = 0;
|
|
1589
|
+
for (; index < arena.size[clause] && glue < maxGlue; index++) {
|
|
1590
|
+
const litLvl = this.lvl(arena.get(clause, index));
|
|
1591
|
+
if (!this.diffLevels[litLvl]) {
|
|
1592
|
+
this.diffLevels[litLvl] = true;
|
|
1593
|
+
glue++;
|
|
1594
|
+
}
|
|
1595
|
+
}
|
|
1596
|
+
while (index-- > 0) this.diffLevels[this.lvl(arena.get(clause, index))] = false;
|
|
1597
|
+
return glue < maxGlue ? glue : -1;
|
|
1598
|
+
}
|
|
1599
|
+
|
|
1600
|
+
private processAntecedentForMinimization(antecedent: number) {
|
|
1601
|
+
const boolVar = antecedent >> 1;
|
|
1602
|
+
const varLvl = this.lvlVar(boolVar);
|
|
1603
|
+
if (!this.mark[boolVar] && varLvl > 0) {
|
|
1604
|
+
if ((this.lvlSet & (1 << (varLvl & 31))) === 0) return false;
|
|
1605
|
+
this.mark[boolVar] = true;
|
|
1606
|
+
this.unmark.push(boolVar);
|
|
1607
|
+
this.lemmaMinStack.push(antecedent);
|
|
1608
|
+
}
|
|
1609
|
+
return true;
|
|
1610
|
+
}
|
|
1611
|
+
|
|
1612
|
+
private impliedByMarked(start: number) {
|
|
1613
|
+
this.lemmaMinStack = [start];
|
|
1614
|
+
const oldSize = this.unmark.length;
|
|
1615
|
+
while (this.lemmaMinStack.length > 0) {
|
|
1616
|
+
const boolVar = (this.lemmaMinStack.pop() as number) >> 1;
|
|
1617
|
+
const kind = this.justKind[boolVar];
|
|
1618
|
+
const val = this.justVal[boolVar];
|
|
1619
|
+
let isImplied = true;
|
|
1620
|
+
if (kind === JUSTIFICATION_NONE) isImplied = this.lvlVar(boolVar) <= 0;
|
|
1621
|
+
else if (kind === JUSTIFICATION_BINARY)
|
|
1622
|
+
isImplied = this.processAntecedentForMinimization(val ^ 1);
|
|
1623
|
+
else if (kind === JUSTIFICATION_EXT) {
|
|
1624
|
+
const consequent = 2 * boolVar + (this.valueVar(boolVar) === L_FALSE ? 1 : 0);
|
|
1625
|
+
for (const lit of this.getExtAntecedents(consequent, val))
|
|
1626
|
+
if (!(isImplied = this.processAntecedentForMinimization(lit))) break;
|
|
1627
|
+
} else {
|
|
1628
|
+
const arena = this.arena;
|
|
1629
|
+
let position = 1;
|
|
1630
|
+
if (arena.get(val, 0) >> 1 !== boolVar) {
|
|
1631
|
+
isImplied = this.processAntecedentForMinimization(arena.get(val, 0) ^ 1);
|
|
1632
|
+
position = 2;
|
|
1633
|
+
}
|
|
1634
|
+
for (; isImplied && position < arena.size[val]; position++)
|
|
1635
|
+
isImplied = this.processAntecedentForMinimization(arena.get(val, position) ^ 1);
|
|
1636
|
+
}
|
|
1637
|
+
if (!isImplied) {
|
|
1638
|
+
this.resetUnmark(oldSize);
|
|
1639
|
+
return false;
|
|
1640
|
+
}
|
|
1641
|
+
}
|
|
1642
|
+
return true;
|
|
1643
|
+
}
|
|
1644
|
+
|
|
1645
|
+
private resetUnmark(oldSize: number) {
|
|
1646
|
+
for (let index = oldSize; index < this.unmark.length; index++)
|
|
1647
|
+
this.mark[this.unmark[index]] = false;
|
|
1648
|
+
this.unmark.length = oldSize;
|
|
1649
|
+
}
|
|
1650
|
+
|
|
1651
|
+
private minimizeLemma() {
|
|
1652
|
+
this.lvlSet = 0;
|
|
1653
|
+
for (const lit of this.lemma) this.lvlSet |= 1 << (this.lvl(lit) & 31);
|
|
1654
|
+
const size = this.lemma.length;
|
|
1655
|
+
let next = 1;
|
|
1656
|
+
for (let index = 1; index < size; index++) {
|
|
1657
|
+
const lit = this.lemma[index];
|
|
1658
|
+
if (this.impliedByMarked(lit)) this.unmark.push(lit >> 1);
|
|
1659
|
+
else this.lemma[next++] = lit;
|
|
1660
|
+
}
|
|
1661
|
+
this.resetUnmark(0);
|
|
1662
|
+
this.lemma.length = next;
|
|
1663
|
+
}
|
|
1664
|
+
|
|
1665
|
+
private resetLemmaVarMarks() {
|
|
1666
|
+
this.updateLrbReasoned();
|
|
1667
|
+
for (let index = 1; index < this.lemma.length; index++)
|
|
1668
|
+
this.mark[this.lemma[index] >> 1] = false;
|
|
1669
|
+
}
|
|
1670
|
+
|
|
1671
|
+
private updateLrbReasoned() {
|
|
1672
|
+
const lemma = this.lemma;
|
|
1673
|
+
const size = lemma.length;
|
|
1674
|
+
this.mark[lemma[0] >> 1] = true;
|
|
1675
|
+
const reason = (lit: number) => {
|
|
1676
|
+
const boolVar = lit >> 1;
|
|
1677
|
+
if (this.mark[boolVar]) return;
|
|
1678
|
+
this.mark[boolVar] = true;
|
|
1679
|
+
this.incActivity(boolVar);
|
|
1680
|
+
lemma.push(lit);
|
|
1681
|
+
};
|
|
1682
|
+
for (let index = lemma.length; index-- > 0;) {
|
|
1683
|
+
const boolVar = lemma[index] >> 1;
|
|
1684
|
+
const kind = this.justKind[boolVar];
|
|
1685
|
+
const val = this.justVal[boolVar];
|
|
1686
|
+
if (kind === JUSTIFICATION_BINARY) reason(val);
|
|
1687
|
+
else if (kind === JUSTIFICATION_CLAUSE)
|
|
1688
|
+
for (let position = 0; position < this.arena.size[val]; position++)
|
|
1689
|
+
reason(this.arena.get(val, position));
|
|
1690
|
+
else if (kind === JUSTIFICATION_EXT)
|
|
1691
|
+
for (const lit of this.getExtAntecedents(lemma[index] ^ 1, val)) reason(lit);
|
|
1692
|
+
}
|
|
1693
|
+
this.mark[lemma[0] >> 1] = false;
|
|
1694
|
+
for (let index = lemma.length; index-- > size;) this.mark[lemma[index] >> 1] = false;
|
|
1695
|
+
lemma.length = size;
|
|
1696
|
+
}
|
|
1697
|
+
|
|
1698
|
+
private dynSubRes() {
|
|
1699
|
+
const lemma = this.lemma;
|
|
1700
|
+
const size = lemma.length;
|
|
1701
|
+
for (const lit of lemma) this.litMark[lit] = true;
|
|
1702
|
+
const first = lemma[0];
|
|
1703
|
+
for (let index = 0; index < size; index++) {
|
|
1704
|
+
const lit = lemma[index];
|
|
1705
|
+
if (!this.litMark[lit]) continue;
|
|
1706
|
+
const wlist = this.getWlist(lit ^ 1);
|
|
1707
|
+
for (let position = 0; position < wlist.size && wlist.isBinary(position); position++) {
|
|
1708
|
+
const other = wlist.getLiteral(position);
|
|
1709
|
+
if (this.litMark[other ^ 1] && first !== (other ^ 1)) this.litMark[other ^ 1] = false;
|
|
1710
|
+
}
|
|
1711
|
+
const impliedLits = this.probing.cachedImpliedLits(lit ^ 1);
|
|
1712
|
+
if (impliedLits !== undefined)
|
|
1713
|
+
for (const other of impliedLits)
|
|
1714
|
+
if (this.litMark[other ^ 1] && first !== (other ^ 1)) this.litMark[other ^ 1] = false;
|
|
1715
|
+
}
|
|
1716
|
+
let next = 0;
|
|
1717
|
+
for (let index = 0; index < size; index++) {
|
|
1718
|
+
const lit = lemma[index];
|
|
1719
|
+
if (this.litMark[lit]) {
|
|
1720
|
+
this.litMark[lit] = false;
|
|
1721
|
+
lemma[next++] = lit;
|
|
1722
|
+
}
|
|
1723
|
+
}
|
|
1724
|
+
lemma.length = next;
|
|
1725
|
+
}
|
|
1726
|
+
|
|
1727
|
+
push() {
|
|
1728
|
+
this.scopes.push({
|
|
1729
|
+
trailLim: this.trail.length,
|
|
1730
|
+
clausesToReinitLim: this.clausesToReinit.length,
|
|
1731
|
+
});
|
|
1732
|
+
this.scopeLvl++;
|
|
1733
|
+
if (this.ext !== null) {
|
|
1734
|
+
this.varsLim.push(this.activeVars.length);
|
|
1735
|
+
this.ext.push();
|
|
1736
|
+
}
|
|
1737
|
+
}
|
|
1738
|
+
|
|
1739
|
+
popReinit(numScopes: number) {
|
|
1740
|
+
this.pop(numScopes);
|
|
1741
|
+
this.reinitAssumptions();
|
|
1742
|
+
}
|
|
1743
|
+
|
|
1744
|
+
// pop_vars keeps every variable made in the popped scopes: no variable is freed for reuse.
|
|
1745
|
+
private popVars(numScopes: number) {
|
|
1746
|
+
this.varsToReinit = [];
|
|
1747
|
+
const oldNumVars = this.varsLim[this.varsLim.length - numScopes];
|
|
1748
|
+
this.varsLim.length -= numScopes;
|
|
1749
|
+
const newLvl = this.scopes.length - numScopes;
|
|
1750
|
+
for (let index = oldNumVars; index < this.activeVars.length; index++) {
|
|
1751
|
+
const boolVar = this.activeVars[index];
|
|
1752
|
+
this.varsToReinit.push(boolVar);
|
|
1753
|
+
this.varScope[boolVar] = newLvl;
|
|
1754
|
+
}
|
|
1755
|
+
}
|
|
1756
|
+
|
|
1757
|
+
pop(numScopes: number) {
|
|
1758
|
+
if (numScopes === 0) return;
|
|
1759
|
+
if (this.ext !== null) {
|
|
1760
|
+
this.popVars(numScopes);
|
|
1761
|
+
this.ext.pop(numScopes);
|
|
1762
|
+
}
|
|
1763
|
+
const newLvl = this.scopeLvl - numScopes;
|
|
1764
|
+
const scope = this.scopes[newLvl];
|
|
1765
|
+
this.isInconsistent = false;
|
|
1766
|
+
this.unassignVars(scope.trailLim, newLvl);
|
|
1767
|
+
this.scopeLvl -= numScopes;
|
|
1768
|
+
this.reinitClauses(scope.clausesToReinitLim);
|
|
1769
|
+
this.scopes.length = newLvl;
|
|
1770
|
+
this.ext?.popReinit();
|
|
1771
|
+
}
|
|
1772
|
+
|
|
1773
|
+
private unassignVars(oldSize: number, newLvl: number) {
|
|
1774
|
+
for (let index = this.trail.length; index-- > oldSize;) {
|
|
1775
|
+
const lit = this.trail[index];
|
|
1776
|
+
const boolVar = lit >> 1;
|
|
1777
|
+
if (this.lvlVar(boolVar) <= newLvl) {
|
|
1778
|
+
this.replayAssign.push(lit);
|
|
1779
|
+
continue;
|
|
1780
|
+
}
|
|
1781
|
+
this.assignment[lit] = L_UNDEF;
|
|
1782
|
+
this.assignment[lit ^ 1] = L_UNDEF;
|
|
1783
|
+
this.caseSplitQueue.unassignVar(boolVar);
|
|
1784
|
+
}
|
|
1785
|
+
this.trail.length = oldSize;
|
|
1786
|
+
this.qhead = oldSize;
|
|
1787
|
+
for (let index = this.replayAssign.length; index-- > 0;)
|
|
1788
|
+
this.trail.push(this.replayAssign[index]);
|
|
1789
|
+
this.replayAssign.length = 0;
|
|
1790
|
+
}
|
|
1791
|
+
|
|
1792
|
+
private reinitClauses(oldSize: number) {
|
|
1793
|
+
const stack = this.clausesToReinit;
|
|
1794
|
+
let next = oldSize;
|
|
1795
|
+
for (let index = oldSize; index < stack.length; index += 2) {
|
|
1796
|
+
const first = stack[index];
|
|
1797
|
+
const second = stack[index + 1];
|
|
1798
|
+
if (second !== NULL_LITERAL) {
|
|
1799
|
+
if (
|
|
1800
|
+
(this.propagateBinClause(first, second) && !this.atBaseLvl()) ||
|
|
1801
|
+
(this.hasVariablesToReinitBinary(first, second) && !this.atBaseLvl())
|
|
1802
|
+
) {
|
|
1803
|
+
stack[next++] = first;
|
|
1804
|
+
stack[next++] = second;
|
|
1805
|
+
}
|
|
1806
|
+
continue;
|
|
1807
|
+
}
|
|
1808
|
+
this.detachClause(first);
|
|
1809
|
+
const isReinit = this.attachClause(first);
|
|
1810
|
+
if (
|
|
1811
|
+
(isReinit && !this.atBaseLvl()) ||
|
|
1812
|
+
(this.hasVariablesToReinit(first) && !this.atBaseLvl())
|
|
1813
|
+
) {
|
|
1814
|
+
stack[next++] = first;
|
|
1815
|
+
stack[next++] = second;
|
|
1816
|
+
} else this.arena.setReinitStack(first, false);
|
|
1817
|
+
}
|
|
1818
|
+
stack.length = next;
|
|
1819
|
+
}
|
|
1820
|
+
|
|
1821
|
+
popToBaseLevel() {
|
|
1822
|
+
this.resetAssumptions();
|
|
1823
|
+
this.pop(this.scopeLvl);
|
|
1824
|
+
this.isModelCurrent = false;
|
|
1825
|
+
}
|
|
1826
|
+
|
|
1827
|
+
// user_push: every clause added in the scope is guarded by the scope's literal. Without free
|
|
1828
|
+
// variables, the scope variable is the last one.
|
|
1829
|
+
userPush() {
|
|
1830
|
+
this.popToBaseLevel();
|
|
1831
|
+
this.userScopeLiterals.push(2 * this.mkVar(true));
|
|
1832
|
+
this.ext?.userPush?.();
|
|
1833
|
+
}
|
|
1834
|
+
|
|
1835
|
+
userPop(numScopes: number) {
|
|
1836
|
+
if (this.userScopeLiterals.length === 0) return;
|
|
1837
|
+
const oldSize = this.userScopeLiterals.length - numScopes;
|
|
1838
|
+
const maxVar = this.userScopeLiterals[oldSize] >> 1;
|
|
1839
|
+
this.userScopeLiterals.length = oldSize;
|
|
1840
|
+
this.popToBaseLevel();
|
|
1841
|
+
this.ext?.userPop?.(numScopes);
|
|
1842
|
+
this.gcVars(maxVar);
|
|
1843
|
+
this.qhead = 0;
|
|
1844
|
+
const wasSuspended = this.limit.isSuspended;
|
|
1845
|
+
this.limit.isSuspended = true;
|
|
1846
|
+
this.propagate(false);
|
|
1847
|
+
this.limit.isSuspended = wasSuspended;
|
|
1848
|
+
}
|
|
1849
|
+
|
|
1850
|
+
// gc_vars: drop the variables from maxVar on, with their watches and clauses.
|
|
1851
|
+
private gcVars(maxVar: number) {
|
|
1852
|
+
this.initVisited();
|
|
1853
|
+
const others: number[] = [];
|
|
1854
|
+
for (let lit = 2 * maxVar; lit < 2 * this.varCount; lit++) {
|
|
1855
|
+
const wlist = this.watches[lit];
|
|
1856
|
+
for (let index = 0; index < wlist.size; index++) {
|
|
1857
|
+
const other = wlist.getLiteral(index);
|
|
1858
|
+
if (wlist.isBinary(index) && other >> 1 < maxVar && !this.isVisited(other)) {
|
|
1859
|
+
others.push(other);
|
|
1860
|
+
this.markVisited(other);
|
|
1861
|
+
}
|
|
1862
|
+
}
|
|
1863
|
+
wlist.size = 0;
|
|
1864
|
+
}
|
|
1865
|
+
for (const lit of others) {
|
|
1866
|
+
const wlist = this.watches[lit ^ 1];
|
|
1867
|
+
let next = 0;
|
|
1868
|
+
for (let index = 0; index < wlist.size; index++)
|
|
1869
|
+
if (!wlist.isBinary(index) || wlist.getLiteral(index) >> 1 < maxVar) {
|
|
1870
|
+
wlist.data[2 * next] = wlist.data[2 * index];
|
|
1871
|
+
wlist.data[2 * next + 1] = wlist.data[2 * index + 1];
|
|
1872
|
+
next++;
|
|
1873
|
+
}
|
|
1874
|
+
wlist.size = next;
|
|
1875
|
+
}
|
|
1876
|
+
const gcClauses = (clauses: number[]) => {
|
|
1877
|
+
let next = 0;
|
|
1878
|
+
for (const clause of clauses) {
|
|
1879
|
+
if (this.arena.getLits(clause).some((lit) => lit >> 1 >= maxVar)) {
|
|
1880
|
+
this.detachClause(clause);
|
|
1881
|
+
this.delClause(clause);
|
|
1882
|
+
} else clauses[next++] = clause;
|
|
1883
|
+
}
|
|
1884
|
+
clauses.length = next;
|
|
1885
|
+
};
|
|
1886
|
+
gcClauses(this.learned);
|
|
1887
|
+
gcClauses(this.clauses);
|
|
1888
|
+
let next = 0;
|
|
1889
|
+
for (const lit of this.trail) if (lit >> 1 < maxVar) this.trail[next++] = lit;
|
|
1890
|
+
this.trail.length = next;
|
|
1891
|
+
this.shrinkVars(maxVar);
|
|
1892
|
+
}
|
|
1893
|
+
|
|
1894
|
+
private shrinkVars(boolVar: number) {
|
|
1895
|
+
for (let index = this.varCount; index-- > boolVar;) {
|
|
1896
|
+
this.caseSplitQueue.delVar(index);
|
|
1897
|
+
this.probing.resetCache(2 * index + 1);
|
|
1898
|
+
this.probing.resetCache(2 * index);
|
|
1899
|
+
}
|
|
1900
|
+
this.varCount = boolVar;
|
|
1901
|
+
this.watches.length = 2 * boolVar;
|
|
1902
|
+
this.assignment.fill(L_UNDEF, 2 * boolVar);
|
|
1903
|
+
for (const values of [
|
|
1904
|
+
this.justVal,
|
|
1905
|
+
this.justKind,
|
|
1906
|
+
this.eliminated,
|
|
1907
|
+
this.external,
|
|
1908
|
+
this.varScope,
|
|
1909
|
+
this.touched,
|
|
1910
|
+
this.activity,
|
|
1911
|
+
this.mark,
|
|
1912
|
+
this.phase,
|
|
1913
|
+
this.bestPhase,
|
|
1914
|
+
this.prevPhase,
|
|
1915
|
+
this.phaseBirthdate,
|
|
1916
|
+
this.bestPhaseBirthdate,
|
|
1917
|
+
this.assignedSinceGc,
|
|
1918
|
+
])
|
|
1919
|
+
values.length = boolVar;
|
|
1920
|
+
this.litMark.length = 2 * boolVar;
|
|
1921
|
+
this.simplifier.resetTodos();
|
|
1922
|
+
}
|
|
1923
|
+
|
|
1924
|
+
incActivity(boolVar: number) {
|
|
1925
|
+
this.activity[boolVar] += this.activityInc;
|
|
1926
|
+
this.caseSplitQueue.activityIncreased(boolVar);
|
|
1927
|
+
if (this.activity[boolVar] > 1 << 24) this.rescaleActivity();
|
|
1928
|
+
}
|
|
1929
|
+
|
|
1930
|
+
private rescaleActivity() {
|
|
1931
|
+
for (let index = 0; index < this.activity.length; index++) this.activity[index] >>>= 14;
|
|
1932
|
+
this.activityInc >>>= 14;
|
|
1933
|
+
}
|
|
1934
|
+
|
|
1935
|
+
numClauses() {
|
|
1936
|
+
let numClauses = this.trail.length;
|
|
1937
|
+
for (let lit = 0; lit < this.watches.length; lit++) {
|
|
1938
|
+
const wlist = this.watches[lit];
|
|
1939
|
+
for (let index = 0; index < wlist.size; index++)
|
|
1940
|
+
if (wlist.isBinary(index) && (lit ^ 1) < wlist.getLiteral(index)) numClauses++;
|
|
1941
|
+
}
|
|
1942
|
+
return numClauses + this.clauses.length + this.learned.length;
|
|
1943
|
+
}
|
|
1944
|
+
|
|
1945
|
+
doCleanup(isForced: boolean) {
|
|
1946
|
+
if (this.conflictsSinceInit === 0 && !isForced) return false;
|
|
1947
|
+
return this.atBaseLvl() && !this.isInconsistent && this.cleaner.run(isForced);
|
|
1948
|
+
}
|
|
1949
|
+
|
|
1950
|
+
private shouldGc() {
|
|
1951
|
+
return (
|
|
1952
|
+
this.conflictsSinceGc > this.gcThreshold &&
|
|
1953
|
+
(this.config.gcStrategy !== GC_DYN_PSM || this.atBaseLvl())
|
|
1954
|
+
);
|
|
1955
|
+
}
|
|
1956
|
+
|
|
1957
|
+
private doGc() {
|
|
1958
|
+
if (!this.shouldGc()) return;
|
|
1959
|
+
const gc = this.gcClauses;
|
|
1960
|
+
this.conflictsSinceGc = 0;
|
|
1961
|
+
this.gcThreshold += this.config.gcIncrement;
|
|
1962
|
+
const arena = this.arena;
|
|
1963
|
+
const glue = (clause: number) => arena.glue[clause];
|
|
1964
|
+
const psm = (clause: number) => arena.psm[clause];
|
|
1965
|
+
const size = (clause: number) => arena.size[clause];
|
|
1966
|
+
const lex =
|
|
1967
|
+
(...keys: ((clause: number) => number)[]) =>
|
|
1968
|
+
(first: number, second: number) => {
|
|
1969
|
+
for (const key of keys) {
|
|
1970
|
+
if (key(first) < key(second)) return true;
|
|
1971
|
+
if (key(first) > key(second)) return false;
|
|
1972
|
+
}
|
|
1973
|
+
return false;
|
|
1974
|
+
};
|
|
1975
|
+
switch (this.config.gcStrategy) {
|
|
1976
|
+
case GC_GLUE:
|
|
1977
|
+
sortClauses(this.learned, lex(glue, size));
|
|
1978
|
+
this.gcHalf();
|
|
1979
|
+
break;
|
|
1980
|
+
case GC_PSM:
|
|
1981
|
+
this.savePsm();
|
|
1982
|
+
sortClauses(this.learned, lex(psm, size));
|
|
1983
|
+
this.gcHalf();
|
|
1984
|
+
break;
|
|
1985
|
+
case GC_GLUE_PSM:
|
|
1986
|
+
this.savePsm();
|
|
1987
|
+
sortClauses(this.learned, lex(glue, psm, size));
|
|
1988
|
+
this.gcHalf();
|
|
1989
|
+
break;
|
|
1990
|
+
case GC_PSM_GLUE:
|
|
1991
|
+
this.savePsm();
|
|
1992
|
+
sortClauses(this.learned, lex(psm, glue, size));
|
|
1993
|
+
this.gcHalf();
|
|
1994
|
+
break;
|
|
1995
|
+
case GC_DYN_PSM:
|
|
1996
|
+
if (!this.atBaseLvl()) return;
|
|
1997
|
+
this.gcDynPsm();
|
|
1998
|
+
break;
|
|
1999
|
+
}
|
|
2000
|
+
this.ext?.gc();
|
|
2001
|
+
if (gc > 0 && this.shouldDefrag()) this.defragClauses();
|
|
2002
|
+
}
|
|
2003
|
+
|
|
2004
|
+
private savePsm() {
|
|
2005
|
+
for (const clause of this.learned) this.arena.setPsm(clause, this.psm(clause));
|
|
2006
|
+
}
|
|
2007
|
+
|
|
2008
|
+
private gcHalf() {
|
|
2009
|
+
const size = this.learned.length;
|
|
2010
|
+
let next = size >>> 1;
|
|
2011
|
+
for (let index = size >>> 1; index < size; index++) {
|
|
2012
|
+
const clause = this.learned[index];
|
|
2013
|
+
if (this.canDelete(clause)) {
|
|
2014
|
+
this.detachClause(clause);
|
|
2015
|
+
this.delClause(clause);
|
|
2016
|
+
} else this.learned[next++] = clause;
|
|
2017
|
+
}
|
|
2018
|
+
this.gcClauses += size - next;
|
|
2019
|
+
this.learned.length = next;
|
|
2020
|
+
}
|
|
2021
|
+
|
|
2022
|
+
canDelete(clause: number) {
|
|
2023
|
+
if (this.arena.isOnReinitStack(clause)) return false;
|
|
2024
|
+
const first = this.arena.get(clause, 0);
|
|
2025
|
+
if (this.value(first) !== L_TRUE) return true;
|
|
2026
|
+
return (
|
|
2027
|
+
this.justKind[first >> 1] !== JUSTIFICATION_CLAUSE || this.justVal[first >> 1] !== clause
|
|
2028
|
+
);
|
|
2029
|
+
}
|
|
2030
|
+
|
|
2031
|
+
private gcDynPsm() {
|
|
2032
|
+
let flips = 0;
|
|
2033
|
+
let assigned = 0;
|
|
2034
|
+
for (let boolVar = 0; boolVar < this.numVars(); boolVar++) {
|
|
2035
|
+
if (this.assignedSinceGc[boolVar]) {
|
|
2036
|
+
assigned++;
|
|
2037
|
+
this.assignedSinceGc[boolVar] = false;
|
|
2038
|
+
}
|
|
2039
|
+
if (this.phase[boolVar] !== this.prevPhase[boolVar]) {
|
|
2040
|
+
flips++;
|
|
2041
|
+
this.prevPhase[boolVar] = this.phase[boolVar];
|
|
2042
|
+
}
|
|
2043
|
+
}
|
|
2044
|
+
const dTk = assigned === 0 ? this.numVars() + 1 : flips / assigned;
|
|
2045
|
+
if (dTk < this.minDTk) this.minDTk = dTk;
|
|
2046
|
+
const arena = this.arena;
|
|
2047
|
+
let next = 0;
|
|
2048
|
+
for (const clause of this.learned) {
|
|
2049
|
+
if (!arena.isFrozen(clause)) {
|
|
2050
|
+
if (arena.glue[clause] > this.config.gcSmallLbd) {
|
|
2051
|
+
if (arena.wasUsed(clause)) arena.inactRounds[clause] = 0;
|
|
2052
|
+
else {
|
|
2053
|
+
arena.incInactRounds(clause);
|
|
2054
|
+
if (arena.inactRounds[clause] > this.config.gcK) {
|
|
2055
|
+
this.detachClause(clause);
|
|
2056
|
+
this.delClause(clause);
|
|
2057
|
+
this.gcClauses++;
|
|
2058
|
+
continue;
|
|
2059
|
+
}
|
|
2060
|
+
}
|
|
2061
|
+
arena.unmarkUsed(clause);
|
|
2062
|
+
if (this.psm(clause) > Math.trunc(arena.size[clause] * this.minDTk)) {
|
|
2063
|
+
this.detachClause(clause);
|
|
2064
|
+
arena.inactRounds[clause] = 0;
|
|
2065
|
+
arena.setFrozen(clause, true);
|
|
2066
|
+
this.numFrozen++;
|
|
2067
|
+
}
|
|
2068
|
+
}
|
|
2069
|
+
} else if (this.psm(clause) <= Math.trunc(arena.size[clause] * this.minDTk)) {
|
|
2070
|
+
arena.setFrozen(clause, false);
|
|
2071
|
+
this.numFrozen--;
|
|
2072
|
+
if (!this.activateFrozenClause(clause)) {
|
|
2073
|
+
this.delClause(clause);
|
|
2074
|
+
continue;
|
|
2075
|
+
}
|
|
2076
|
+
} else {
|
|
2077
|
+
arena.incInactRounds(clause);
|
|
2078
|
+
if (arena.inactRounds[clause] > this.config.gcK) {
|
|
2079
|
+
this.delClause(clause);
|
|
2080
|
+
this.gcClauses++;
|
|
2081
|
+
continue;
|
|
2082
|
+
}
|
|
2083
|
+
}
|
|
2084
|
+
this.learned[next++] = clause;
|
|
2085
|
+
}
|
|
2086
|
+
this.learned.length = next;
|
|
2087
|
+
}
|
|
2088
|
+
|
|
2089
|
+
private activateFrozenClause(clause: number) {
|
|
2090
|
+
const arena = this.arena;
|
|
2091
|
+
const size = arena.size[clause];
|
|
2092
|
+
let next = 0;
|
|
2093
|
+
for (let index = 0; index < size; index++) {
|
|
2094
|
+
const value = this.value(arena.get(clause, index));
|
|
2095
|
+
if (value === L_TRUE) return false;
|
|
2096
|
+
if (value === L_UNDEF) {
|
|
2097
|
+
if (index !== next) arena.swap(clause, index, next);
|
|
2098
|
+
next++;
|
|
2099
|
+
}
|
|
2100
|
+
}
|
|
2101
|
+
switch (next) {
|
|
2102
|
+
case 0:
|
|
2103
|
+
this.setConflict();
|
|
2104
|
+
return false;
|
|
2105
|
+
case 1:
|
|
2106
|
+
this.assignUnit(arena.get(clause, 0));
|
|
2107
|
+
return false;
|
|
2108
|
+
case 2:
|
|
2109
|
+
this.mkBinClause(arena.get(clause, 0), arena.get(clause, 1), true);
|
|
2110
|
+
return false;
|
|
2111
|
+
default:
|
|
2112
|
+
this.shrink(clause, size, next);
|
|
2113
|
+
this.attachClause(clause);
|
|
2114
|
+
return true;
|
|
2115
|
+
}
|
|
2116
|
+
}
|
|
2117
|
+
|
|
2118
|
+
private psm(clause: number) {
|
|
2119
|
+
const arena = this.arena;
|
|
2120
|
+
let result = 0;
|
|
2121
|
+
for (let index = 0; index < arena.size[clause]; index++) {
|
|
2122
|
+
const lit = arena.get(clause, index);
|
|
2123
|
+
if (((lit & 1) === 1) !== this.phase[lit >> 1]) result++;
|
|
2124
|
+
}
|
|
2125
|
+
return result;
|
|
2126
|
+
}
|
|
2127
|
+
}
|