tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +25 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +56 -74
- package/src/runtime.ts +4 -0
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +2 -3
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +62 -152
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,53 +1,144 @@
|
|
|
1
|
-
//
|
|
2
|
-
import {
|
|
1
|
+
// The solver decides like `z3 -smt2 AUTO_CONFIG=false smt.MBQI=true`.
|
|
2
|
+
import {
|
|
3
|
+
isStackOverflow,
|
|
4
|
+
SmtCanceledError,
|
|
5
|
+
type SmtParseError,
|
|
6
|
+
SmtUnsupportedError,
|
|
7
|
+
} from "../../../errors";
|
|
3
8
|
import type { DecideOptions, Verdict } from "../../verdict";
|
|
4
9
|
import { AssertedFormulas } from "./asserted-formulas";
|
|
5
10
|
import { AstManager } from "./ast";
|
|
6
|
-
import { Context } from "./context";
|
|
11
|
+
import { Context, MBQI_MAX_ITERATIONS } from "./context";
|
|
7
12
|
import { L_FALSE, L_TRUE } from "./lbool";
|
|
8
13
|
import { applyUfniaTactic } from "./quant-tactics";
|
|
9
14
|
import { ResourceLimit } from "./rlimit";
|
|
10
15
|
import { parseSmtlib } from "./smtlib-parser";
|
|
16
|
+
import type { SmtSetup } from "./smt-setup";
|
|
17
|
+
|
|
18
|
+
export interface KernelParams {
|
|
19
|
+
isMbqi: boolean;
|
|
20
|
+
mbqiMaxIterations: number;
|
|
21
|
+
isFindingMacros: boolean;
|
|
22
|
+
relevancyLevel?: 0 | 2;
|
|
23
|
+
// A kernel without a setup runs as with auto_config false.
|
|
24
|
+
setup?: SmtSetup;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
const DEFAULT_KERNEL_PARAMS: KernelParams = {
|
|
28
|
+
isMbqi: true,
|
|
29
|
+
mbqiMaxIterations: MBQI_MAX_ITERATIONS,
|
|
30
|
+
isFindingMacros: false,
|
|
31
|
+
};
|
|
11
32
|
|
|
12
33
|
interface SmtCheck {
|
|
13
34
|
verdict: Verdict;
|
|
14
35
|
numInstances: number;
|
|
15
36
|
}
|
|
16
37
|
|
|
17
|
-
|
|
38
|
+
// The context makes its asserted formulas first, and asserts the formulas. It makes the theories
|
|
39
|
+
// next, before the formulas are reduced.
|
|
40
|
+
export const solveGoal = (manager: AstManager, forms: number[], params: KernelParams) => {
|
|
41
|
+
const asserted = new AssertedFormulas(manager, params.isFindingMacros);
|
|
42
|
+
const context = new Context(manager, {
|
|
43
|
+
isMbqi: params.isMbqi,
|
|
44
|
+
mbqiMaxIterations: params.mbqiMaxIterations,
|
|
45
|
+
relevancyLevel: 2,
|
|
46
|
+
});
|
|
47
|
+
for (const form of forms) asserted.assertExpr(form);
|
|
48
|
+
context.setupContext(params.setup, true, asserted);
|
|
49
|
+
context.internalizeAssertions(asserted);
|
|
50
|
+
const theoryAssumptions: number[] = [];
|
|
51
|
+
context.addTheoryAssumptions(theoryAssumptions);
|
|
52
|
+
const result =
|
|
53
|
+
theoryAssumptions.length === 0 ? context.search() : context.checkResearching(asserted, []);
|
|
54
|
+
manager.limit.release();
|
|
55
|
+
return { result, context };
|
|
56
|
+
};
|
|
57
|
+
|
|
58
|
+
export const solveAssertions = (
|
|
59
|
+
manager: AstManager,
|
|
60
|
+
assertions: number[],
|
|
61
|
+
params = DEFAULT_KERNEL_PARAMS,
|
|
62
|
+
) => {
|
|
63
|
+
const goal = applyUfniaTactic(manager, assertions);
|
|
64
|
+
if (goal.isInconsistent || goal.forms.size === 0) {
|
|
65
|
+
manager.limit.release();
|
|
66
|
+
return { result: goal.isInconsistent ? L_FALSE : L_TRUE, context: undefined };
|
|
67
|
+
}
|
|
68
|
+
return solveGoal(manager, goal.forms.items, params);
|
|
69
|
+
};
|
|
70
|
+
|
|
71
|
+
// combined_solver searches with its incremental smt kernel, without the tactic, once the check has
|
|
72
|
+
// assumptions.
|
|
73
|
+
export const solveAssuming = (
|
|
74
|
+
manager: AstManager,
|
|
75
|
+
assertions: number[],
|
|
76
|
+
assumptions: number[],
|
|
77
|
+
params = DEFAULT_KERNEL_PARAMS,
|
|
78
|
+
) => {
|
|
79
|
+
const asserted = new AssertedFormulas(manager, params.isFindingMacros);
|
|
80
|
+
const context = new Context(manager, {
|
|
81
|
+
isMbqi: params.isMbqi,
|
|
82
|
+
mbqiMaxIterations: params.mbqiMaxIterations,
|
|
83
|
+
relevancyLevel: 2,
|
|
84
|
+
});
|
|
85
|
+
for (const assertion of assertions) asserted.assertExpr(assertion);
|
|
86
|
+
context.setupContext(params.setup, false, asserted);
|
|
87
|
+
context.internalizeAssertions(asserted);
|
|
88
|
+
const result = context.checkResearching(asserted, assumptions);
|
|
89
|
+
manager.limit.release();
|
|
90
|
+
return { result, context };
|
|
91
|
+
};
|
|
92
|
+
|
|
93
|
+
export const getVerdict = (result: number): Verdict =>
|
|
94
|
+
result === L_FALSE ? "unsat" : result === L_TRUE ? "sat" : "unknown";
|
|
95
|
+
|
|
96
|
+
const rethrow = (error: SmtParseError) => {
|
|
97
|
+
throw error;
|
|
98
|
+
};
|
|
99
|
+
|
|
100
|
+
export const checkSmt = (
|
|
101
|
+
text: string,
|
|
102
|
+
options: DecideOptions,
|
|
103
|
+
report: (error: SmtParseError) => void = rethrow,
|
|
104
|
+
): SmtCheck => {
|
|
18
105
|
const manager = new AstManager(
|
|
19
106
|
new ResourceLimit(Date.now() + options.timeLimitMs, options.signal),
|
|
20
107
|
);
|
|
21
108
|
try {
|
|
22
109
|
const incremental = new AssertedFormulas(manager);
|
|
23
110
|
manager.limit.inc();
|
|
24
|
-
const problem = parseSmtlib(
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
111
|
+
const problem = parseSmtlib(
|
|
112
|
+
text,
|
|
113
|
+
manager,
|
|
114
|
+
(assertion) => {
|
|
115
|
+
manager.limit.inc();
|
|
116
|
+
incremental.assertExpr(assertion);
|
|
117
|
+
},
|
|
118
|
+
report,
|
|
119
|
+
);
|
|
28
120
|
if (!problem.hasCheckSat) return { verdict: "unknown", numInstances: 0 };
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
}
|
|
33
|
-
const asserted = new AssertedFormulas(manager);
|
|
34
|
-
const context = new Context(manager, { isMbqi: true, relevancyLevel: 2 });
|
|
35
|
-
for (const assertion of goal.forms.items) asserted.assertExpr(assertion);
|
|
36
|
-
context.setupContext();
|
|
37
|
-
context.internalizeAssertions(asserted);
|
|
38
|
-
const result = context.search();
|
|
121
|
+
// cmd_context::check_sat bounds the steps of the search by the rlimit from the count so far.
|
|
122
|
+
manager.limit.push(problem.rlimit);
|
|
123
|
+
const solved = solveAssertions(manager, problem.assertions);
|
|
39
124
|
return {
|
|
40
|
-
verdict: result
|
|
41
|
-
numInstances: context
|
|
125
|
+
verdict: getVerdict(solved.result),
|
|
126
|
+
numInstances: solved.context?.qmanager.getNumInstances() ?? 0,
|
|
42
127
|
};
|
|
43
128
|
} finally {
|
|
44
129
|
manager.limit.release();
|
|
45
130
|
}
|
|
46
131
|
};
|
|
47
132
|
|
|
48
|
-
|
|
133
|
+
// report gets each SmtParseError, and Z3 goes on past one only when report returns. Anything else
|
|
134
|
+
// it cannot decide is unknown.
|
|
135
|
+
export const decideSmt = (
|
|
136
|
+
text: string,
|
|
137
|
+
options: DecideOptions,
|
|
138
|
+
report: (error: SmtParseError) => void = rethrow,
|
|
139
|
+
): Verdict => {
|
|
49
140
|
try {
|
|
50
|
-
return checkSmt(text, options).verdict;
|
|
141
|
+
return checkSmt(text, options, report).verdict;
|
|
51
142
|
} catch (error) {
|
|
52
143
|
if (
|
|
53
144
|
error instanceof SmtUnsupportedError ||
|
|
@@ -0,0 +1,314 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
FAMILY_ARRAY,
|
|
5
|
+
FAMILY_BASIC,
|
|
6
|
+
FAMILY_BV,
|
|
7
|
+
FAMILY_FPA,
|
|
8
|
+
FAMILY_LABEL,
|
|
9
|
+
FAMILY_MODEL_VALUE,
|
|
10
|
+
FAMILY_USER,
|
|
11
|
+
OP_ADD,
|
|
12
|
+
OP_AND,
|
|
13
|
+
OP_DIV,
|
|
14
|
+
OP_EQ,
|
|
15
|
+
OP_GE,
|
|
16
|
+
OP_IDIV,
|
|
17
|
+
OP_IMPLIES,
|
|
18
|
+
OP_ITE,
|
|
19
|
+
OP_LE,
|
|
20
|
+
OP_MOD,
|
|
21
|
+
OP_MUL,
|
|
22
|
+
OP_NOT,
|
|
23
|
+
OP_OR,
|
|
24
|
+
OP_REM,
|
|
25
|
+
OP_SELECT,
|
|
26
|
+
OP_STORE,
|
|
27
|
+
OP_XOR,
|
|
28
|
+
SORT_INT,
|
|
29
|
+
SORT_REAL,
|
|
30
|
+
} from "./ast";
|
|
31
|
+
import { Rational } from "./rational";
|
|
32
|
+
|
|
33
|
+
export interface StaticFeatures {
|
|
34
|
+
isCnf: boolean;
|
|
35
|
+
numClauses: number;
|
|
36
|
+
numBinClauses: number;
|
|
37
|
+
numUnits: number;
|
|
38
|
+
numQuantifiers: number;
|
|
39
|
+
numQuantifiersWithPatterns: number;
|
|
40
|
+
numBoolConstants: number;
|
|
41
|
+
maxIteTreeDepth: number;
|
|
42
|
+
numIteTerms: number;
|
|
43
|
+
numUninterpretedConstants: number;
|
|
44
|
+
numUninterpretedFunctions: number;
|
|
45
|
+
hasRational: boolean;
|
|
46
|
+
hasInt: boolean;
|
|
47
|
+
hasReal: boolean;
|
|
48
|
+
hasBv: boolean;
|
|
49
|
+
hasFpa: boolean;
|
|
50
|
+
hasArrays: boolean;
|
|
51
|
+
hasExtArrays: boolean;
|
|
52
|
+
arithKSum: Rational;
|
|
53
|
+
numArithTerms: number;
|
|
54
|
+
numArithEqs: number;
|
|
55
|
+
numArithIneqs: number;
|
|
56
|
+
numDiffTerms: number;
|
|
57
|
+
numDiffEqs: number;
|
|
58
|
+
numDiffIneqs: number;
|
|
59
|
+
numNonLinear: number;
|
|
60
|
+
numTheories: number;
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
interface ToProcess {
|
|
64
|
+
expr: number;
|
|
65
|
+
isIteContext: boolean;
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
const MINUS_ONE = Rational.of(-1n);
|
|
69
|
+
const GATE_OPS = new Set([OP_ITE, OP_AND, OP_OR, OP_XOR, OP_IMPLIES, OP_EQ]);
|
|
70
|
+
const DIV_OPS = new Set([OP_DIV, OP_IDIV, OP_REM, OP_MOD]);
|
|
71
|
+
const BUILTIN_FAMILIES = new Set([FAMILY_BASIC, FAMILY_USER, FAMILY_MODEL_VALUE, FAMILY_LABEL]);
|
|
72
|
+
|
|
73
|
+
export const isDense = (features: StaticFeatures) =>
|
|
74
|
+
features.numUninterpretedConstants < 1000 &&
|
|
75
|
+
features.numArithEqs + features.numArithIneqs > features.numUninterpretedConstants * 9;
|
|
76
|
+
|
|
77
|
+
export const collectStaticFeatures = (
|
|
78
|
+
manager: AstManager,
|
|
79
|
+
formulas: readonly number[],
|
|
80
|
+
): StaticFeatures => {
|
|
81
|
+
const features = {
|
|
82
|
+
isCnf: true,
|
|
83
|
+
numClauses: 0,
|
|
84
|
+
numBinClauses: 0,
|
|
85
|
+
numUnits: 0,
|
|
86
|
+
numQuantifiers: 0,
|
|
87
|
+
numQuantifiersWithPatterns: 0,
|
|
88
|
+
numBoolConstants: 0,
|
|
89
|
+
maxIteTreeDepth: 0,
|
|
90
|
+
numIteTerms: 0,
|
|
91
|
+
numUninterpretedConstants: 0,
|
|
92
|
+
numUninterpretedFunctions: 0,
|
|
93
|
+
hasRational: false,
|
|
94
|
+
hasInt: false,
|
|
95
|
+
hasReal: false,
|
|
96
|
+
hasBv: false,
|
|
97
|
+
hasFpa: false,
|
|
98
|
+
hasArrays: false,
|
|
99
|
+
hasExtArrays: false,
|
|
100
|
+
arithKSum: Rational.zero,
|
|
101
|
+
numArithTerms: 0,
|
|
102
|
+
numArithEqs: 0,
|
|
103
|
+
numArithIneqs: 0,
|
|
104
|
+
numDiffTerms: 0,
|
|
105
|
+
numDiffEqs: 0,
|
|
106
|
+
numDiffIneqs: 0,
|
|
107
|
+
numNonLinear: 0,
|
|
108
|
+
};
|
|
109
|
+
const theories = new Set<number>();
|
|
110
|
+
const markTheory = (family: number) => {
|
|
111
|
+
if (!BUILTIN_FAMILIES.has(family)) theories.add(family);
|
|
112
|
+
};
|
|
113
|
+
const isArithExpr = (expr: number) =>
|
|
114
|
+
manager.isApp(expr) && manager.getFamily(expr) === FAMILY_ARITH;
|
|
115
|
+
const isIte = (expr: number) => manager.getOp(expr) === OP_ITE;
|
|
116
|
+
const isBinary = (expr: number, op: number) =>
|
|
117
|
+
manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
|
|
118
|
+
const isGate = (expr: number) =>
|
|
119
|
+
manager.isApp(expr) &&
|
|
120
|
+
manager.getFamily(expr) === FAMILY_BASIC &&
|
|
121
|
+
GATE_OPS.has(manager.getOp(expr));
|
|
122
|
+
const accNum = (value: Rational) => {
|
|
123
|
+
features.arithKSum = features.arithKSum.add(value.abs());
|
|
124
|
+
};
|
|
125
|
+
const accNumeral = (expr: number) => {
|
|
126
|
+
if (manager.isNumeral(expr)) accNum(manager.getRationalValue(expr));
|
|
127
|
+
};
|
|
128
|
+
// is_diff_term: a term x or (+ k x), with the k it adds.
|
|
129
|
+
const getDiffTermConstant = (expr: number) => {
|
|
130
|
+
if (!isArithExpr(expr)) return Rational.zero;
|
|
131
|
+
if (manager.isNumeral(expr)) return manager.getRationalValue(expr);
|
|
132
|
+
if (!isBinary(expr, OP_ADD)) return undefined;
|
|
133
|
+
const constant = manager.getArg(expr, 0);
|
|
134
|
+
const term = manager.getArg(expr, 1);
|
|
135
|
+
return manager.isNumeral(constant) && !isArithExpr(term) && !isIte(term)
|
|
136
|
+
? manager.getRationalValue(constant)
|
|
137
|
+
: undefined;
|
|
138
|
+
};
|
|
139
|
+
const isMinusOneTimes = (term: number, other: number) => {
|
|
140
|
+
if (isArithExpr(other) || !isBinary(term, OP_MUL)) return false;
|
|
141
|
+
const coefficient = manager.getArg(term, 0);
|
|
142
|
+
const factor = manager.getArg(term, 1);
|
|
143
|
+
return (
|
|
144
|
+
manager.isNumeral(coefficient) &&
|
|
145
|
+
manager.getRationalValue(coefficient).equals(MINUS_ONE) &&
|
|
146
|
+
!isArithExpr(factor) &&
|
|
147
|
+
!isIte(factor)
|
|
148
|
+
);
|
|
149
|
+
};
|
|
150
|
+
// An atom x <= k, x = k or x - y <= k, with the subtraction written as (+ x (* -1 y)).
|
|
151
|
+
const isDiffAtom = (expr: number) => {
|
|
152
|
+
const lhs = manager.getArg(expr, 0);
|
|
153
|
+
const rhs = manager.getArg(expr, 1);
|
|
154
|
+
if (!isArithExpr(lhs) && !isArithExpr(rhs) && !isIte(lhs) && !isIte(rhs)) return true;
|
|
155
|
+
if (!manager.isNumeral(rhs)) return false;
|
|
156
|
+
if (!isArithExpr(lhs) && !isIte(lhs)) return true;
|
|
157
|
+
if (!isBinary(lhs, OP_ADD)) return false;
|
|
158
|
+
const first = manager.getArg(lhs, 0);
|
|
159
|
+
const second = manager.getArg(lhs, 1);
|
|
160
|
+
return isMinusOneTimes(second, first) || isMinusOneTimes(first, second);
|
|
161
|
+
};
|
|
162
|
+
const countArithTerm = (expr: number) => {
|
|
163
|
+
features.numArithTerms++;
|
|
164
|
+
const constant = getDiffTermConstant(expr);
|
|
165
|
+
if (constant === undefined) return;
|
|
166
|
+
features.numDiffTerms++;
|
|
167
|
+
accNum(constant);
|
|
168
|
+
};
|
|
169
|
+
const updateSort = (sort: number) => {
|
|
170
|
+
const family = manager.getSortFamily(sort);
|
|
171
|
+
markTheory(family);
|
|
172
|
+
features.hasInt ||= sort === SORT_INT;
|
|
173
|
+
features.hasReal ||= sort === SORT_REAL;
|
|
174
|
+
features.hasBv ||= family === FAMILY_BV;
|
|
175
|
+
features.hasFpa ||= family === FAMILY_FPA;
|
|
176
|
+
if (family !== FAMILY_ARRAY) return;
|
|
177
|
+
features.hasArrays = true;
|
|
178
|
+
for (const parameter of manager.getSortParameters(sort)) updateSort(parameter);
|
|
179
|
+
};
|
|
180
|
+
const uninterpretedDecls = new Set<number>();
|
|
181
|
+
const update = (expr: number) => {
|
|
182
|
+
const sort = manager.sorts[expr];
|
|
183
|
+
updateSort(sort);
|
|
184
|
+
const op = manager.getOp(expr);
|
|
185
|
+
const family = manager.getFamily(expr);
|
|
186
|
+
const isBool = manager.isBool(expr);
|
|
187
|
+
const isExprGate = isGate(expr);
|
|
188
|
+
if (isExprGate) features.isCnf = false;
|
|
189
|
+
if (op === OP_ITE && !isBool) {
|
|
190
|
+
features.numIteTerms++;
|
|
191
|
+
for (const arg of [manager.getArg(expr, 1), manager.getArg(expr, 2)]) {
|
|
192
|
+
accNumeral(arg);
|
|
193
|
+
if (manager.getSortFamily(manager.sorts[arg]) === FAMILY_ARITH) countArithTerm(arg);
|
|
194
|
+
}
|
|
195
|
+
}
|
|
196
|
+
if (isBool && manager.isApp(expr) && manager.getNumArgs(expr) === 0)
|
|
197
|
+
features.numBoolConstants++;
|
|
198
|
+
features.hasExtArrays ||=
|
|
199
|
+
manager.getSortFamily(sort) === FAMILY_ARRAY && op !== OP_SELECT && op !== OP_STORE;
|
|
200
|
+
if (!manager.isApp(expr)) {
|
|
201
|
+
features.numQuantifiers++;
|
|
202
|
+
if (manager.getQuantifier(expr).patterns.length > 0) features.numQuantifiersWithPatterns++;
|
|
203
|
+
return;
|
|
204
|
+
}
|
|
205
|
+
if (family === FAMILY_ARITH && (op === OP_LE || op === OP_GE)) {
|
|
206
|
+
features.numArithIneqs++;
|
|
207
|
+
if (isDiffAtom(expr)) features.numDiffIneqs++;
|
|
208
|
+
accNumeral(manager.getArg(expr, 1));
|
|
209
|
+
}
|
|
210
|
+
if (manager.isNumeral(expr) && !manager.getRationalValue(expr).isInt())
|
|
211
|
+
features.hasRational = true;
|
|
212
|
+
if (op === OP_EQ && manager.isNumeral(manager.getArg(expr, 1))) {
|
|
213
|
+
accNumeral(manager.getArg(expr, 1));
|
|
214
|
+
features.numArithEqs++;
|
|
215
|
+
if (isDiffAtom(expr)) features.numDiffEqs++;
|
|
216
|
+
}
|
|
217
|
+
markTheory(family);
|
|
218
|
+
if (
|
|
219
|
+
family === FAMILY_ARITH &&
|
|
220
|
+
op === OP_MUL &&
|
|
221
|
+
(!manager.isNumeral(manager.getArg(expr, 0)) || manager.getNumArgs(expr) > 2)
|
|
222
|
+
)
|
|
223
|
+
features.numNonLinear++;
|
|
224
|
+
if (family === FAMILY_ARITH && DIV_OPS.has(op)) {
|
|
225
|
+
const divisor = manager.getArg(expr, 1);
|
|
226
|
+
if (!manager.isNumeral(divisor) || manager.getRationalValue(divisor).isZero()) {
|
|
227
|
+
features.numUninterpretedFunctions++;
|
|
228
|
+
features.numNonLinear++;
|
|
229
|
+
}
|
|
230
|
+
}
|
|
231
|
+
if (family === FAMILY_USER && manager.getNumArgs(expr) === 0)
|
|
232
|
+
features.numUninterpretedConstants++;
|
|
233
|
+
if (family === FAMILY_USER && manager.getNumArgs(expr) > 0) {
|
|
234
|
+
const decl = manager.getDeclId(expr);
|
|
235
|
+
if (!uninterpretedDecls.has(decl)) features.numUninterpretedFunctions++;
|
|
236
|
+
uninterpretedDecls.add(decl);
|
|
237
|
+
}
|
|
238
|
+
// An argument of another theory is an alien term.
|
|
239
|
+
if (isExprGate || family === FAMILY_ARITH) return;
|
|
240
|
+
for (const arg of manager.getArgs(expr))
|
|
241
|
+
if (manager.getSortFamily(manager.sorts[arg]) === FAMILY_ARITH) countArithTerm(arg);
|
|
242
|
+
};
|
|
243
|
+
const stripNot = (expr: number) =>
|
|
244
|
+
manager.getOp(expr) === OP_NOT ? manager.getArg(expr, 0) : expr;
|
|
245
|
+
const preProcessed = new Set<number>();
|
|
246
|
+
const postProcessed = new Set<number>();
|
|
247
|
+
const iteDepths = new Map<number, number>();
|
|
248
|
+
const todo: ToProcess[] = [];
|
|
249
|
+
// pre_process: whether every child is done, so that the expression can be post-processed.
|
|
250
|
+
const preProcess = (expr: number) => {
|
|
251
|
+
if (postProcessed.has(expr) || preProcessed.has(expr)) return true;
|
|
252
|
+
preProcessed.add(expr);
|
|
253
|
+
if (manager.isVar(expr)) {
|
|
254
|
+
postProcessed.add(expr);
|
|
255
|
+
return true;
|
|
256
|
+
}
|
|
257
|
+
update(expr);
|
|
258
|
+
if (!manager.isApp(expr)) {
|
|
259
|
+
const body = manager.getQuantifier(expr).body;
|
|
260
|
+
if (postProcessed.has(body)) return true;
|
|
261
|
+
todo.push({ expr: body, isIteContext: false });
|
|
262
|
+
return false;
|
|
263
|
+
}
|
|
264
|
+
const isIteContext = isIte(expr);
|
|
265
|
+
let isAllProcessed = true;
|
|
266
|
+
for (const arg of manager.getArgs(expr)) {
|
|
267
|
+
const child = stripNot(arg);
|
|
268
|
+
if (postProcessed.has(child)) continue;
|
|
269
|
+
todo.push({ expr: child, isIteContext });
|
|
270
|
+
isAllProcessed = false;
|
|
271
|
+
}
|
|
272
|
+
return isAllProcessed;
|
|
273
|
+
};
|
|
274
|
+
const postProcess = (expr: number, isIteContext: boolean) => {
|
|
275
|
+
if (postProcessed.has(expr)) return;
|
|
276
|
+
postProcessed.add(expr);
|
|
277
|
+
if (!manager.isApp(expr) || !isIte(expr)) return;
|
|
278
|
+
const depth =
|
|
279
|
+
Math.max(0, ...manager.getArgs(expr).map((arg) => iteDepths.get(stripNot(arg)) ?? 0)) + 1;
|
|
280
|
+
if (!isIteContext) features.maxIteTreeDepth = Math.max(features.maxIteTreeDepth, depth);
|
|
281
|
+
iteDepths.set(expr, depth);
|
|
282
|
+
};
|
|
283
|
+
const processAll = () => {
|
|
284
|
+
for (let top = todo.at(-1); top !== undefined; top = todo.at(-1)) {
|
|
285
|
+
if (postProcessed.has(top.expr)) {
|
|
286
|
+
todo.pop();
|
|
287
|
+
continue;
|
|
288
|
+
}
|
|
289
|
+
if (!preProcess(top.expr)) continue;
|
|
290
|
+
postProcess(top.expr, top.isIteContext);
|
|
291
|
+
todo.pop();
|
|
292
|
+
}
|
|
293
|
+
};
|
|
294
|
+
for (const root of formulas) {
|
|
295
|
+
if (postProcessed.has(root)) continue;
|
|
296
|
+
if (manager.getOp(root) === OP_OR) {
|
|
297
|
+
postProcessed.add(root);
|
|
298
|
+
features.numClauses++;
|
|
299
|
+
if (manager.getNumArgs(root) === 2) features.numBinClauses++;
|
|
300
|
+
for (const arg of manager.getArgs(root)) {
|
|
301
|
+
todo.push({ expr: stripNot(arg), isIteContext: false });
|
|
302
|
+
processAll();
|
|
303
|
+
}
|
|
304
|
+
continue;
|
|
305
|
+
}
|
|
306
|
+
if (!isGate(root)) {
|
|
307
|
+
features.numUnits++;
|
|
308
|
+
features.numClauses++;
|
|
309
|
+
}
|
|
310
|
+
todo.push({ expr: root, isIteContext: false });
|
|
311
|
+
processAll();
|
|
312
|
+
}
|
|
313
|
+
return { ...features, numTheories: theories.size };
|
|
314
|
+
};
|