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,787 @@
|
|
|
1
|
+
// MaxSMT runs on the SMT core.
|
|
2
|
+
import { SmtUnsupportedError } from "../../../errors";
|
|
3
|
+
import {
|
|
4
|
+
type AstManager,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
FAMILY_BV,
|
|
7
|
+
FAMILY_PB,
|
|
8
|
+
OP_ADD,
|
|
9
|
+
KIND_APP,
|
|
10
|
+
OP_GE,
|
|
11
|
+
OP_ITE,
|
|
12
|
+
OP_LE,
|
|
13
|
+
OP_MUL,
|
|
14
|
+
OP_EXTRACT,
|
|
15
|
+
OP_UMINUS,
|
|
16
|
+
SORT_BOOL,
|
|
17
|
+
SORT_INT,
|
|
18
|
+
SORT_REAL,
|
|
19
|
+
} from "./ast";
|
|
20
|
+
import { mkNot } from "./ast-util";
|
|
21
|
+
import { mkBvApp } from "./bv-decl-plugin";
|
|
22
|
+
import { Goal } from "./goal";
|
|
23
|
+
import { getPbSum } from "./lia2card";
|
|
24
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
25
|
+
import type { MaxsatContext, MaxsatParams, MaxsatSolver } from "./maxsmt-base";
|
|
26
|
+
import { Maxsmt } from "./maxsmt";
|
|
27
|
+
import { isInNraFragment } from "./opt-nlsat";
|
|
28
|
+
import { canReuseNlsatSolver, giaPareto, ParetoNlsatSolver, type ParetoSolver } from "./opt-pareto";
|
|
29
|
+
import type { ProtoModel } from "./proto-model";
|
|
30
|
+
import { Rational } from "./rational";
|
|
31
|
+
import { RefVector } from "./ref-vector";
|
|
32
|
+
import { IncSatSolver } from "./sat/inc-sat-solver";
|
|
33
|
+
import { InfEps } from "./inf-eps";
|
|
34
|
+
import { getModelValueBound, OptParetoSolver, OptSolver } from "./opt-solver";
|
|
35
|
+
import { ObjectiveValue } from "./opt-value";
|
|
36
|
+
import { Optsmt, type OptsmtParams } from "./optsmt";
|
|
37
|
+
import { compileInternalTactic, convertModel, type TacticEnvironment } from "./tactic";
|
|
38
|
+
|
|
39
|
+
const NORMALIZER =
|
|
40
|
+
"(and-then (using-params simplify :som true) propagate-values solve-eqs simplify)";
|
|
41
|
+
|
|
42
|
+
const ZERO_ONE_NORMALIZER =
|
|
43
|
+
"(and-then (using-params simplify :som true) propagate-values solve-eqs simplify dt2bv " +
|
|
44
|
+
"(using-params lia2card :compile_equality false) eq2bv simplify)";
|
|
45
|
+
|
|
46
|
+
export const O_MAXIMIZE = 0;
|
|
47
|
+
export const O_MINIMIZE = 1;
|
|
48
|
+
export const O_MAXSMT = 2;
|
|
49
|
+
|
|
50
|
+
export interface OptObjective {
|
|
51
|
+
type: number;
|
|
52
|
+
// The minimized or maximized term, or -1 for soft constraints.
|
|
53
|
+
term: number;
|
|
54
|
+
terms: number[];
|
|
55
|
+
weights: Rational[];
|
|
56
|
+
id: string | null;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
interface Objective extends OptObjective {
|
|
60
|
+
offset: Rational;
|
|
61
|
+
isNegated: boolean;
|
|
62
|
+
index: number;
|
|
63
|
+
maxsmt: Maxsmt | null;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
export interface OptOptions {
|
|
67
|
+
priority: string;
|
|
68
|
+
optsmt: OptsmtParams;
|
|
69
|
+
isParetoNlsat: boolean;
|
|
70
|
+
isParetoNlsatReused: boolean;
|
|
71
|
+
paretoMaxLemmas: number;
|
|
72
|
+
hasAssumptions: boolean;
|
|
73
|
+
isSatEnabled: boolean;
|
|
74
|
+
isEliminatingZeroOne: boolean;
|
|
75
|
+
maxsat: MaxsatParams;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
const isPropositional = (manager: AstManager, expr: number) => {
|
|
79
|
+
const atom = manager.isNot(expr) ? manager.getArg(expr, 0) : expr;
|
|
80
|
+
if (manager.isUninterpretedConst(atom)) return true;
|
|
81
|
+
const seen = new Set<number>();
|
|
82
|
+
const todo = [expr];
|
|
83
|
+
for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
|
|
84
|
+
if (seen.has(current)) continue;
|
|
85
|
+
seen.add(current);
|
|
86
|
+
if (manager.kinds[current] !== KIND_APP) return false;
|
|
87
|
+
if (manager.getFamily(current) !== FAMILY_BASIC && !manager.isUninterpretedConst(current))
|
|
88
|
+
return false;
|
|
89
|
+
manager.pushArgs(current, todo);
|
|
90
|
+
}
|
|
91
|
+
return true;
|
|
92
|
+
};
|
|
93
|
+
|
|
94
|
+
// is_fd: Boolean structure over Boolean and bit-vector constants and bit-vector operations.
|
|
95
|
+
const isFiniteDomain = (manager: AstManager, formulas: readonly number[]) => {
|
|
96
|
+
const seen = new Set<number>();
|
|
97
|
+
const todo = [...formulas];
|
|
98
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
99
|
+
if (seen.has(expr)) continue;
|
|
100
|
+
seen.add(expr);
|
|
101
|
+
if (manager.kinds[expr] !== KIND_APP) return false;
|
|
102
|
+
const family = manager.getFamily(expr);
|
|
103
|
+
const sort = manager.sorts[expr];
|
|
104
|
+
if (
|
|
105
|
+
family !== FAMILY_BASIC &&
|
|
106
|
+
family !== FAMILY_PB &&
|
|
107
|
+
family !== FAMILY_BV &&
|
|
108
|
+
(!manager.isUninterpretedConst(expr) || (sort !== SORT_BOOL && !manager.isBvSort(sort)))
|
|
109
|
+
)
|
|
110
|
+
return false;
|
|
111
|
+
manager.pushArgs(expr, todo);
|
|
112
|
+
}
|
|
113
|
+
return true;
|
|
114
|
+
};
|
|
115
|
+
|
|
116
|
+
const SAT_MAXSAT_ENGINES = new Set([
|
|
117
|
+
"maxres",
|
|
118
|
+
"maxresw",
|
|
119
|
+
"rc2",
|
|
120
|
+
"rc2tot",
|
|
121
|
+
"rc2bin",
|
|
122
|
+
"maxres-bin",
|
|
123
|
+
"maxres-bin-delay",
|
|
124
|
+
"pd-maxres",
|
|
125
|
+
"bcd2",
|
|
126
|
+
"sls",
|
|
127
|
+
]);
|
|
128
|
+
|
|
129
|
+
export class OptContext {
|
|
130
|
+
private boxModels: ProtoModel[] = [];
|
|
131
|
+
private boxIndex = -1;
|
|
132
|
+
private pareto: ParetoSolver | null = null;
|
|
133
|
+
private internal: Objective[] = [];
|
|
134
|
+
private normalized: { term: number; isMax: boolean }[] = [];
|
|
135
|
+
private normalizedGoal: Goal | null = null;
|
|
136
|
+
private normalizedTerms: RefVector;
|
|
137
|
+
private hiddenDecls: number[] = [];
|
|
138
|
+
private optSolver: OptSolver | null = null;
|
|
139
|
+
private satSolver: IncSatSolver | null = null;
|
|
140
|
+
private optsmt: Optsmt | null = null;
|
|
141
|
+
private rawModel: ProtoModel | null = null;
|
|
142
|
+
private fixedModels = new Map<ProtoModel, ProtoModel>();
|
|
143
|
+
model: ProtoModel | null = null;
|
|
144
|
+
reasonUnknown = "";
|
|
145
|
+
|
|
146
|
+
constructor(
|
|
147
|
+
private manager: AstManager,
|
|
148
|
+
private environment: TacticEnvironment,
|
|
149
|
+
private objectives: readonly OptObjective[],
|
|
150
|
+
) {
|
|
151
|
+
this.normalizedTerms = new RefVector(manager);
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
private pin(expr: number) {
|
|
155
|
+
this.normalizedTerms.push(expr);
|
|
156
|
+
return expr;
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
private applyConverters(model: ProtoModel) {
|
|
160
|
+
for (const decl of this.hiddenDecls) model.unregisterDecl(decl);
|
|
161
|
+
const goal = this.normalizedGoal;
|
|
162
|
+
return goal === null ? model : convertModel(goal, model);
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
private fixModel(model: ProtoModel) {
|
|
166
|
+
const existing = this.fixedModels.get(model);
|
|
167
|
+
if (existing !== undefined) return existing;
|
|
168
|
+
const fixed = this.applyConverters(model);
|
|
169
|
+
fixed.incRef();
|
|
170
|
+
this.fixedModels.set(model, fixed);
|
|
171
|
+
return fixed;
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
private setModel(model: ProtoModel | null) {
|
|
175
|
+
const fixed = model === null ? model : this.fixModel(model);
|
|
176
|
+
fixed?.incRef();
|
|
177
|
+
this.model?.decRef();
|
|
178
|
+
this.model = fixed;
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
private executePareto() {
|
|
182
|
+
const pareto = this.pareto;
|
|
183
|
+
const optsmt = this.optsmt;
|
|
184
|
+
if (pareto === null || optsmt === null)
|
|
185
|
+
throw new SmtUnsupportedError("pareto optimization without a solver");
|
|
186
|
+
const outcome = giaPareto(
|
|
187
|
+
this.manager,
|
|
188
|
+
pareto,
|
|
189
|
+
this.normalized,
|
|
190
|
+
pareto instanceof ParetoNlsatSolver,
|
|
191
|
+
);
|
|
192
|
+
if (outcome.status !== L_TRUE || outcome.model === null) {
|
|
193
|
+
if (outcome.status === L_UNDEF) this.reasonUnknown = pareto.reasonUnknown;
|
|
194
|
+
pareto.release();
|
|
195
|
+
this.pareto = null;
|
|
196
|
+
return outcome.status;
|
|
197
|
+
}
|
|
198
|
+
this.rawModel = outcome.model;
|
|
199
|
+
this.updateBound(optsmt, true);
|
|
200
|
+
this.updateBound(optsmt, false);
|
|
201
|
+
this.setModel(outcome.model);
|
|
202
|
+
outcome.model.decRef();
|
|
203
|
+
return L_TRUE;
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
// On a pure NRA problem the dominance and blocking constraints go to nlsat, which decides atoms
|
|
207
|
+
// over irrational algebraic numerals that the SMT core does not internalize.
|
|
208
|
+
private mkParetoSolver(solver: OptSolver, hard: readonly number[], options: OptOptions) {
|
|
209
|
+
const manager = this.manager;
|
|
210
|
+
if (!options.isParetoNlsat || options.hasAssumptions) return new OptParetoSolver(solver);
|
|
211
|
+
const terms = [...hard];
|
|
212
|
+
for (const objective of this.internal) {
|
|
213
|
+
if (
|
|
214
|
+
objective.type === O_MAXSMT ||
|
|
215
|
+
manager.sorts[objective.term] !== SORT_REAL ||
|
|
216
|
+
!isInNraFragment(manager, [...hard, objective.term])
|
|
217
|
+
)
|
|
218
|
+
return new OptParetoSolver(solver);
|
|
219
|
+
terms.push(objective.term);
|
|
220
|
+
}
|
|
221
|
+
if (!options.isParetoNlsatReused || !canReuseNlsatSolver(manager, terms))
|
|
222
|
+
throw new SmtUnsupportedError("pareto optimization without incremental nlsat");
|
|
223
|
+
const pareto = new ParetoNlsatSolver(manager, this.environment, options.paretoMaxLemmas);
|
|
224
|
+
for (const form of hard) pareto.assert(form);
|
|
225
|
+
return pareto;
|
|
226
|
+
}
|
|
227
|
+
|
|
228
|
+
optimize(hard: readonly number[], options: OptOptions) {
|
|
229
|
+
if (this.pareto !== null) return this.executePareto();
|
|
230
|
+
if (this.boxIndex !== -1) {
|
|
231
|
+
if (this.boxIndex < this.boxModels.length) {
|
|
232
|
+
this.setModel(this.boxModels[this.boxIndex++]);
|
|
233
|
+
return L_TRUE;
|
|
234
|
+
}
|
|
235
|
+
this.boxIndex = -1;
|
|
236
|
+
return L_FALSE;
|
|
237
|
+
}
|
|
238
|
+
this.release();
|
|
239
|
+
const normalized = this.normalize(hard, options.isEliminatingZeroOne);
|
|
240
|
+
if (normalized.length === 1 && this.manager.isFalse(normalized[0])) return L_FALSE;
|
|
241
|
+
return this.execute(normalized, options);
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
private getMaxsatContext(optSolver: OptSolver, options: OptOptions): MaxsatContext {
|
|
245
|
+
const getSolver = () => this.satSolver ?? optSolver;
|
|
246
|
+
const isSatEnabled = () => this.satSolver !== null;
|
|
247
|
+
const solver: MaxsatSolver = {
|
|
248
|
+
assertExpr: (expr) => getSolver().assertExpr(expr),
|
|
249
|
+
checkSat: (assumptions) => getSolver().check(assumptions),
|
|
250
|
+
getModel: () => getSolver().getModel(),
|
|
251
|
+
getUnsatCore: () => getSolver().getUnsatCore(),
|
|
252
|
+
findMutexes: (vars) => ({ status: L_TRUE, mutexes: getSolver().findMutexes(vars) }),
|
|
253
|
+
};
|
|
254
|
+
return {
|
|
255
|
+
manager: this.manager,
|
|
256
|
+
params: options.maxsat,
|
|
257
|
+
get isSatEnabled() {
|
|
258
|
+
return isSatEnabled();
|
|
259
|
+
},
|
|
260
|
+
getSolver: () => solver,
|
|
261
|
+
getBaseModel: () => this.rawModel,
|
|
262
|
+
hide: (decl) => {
|
|
263
|
+
this.hiddenDecls.push(decl);
|
|
264
|
+
},
|
|
265
|
+
adjust: (index, value) => this.adjust(index, value),
|
|
266
|
+
addOffset: (index, value) => {
|
|
267
|
+
const objective = this.internal[index];
|
|
268
|
+
objective.offset = objective.isNegated
|
|
269
|
+
? objective.offset.sub(value)
|
|
270
|
+
: objective.offset.add(value);
|
|
271
|
+
},
|
|
272
|
+
verifyModel: (index, model, value) => this.verifyModel(index, model, value),
|
|
273
|
+
modelUpdated: (model) => {
|
|
274
|
+
this.rawModel = model;
|
|
275
|
+
},
|
|
276
|
+
};
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
private adjust(index: number, value: Rational) {
|
|
280
|
+
const objective = this.internal[index];
|
|
281
|
+
return (objective.isNegated ? value.neg() : value).add(objective.offset);
|
|
282
|
+
}
|
|
283
|
+
|
|
284
|
+
private verifyModel(index: number, model: ProtoModel, value: Rational) {
|
|
285
|
+
const manager = this.manager;
|
|
286
|
+
const term = this.internal[index].term;
|
|
287
|
+
if (term === -1) return true;
|
|
288
|
+
const expected = this.adjust(index, value);
|
|
289
|
+
const copy = model.copy();
|
|
290
|
+
copy.incRef();
|
|
291
|
+
const fixed = this.applyConverters(copy);
|
|
292
|
+
if (fixed !== copy) {
|
|
293
|
+
fixed.incRef();
|
|
294
|
+
copy.decRef();
|
|
295
|
+
}
|
|
296
|
+
const evaluated = fixed.eval(term, true);
|
|
297
|
+
const actual = manager.isNumeral(evaluated)
|
|
298
|
+
? manager.getRationalValue(evaluated)
|
|
299
|
+
: manager.isBvNumeral(evaluated)
|
|
300
|
+
? Rational.of(manager.getBvNumeralValue(evaluated))
|
|
301
|
+
: undefined;
|
|
302
|
+
manager.decRef(evaluated);
|
|
303
|
+
fixed.decRef();
|
|
304
|
+
return actual !== undefined && actual.equals(expected);
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
private execute(hard: readonly number[], options: OptOptions) {
|
|
308
|
+
const manager = this.manager;
|
|
309
|
+
this.reasonUnknown = "";
|
|
310
|
+
if (hard.some((form) => manager.hasQuantifierFlags[form]))
|
|
311
|
+
throw new SmtUnsupportedError("optimization with quantified constraints");
|
|
312
|
+
const solver = new OptSolver(manager, this.environment);
|
|
313
|
+
this.optSolver = solver;
|
|
314
|
+
const optsmt = new Optsmt(
|
|
315
|
+
manager,
|
|
316
|
+
this.environment,
|
|
317
|
+
{
|
|
318
|
+
getBaseModel: () => this.rawModel,
|
|
319
|
+
setModel: (model) => {
|
|
320
|
+
this.rawModel = model;
|
|
321
|
+
},
|
|
322
|
+
},
|
|
323
|
+
options.optsmt,
|
|
324
|
+
);
|
|
325
|
+
this.optsmt = optsmt;
|
|
326
|
+
const context = this.getMaxsatContext(solver, options);
|
|
327
|
+
for (const [index, objective] of this.internal.entries()) {
|
|
328
|
+
if (objective.type === O_MAXSMT) {
|
|
329
|
+
const maxsmt = new Maxsmt(context, index);
|
|
330
|
+
objective.maxsmt = maxsmt;
|
|
331
|
+
for (const [termIndex, term] of objective.terms.entries())
|
|
332
|
+
maxsmt.add(term, objective.weights[termIndex]);
|
|
333
|
+
continue;
|
|
334
|
+
}
|
|
335
|
+
const term = objective.term;
|
|
336
|
+
objective.index = optsmt.add(
|
|
337
|
+
objective.type === O_MAXIMIZE
|
|
338
|
+
? term
|
|
339
|
+
: this.pin(manager.mkApp(OP_UMINUS, [term], manager.sorts[term])),
|
|
340
|
+
);
|
|
341
|
+
}
|
|
342
|
+
this.satSolver = this.updateSolver(hard, options) ? new IncSatSolver(manager, new Map()) : null;
|
|
343
|
+
const checkSolver = this.satSolver ?? solver;
|
|
344
|
+
for (const form of hard) checkSolver.assertExpr(form);
|
|
345
|
+
const checked = checkSolver.check();
|
|
346
|
+
this.rawModel = checked === L_FALSE ? null : checkSolver.getModel();
|
|
347
|
+
const status = checked !== L_FALSE && this.rawModel === null ? L_UNDEF : checked;
|
|
348
|
+
if (status !== L_TRUE) {
|
|
349
|
+
this.setModel(this.rawModel);
|
|
350
|
+
return status;
|
|
351
|
+
}
|
|
352
|
+
optsmt.setup(solver);
|
|
353
|
+
this.updateBound(optsmt, true);
|
|
354
|
+
const count = this.internal.length;
|
|
355
|
+
if (count > 1 && options.priority === "pareto") {
|
|
356
|
+
if (this.internal.some((objective) => objective.type === O_MAXSMT))
|
|
357
|
+
throw new SmtUnsupportedError("pareto optimization of soft constraints");
|
|
358
|
+
this.pareto = this.mkParetoSolver(solver, hard, options);
|
|
359
|
+
return this.executePareto();
|
|
360
|
+
}
|
|
361
|
+
const result =
|
|
362
|
+
count === 0
|
|
363
|
+
? L_TRUE
|
|
364
|
+
: count === 1
|
|
365
|
+
? this.execute1(optsmt, this.internal[0], true, false)
|
|
366
|
+
: options.priority === "box"
|
|
367
|
+
? this.executeBox(optsmt)
|
|
368
|
+
: this.executeLex(optsmt, options);
|
|
369
|
+
this.setModel(this.rawModel);
|
|
370
|
+
return result === L_TRUE && checkSolver.wasUnknown ? L_UNDEF : result;
|
|
371
|
+
}
|
|
372
|
+
|
|
373
|
+
// Z3 moves a MaxSAT query over finite domains to the SAT core.
|
|
374
|
+
private updateSolver(hard: readonly number[], options: OptOptions) {
|
|
375
|
+
if (!options.isSatEnabled) return false;
|
|
376
|
+
if (this.internal.some((objective) => objective.type !== O_MAXSMT)) return false;
|
|
377
|
+
const soft = this.internal.flatMap((objective) => objective.terms);
|
|
378
|
+
if (!isFiniteDomain(this.manager, [...soft, ...hard])) return false;
|
|
379
|
+
return SAT_MAXSAT_ENGINES.has(options.maxsat.maxsatEngine) && options.priority !== "pareto";
|
|
380
|
+
}
|
|
381
|
+
|
|
382
|
+
// The model's objective values are lower bounds, or upper bounds.
|
|
383
|
+
private updateBound(optsmt: Optsmt, isLower: boolean) {
|
|
384
|
+
const manager = this.manager;
|
|
385
|
+
const model = this.rawModel;
|
|
386
|
+
if (model === null) return;
|
|
387
|
+
for (const objective of this.internal) {
|
|
388
|
+
if (objective.type === O_MAXSMT) {
|
|
389
|
+
let cost = Rational.zero;
|
|
390
|
+
for (const [index, term] of objective.terms.entries()) {
|
|
391
|
+
const value = model.eval(term, false);
|
|
392
|
+
if (value !== manager.trueExpr) cost = cost.add(objective.weights[index]);
|
|
393
|
+
manager.decRef(value);
|
|
394
|
+
}
|
|
395
|
+
if (isLower) objective.maxsmt?.updateUpper(cost);
|
|
396
|
+
else objective.maxsmt?.updateLower(cost);
|
|
397
|
+
continue;
|
|
398
|
+
}
|
|
399
|
+
const value = model.eval(objective.term, false);
|
|
400
|
+
const bound =
|
|
401
|
+
getModelValueBound(manager, manager.am, value, isLower !== objective.isNegated) ??
|
|
402
|
+
(manager.isBvNumeral(value) ? Rational.of(manager.getBvNumeralValue(value)) : undefined);
|
|
403
|
+
manager.decRef(value);
|
|
404
|
+
if (bound === undefined) continue;
|
|
405
|
+
const adjusted = InfEps.of((objective.isNegated ? bound.neg() : bound).add(objective.offset));
|
|
406
|
+
if (isLower) optsmt.updateLowerBound(objective.index, adjusted);
|
|
407
|
+
else optsmt.updateUpperBound(objective.index, adjusted);
|
|
408
|
+
}
|
|
409
|
+
}
|
|
410
|
+
|
|
411
|
+
private execute1(optsmt: Optsmt, objective: Objective, isCommitted: boolean, isScoped: boolean) {
|
|
412
|
+
return objective.type === O_MAXSMT
|
|
413
|
+
? this.executeMaxsat(objective, isCommitted, isScoped)
|
|
414
|
+
: this.executeMinMax(optsmt, objective.index, isCommitted, isScoped);
|
|
415
|
+
}
|
|
416
|
+
|
|
417
|
+
private executeMaxsat(objective: Objective, isCommitted: boolean, isScoped: boolean) {
|
|
418
|
+
const solver = this.satSolver ?? this.optSolver;
|
|
419
|
+
const maxsmt = objective.maxsmt;
|
|
420
|
+
if (solver === null || maxsmt === null)
|
|
421
|
+
throw new SmtUnsupportedError("MaxSMT without a solver");
|
|
422
|
+
if (isScoped) solver.push();
|
|
423
|
+
const status = maxsmt.run(isCommitted);
|
|
424
|
+
if (status !== L_FALSE && maxsmt.model !== null) this.rawModel = maxsmt.model;
|
|
425
|
+
if (isScoped) solver.pop(1);
|
|
426
|
+
if (status === L_TRUE && isCommitted) maxsmt.commitAssignment();
|
|
427
|
+
return status;
|
|
428
|
+
}
|
|
429
|
+
|
|
430
|
+
private executeMinMax(optsmt: Optsmt, index: number, isCommitted: boolean, isScoped: boolean) {
|
|
431
|
+
const solver = this.optSolver;
|
|
432
|
+
if (solver === null) throw new SmtUnsupportedError("optimization without a solver");
|
|
433
|
+
if (isScoped) solver.push();
|
|
434
|
+
const result = optsmt.lex(index);
|
|
435
|
+
// A later lexicographic objective cannot be optimized at an unattained real value.
|
|
436
|
+
const isOpen = result === L_TRUE && optsmt.hasOpenBound(index);
|
|
437
|
+
const isBlockingLater = isOpen && isCommitted && this.internal.length > 1;
|
|
438
|
+
if (isBlockingLater)
|
|
439
|
+
this.reasonUnknown =
|
|
440
|
+
"later lexicographic objectives after an unattained nonlinear optimum are not supported";
|
|
441
|
+
const status = isBlockingLater ? L_UNDEF : result;
|
|
442
|
+
const best = optsmt.getBestModel();
|
|
443
|
+
if (status === L_TRUE || (status === L_UNDEF && best !== null)) this.rawModel = best;
|
|
444
|
+
if (isScoped) solver.pop(1);
|
|
445
|
+
if (status === L_TRUE && isCommitted && !isOpen) optsmt.commitAssignment(index);
|
|
446
|
+
return status;
|
|
447
|
+
}
|
|
448
|
+
|
|
449
|
+
private executeLex(optsmt: Optsmt, options: OptOptions) {
|
|
450
|
+
const count = this.internal.length;
|
|
451
|
+
const isScoped =
|
|
452
|
+
options.maxsat.maxsatEngine !== "maxres" ||
|
|
453
|
+
this.internal.some((objective) => objective.type !== O_MAXSMT);
|
|
454
|
+
for (let index = 0; index < count; index++) {
|
|
455
|
+
const objective = this.internal[index];
|
|
456
|
+
const isLast = index + 1 === count;
|
|
457
|
+
const status = this.execute1(optsmt, objective, !isLast, isScoped && !isLast);
|
|
458
|
+
if (status !== L_TRUE) return status;
|
|
459
|
+
const isUnbounded = objective.type !== O_MAXSMT && optsmt.isUnbounded(objective.index, true);
|
|
460
|
+
if (isUnbounded) return isLast ? status : this.executeLexAfterUnbounded(optsmt, index);
|
|
461
|
+
if (!isLast) this.updateBound(optsmt, true);
|
|
462
|
+
}
|
|
463
|
+
return L_TRUE;
|
|
464
|
+
}
|
|
465
|
+
|
|
466
|
+
// Each later arithmetic objective takes the limit of its optima as the unbounded objective
|
|
467
|
+
// grows. A determined limit is committed before the next objective; an interval ends the search,
|
|
468
|
+
// and the later objectives keep their unrestricted intervals.
|
|
469
|
+
private executeLexAfterUnbounded(optsmt: Optsmt, unbounded: number) {
|
|
470
|
+
const count = this.internal.length;
|
|
471
|
+
for (let index = unbounded + 1; index < count; index++) {
|
|
472
|
+
const objective = this.internal[index];
|
|
473
|
+
if (objective.type === O_MAXSMT) return L_TRUE;
|
|
474
|
+
const status = optsmt.lexAfterUnbounded(this.internal[unbounded].index, objective.index);
|
|
475
|
+
const best = optsmt.getBestModel();
|
|
476
|
+
if (best !== null) this.rawModel = best;
|
|
477
|
+
if (status !== L_TRUE) return status;
|
|
478
|
+
if (index + 1 < count) {
|
|
479
|
+
const am = this.manager.am;
|
|
480
|
+
if (!this.getAdjusted(index, true).equals(this.getAdjusted(index, false), am))
|
|
481
|
+
return L_TRUE;
|
|
482
|
+
optsmt.commitAssignment(objective.index);
|
|
483
|
+
}
|
|
484
|
+
}
|
|
485
|
+
return L_TRUE;
|
|
486
|
+
}
|
|
487
|
+
|
|
488
|
+
private executeBox(optsmt: Optsmt) {
|
|
489
|
+
const solver = this.satSolver ?? this.optSolver;
|
|
490
|
+
if (solver === null) throw new SmtUnsupportedError("optimization without a solver");
|
|
491
|
+
this.boxIndex = 1;
|
|
492
|
+
let status = optsmt.box();
|
|
493
|
+
for (const objective of this.internal) {
|
|
494
|
+
if (status !== L_TRUE) break;
|
|
495
|
+
if (objective.type === O_MAXSMT) {
|
|
496
|
+
solver.push();
|
|
497
|
+
status = this.execute1(optsmt, objective, false, false);
|
|
498
|
+
solver.pop(1);
|
|
499
|
+
}
|
|
500
|
+
const boxModel =
|
|
501
|
+
objective.type === O_MAXSMT
|
|
502
|
+
? this.rawModel
|
|
503
|
+
: (optsmt.models[objective.index] ?? this.rawModel);
|
|
504
|
+
if (boxModel === null) throw new SmtUnsupportedError("a box objective without a model");
|
|
505
|
+
boxModel.incRef();
|
|
506
|
+
this.boxModels.push(boxModel);
|
|
507
|
+
}
|
|
508
|
+
if (status === L_TRUE && this.boxModels.length > 0) this.rawModel = this.boxModels[0];
|
|
509
|
+
return status;
|
|
510
|
+
}
|
|
511
|
+
|
|
512
|
+
private isMulConst(term: number) {
|
|
513
|
+
const manager = this.manager;
|
|
514
|
+
if (manager.isUninterpretedConst(term) || manager.isNumeral(term)) return true;
|
|
515
|
+
if (manager.getOp(term) !== OP_MUL || manager.getNumArgs(term) !== 2) return false;
|
|
516
|
+
const args = manager.getArgs(term);
|
|
517
|
+
return (
|
|
518
|
+
(manager.isNumeral(args[0]) && manager.isUninterpretedConst(args[1])) ||
|
|
519
|
+
(manager.isNumeral(args[1]) && manager.isUninterpretedConst(args[0]))
|
|
520
|
+
);
|
|
521
|
+
}
|
|
522
|
+
|
|
523
|
+
private purify(term: number, hard: number[], goal: Goal) {
|
|
524
|
+
const manager = this.manager;
|
|
525
|
+
const fresh = this.pin(manager.mkFreshConst("obj", manager.sorts[term]));
|
|
526
|
+
const sort = manager.sorts[term];
|
|
527
|
+
if (sort === SORT_INT || sort === SORT_REAL)
|
|
528
|
+
hard.push(
|
|
529
|
+
this.pin(manager.mkApp(OP_GE, [fresh, term], SORT_BOOL)),
|
|
530
|
+
this.pin(manager.mkApp(OP_LE, [fresh, term], SORT_BOOL)),
|
|
531
|
+
);
|
|
532
|
+
else hard.push(this.pin(manager.mkEq(fresh, term)));
|
|
533
|
+
goal.addConverter(manager.decls[fresh]);
|
|
534
|
+
return fresh;
|
|
535
|
+
}
|
|
536
|
+
|
|
537
|
+
private purifyObjective(term: number, hard: number[], goal: Goal) {
|
|
538
|
+
const manager = this.manager;
|
|
539
|
+
if (manager.getOp(term) === OP_ADD)
|
|
540
|
+
return this.pin(
|
|
541
|
+
manager.mkApp(
|
|
542
|
+
OP_ADD,
|
|
543
|
+
manager
|
|
544
|
+
.getArgs(term)
|
|
545
|
+
.map((arg) => (this.isMulConst(arg) ? arg : this.purify(arg, hard, goal))),
|
|
546
|
+
manager.sorts[term],
|
|
547
|
+
),
|
|
548
|
+
);
|
|
549
|
+
return manager.getOp(term) === OP_ITE || !this.isMulConst(term)
|
|
550
|
+
? this.purify(term, hard, goal)
|
|
551
|
+
: term;
|
|
552
|
+
}
|
|
553
|
+
|
|
554
|
+
// is_maxsat on a minimized or maximized term: a pseudo-Boolean sum or a bit-vector.
|
|
555
|
+
private getMaxsat(term: number, isMax: boolean) {
|
|
556
|
+
const manager = this.manager;
|
|
557
|
+
const sum = getPbSum(manager, term, this.normalizedTerms);
|
|
558
|
+
if (sum !== undefined) {
|
|
559
|
+
let offset = sum.coeff;
|
|
560
|
+
const terms: number[] = [];
|
|
561
|
+
const weights: Rational[] = [];
|
|
562
|
+
for (const [index, arg] of sum.args.entries()) {
|
|
563
|
+
const weight = sum.coeffs[index];
|
|
564
|
+
const isNegative = weight.isNegative();
|
|
565
|
+
if (isMax) offset = offset.add(isNegative ? weight.neg() : weight);
|
|
566
|
+
else if (isNegative) offset = offset.add(weight);
|
|
567
|
+
terms.push(isNegative === isMax ? this.pin(mkNot(manager, arg)) : arg);
|
|
568
|
+
weights.push(isNegative ? weight.neg() : weight);
|
|
569
|
+
}
|
|
570
|
+
return { terms, weights, offset, isNegated: isMax };
|
|
571
|
+
}
|
|
572
|
+
const sort = manager.sorts[term];
|
|
573
|
+
if (!manager.isBvSort(sort)) return undefined;
|
|
574
|
+
const value = this.pin(manager.mkBvNumeral(isMax ? 1n : 0n, 1));
|
|
575
|
+
const terms: number[] = [];
|
|
576
|
+
const weights: Rational[] = [];
|
|
577
|
+
let offset = Rational.zero;
|
|
578
|
+
for (let bit = 0; bit < manager.getBvSize(sort); bit++) {
|
|
579
|
+
const weight = Rational.of(2n ** BigInt(bit));
|
|
580
|
+
weights.push(weight);
|
|
581
|
+
terms.push(
|
|
582
|
+
this.pin(manager.mkEq(value, this.pin(mkBvApp(manager, OP_EXTRACT, [term], [bit, bit])))),
|
|
583
|
+
);
|
|
584
|
+
if (isMax) offset = offset.add(weight);
|
|
585
|
+
}
|
|
586
|
+
return { terms, weights, offset, isNegated: isMax };
|
|
587
|
+
}
|
|
588
|
+
|
|
589
|
+
private mkAtomic(terms: number[], hard: number[], goal: Goal) {
|
|
590
|
+
return terms.map((term) =>
|
|
591
|
+
isPropositional(this.manager, term) ? term : this.purify(term, hard, goal),
|
|
592
|
+
);
|
|
593
|
+
}
|
|
594
|
+
|
|
595
|
+
private normalize(hard: readonly number[], isEliminatingZeroOne: boolean) {
|
|
596
|
+
const manager = this.manager;
|
|
597
|
+
const goal = new Goal(manager);
|
|
598
|
+
const decls = this.objectives.map((objective) =>
|
|
599
|
+
manager.mkFreshFuncDecl(
|
|
600
|
+
objective.type === O_MAXIMIZE
|
|
601
|
+
? "maximize"
|
|
602
|
+
: objective.type === O_MINIMIZE
|
|
603
|
+
? "minimize"
|
|
604
|
+
: "maxsat",
|
|
605
|
+
objective.type === O_MAXSMT
|
|
606
|
+
? objective.terms.map(() => SORT_BOOL)
|
|
607
|
+
: [manager.sorts[objective.term]],
|
|
608
|
+
SORT_BOOL,
|
|
609
|
+
),
|
|
610
|
+
);
|
|
611
|
+
for (const form of hard) goal.assert(form);
|
|
612
|
+
for (const [index, objective] of this.objectives.entries())
|
|
613
|
+
goal.assert(
|
|
614
|
+
manager.mkApp(
|
|
615
|
+
decls[index],
|
|
616
|
+
objective.type === O_MAXSMT ? objective.terms : [objective.term],
|
|
617
|
+
SORT_BOOL,
|
|
618
|
+
),
|
|
619
|
+
);
|
|
620
|
+
const goals = compileInternalTactic(
|
|
621
|
+
this.environment,
|
|
622
|
+
isEliminatingZeroOne ? ZERO_ONE_NORMALIZER : NORMALIZER,
|
|
623
|
+
)(goal);
|
|
624
|
+
if (goals.length !== 1) throw new SmtUnsupportedError("a normalization into several goals");
|
|
625
|
+
const result = goals[0];
|
|
626
|
+
const forms = result.isInconsistent ? [manager.falseExpr] : [...result.forms.items];
|
|
627
|
+
for (const form of forms) this.normalizedTerms.push(form);
|
|
628
|
+
this.normalizedGoal = result;
|
|
629
|
+
const normalizedHard: number[] = [];
|
|
630
|
+
this.internal = this.objectives.map((objective) => ({
|
|
631
|
+
...objective,
|
|
632
|
+
offset: Rational.zero,
|
|
633
|
+
isNegated: objective.type === O_MINIMIZE,
|
|
634
|
+
index: 0,
|
|
635
|
+
maxsmt: null,
|
|
636
|
+
}));
|
|
637
|
+
for (const form of forms) {
|
|
638
|
+
const index = manager.kinds[form] === KIND_APP ? decls.indexOf(manager.decls[form]) : -1;
|
|
639
|
+
if (index === -1) {
|
|
640
|
+
normalizedHard.push(form);
|
|
641
|
+
continue;
|
|
642
|
+
}
|
|
643
|
+
const objective = this.internal[index];
|
|
644
|
+
const args = manager.getArgs(form);
|
|
645
|
+
if (objective.type === O_MAXSMT) {
|
|
646
|
+
let offset = Rational.zero;
|
|
647
|
+
const terms: number[] = [];
|
|
648
|
+
const weights: Rational[] = [];
|
|
649
|
+
for (const [argIndex, arg] of args.entries()) {
|
|
650
|
+
const weight = objective.weights[argIndex];
|
|
651
|
+
const term = weight.isNegative() ? this.pin(mkNot(manager, arg)) : arg;
|
|
652
|
+
const positive = weight.isNegative() ? weight.neg() : weight;
|
|
653
|
+
if (weight.isNegative()) offset = offset.sub(positive);
|
|
654
|
+
if (manager.isTrue(term) || positive.isZero()) continue;
|
|
655
|
+
if (manager.isFalse(term)) {
|
|
656
|
+
offset = offset.add(positive);
|
|
657
|
+
continue;
|
|
658
|
+
}
|
|
659
|
+
terms.push(term);
|
|
660
|
+
weights.push(positive);
|
|
661
|
+
}
|
|
662
|
+
Object.assign(objective, {
|
|
663
|
+
term: -1,
|
|
664
|
+
terms: this.mkAtomic(terms, normalizedHard, result),
|
|
665
|
+
weights,
|
|
666
|
+
offset,
|
|
667
|
+
isNegated: false,
|
|
668
|
+
});
|
|
669
|
+
continue;
|
|
670
|
+
}
|
|
671
|
+
const term = args[0];
|
|
672
|
+
const isMax = objective.type === O_MAXIMIZE;
|
|
673
|
+
const maxsat = this.getMaxsat(term, isMax);
|
|
674
|
+
if (maxsat !== undefined) {
|
|
675
|
+
Object.assign(objective, {
|
|
676
|
+
type: O_MAXSMT,
|
|
677
|
+
id: null,
|
|
678
|
+
terms: this.mkAtomic(maxsat.terms, normalizedHard, result),
|
|
679
|
+
weights: maxsat.weights,
|
|
680
|
+
offset: maxsat.offset,
|
|
681
|
+
isNegated: maxsat.isNegated,
|
|
682
|
+
});
|
|
683
|
+
continue;
|
|
684
|
+
}
|
|
685
|
+
objective.term = this.purifyObjective(term, normalizedHard, result);
|
|
686
|
+
}
|
|
687
|
+
for (const objective of this.internal)
|
|
688
|
+
if (
|
|
689
|
+
objective.type !== O_MAXSMT &&
|
|
690
|
+
manager.sorts[objective.term] !== SORT_INT &&
|
|
691
|
+
manager.sorts[objective.term] !== SORT_REAL
|
|
692
|
+
)
|
|
693
|
+
objective.term = this.pin(manager.mkNumeral(0n));
|
|
694
|
+
this.normalized = this.internal.map((objective) => ({
|
|
695
|
+
term: objective.term,
|
|
696
|
+
isMax: objective.type === O_MAXIMIZE,
|
|
697
|
+
}));
|
|
698
|
+
result.forms.reset();
|
|
699
|
+
return normalizedHard;
|
|
700
|
+
}
|
|
701
|
+
|
|
702
|
+
private getAdjusted(index: number, isLower: boolean) {
|
|
703
|
+
const objective = this.internal[index];
|
|
704
|
+
const maxsmt = objective?.maxsmt;
|
|
705
|
+
if (maxsmt !== null && maxsmt !== undefined)
|
|
706
|
+
return new ObjectiveValue(InfEps.of(isLower ? maxsmt.getLower() : maxsmt.getUpper()));
|
|
707
|
+
const isMax = this.objectives[index].type === O_MAXIMIZE;
|
|
708
|
+
const optsmt = this.optsmt;
|
|
709
|
+
const value =
|
|
710
|
+
optsmt === null || objective === undefined
|
|
711
|
+
? isLower === isMax
|
|
712
|
+
? ObjectiveValue.minusInfinity
|
|
713
|
+
: ObjectiveValue.infinity
|
|
714
|
+
: (isLower === isMax ? optsmt.lower : optsmt.upper)[objective.index];
|
|
715
|
+
return isMax ? value : value.negated(this.manager.am);
|
|
716
|
+
}
|
|
717
|
+
|
|
718
|
+
private toExpr(value: ObjectiveValue, pinned: RefVector) {
|
|
719
|
+
const manager = this.manager;
|
|
720
|
+
const bound = value.bound;
|
|
721
|
+
const isAlgebraic = value.exact !== null && !manager.am.isRational(value.exact);
|
|
722
|
+
const sort =
|
|
723
|
+
!isAlgebraic && bound.epsilon.isZero() && bound.value.isInt() ? SORT_INT : SORT_REAL;
|
|
724
|
+
const mkConst = (name: string, constSort: number) =>
|
|
725
|
+
manager.mkApp(manager.mkFuncDecl(name, [], constSort), [], constSort);
|
|
726
|
+
const mkScaled = (coefficient: Rational, term: number) =>
|
|
727
|
+
coefficient.equals(Rational.one)
|
|
728
|
+
? term
|
|
729
|
+
: manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(coefficient, sort), term], sort);
|
|
730
|
+
const args: number[] = [];
|
|
731
|
+
if (!bound.infinity.isZero()) args.push(mkScaled(bound.infinity, mkConst("oo", sort)));
|
|
732
|
+
if (isAlgebraic && value.exact !== null) args.push(manager.mkAlgebraicNumeral(value.exact));
|
|
733
|
+
else if (!bound.value.isZero()) args.push(manager.mkNumeralOfSort(bound.value, sort));
|
|
734
|
+
if (!bound.epsilon.isZero()) args.push(mkScaled(bound.epsilon, mkConst("epsilon", SORT_REAL)));
|
|
735
|
+
const expr =
|
|
736
|
+
args.length === 0
|
|
737
|
+
? manager.mkNumeral(0n)
|
|
738
|
+
: args.length === 1
|
|
739
|
+
? args[0]
|
|
740
|
+
: manager.mkApp(OP_ADD, args, sort);
|
|
741
|
+
pinned.push(expr);
|
|
742
|
+
return expr;
|
|
743
|
+
}
|
|
744
|
+
|
|
745
|
+
getObjectives(format: (expr: number) => string) {
|
|
746
|
+
const pinned = new RefVector(this.manager);
|
|
747
|
+
const lines = this.objectives.map((objective, index) => {
|
|
748
|
+
const lower = this.getAdjusted(index, true);
|
|
749
|
+
const upper = this.getAdjusted(index, false);
|
|
750
|
+
const name = objective.type === O_MAXSMT ? (objective.id ?? "") : format(objective.term);
|
|
751
|
+
if (!lower.equals(upper, this.manager.am))
|
|
752
|
+
return ` (${name} (interval ${format(this.toExpr(lower, pinned))} ${format(this.toExpr(upper, pinned))}))`;
|
|
753
|
+
if (lower.exact !== null && !lower.hasInfinitesimal()) {
|
|
754
|
+
const exact = this.manager.mkAlgebraicNumeral(lower.exact);
|
|
755
|
+
pinned.push(exact);
|
|
756
|
+
return ` (${name} ${format(exact)})`;
|
|
757
|
+
}
|
|
758
|
+
return ` (${name} ${format(this.toExpr(lower, pinned))})`;
|
|
759
|
+
});
|
|
760
|
+
pinned.reset();
|
|
761
|
+
return ["(objectives", ...lines, ")"].join("\n");
|
|
762
|
+
}
|
|
763
|
+
|
|
764
|
+
release() {
|
|
765
|
+
for (const objective of this.internal) objective.maxsmt?.release();
|
|
766
|
+
this.internal = [];
|
|
767
|
+
this.optsmt?.release();
|
|
768
|
+
this.optsmt = null;
|
|
769
|
+
this.rawModel = null;
|
|
770
|
+
this.pareto?.release();
|
|
771
|
+
this.pareto = null;
|
|
772
|
+
for (const model of this.boxModels) model.decRef();
|
|
773
|
+
this.boxModels = [];
|
|
774
|
+
this.boxIndex = -1;
|
|
775
|
+
this.setModel(null);
|
|
776
|
+
for (const fixed of this.fixedModels.values()) fixed.decRef();
|
|
777
|
+
this.fixedModels.clear();
|
|
778
|
+
this.hiddenDecls = [];
|
|
779
|
+
this.normalizedGoal = null;
|
|
780
|
+
this.normalizedTerms.reset();
|
|
781
|
+
this.normalized = [];
|
|
782
|
+
this.optSolver?.release();
|
|
783
|
+
this.optSolver = null;
|
|
784
|
+
this.satSolver?.release();
|
|
785
|
+
this.satSolver = null;
|
|
786
|
+
}
|
|
787
|
+
}
|