tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b
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 +4 -1
- package/dist/index.d.ts +4 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- 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/bags.ts +47 -28
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +476 -590
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +60 -708
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +25 -18
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +14 -7
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/json.ts +4 -7
- package/src/levels.ts +42 -44
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +597 -240
- 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 +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +652 -220
- 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 +93 -15
- 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 +536 -117
- 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 +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -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 +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -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 +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- 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 +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- 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 +165 -83
- 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 +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- 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 +410 -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 +1407 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -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 +22 -25
- 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 +38 -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 +44 -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 +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +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 +90 -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 +1704 -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 +1995 -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 +94 -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 +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -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 +2 -3
- 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 +127 -108
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +382 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1092 -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 +6 -13
- 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 +243 -52
- package/src/simulate.ts +160 -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 +2 -9
- package/src/subexpressions.ts +3 -1
- 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/jar-data.ts +12 -0
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +16 -12
- 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 +61 -16
- package/src/tlc/trace-spec.ts +26 -47
- 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 +63 -158
- 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
|
@@ -0,0 +1,889 @@
|
|
|
1
|
+
// A node is 2 * id for a variable and 2 * (id - FIRST_NODE_ID) + 1 for an and, and a literal is 2 *
|
|
2
|
+
// node, plus 1 when inverted.
|
|
3
|
+
import { SmtTacticError } from "../../../errors";
|
|
4
|
+
import {
|
|
5
|
+
type AstManager,
|
|
6
|
+
KIND_APP,
|
|
7
|
+
OP_AND,
|
|
8
|
+
OP_EQ,
|
|
9
|
+
OP_FALSE,
|
|
10
|
+
OP_IMPLIES,
|
|
11
|
+
OP_ITE,
|
|
12
|
+
OP_NOT,
|
|
13
|
+
OP_OR,
|
|
14
|
+
OP_TRUE,
|
|
15
|
+
OP_XOR,
|
|
16
|
+
SORT_BOOL,
|
|
17
|
+
} from "./ast";
|
|
18
|
+
import { combineHash } from "./hash";
|
|
19
|
+
import { ObjMap } from "./hashtable";
|
|
20
|
+
import { RefVector } from "./ref-vector";
|
|
21
|
+
|
|
22
|
+
const FIRST_NODE_ID = 2147483647;
|
|
23
|
+
const NULL_LIT = -1;
|
|
24
|
+
const TRUE_LIT = 0;
|
|
25
|
+
const FALSE_LIT = 1;
|
|
26
|
+
const INITIAL_NODES = 64;
|
|
27
|
+
const INITIAL_TABLE = 64;
|
|
28
|
+
|
|
29
|
+
const AIG_AND = 0;
|
|
30
|
+
const AIG_AUX_AND = 1;
|
|
31
|
+
const AIG_ITE = 2;
|
|
32
|
+
|
|
33
|
+
const CONNECTIVE_OPS = new Set([OP_NOT, OP_OR, OP_AND, OP_XOR, OP_IMPLIES, OP_ITE]);
|
|
34
|
+
|
|
35
|
+
const isInverted = (lit: number) => (lit & 1) === 1;
|
|
36
|
+
const isVar = (node: number) => (node & 1) === 0;
|
|
37
|
+
const getId = (node: number) => (isVar(node) ? node >> 1 : FIRST_NODE_ID + (node >> 1));
|
|
38
|
+
const isNotEq = (first: number, second: number) => (first ^ second) === 1;
|
|
39
|
+
|
|
40
|
+
const compareLits = (first: number, second: number) => {
|
|
41
|
+
const firstId = getId(first >> 1);
|
|
42
|
+
const secondId = getId(second >> 1);
|
|
43
|
+
return firstId === secondId ? (second & 1) - (first & 1) : firstId - secondId;
|
|
44
|
+
};
|
|
45
|
+
|
|
46
|
+
const sortRange = (lits: number[], start: number) => {
|
|
47
|
+
const sorted = lits.slice(start).sort(compareLits);
|
|
48
|
+
for (const [offset, lit] of sorted.entries()) lits[start + offset] = lit;
|
|
49
|
+
};
|
|
50
|
+
|
|
51
|
+
const getGrown = (array: Int32Array, size: number, fill: number) => {
|
|
52
|
+
const grown = new Int32Array(size).fill(fill);
|
|
53
|
+
grown.set(array);
|
|
54
|
+
return grown;
|
|
55
|
+
};
|
|
56
|
+
|
|
57
|
+
export class AigManager {
|
|
58
|
+
refCounts = new Int32Array(INITIAL_NODES);
|
|
59
|
+
lefts = new Int32Array(INITIAL_NODES);
|
|
60
|
+
rights = new Int32Array(INITIAL_NODES);
|
|
61
|
+
readonly varExprs: RefVector;
|
|
62
|
+
iteCond = NULL_LIT;
|
|
63
|
+
iteThen = NULL_LIT;
|
|
64
|
+
iteElse = NULL_LIT;
|
|
65
|
+
private nextVarId = 0;
|
|
66
|
+
private readonly freeVarIds: number[] = [];
|
|
67
|
+
private nextNodeIndex = 0;
|
|
68
|
+
private readonly freeNodeIndexes: number[] = [];
|
|
69
|
+
private table = new Int32Array(INITIAL_TABLE).fill(-1);
|
|
70
|
+
private tableSize = 0;
|
|
71
|
+
private readonly toDelete: number[] = [];
|
|
72
|
+
|
|
73
|
+
constructor(readonly manager: AstManager) {
|
|
74
|
+
this.varExprs = new RefVector(manager);
|
|
75
|
+
this.mkVar(manager.trueExpr);
|
|
76
|
+
this.incRef(TRUE_LIT);
|
|
77
|
+
this.incRef(FALSE_LIT);
|
|
78
|
+
}
|
|
79
|
+
|
|
80
|
+
release() {
|
|
81
|
+
this.decRef(TRUE_LIT);
|
|
82
|
+
this.decRef(FALSE_LIT);
|
|
83
|
+
this.varExprs.reset();
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
incRef(lit: number) {
|
|
87
|
+
this.refCounts[lit >> 1]++;
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
decRef(lit: number) {
|
|
91
|
+
this.decRefCore(lit >> 1);
|
|
92
|
+
for (let node = this.toDelete.pop(); node !== undefined; node = this.toDelete.pop())
|
|
93
|
+
this.deleteNode(node);
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
decRefResult(lit: number) {
|
|
97
|
+
this.refCounts[lit >> 1]--;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
private decRefCore(node: number) {
|
|
101
|
+
this.refCounts[node]--;
|
|
102
|
+
if (this.refCounts[node] === 0) this.toDelete.push(node);
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
private deleteNode(node: number) {
|
|
106
|
+
if (isVar(node)) {
|
|
107
|
+
this.freeVarIds.push(node >> 1);
|
|
108
|
+
this.varExprs.set(node >> 1, -1);
|
|
109
|
+
return;
|
|
110
|
+
}
|
|
111
|
+
this.eraseNode(node);
|
|
112
|
+
this.freeNodeIndexes.push(node >> 1);
|
|
113
|
+
this.decRefCore(this.lefts[node] >> 1);
|
|
114
|
+
this.decRefCore(this.rights[node] >> 1);
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
private reserve(node: number) {
|
|
118
|
+
if (node < this.refCounts.length) return;
|
|
119
|
+
const size = Math.max(node + 1, 2 * this.refCounts.length);
|
|
120
|
+
this.refCounts = getGrown(this.refCounts, size, 0);
|
|
121
|
+
this.lefts = getGrown(this.lefts, size, 0);
|
|
122
|
+
this.rights = getGrown(this.rights, size, 0);
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
private getHash(left: number, right: number) {
|
|
126
|
+
return combineHash(left, right) & (this.table.length - 1);
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
private findNode(left: number, right: number) {
|
|
130
|
+
const mask = this.table.length - 1;
|
|
131
|
+
for (let slot = this.getHash(left, right); ; slot = (slot + 1) & mask) {
|
|
132
|
+
const node = this.table[slot];
|
|
133
|
+
if (node === -1 || (this.lefts[node] === left && this.rights[node] === right)) return node;
|
|
134
|
+
}
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
private insertNode(node: number) {
|
|
138
|
+
if (2 * (this.tableSize + 1) > this.table.length) {
|
|
139
|
+
const old = this.table;
|
|
140
|
+
this.table = new Int32Array(2 * old.length).fill(-1);
|
|
141
|
+
for (const entry of old) if (entry !== -1) this.placeNode(entry);
|
|
142
|
+
}
|
|
143
|
+
this.placeNode(node);
|
|
144
|
+
this.tableSize++;
|
|
145
|
+
}
|
|
146
|
+
|
|
147
|
+
private placeNode(node: number) {
|
|
148
|
+
const mask = this.table.length - 1;
|
|
149
|
+
let slot = this.getHash(this.lefts[node], this.rights[node]);
|
|
150
|
+
while (this.table[slot] !== -1) slot = (slot + 1) & mask;
|
|
151
|
+
this.table[slot] = node;
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
private eraseNode(node: number) {
|
|
155
|
+
const mask = this.table.length - 1;
|
|
156
|
+
let hole = this.getHash(this.lefts[node], this.rights[node]);
|
|
157
|
+
while (this.table[hole] !== node) hole = (hole + 1) & mask;
|
|
158
|
+
for (let next = (hole + 1) & mask; this.table[next] !== -1; next = (next + 1) & mask) {
|
|
159
|
+
const home = this.getHash(this.lefts[this.table[next]], this.rights[this.table[next]]);
|
|
160
|
+
if (((next - home) & mask) < ((next - hole) & mask)) continue;
|
|
161
|
+
this.table[hole] = this.table[next];
|
|
162
|
+
hole = next;
|
|
163
|
+
}
|
|
164
|
+
this.table[hole] = -1;
|
|
165
|
+
this.tableSize--;
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
mkVar(expr: number) {
|
|
169
|
+
const id = this.freeVarIds.pop() ?? this.nextVarId++;
|
|
170
|
+
const node = 2 * id;
|
|
171
|
+
this.reserve(node);
|
|
172
|
+
this.refCounts[node] = 0;
|
|
173
|
+
if (id === this.varExprs.size) this.varExprs.push(expr);
|
|
174
|
+
else this.varExprs.set(id, expr);
|
|
175
|
+
return 2 * node;
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
private mkNodeCore(left: number, right: number) {
|
|
179
|
+
const found = this.findNode(left, right);
|
|
180
|
+
if (found !== -1) return 2 * found;
|
|
181
|
+
const node = 2 * (this.freeNodeIndexes.pop() ?? this.nextNodeIndex++) + 1;
|
|
182
|
+
this.reserve(node);
|
|
183
|
+
this.lefts[node] = left;
|
|
184
|
+
this.rights[node] = right;
|
|
185
|
+
this.refCounts[node] = 0;
|
|
186
|
+
this.insertNode(node);
|
|
187
|
+
this.incRef(left);
|
|
188
|
+
this.incRef(right);
|
|
189
|
+
return 2 * node;
|
|
190
|
+
}
|
|
191
|
+
|
|
192
|
+
mkAnd(first: number, second: number) {
|
|
193
|
+
let left = first;
|
|
194
|
+
let right = second;
|
|
195
|
+
for (;;) {
|
|
196
|
+
const isLeftInverted = isInverted(left);
|
|
197
|
+
const leftNode = left >> 1;
|
|
198
|
+
const isRightInverted = isInverted(right);
|
|
199
|
+
const rightNode = right >> 1;
|
|
200
|
+
if (leftNode === 0) return isLeftInverted ? FALSE_LIT : right;
|
|
201
|
+
if (rightNode === 0) return isRightInverted ? FALSE_LIT : left;
|
|
202
|
+
if (leftNode === rightNode) return isLeftInverted === isRightInverted ? left : FALSE_LIT;
|
|
203
|
+
if (!isVar(leftNode)) {
|
|
204
|
+
const a = this.lefts[leftNode];
|
|
205
|
+
const b = this.rights[leftNode];
|
|
206
|
+
if (isNotEq(a, right) || isNotEq(b, right)) return isLeftInverted ? right : FALSE_LIT;
|
|
207
|
+
if (a === right) {
|
|
208
|
+
if (!isLeftInverted) return left;
|
|
209
|
+
left = b ^ 1;
|
|
210
|
+
continue;
|
|
211
|
+
}
|
|
212
|
+
if (b === right) {
|
|
213
|
+
if (!isLeftInverted) return left;
|
|
214
|
+
left = a ^ 1;
|
|
215
|
+
continue;
|
|
216
|
+
}
|
|
217
|
+
if (!isVar(rightNode)) {
|
|
218
|
+
const c = this.lefts[rightNode];
|
|
219
|
+
const d = this.rights[rightNode];
|
|
220
|
+
const isComplementary = isNotEq(a, c) || isNotEq(a, d) || isNotEq(b, c) || isNotEq(b, d);
|
|
221
|
+
if (!isLeftInverted && !isRightInverted) {
|
|
222
|
+
if (isComplementary) return FALSE_LIT;
|
|
223
|
+
if (a === c || b === c) {
|
|
224
|
+
right = d;
|
|
225
|
+
continue;
|
|
226
|
+
}
|
|
227
|
+
if (b === c || b === d) {
|
|
228
|
+
left = a;
|
|
229
|
+
continue;
|
|
230
|
+
}
|
|
231
|
+
if (a === d || b === d) {
|
|
232
|
+
right = c;
|
|
233
|
+
continue;
|
|
234
|
+
}
|
|
235
|
+
if (a === c || a === d) {
|
|
236
|
+
left = b;
|
|
237
|
+
continue;
|
|
238
|
+
}
|
|
239
|
+
}
|
|
240
|
+
if (isLeftInverted && !isRightInverted) {
|
|
241
|
+
if (isComplementary) return right;
|
|
242
|
+
if (b === c || b === d) {
|
|
243
|
+
left = a ^ 1;
|
|
244
|
+
continue;
|
|
245
|
+
}
|
|
246
|
+
if (a === c || a === d) {
|
|
247
|
+
left = b ^ 1;
|
|
248
|
+
continue;
|
|
249
|
+
}
|
|
250
|
+
}
|
|
251
|
+
if (!isLeftInverted && isRightInverted) {
|
|
252
|
+
if (isComplementary) return left;
|
|
253
|
+
if (c === a || c === b) {
|
|
254
|
+
right = d ^ 1;
|
|
255
|
+
continue;
|
|
256
|
+
}
|
|
257
|
+
if (d === a || d === b) {
|
|
258
|
+
right = c ^ 1;
|
|
259
|
+
continue;
|
|
260
|
+
}
|
|
261
|
+
}
|
|
262
|
+
if (isLeftInverted && isRightInverted) {
|
|
263
|
+
if (a === c && isNotEq(b, d)) return a ^ 1;
|
|
264
|
+
if (isNotEq(a, c) && b === d) return b ^ 1;
|
|
265
|
+
}
|
|
266
|
+
}
|
|
267
|
+
}
|
|
268
|
+
if (!isVar(rightNode)) {
|
|
269
|
+
const a = this.lefts[rightNode];
|
|
270
|
+
const b = this.rights[rightNode];
|
|
271
|
+
if (isNotEq(left, a) || isNotEq(left, b)) return isRightInverted ? left : FALSE_LIT;
|
|
272
|
+
if (a === left) {
|
|
273
|
+
if (!isRightInverted) return right;
|
|
274
|
+
right = b ^ 1;
|
|
275
|
+
continue;
|
|
276
|
+
}
|
|
277
|
+
if (b === left) {
|
|
278
|
+
if (!isRightInverted) return right;
|
|
279
|
+
right = a ^ 1;
|
|
280
|
+
continue;
|
|
281
|
+
}
|
|
282
|
+
}
|
|
283
|
+
return getId(leftNode) > getId(rightNode)
|
|
284
|
+
? this.mkNodeCore(right, left)
|
|
285
|
+
: this.mkNodeCore(left, right);
|
|
286
|
+
}
|
|
287
|
+
}
|
|
288
|
+
|
|
289
|
+
mkOr(first: number, second: number) {
|
|
290
|
+
return this.mkAnd(first ^ 1, second ^ 1) ^ 1;
|
|
291
|
+
}
|
|
292
|
+
|
|
293
|
+
// Sorts the literals from start on in place, since the caller releases them in that order.
|
|
294
|
+
mkJunction(lits: number[], start: number, isOr: boolean) {
|
|
295
|
+
const count = lits.length - start;
|
|
296
|
+
if (count === 0) return isOr ? FALSE_LIT : TRUE_LIT;
|
|
297
|
+
if (count === 1) return lits[start];
|
|
298
|
+
const mk = (first: number, second: number) =>
|
|
299
|
+
isOr ? this.mkOr(first, second) : this.mkAnd(first, second);
|
|
300
|
+
if (count === 2) return mk(lits[start], lits[start + 1]);
|
|
301
|
+
sortRange(lits, start);
|
|
302
|
+
let result = mk(lits[start], lits[start + 1]);
|
|
303
|
+
this.incRef(result);
|
|
304
|
+
for (let index = start + 2; index < lits.length; index++) {
|
|
305
|
+
const next = mk(result, lits[index]);
|
|
306
|
+
this.incRef(next);
|
|
307
|
+
this.decRef(result);
|
|
308
|
+
result = next;
|
|
309
|
+
}
|
|
310
|
+
this.decRefResult(result);
|
|
311
|
+
return result;
|
|
312
|
+
}
|
|
313
|
+
|
|
314
|
+
mkIte(cond: number, then: number, otherwise: number) {
|
|
315
|
+
const first = this.mkAnd(cond, then ^ 1);
|
|
316
|
+
const second = this.mkAnd(cond ^ 1, otherwise ^ 1);
|
|
317
|
+
return this.mkGate(first, second);
|
|
318
|
+
}
|
|
319
|
+
|
|
320
|
+
mkIff(left: number, right: number) {
|
|
321
|
+
const first = this.mkAnd(left, right ^ 1);
|
|
322
|
+
const second = this.mkAnd(left ^ 1, right);
|
|
323
|
+
return this.mkGate(first, second);
|
|
324
|
+
}
|
|
325
|
+
|
|
326
|
+
private mkGate(first: number, second: number) {
|
|
327
|
+
this.incRef(first);
|
|
328
|
+
this.incRef(second);
|
|
329
|
+
const result = this.mkAnd(first ^ 1, second ^ 1);
|
|
330
|
+
this.incRef(result);
|
|
331
|
+
this.decRef(first);
|
|
332
|
+
this.decRef(second);
|
|
333
|
+
this.decRefResult(result);
|
|
334
|
+
return result;
|
|
335
|
+
}
|
|
336
|
+
|
|
337
|
+
mkXor(left: number, right: number) {
|
|
338
|
+
return this.mkIff(left ^ 1, right);
|
|
339
|
+
}
|
|
340
|
+
|
|
341
|
+
mkImplies(left: number, right: number) {
|
|
342
|
+
return this.mkOr(left ^ 1, right);
|
|
343
|
+
}
|
|
344
|
+
|
|
345
|
+
private setIte(cond: number, then: number, otherwise: number) {
|
|
346
|
+
this.iteCond = cond;
|
|
347
|
+
this.iteThen = then;
|
|
348
|
+
this.iteElse = otherwise;
|
|
349
|
+
return true;
|
|
350
|
+
}
|
|
351
|
+
|
|
352
|
+
isIte(node: number) {
|
|
353
|
+
if (isVar(node)) return false;
|
|
354
|
+
const left = this.lefts[node];
|
|
355
|
+
const right = this.rights[node];
|
|
356
|
+
if (!isInverted(left) || !isInverted(right)) return false;
|
|
357
|
+
const leftNode = left >> 1;
|
|
358
|
+
const rightNode = right >> 1;
|
|
359
|
+
if (isVar(leftNode) || isVar(rightNode)) return false;
|
|
360
|
+
const left1 = this.lefts[leftNode] ^ 1;
|
|
361
|
+
const left2 = this.rights[leftNode] ^ 1;
|
|
362
|
+
const right1 = this.lefts[rightNode] ^ 1;
|
|
363
|
+
const right2 = this.rights[rightNode] ^ 1;
|
|
364
|
+
if (isNotEq(left1, right1))
|
|
365
|
+
return isInverted(left1)
|
|
366
|
+
? this.setIte(right1, left2, right2)
|
|
367
|
+
: this.setIte(left1, right2, left2);
|
|
368
|
+
if (isNotEq(left1, right2))
|
|
369
|
+
return isInverted(left1)
|
|
370
|
+
? this.setIte(right2, left2, right1)
|
|
371
|
+
: this.setIte(left1, right1, left2);
|
|
372
|
+
if (isNotEq(left2, right1))
|
|
373
|
+
return isInverted(left2)
|
|
374
|
+
? this.setIte(right1, left1, right2)
|
|
375
|
+
: this.setIte(left2, right2, left1);
|
|
376
|
+
if (isNotEq(left2, right2))
|
|
377
|
+
return isInverted(left2)
|
|
378
|
+
? this.setIte(right2, left1, right1)
|
|
379
|
+
: this.setIte(left2, right1, left1);
|
|
380
|
+
return false;
|
|
381
|
+
}
|
|
382
|
+
|
|
383
|
+
mkAig(expr: number) {
|
|
384
|
+
const converter = new Expr2Aig(this);
|
|
385
|
+
const result = converter.convert(expr);
|
|
386
|
+
this.incRef(result);
|
|
387
|
+
converter.release();
|
|
388
|
+
this.decRefResult(result);
|
|
389
|
+
return result;
|
|
390
|
+
}
|
|
391
|
+
|
|
392
|
+
maxSharing(lit: number) {
|
|
393
|
+
return new MaxSharing(this).apply(lit);
|
|
394
|
+
}
|
|
395
|
+
|
|
396
|
+
// The result comes with a reference.
|
|
397
|
+
toFormula(lit: number) {
|
|
398
|
+
const converter = new Aig2Expr(this);
|
|
399
|
+
const result = converter.convert(lit);
|
|
400
|
+
converter.release();
|
|
401
|
+
return result;
|
|
402
|
+
}
|
|
403
|
+
}
|
|
404
|
+
|
|
405
|
+
class Expr2Aig {
|
|
406
|
+
private readonly frameExprs: number[] = [];
|
|
407
|
+
private readonly frameIndexes: number[] = [];
|
|
408
|
+
private readonly frameStarts: number[] = [];
|
|
409
|
+
private readonly results: number[] = [];
|
|
410
|
+
private readonly cache: ObjMap<number>;
|
|
411
|
+
|
|
412
|
+
constructor(private readonly aigs: AigManager) {
|
|
413
|
+
this.cache = new ObjMap((expr) => aigs.manager.hashes[expr]);
|
|
414
|
+
}
|
|
415
|
+
|
|
416
|
+
release() {
|
|
417
|
+
for (const [, lit] of this.cache) this.aigs.decRef(lit);
|
|
418
|
+
this.restoreResults(0);
|
|
419
|
+
}
|
|
420
|
+
|
|
421
|
+
private saveResult(lit: number) {
|
|
422
|
+
this.aigs.incRef(lit);
|
|
423
|
+
this.results.push(lit);
|
|
424
|
+
}
|
|
425
|
+
|
|
426
|
+
private cacheResult(expr: number, lit: number) {
|
|
427
|
+
this.aigs.incRef(lit);
|
|
428
|
+
this.cache.set(expr, lit);
|
|
429
|
+
}
|
|
430
|
+
|
|
431
|
+
private isCached(expr: number) {
|
|
432
|
+
const lit = this.cache.get(expr);
|
|
433
|
+
if (lit === undefined) return false;
|
|
434
|
+
this.saveResult(lit);
|
|
435
|
+
return true;
|
|
436
|
+
}
|
|
437
|
+
|
|
438
|
+
private visit(expr: number) {
|
|
439
|
+
const manager = this.aigs.manager;
|
|
440
|
+
if (manager.kinds[expr] === KIND_APP) {
|
|
441
|
+
const op = manager.getOp(expr);
|
|
442
|
+
if (op === OP_TRUE || op === OP_FALSE) {
|
|
443
|
+
this.saveResult(op === OP_TRUE ? TRUE_LIT : FALSE_LIT);
|
|
444
|
+
return true;
|
|
445
|
+
}
|
|
446
|
+
if (CONNECTIVE_OPS.has(op) || (op === OP_EQ && manager.isBool(manager.getArg(expr, 0)))) {
|
|
447
|
+
if (manager.getRefCount(expr) > 1 && this.isCached(expr)) return true;
|
|
448
|
+
this.frameExprs.push(expr);
|
|
449
|
+
this.frameIndexes.push(0);
|
|
450
|
+
this.frameStarts.push(this.results.length);
|
|
451
|
+
return false;
|
|
452
|
+
}
|
|
453
|
+
}
|
|
454
|
+
if (this.isCached(expr)) return true;
|
|
455
|
+
const lit = this.aigs.mkVar(expr);
|
|
456
|
+
this.cacheResult(expr, lit);
|
|
457
|
+
this.saveResult(lit);
|
|
458
|
+
return true;
|
|
459
|
+
}
|
|
460
|
+
|
|
461
|
+
private restoreResults(size: number) {
|
|
462
|
+
for (let index = size; index < this.results.length; index++)
|
|
463
|
+
this.aigs.decRef(this.results[index]);
|
|
464
|
+
this.results.length = size;
|
|
465
|
+
}
|
|
466
|
+
|
|
467
|
+
private saveNodeResult(start: number, lit: number) {
|
|
468
|
+
this.aigs.incRef(lit);
|
|
469
|
+
this.restoreResults(start);
|
|
470
|
+
this.saveResult(lit);
|
|
471
|
+
this.aigs.decRef(lit);
|
|
472
|
+
}
|
|
473
|
+
|
|
474
|
+
private mkXor(start: number) {
|
|
475
|
+
const results = this.results;
|
|
476
|
+
if (results.length === start) return FALSE_LIT;
|
|
477
|
+
let lit = results[start];
|
|
478
|
+
for (let index = start + 1; index < results.length; index++)
|
|
479
|
+
lit = this.aigs.mkXor(lit, results[index]);
|
|
480
|
+
return lit;
|
|
481
|
+
}
|
|
482
|
+
|
|
483
|
+
private mkAig(expr: number, start: number) {
|
|
484
|
+
const aigs = this.aigs;
|
|
485
|
+
const results = this.results;
|
|
486
|
+
const op = aigs.manager.getOp(expr);
|
|
487
|
+
if (op === OP_NOT) results[start] ^= 1;
|
|
488
|
+
else if (op === OP_OR || op === OP_AND)
|
|
489
|
+
this.saveNodeResult(start, aigs.mkJunction(results, start, op === OP_OR));
|
|
490
|
+
else if (op === OP_EQ) {
|
|
491
|
+
if (start + 2 !== results.length)
|
|
492
|
+
throw new SmtTacticError("aig conversion assumes expressions have been simplified");
|
|
493
|
+
this.saveNodeResult(start, aigs.mkIff(results[start], results[start + 1]));
|
|
494
|
+
} else if (op === OP_XOR) this.saveNodeResult(start, this.mkXor(start));
|
|
495
|
+
else if (op === OP_IMPLIES)
|
|
496
|
+
this.saveNodeResult(start, aigs.mkImplies(results[start], results[start + 1]));
|
|
497
|
+
else
|
|
498
|
+
this.saveNodeResult(
|
|
499
|
+
start,
|
|
500
|
+
aigs.mkIte(results[start], results[start + 1], results[start + 2]),
|
|
501
|
+
);
|
|
502
|
+
if (aigs.manager.getRefCount(expr) > 1) this.cacheResult(expr, results[results.length - 1]);
|
|
503
|
+
}
|
|
504
|
+
|
|
505
|
+
convert(root: number) {
|
|
506
|
+
const manager = this.aigs.manager;
|
|
507
|
+
if (!this.visit(root))
|
|
508
|
+
while (this.frameExprs.length > 0) {
|
|
509
|
+
manager.limit.checkpoint();
|
|
510
|
+
const top = this.frameExprs.length - 1;
|
|
511
|
+
const expr = this.frameExprs[top];
|
|
512
|
+
if (this.frameIndexes[top] === 0 && manager.getRefCount(expr) > 1 && this.isCached(expr)) {
|
|
513
|
+
this.popFrame();
|
|
514
|
+
continue;
|
|
515
|
+
}
|
|
516
|
+
const numArgs = manager.getNumArgs(expr);
|
|
517
|
+
let isDescending = false;
|
|
518
|
+
while (!isDescending && this.frameIndexes[top] < numArgs) {
|
|
519
|
+
const arg = manager.getArg(expr, this.frameIndexes[top]);
|
|
520
|
+
this.frameIndexes[top]++;
|
|
521
|
+
isDescending = !this.visit(arg);
|
|
522
|
+
}
|
|
523
|
+
if (isDescending) continue;
|
|
524
|
+
this.mkAig(expr, this.frameStarts[top]);
|
|
525
|
+
this.popFrame();
|
|
526
|
+
}
|
|
527
|
+
const result = this.results[this.results.length - 1];
|
|
528
|
+
this.results.pop();
|
|
529
|
+
this.aigs.decRefResult(result);
|
|
530
|
+
return result;
|
|
531
|
+
}
|
|
532
|
+
|
|
533
|
+
private popFrame() {
|
|
534
|
+
this.frameExprs.pop();
|
|
535
|
+
this.frameIndexes.pop();
|
|
536
|
+
this.frameStarts.pop();
|
|
537
|
+
}
|
|
538
|
+
}
|
|
539
|
+
|
|
540
|
+
class MaxSharing {
|
|
541
|
+
private readonly frameNodes: number[] = [];
|
|
542
|
+
private readonly frameIndexes: number[] = [];
|
|
543
|
+
private readonly results: number[] = [];
|
|
544
|
+
private cache = new Int32Array(0);
|
|
545
|
+
private readonly saved: number[] = [];
|
|
546
|
+
|
|
547
|
+
constructor(private readonly aigs: AigManager) {}
|
|
548
|
+
|
|
549
|
+
private pushResult(lit: number) {
|
|
550
|
+
this.results.push(lit);
|
|
551
|
+
if (lit !== NULL_LIT) this.aigs.incRef(lit);
|
|
552
|
+
}
|
|
553
|
+
|
|
554
|
+
private isCached(node: number) {
|
|
555
|
+
if (this.aigs.refCounts[node] <= 1) return false;
|
|
556
|
+
const lit = node >> 1 < this.cache.length ? this.cache[node >> 1] : NULL_LIT;
|
|
557
|
+
if (lit === NULL_LIT) return false;
|
|
558
|
+
this.pushResult(lit);
|
|
559
|
+
return true;
|
|
560
|
+
}
|
|
561
|
+
|
|
562
|
+
private visit(node: number) {
|
|
563
|
+
if (isVar(node)) {
|
|
564
|
+
this.pushResult(NULL_LIT);
|
|
565
|
+
return true;
|
|
566
|
+
}
|
|
567
|
+
if (this.isCached(node)) return true;
|
|
568
|
+
this.frameNodes.push(node);
|
|
569
|
+
this.frameIndexes.push(0);
|
|
570
|
+
return false;
|
|
571
|
+
}
|
|
572
|
+
|
|
573
|
+
private saveResult(original: number, lit: number) {
|
|
574
|
+
const aigs = this.aigs;
|
|
575
|
+
if (aigs.refCounts[original] > 1) {
|
|
576
|
+
const index = original >> 1;
|
|
577
|
+
if (index >= this.cache.length)
|
|
578
|
+
this.cache = getGrown(this.cache, Math.max(index + 1, 2 * this.cache.length), NULL_LIT);
|
|
579
|
+
this.cache[index] = lit;
|
|
580
|
+
this.saved.push(original, lit >> 1);
|
|
581
|
+
aigs.incRef(2 * original);
|
|
582
|
+
aigs.incRef(lit);
|
|
583
|
+
}
|
|
584
|
+
this.pushResult(original === lit >> 1 ? NULL_LIT : lit);
|
|
585
|
+
}
|
|
586
|
+
|
|
587
|
+
private pop2Results() {
|
|
588
|
+
const size = this.results.length;
|
|
589
|
+
const first = this.results[size - 1];
|
|
590
|
+
const second = this.results[size - 2];
|
|
591
|
+
this.results.length = size - 2;
|
|
592
|
+
if (first !== NULL_LIT) this.aigs.decRef(first);
|
|
593
|
+
if (second !== NULL_LIT) this.aigs.decRef(second);
|
|
594
|
+
}
|
|
595
|
+
|
|
596
|
+
private improveSharingLeft(original: number, lit: number) {
|
|
597
|
+
const aigs = this.aigs;
|
|
598
|
+
const leftNode = aigs.lefts[lit >> 1] >> 1;
|
|
599
|
+
const a = aigs.lefts[leftNode];
|
|
600
|
+
const b = aigs.rights[leftNode];
|
|
601
|
+
const c = aigs.rights[lit >> 1];
|
|
602
|
+
return (
|
|
603
|
+
this.tryShared(original, lit, b, c, a, false) || this.tryShared(original, lit, a, c, b, false)
|
|
604
|
+
);
|
|
605
|
+
}
|
|
606
|
+
|
|
607
|
+
private improveSharingRight(original: number, lit: number) {
|
|
608
|
+
const aigs = this.aigs;
|
|
609
|
+
const a = aigs.lefts[lit >> 1];
|
|
610
|
+
const rightNode = aigs.rights[lit >> 1] >> 1;
|
|
611
|
+
const b = aigs.lefts[rightNode];
|
|
612
|
+
const c = aigs.rights[rightNode];
|
|
613
|
+
return (
|
|
614
|
+
this.tryShared(original, lit, a, b, c, true) || this.tryShared(original, lit, a, c, b, true)
|
|
615
|
+
);
|
|
616
|
+
}
|
|
617
|
+
|
|
618
|
+
private tryShared(
|
|
619
|
+
original: number,
|
|
620
|
+
lit: number,
|
|
621
|
+
first: number,
|
|
622
|
+
second: number,
|
|
623
|
+
rest: number,
|
|
624
|
+
isInnerLeft: boolean,
|
|
625
|
+
) {
|
|
626
|
+
const aigs = this.aigs;
|
|
627
|
+
const inner = aigs.mkAnd(first, second);
|
|
628
|
+
aigs.incRef(inner);
|
|
629
|
+
const isShared = aigs.refCounts[inner >> 1] > 1;
|
|
630
|
+
if (isShared) {
|
|
631
|
+
const result = isInnerLeft ? aigs.mkAnd(inner, rest) : aigs.mkAnd(rest, inner);
|
|
632
|
+
this.saveResult(original, isInverted(lit) ? result ^ 1 : result);
|
|
633
|
+
}
|
|
634
|
+
aigs.decRef(inner);
|
|
635
|
+
return isShared;
|
|
636
|
+
}
|
|
637
|
+
|
|
638
|
+
private improveSharingCore(original: number, lit: number) {
|
|
639
|
+
const aigs = this.aigs;
|
|
640
|
+
const node = lit >> 1;
|
|
641
|
+
if (!isVar(node)) {
|
|
642
|
+
const left = aigs.lefts[node];
|
|
643
|
+
if (
|
|
644
|
+
!isInverted(left) &&
|
|
645
|
+
aigs.refCounts[left >> 1] === 1 &&
|
|
646
|
+
!isVar(left >> 1) &&
|
|
647
|
+
this.improveSharingLeft(original, lit)
|
|
648
|
+
)
|
|
649
|
+
return;
|
|
650
|
+
const right = aigs.rights[node];
|
|
651
|
+
if (
|
|
652
|
+
!isInverted(right) &&
|
|
653
|
+
aigs.refCounts[right >> 1] === 1 &&
|
|
654
|
+
!isVar(right >> 1) &&
|
|
655
|
+
this.improveSharingRight(original, lit)
|
|
656
|
+
)
|
|
657
|
+
return;
|
|
658
|
+
}
|
|
659
|
+
this.saveResult(original, lit);
|
|
660
|
+
}
|
|
661
|
+
|
|
662
|
+
private improveSharing(node: number) {
|
|
663
|
+
const aigs = this.aigs;
|
|
664
|
+
const size = this.results.length;
|
|
665
|
+
const newLeft = this.results[size - 2];
|
|
666
|
+
const newRight = this.results[size - 1];
|
|
667
|
+
if (newLeft === NULL_LIT && newRight === NULL_LIT) {
|
|
668
|
+
this.pop2Results();
|
|
669
|
+
this.improveSharingCore(node, 2 * node);
|
|
670
|
+
return;
|
|
671
|
+
}
|
|
672
|
+
const oldLeft = aigs.lefts[node];
|
|
673
|
+
const oldRight = aigs.rights[node];
|
|
674
|
+
const left = newLeft === NULL_LIT ? oldLeft : newLeft ^ (oldLeft & 1);
|
|
675
|
+
const right = newRight === NULL_LIT ? oldRight : newRight ^ (oldRight & 1);
|
|
676
|
+
const lit = aigs.mkAnd(left, right);
|
|
677
|
+
aigs.incRef(lit);
|
|
678
|
+
this.pop2Results();
|
|
679
|
+
this.improveSharingCore(node, lit);
|
|
680
|
+
aigs.decRef(lit);
|
|
681
|
+
}
|
|
682
|
+
|
|
683
|
+
private process(root: number) {
|
|
684
|
+
if (this.visit(root)) return;
|
|
685
|
+
while (this.frameNodes.length > 0) {
|
|
686
|
+
const top = this.frameNodes.length - 1;
|
|
687
|
+
const node = this.frameNodes[top];
|
|
688
|
+
if (this.frameIndexes[top] === 0) {
|
|
689
|
+
this.frameIndexes[top]++;
|
|
690
|
+
if (!this.visit(this.aigs.lefts[node] >> 1)) continue;
|
|
691
|
+
}
|
|
692
|
+
if (this.frameIndexes[top] === 1) {
|
|
693
|
+
this.frameIndexes[top]++;
|
|
694
|
+
if (!this.visit(this.aigs.rights[node] >> 1)) continue;
|
|
695
|
+
}
|
|
696
|
+
if (!this.isCached(node)) this.improveSharing(node);
|
|
697
|
+
this.frameNodes.pop();
|
|
698
|
+
this.frameIndexes.pop();
|
|
699
|
+
}
|
|
700
|
+
}
|
|
701
|
+
|
|
702
|
+
apply(lit: number) {
|
|
703
|
+
const aigs = this.aigs;
|
|
704
|
+
this.process(lit >> 1);
|
|
705
|
+
const top = this.results[this.results.length - 1];
|
|
706
|
+
this.cache = new Int32Array(0);
|
|
707
|
+
for (const node of this.saved) aigs.decRef(2 * node);
|
|
708
|
+
this.saved.length = 0;
|
|
709
|
+
const result = top === NULL_LIT ? lit : top ^ (lit & 1);
|
|
710
|
+
if (top === NULL_LIT) aigs.incRef(result);
|
|
711
|
+
this.results.pop();
|
|
712
|
+
aigs.decRefResult(result);
|
|
713
|
+
return result;
|
|
714
|
+
}
|
|
715
|
+
}
|
|
716
|
+
|
|
717
|
+
class Aig2Expr {
|
|
718
|
+
private readonly cache: RefVector;
|
|
719
|
+
private readonly frameNodes: number[] = [];
|
|
720
|
+
private readonly frameKinds: number[] = [];
|
|
721
|
+
private readonly frameIsFirst: boolean[] = [];
|
|
722
|
+
private readonly andChildren: number[] = [];
|
|
723
|
+
private readonly andTodo: number[] = [];
|
|
724
|
+
|
|
725
|
+
constructor(private readonly aigs: AigManager) {
|
|
726
|
+
this.cache = new RefVector(aigs.manager);
|
|
727
|
+
}
|
|
728
|
+
|
|
729
|
+
release() {
|
|
730
|
+
this.cache.reset();
|
|
731
|
+
}
|
|
732
|
+
|
|
733
|
+
private getCachedNode(node: number) {
|
|
734
|
+
return this.cache.items[node >> 1];
|
|
735
|
+
}
|
|
736
|
+
|
|
737
|
+
private getNodeExpr(node: number) {
|
|
738
|
+
return isVar(node) ? this.aigs.varExprs.items[node >> 1] : this.getCachedNode(node);
|
|
739
|
+
}
|
|
740
|
+
|
|
741
|
+
private invert(expr: number) {
|
|
742
|
+
const manager = this.aigs.manager;
|
|
743
|
+
if (manager.isNot(expr)) return manager.getArg(expr, 0);
|
|
744
|
+
if (manager.isTrue(expr)) return manager.falseExpr;
|
|
745
|
+
return manager.mkApp(OP_NOT, [expr], SORT_BOOL);
|
|
746
|
+
}
|
|
747
|
+
|
|
748
|
+
private getLitExpr(lit: number) {
|
|
749
|
+
const expr = this.getNodeExpr(lit >> 1);
|
|
750
|
+
return isInverted(lit) ? this.invert(expr) : expr;
|
|
751
|
+
}
|
|
752
|
+
|
|
753
|
+
private isCached(node: number) {
|
|
754
|
+
if (isVar(node)) return true;
|
|
755
|
+
if (node >> 1 >= this.cache.size) {
|
|
756
|
+
this.cache.resize((node >> 1) + 1);
|
|
757
|
+
return false;
|
|
758
|
+
}
|
|
759
|
+
return this.getCachedNode(node) !== -1;
|
|
760
|
+
}
|
|
761
|
+
|
|
762
|
+
private pushFrame(node: number, kind: number) {
|
|
763
|
+
this.frameNodes.push(node);
|
|
764
|
+
this.frameKinds.push(kind);
|
|
765
|
+
this.frameIsFirst.push(true);
|
|
766
|
+
return 1;
|
|
767
|
+
}
|
|
768
|
+
|
|
769
|
+
private visitAndChild(lit: number) {
|
|
770
|
+
const node = lit >> 1;
|
|
771
|
+
if (this.isCached(node)) return 0;
|
|
772
|
+
if (this.aigs.isIte(node)) return this.pushFrame(node, AIG_ITE);
|
|
773
|
+
if (!isInverted(lit) && this.aigs.refCounts[node] === 1)
|
|
774
|
+
return this.pushFrame(node, AIG_AUX_AND);
|
|
775
|
+
return this.pushFrame(node, AIG_AND);
|
|
776
|
+
}
|
|
777
|
+
|
|
778
|
+
private visitIteChild(lit: number) {
|
|
779
|
+
const node = lit >> 1;
|
|
780
|
+
if (this.isCached(node)) return 0;
|
|
781
|
+
return this.pushFrame(node, this.aigs.isIte(node) ? AIG_ITE : AIG_AND);
|
|
782
|
+
}
|
|
783
|
+
|
|
784
|
+
private addChild(lit: number) {
|
|
785
|
+
const node = lit >> 1;
|
|
786
|
+
if (isInverted(lit)) this.andChildren.push(this.getNodeExpr(node));
|
|
787
|
+
else if (this.isCached(node)) this.andChildren.push(this.invert(this.getNodeExpr(node)));
|
|
788
|
+
else this.andTodo.push(node);
|
|
789
|
+
}
|
|
790
|
+
|
|
791
|
+
private mkAnd(node: number) {
|
|
792
|
+
const aigs = this.aigs;
|
|
793
|
+
this.andChildren.length = 0;
|
|
794
|
+
this.andTodo.length = 0;
|
|
795
|
+
this.addChild(aigs.lefts[node]);
|
|
796
|
+
this.addChild(aigs.rights[node]);
|
|
797
|
+
for (let todo = this.andTodo.pop(); todo !== undefined; todo = this.andTodo.pop()) {
|
|
798
|
+
this.addChild(aigs.lefts[todo]);
|
|
799
|
+
this.addChild(aigs.rights[todo]);
|
|
800
|
+
}
|
|
801
|
+
const manager = aigs.manager;
|
|
802
|
+
const disjunction = manager.mkApp(OP_OR, this.andChildren, SORT_BOOL);
|
|
803
|
+
this.cache.set(node >> 1, manager.mkApp(OP_NOT, [disjunction], SORT_BOOL));
|
|
804
|
+
}
|
|
805
|
+
|
|
806
|
+
private mkIte(node: number) {
|
|
807
|
+
const aigs = this.aigs;
|
|
808
|
+
const manager = aigs.manager;
|
|
809
|
+
aigs.isIte(node);
|
|
810
|
+
const isSwapped = isInverted(aigs.iteCond);
|
|
811
|
+
const cond = aigs.iteCond & ~1;
|
|
812
|
+
const then = isSwapped ? aigs.iteElse : aigs.iteThen;
|
|
813
|
+
const otherwise = isSwapped ? aigs.iteThen : aigs.iteElse;
|
|
814
|
+
const condExpr = this.getLitExpr(cond);
|
|
815
|
+
const thenExpr = this.getLitExpr(then);
|
|
816
|
+
this.cache.set(
|
|
817
|
+
node >> 1,
|
|
818
|
+
isNotEq(then, otherwise)
|
|
819
|
+
? manager.mkEq(condExpr, thenExpr)
|
|
820
|
+
: manager.mkApp(OP_ITE, [condExpr, thenExpr, this.getLitExpr(otherwise)], SORT_BOOL),
|
|
821
|
+
);
|
|
822
|
+
}
|
|
823
|
+
|
|
824
|
+
private processRoot(root: number) {
|
|
825
|
+
const aigs = this.aigs;
|
|
826
|
+
if (this.isCached(root)) return this.getNodeExpr(root);
|
|
827
|
+
this.pushFrame(root, aigs.isIte(root) ? AIG_ITE : AIG_AND);
|
|
828
|
+
while (this.frameNodes.length > 0) {
|
|
829
|
+
aigs.manager.limit.checkpoint();
|
|
830
|
+
const top = this.frameNodes.length - 1;
|
|
831
|
+
const node = this.frameNodes[top];
|
|
832
|
+
if (this.isCached(node)) {
|
|
833
|
+
this.popFrame();
|
|
834
|
+
continue;
|
|
835
|
+
}
|
|
836
|
+
const kind = this.frameKinds[top];
|
|
837
|
+
if (this.frameIsFirst[top]) {
|
|
838
|
+
this.frameIsFirst[top] = false;
|
|
839
|
+
if (kind !== AIG_ITE) {
|
|
840
|
+
const pushed =
|
|
841
|
+
this.visitAndChild(aigs.lefts[node]) + this.visitAndChild(aigs.rights[node]);
|
|
842
|
+
if (pushed > 0) continue;
|
|
843
|
+
} else {
|
|
844
|
+
const leftNode = aigs.lefts[node] >> 1;
|
|
845
|
+
const rightNode = aigs.rights[node] >> 1;
|
|
846
|
+
const a = aigs.lefts[leftNode];
|
|
847
|
+
const b = aigs.rights[leftNode];
|
|
848
|
+
const c = aigs.lefts[rightNode];
|
|
849
|
+
const d = aigs.rights[rightNode];
|
|
850
|
+
const isNew = (lit: number) => lit >> 1 !== a >> 1 && lit >> 1 !== b >> 1;
|
|
851
|
+
const pushed =
|
|
852
|
+
this.visitIteChild(a) +
|
|
853
|
+
this.visitIteChild(b) +
|
|
854
|
+
(isNew(c) ? this.visitIteChild(c) : 0) +
|
|
855
|
+
(isNew(d) ? this.visitIteChild(d) : 0);
|
|
856
|
+
if (pushed > 0) continue;
|
|
857
|
+
}
|
|
858
|
+
}
|
|
859
|
+
if (kind === AIG_AND) this.mkAnd(node);
|
|
860
|
+
else if (kind === AIG_ITE) this.mkIte(node);
|
|
861
|
+
this.popFrame();
|
|
862
|
+
}
|
|
863
|
+
return this.getNodeExpr(root);
|
|
864
|
+
}
|
|
865
|
+
|
|
866
|
+
private popFrame() {
|
|
867
|
+
this.frameNodes.pop();
|
|
868
|
+
this.frameKinds.pop();
|
|
869
|
+
this.frameIsFirst.pop();
|
|
870
|
+
}
|
|
871
|
+
|
|
872
|
+
convert(lit: number) {
|
|
873
|
+
const aigs = this.aigs;
|
|
874
|
+
const manager = aigs.manager;
|
|
875
|
+
const roots = [lit];
|
|
876
|
+
const conjuncts = new RefVector(manager);
|
|
877
|
+
for (let current = roots.pop(); current !== undefined; current = roots.pop()) {
|
|
878
|
+
const node = current >> 1;
|
|
879
|
+
if (isInverted(current)) conjuncts.push(this.invert(this.processRoot(node)));
|
|
880
|
+
else if (aigs.isIte(node)) conjuncts.push(this.processRoot(node));
|
|
881
|
+
else if (isVar(node)) conjuncts.push(aigs.varExprs.items[node >> 1]);
|
|
882
|
+
else roots.push(aigs.lefts[node], aigs.rights[node]);
|
|
883
|
+
}
|
|
884
|
+
const result = manager.mkAnd(conjuncts.items);
|
|
885
|
+
manager.incRef(result);
|
|
886
|
+
conjuncts.reset();
|
|
887
|
+
return result;
|
|
888
|
+
}
|
|
889
|
+
}
|