tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
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 +37 -0
- package/dist/index.d.ts +37 -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 +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- 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 +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- 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/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- 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 +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- 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 +908 -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 +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 +67 -16
- 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 +122 -64
- 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 +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 +236 -45
- 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 +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 +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 +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 +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 +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/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- 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 +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- 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 +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- 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 +136 -338
- 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,640 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
OP_EXTRACT,
|
|
4
|
+
OP_FPA_ABS,
|
|
5
|
+
OP_FPA_ADD,
|
|
6
|
+
OP_FPA_BV2RM,
|
|
7
|
+
OP_FPA_BVWRAP,
|
|
8
|
+
OP_FPA_DIV,
|
|
9
|
+
OP_FPA_EQ,
|
|
10
|
+
OP_FPA_FMA,
|
|
11
|
+
OP_FPA_FP,
|
|
12
|
+
OP_FPA_GE,
|
|
13
|
+
OP_FPA_GT,
|
|
14
|
+
OP_FPA_IS_INF,
|
|
15
|
+
OP_FPA_IS_NAN,
|
|
16
|
+
OP_FPA_IS_NEGATIVE,
|
|
17
|
+
OP_FPA_IS_NORMAL,
|
|
18
|
+
OP_FPA_IS_POSITIVE,
|
|
19
|
+
OP_FPA_IS_SUBNORMAL,
|
|
20
|
+
OP_FPA_IS_ZERO,
|
|
21
|
+
OP_FPA_LE,
|
|
22
|
+
OP_FPA_LT,
|
|
23
|
+
OP_FPA_MAX,
|
|
24
|
+
OP_FPA_MAX_I,
|
|
25
|
+
OP_FPA_MIN,
|
|
26
|
+
OP_FPA_MIN_I,
|
|
27
|
+
OP_FPA_MUL,
|
|
28
|
+
OP_FPA_NEG,
|
|
29
|
+
OP_FPA_REM,
|
|
30
|
+
OP_FPA_ROUND_TO_INTEGRAL,
|
|
31
|
+
OP_FPA_SQRT,
|
|
32
|
+
OP_FPA_SUB,
|
|
33
|
+
OP_FPA_TO_FP,
|
|
34
|
+
OP_FPA_TO_FP_UNSIGNED,
|
|
35
|
+
OP_FPA_TO_IEEE_BV,
|
|
36
|
+
OP_FPA_TO_IEEE_BV_I,
|
|
37
|
+
OP_FPA_TO_REAL,
|
|
38
|
+
OP_FPA_TO_REAL_I,
|
|
39
|
+
OP_FPA_TO_SBV,
|
|
40
|
+
OP_FPA_TO_SBV_I,
|
|
41
|
+
OP_FPA_TO_UBV,
|
|
42
|
+
OP_FPA_TO_UBV_I,
|
|
43
|
+
OP_GE,
|
|
44
|
+
OP_GT,
|
|
45
|
+
OP_ITE,
|
|
46
|
+
OP_LE,
|
|
47
|
+
OP_LT,
|
|
48
|
+
OP_NUM,
|
|
49
|
+
OP_TO_REAL,
|
|
50
|
+
SORT_BOOL,
|
|
51
|
+
SORT_INT,
|
|
52
|
+
SORT_REAL,
|
|
53
|
+
} from "./ast";
|
|
54
|
+
import {
|
|
55
|
+
BV_RM_TIES_TO_AWAY,
|
|
56
|
+
BV_RM_TIES_TO_EVEN,
|
|
57
|
+
BV_RM_TO_NEGATIVE,
|
|
58
|
+
BV_RM_TO_POSITIVE,
|
|
59
|
+
getFpNumeral,
|
|
60
|
+
getRmNumeral,
|
|
61
|
+
mkFpaApp,
|
|
62
|
+
mkFpNumeral,
|
|
63
|
+
mkRmNumeral,
|
|
64
|
+
} from "./fpa-decl-plugin";
|
|
65
|
+
import {
|
|
66
|
+
isDenormal,
|
|
67
|
+
isInf,
|
|
68
|
+
isNan,
|
|
69
|
+
isNeg,
|
|
70
|
+
isNormal,
|
|
71
|
+
isZero,
|
|
72
|
+
type Mpf,
|
|
73
|
+
MPF_ROUND_NEAREST_TAWAY,
|
|
74
|
+
MPF_ROUND_NEAREST_TEVEN,
|
|
75
|
+
MPF_ROUND_TOWARD_NEGATIVE,
|
|
76
|
+
MPF_ROUND_TOWARD_POSITIVE,
|
|
77
|
+
MPF_ROUND_TOWARD_ZERO,
|
|
78
|
+
mkInf,
|
|
79
|
+
mkMaxExp,
|
|
80
|
+
mkMaxValue,
|
|
81
|
+
mkMpf,
|
|
82
|
+
mkNan,
|
|
83
|
+
mkZero,
|
|
84
|
+
mpfAdd,
|
|
85
|
+
mpfDiv,
|
|
86
|
+
mpfEq,
|
|
87
|
+
mpfFma,
|
|
88
|
+
mpfFromRational,
|
|
89
|
+
mpfLe,
|
|
90
|
+
mpfLt,
|
|
91
|
+
mpfMaximum,
|
|
92
|
+
mpfMinimum,
|
|
93
|
+
mpfMul,
|
|
94
|
+
mpfNeg,
|
|
95
|
+
mpfRem,
|
|
96
|
+
mpfRoundToIntegral,
|
|
97
|
+
mpfSqrt,
|
|
98
|
+
mpfToFormat,
|
|
99
|
+
mpfToIeeeBv,
|
|
100
|
+
mpfToRational,
|
|
101
|
+
mpfToSbv,
|
|
102
|
+
unbiasExp,
|
|
103
|
+
} from "./mpf";
|
|
104
|
+
import { Rational } from "./rational";
|
|
105
|
+
import type { Rewrite } from "./rewriter-tpl";
|
|
106
|
+
|
|
107
|
+
type Result = number | Rewrite | undefined;
|
|
108
|
+
|
|
109
|
+
const rewrite = (expr: number, depth: number): Rewrite => ({ expr, depth });
|
|
110
|
+
|
|
111
|
+
const BR_REWRITE_FULL = 4;
|
|
112
|
+
|
|
113
|
+
const getFloatSortOf = (manager: AstManager, expr: number) => {
|
|
114
|
+
const sort = manager.sorts[expr];
|
|
115
|
+
return { ebits: manager.getEbits(sort), sbits: manager.getSbits(sort) };
|
|
116
|
+
};
|
|
117
|
+
|
|
118
|
+
const getArithNumeral = (manager: AstManager, expr: number) =>
|
|
119
|
+
manager.getOp(expr) === OP_NUM ? manager.getRationalValue(expr) : undefined;
|
|
120
|
+
|
|
121
|
+
const getBvNumeral = (manager: AstManager, expr: number) =>
|
|
122
|
+
manager.isBvNumeral(expr) ? manager.getBvNumeralValue(expr) : undefined;
|
|
123
|
+
|
|
124
|
+
const isNanExpr = (manager: AstManager, expr: number) => {
|
|
125
|
+
const value = getFpNumeral(manager, expr);
|
|
126
|
+
return value !== undefined && isNan(value);
|
|
127
|
+
};
|
|
128
|
+
|
|
129
|
+
const isInfExpr = (manager: AstManager, expr: number, sign: boolean) => {
|
|
130
|
+
const value = getFpNumeral(manager, expr);
|
|
131
|
+
return value !== undefined && isInf(value) && value.sign === sign;
|
|
132
|
+
};
|
|
133
|
+
|
|
134
|
+
const mkBool = (manager: AstManager, value: boolean) =>
|
|
135
|
+
value ? manager.trueExpr : manager.falseExpr;
|
|
136
|
+
|
|
137
|
+
const mkFromBits = (ebits: number, sbits: number, sign: boolean, biased: bigint, sig: bigint) =>
|
|
138
|
+
mkMpf(ebits, sbits, sign, unbiasExp(ebits, Number(biased)), sig);
|
|
139
|
+
|
|
140
|
+
const mkToFp = (manager: AstManager, decl: number, args: number[]): Result => {
|
|
141
|
+
const parameters = manager.funcDecls[decl].parameters;
|
|
142
|
+
const ebits = parameters[0];
|
|
143
|
+
const sbits = parameters[1];
|
|
144
|
+
if (args.length === 1) {
|
|
145
|
+
const bits = getBvNumeral(manager, args[0]);
|
|
146
|
+
if (bits === undefined) return undefined;
|
|
147
|
+
const sig = bits % (1n << BigInt(sbits - 1));
|
|
148
|
+
const rest = bits / (1n << BigInt(sbits - 1));
|
|
149
|
+
const exponent = rest % (1n << BigInt(ebits));
|
|
150
|
+
return mkFpNumeral(
|
|
151
|
+
manager,
|
|
152
|
+
mkFromBits(ebits, sbits, rest / (1n << BigInt(ebits)) !== 0n, exponent, sig),
|
|
153
|
+
);
|
|
154
|
+
}
|
|
155
|
+
if (args.length === 2) {
|
|
156
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
157
|
+
if (rm === undefined) return undefined;
|
|
158
|
+
const real = getArithNumeral(manager, args[1]);
|
|
159
|
+
if (real !== undefined)
|
|
160
|
+
return mkFpNumeral(manager, mpfFromRational(ebits, sbits, rm, 0n, real));
|
|
161
|
+
const float = getFpNumeral(manager, args[1]);
|
|
162
|
+
if (float !== undefined) return mkFpNumeral(manager, mpfToFormat(ebits, sbits, rm, float));
|
|
163
|
+
const bits = getBvNumeral(manager, args[1]);
|
|
164
|
+
if (bits === undefined) return undefined;
|
|
165
|
+
const width = manager.getBvSize(manager.sorts[args[1]]);
|
|
166
|
+
const signed = bits >= 1n << BigInt(width - 1) ? bits - (1n << BigInt(width)) : bits;
|
|
167
|
+
return mkFpNumeral(manager, mpfFromRational(ebits, sbits, rm, 0n, Rational.of(signed)));
|
|
168
|
+
}
|
|
169
|
+
if (args.length !== 3) return undefined;
|
|
170
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
171
|
+
const isRealInt = manager.sorts[args[1]] === SORT_REAL && manager.sorts[args[2]] === SORT_INT;
|
|
172
|
+
const isIntReal = manager.sorts[args[1]] === SORT_INT && manager.sorts[args[2]] === SORT_REAL;
|
|
173
|
+
if (rm !== undefined && (isRealInt || isIntReal)) {
|
|
174
|
+
const first = getArithNumeral(manager, args[1]);
|
|
175
|
+
const second = getArithNumeral(manager, args[2]);
|
|
176
|
+
if (first === undefined || second === undefined) return undefined;
|
|
177
|
+
const exponent = isRealInt ? second : first;
|
|
178
|
+
const significand = isRealInt ? first : second;
|
|
179
|
+
return mkFpNumeral(manager, mpfFromRational(ebits, sbits, rm, exponent.num, significand));
|
|
180
|
+
}
|
|
181
|
+
const sign = getBvNumeral(manager, args[0]);
|
|
182
|
+
const exponent = getBvNumeral(manager, args[1]);
|
|
183
|
+
const sig = getBvNumeral(manager, args[2]);
|
|
184
|
+
if (sign === undefined || exponent === undefined || sig === undefined) return undefined;
|
|
185
|
+
const exponentWidth = manager.getBvSize(manager.sorts[args[1]]);
|
|
186
|
+
return mkFpNumeral(
|
|
187
|
+
manager,
|
|
188
|
+
mkFromBits(
|
|
189
|
+
exponentWidth,
|
|
190
|
+
manager.getBvSize(manager.sorts[args[2]]) + 1,
|
|
191
|
+
sign === 1n,
|
|
192
|
+
exponent,
|
|
193
|
+
sig,
|
|
194
|
+
),
|
|
195
|
+
);
|
|
196
|
+
};
|
|
197
|
+
|
|
198
|
+
const mkRmBinary = (
|
|
199
|
+
manager: AstManager,
|
|
200
|
+
args: number[],
|
|
201
|
+
apply: (rm: number, first: Mpf, second: Mpf) => Mpf,
|
|
202
|
+
): Result => {
|
|
203
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
204
|
+
const first = getFpNumeral(manager, args[1]);
|
|
205
|
+
const second = getFpNumeral(manager, args[2]);
|
|
206
|
+
if (rm === undefined || first === undefined || second === undefined) return undefined;
|
|
207
|
+
return mkFpNumeral(manager, apply(rm, first, second));
|
|
208
|
+
};
|
|
209
|
+
|
|
210
|
+
const mkRmUnary = (
|
|
211
|
+
manager: AstManager,
|
|
212
|
+
args: number[],
|
|
213
|
+
apply: (rm: number, value: Mpf) => Mpf,
|
|
214
|
+
): Result => {
|
|
215
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
216
|
+
const value = getFpNumeral(manager, args[1]);
|
|
217
|
+
if (rm === undefined || value === undefined) return undefined;
|
|
218
|
+
return mkFpNumeral(manager, apply(rm, value));
|
|
219
|
+
};
|
|
220
|
+
|
|
221
|
+
const mkNeg = (manager: AstManager, arg: number): Result => {
|
|
222
|
+
if (isNanExpr(manager, arg)) return arg;
|
|
223
|
+
const value = getFpNumeral(manager, arg);
|
|
224
|
+
if (value !== undefined && isInf(value))
|
|
225
|
+
return mkFpNumeral(manager, mkInf(value.ebits, value.sbits, !value.sign));
|
|
226
|
+
if (manager.getOp(arg) === OP_FPA_NEG) return manager.getArg(arg, 0);
|
|
227
|
+
return value === undefined ? undefined : mkFpNumeral(manager, mpfNeg(value));
|
|
228
|
+
};
|
|
229
|
+
|
|
230
|
+
const mkMinMax = (manager: AstManager, args: number[], isMin: boolean): Result => {
|
|
231
|
+
if (isNanExpr(manager, args[0])) return args[1];
|
|
232
|
+
if (isNanExpr(manager, args[1])) return args[0];
|
|
233
|
+
const first = getFpNumeral(manager, args[0]);
|
|
234
|
+
const second = getFpNumeral(manager, args[1]);
|
|
235
|
+
if (first === undefined || second === undefined) return undefined;
|
|
236
|
+
if (isZero(first) && isZero(second) && first.sign !== second.sign) return undefined;
|
|
237
|
+
return mkFpNumeral(manager, isMin ? mpfMinimum(first, second) : mpfMaximum(first, second));
|
|
238
|
+
};
|
|
239
|
+
|
|
240
|
+
const mkFma = (manager: AstManager, args: number[]): Result => {
|
|
241
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
242
|
+
if (rm === undefined) return undefined;
|
|
243
|
+
const values = args.slice(1).map((arg) => getFpNumeral(manager, arg));
|
|
244
|
+
if (values[0] !== undefined && values[1] !== undefined && values[2] !== undefined)
|
|
245
|
+
return mkFpNumeral(manager, mpfFma(rm, values[0], values[1], values[2]));
|
|
246
|
+
const zero =
|
|
247
|
+
values[0] !== undefined && isZero(values[0])
|
|
248
|
+
? { value: values[0], other: args[2] }
|
|
249
|
+
: values[1] !== undefined && isZero(values[1])
|
|
250
|
+
? { value: values[1], other: args[1] }
|
|
251
|
+
: undefined;
|
|
252
|
+
if (zero === undefined) return undefined;
|
|
253
|
+
const addend = args[3];
|
|
254
|
+
const format = getFloatSortOf(manager, addend);
|
|
255
|
+
const nan = mkFpNumeral(manager, mkNan(format.ebits, format.sbits));
|
|
256
|
+
if (isNanExpr(manager, addend)) return nan;
|
|
257
|
+
const other = getFpNumeral(manager, zero.other);
|
|
258
|
+
if (other !== undefined && (isNan(other) || isInf(other))) return nan;
|
|
259
|
+
if (other !== undefined)
|
|
260
|
+
return rewrite(
|
|
261
|
+
mkFpaApp(manager, OP_FPA_ADD, [
|
|
262
|
+
args[0],
|
|
263
|
+
mkFpNumeral(manager, mpfMul(rm, zero.value, other)),
|
|
264
|
+
addend,
|
|
265
|
+
]),
|
|
266
|
+
2,
|
|
267
|
+
);
|
|
268
|
+
const isFinite = manager.mkNot(
|
|
269
|
+
manager.mkOr([
|
|
270
|
+
mkFpaApp(manager, OP_FPA_IS_NAN, [zero.other]),
|
|
271
|
+
mkFpaApp(manager, OP_FPA_IS_INF, [zero.other]),
|
|
272
|
+
]),
|
|
273
|
+
);
|
|
274
|
+
const addendValue = getFpNumeral(manager, addend);
|
|
275
|
+
const sort = manager.sorts[addend];
|
|
276
|
+
if (addendValue !== undefined && !isZero(addendValue) && !isNan(addendValue))
|
|
277
|
+
return rewrite(manager.mkApp(OP_ITE, [isFinite, addend, nan], sort), BR_REWRITE_FULL);
|
|
278
|
+
const positive = mkFpNumeral(manager, mkZero(format.ebits, format.sbits, false));
|
|
279
|
+
const negative = mkFpNumeral(manager, mkZero(format.ebits, format.sbits, true));
|
|
280
|
+
const isOtherNegative = mkFpaApp(manager, OP_FPA_IS_NEGATIVE, [zero.other]);
|
|
281
|
+
const product = manager.mkApp(
|
|
282
|
+
OP_ITE,
|
|
283
|
+
isNeg(zero.value)
|
|
284
|
+
? [isOtherNegative, positive, negative]
|
|
285
|
+
: [isOtherNegative, negative, positive],
|
|
286
|
+
sort,
|
|
287
|
+
);
|
|
288
|
+
return rewrite(
|
|
289
|
+
manager.mkApp(
|
|
290
|
+
OP_ITE,
|
|
291
|
+
[isFinite, mkFpaApp(manager, OP_FPA_ADD, [args[0], product, addend]), nan],
|
|
292
|
+
sort,
|
|
293
|
+
),
|
|
294
|
+
BR_REWRITE_FULL,
|
|
295
|
+
);
|
|
296
|
+
};
|
|
297
|
+
|
|
298
|
+
const mkNeqNan = (manager: AstManager, arg: number) => {
|
|
299
|
+
const format = getFloatSortOf(manager, arg);
|
|
300
|
+
return manager.mkNot(manager.mkEq(arg, mkFpNumeral(manager, mkNan(format.ebits, format.sbits))));
|
|
301
|
+
};
|
|
302
|
+
|
|
303
|
+
const mkLt = (manager: AstManager, first: number, second: number): Result => {
|
|
304
|
+
if (isNanExpr(manager, first) || isNanExpr(manager, second)) return manager.falseExpr;
|
|
305
|
+
if (isInfExpr(manager, first, true))
|
|
306
|
+
return rewrite(
|
|
307
|
+
manager.mkAnd([manager.mkNot(manager.mkEq(second, first)), mkNeqNan(manager, second)]),
|
|
308
|
+
3,
|
|
309
|
+
);
|
|
310
|
+
if (isInfExpr(manager, second, true) || isInfExpr(manager, first, false))
|
|
311
|
+
return manager.falseExpr;
|
|
312
|
+
if (isInfExpr(manager, second, false))
|
|
313
|
+
return rewrite(
|
|
314
|
+
manager.mkAnd([manager.mkNot(manager.mkEq(first, second)), mkNeqNan(manager, first)]),
|
|
315
|
+
3,
|
|
316
|
+
);
|
|
317
|
+
const left = getFpNumeral(manager, first);
|
|
318
|
+
const right = getFpNumeral(manager, second);
|
|
319
|
+
return left === undefined || right === undefined
|
|
320
|
+
? undefined
|
|
321
|
+
: mkBool(manager, mpfLt(left, right));
|
|
322
|
+
};
|
|
323
|
+
|
|
324
|
+
const mkLe = (manager: AstManager, first: number, second: number): Result => {
|
|
325
|
+
if (isNanExpr(manager, first) || isNanExpr(manager, second)) return manager.falseExpr;
|
|
326
|
+
const left = getFpNumeral(manager, first);
|
|
327
|
+
const right = getFpNumeral(manager, second);
|
|
328
|
+
return left === undefined || right === undefined
|
|
329
|
+
? undefined
|
|
330
|
+
: mkBool(manager, mpfLe(left, right));
|
|
331
|
+
};
|
|
332
|
+
|
|
333
|
+
const mkPredicate = (
|
|
334
|
+
manager: AstManager,
|
|
335
|
+
arg: number,
|
|
336
|
+
predicate: (value: Mpf) => boolean,
|
|
337
|
+
): Result => {
|
|
338
|
+
const value = getFpNumeral(manager, arg);
|
|
339
|
+
return value === undefined ? undefined : mkBool(manager, predicate(value));
|
|
340
|
+
};
|
|
341
|
+
|
|
342
|
+
const mkPredicateOfIte = (
|
|
343
|
+
manager: AstManager,
|
|
344
|
+
arg: number,
|
|
345
|
+
predicate: (value: Mpf) => boolean,
|
|
346
|
+
): Result => {
|
|
347
|
+
if (manager.getOp(arg) !== OP_ITE) return undefined;
|
|
348
|
+
const thenValue = getFpNumeral(manager, manager.getArg(arg, 1));
|
|
349
|
+
const elseValue = getFpNumeral(manager, manager.getArg(arg, 2));
|
|
350
|
+
if (thenValue === undefined || elseValue === undefined) return undefined;
|
|
351
|
+
return rewrite(
|
|
352
|
+
manager.mkApp(
|
|
353
|
+
OP_ITE,
|
|
354
|
+
[
|
|
355
|
+
manager.getArg(arg, 0),
|
|
356
|
+
mkBool(manager, predicate(thenValue)),
|
|
357
|
+
mkBool(manager, predicate(elseValue)),
|
|
358
|
+
],
|
|
359
|
+
SORT_BOOL,
|
|
360
|
+
),
|
|
361
|
+
2,
|
|
362
|
+
);
|
|
363
|
+
};
|
|
364
|
+
|
|
365
|
+
const getToFpOfInt = (manager: AstManager, arg: number) => {
|
|
366
|
+
if (manager.getOp(arg) !== OP_FPA_TO_FP || manager.getNumArgs(arg) !== 2) return undefined;
|
|
367
|
+
const rm = getRmNumeral(manager, manager.getArg(arg, 0));
|
|
368
|
+
if (rm === undefined) return undefined;
|
|
369
|
+
const inner = manager.getArg(arg, 1);
|
|
370
|
+
const integer =
|
|
371
|
+
manager.getOp(inner) === OP_TO_REAL
|
|
372
|
+
? manager.sorts[manager.getArg(inner, 0)] === SORT_INT
|
|
373
|
+
? manager.getArg(inner, 0)
|
|
374
|
+
: undefined
|
|
375
|
+
: manager.sorts[inner] === SORT_INT
|
|
376
|
+
? inner
|
|
377
|
+
: undefined;
|
|
378
|
+
if (integer === undefined) return undefined;
|
|
379
|
+
const parameters = manager.funcDecls[manager.decls[arg]].parameters;
|
|
380
|
+
return { rm, ebits: parameters[0], sbits: parameters[1], integer };
|
|
381
|
+
};
|
|
382
|
+
|
|
383
|
+
const mkIsInfOfInt = (
|
|
384
|
+
manager: AstManager,
|
|
385
|
+
rm: number,
|
|
386
|
+
ebits: number,
|
|
387
|
+
sbits: number,
|
|
388
|
+
integer: number,
|
|
389
|
+
) => {
|
|
390
|
+
const maxExp = mkMaxExp(ebits);
|
|
391
|
+
const mkInt = (value: bigint) => manager.mkNumeral(value);
|
|
392
|
+
const mkCompare = (op: number, value: bigint) =>
|
|
393
|
+
manager.mkApp(op, [integer, mkInt(value)], SORT_BOOL);
|
|
394
|
+
const mkAbsGe = (threshold: bigint) =>
|
|
395
|
+
manager.mkOr([mkCompare(OP_GE, threshold), mkCompare(OP_LE, -threshold)]);
|
|
396
|
+
if (sbits > maxExp) {
|
|
397
|
+
const threshold = 1n << BigInt(maxExp + 1);
|
|
398
|
+
return rm === MPF_ROUND_NEAREST_TEVEN || rm === MPF_ROUND_NEAREST_TAWAY
|
|
399
|
+
? mkAbsGe(threshold)
|
|
400
|
+
: rm === MPF_ROUND_TOWARD_POSITIVE
|
|
401
|
+
? mkCompare(OP_GE, threshold)
|
|
402
|
+
: rm === MPF_ROUND_TOWARD_NEGATIVE
|
|
403
|
+
? mkCompare(OP_LE, -threshold)
|
|
404
|
+
: manager.falseExpr;
|
|
405
|
+
}
|
|
406
|
+
// Deviation from Z3: Z3 gives up from an exponent width of 34. From 31, MAX_FINITE is a numeral of
|
|
407
|
+
// 2^30 bits, more than a BigInt holds, so those widths give up too.
|
|
408
|
+
if (ebits > 30) return -1;
|
|
409
|
+
const maxFinite = mpfToRational(mkMaxValue(ebits, sbits, false)).num;
|
|
410
|
+
const halfUlp = 1n << BigInt(maxExp - sbits);
|
|
411
|
+
return rm === MPF_ROUND_NEAREST_TEVEN || rm === MPF_ROUND_NEAREST_TAWAY
|
|
412
|
+
? mkAbsGe(maxFinite + halfUlp)
|
|
413
|
+
: rm === MPF_ROUND_TOWARD_POSITIVE
|
|
414
|
+
? mkCompare(OP_GT, maxFinite)
|
|
415
|
+
: rm === MPF_ROUND_TOWARD_NEGATIVE
|
|
416
|
+
? mkCompare(OP_LT, -maxFinite)
|
|
417
|
+
: manager.falseExpr;
|
|
418
|
+
};
|
|
419
|
+
|
|
420
|
+
const mkIsNan = (manager: AstManager, arg: number): Result => {
|
|
421
|
+
const folded = mkPredicate(manager, arg, isNan);
|
|
422
|
+
if (folded !== undefined) return folded;
|
|
423
|
+
if (
|
|
424
|
+
manager.getOp(arg) === OP_FPA_TO_FP &&
|
|
425
|
+
manager.getNumArgs(arg) === 2 &&
|
|
426
|
+
(manager.sorts[manager.getArg(arg, 1)] === SORT_REAL ||
|
|
427
|
+
manager.sorts[manager.getArg(arg, 1)] === SORT_INT)
|
|
428
|
+
)
|
|
429
|
+
return manager.falseExpr;
|
|
430
|
+
return mkPredicateOfIte(manager, arg, isNan);
|
|
431
|
+
};
|
|
432
|
+
|
|
433
|
+
const mkIsInf = (manager: AstManager, arg: number): Result => {
|
|
434
|
+
const folded = mkPredicate(manager, arg, isInf);
|
|
435
|
+
if (folded !== undefined) return folded;
|
|
436
|
+
const toFp = getToFpOfInt(manager, arg);
|
|
437
|
+
if (toFp !== undefined) {
|
|
438
|
+
const infCond = mkIsInfOfInt(manager, toFp.rm, toFp.ebits, toFp.sbits, toFp.integer);
|
|
439
|
+
if (infCond !== -1) return rewrite(infCond, BR_REWRITE_FULL);
|
|
440
|
+
}
|
|
441
|
+
return mkPredicateOfIte(manager, arg, isInf);
|
|
442
|
+
};
|
|
443
|
+
|
|
444
|
+
const mkIsNormal = (manager: AstManager, arg: number): Result => {
|
|
445
|
+
const folded = mkPredicate(manager, arg, isNormal);
|
|
446
|
+
if (folded !== undefined) return folded;
|
|
447
|
+
const toFp = getToFpOfInt(manager, arg);
|
|
448
|
+
if (toFp !== undefined) {
|
|
449
|
+
const notZero = manager.mkNot(manager.mkEq(toFp.integer, manager.mkNumeral(0n)));
|
|
450
|
+
const infCond = mkIsInfOfInt(manager, toFp.rm, toFp.ebits, toFp.sbits, toFp.integer);
|
|
451
|
+
if (infCond === -1) return undefined;
|
|
452
|
+
return rewrite(manager.mkAnd([notZero, manager.mkNot(infCond)]), BR_REWRITE_FULL);
|
|
453
|
+
}
|
|
454
|
+
return mkPredicateOfIte(manager, arg, isNormal);
|
|
455
|
+
};
|
|
456
|
+
|
|
457
|
+
const mkToBv = (manager: AstManager, decl: number, args: number[], isSigned: boolean): Result => {
|
|
458
|
+
const width = manager.funcDecls[decl].parameters[0];
|
|
459
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
460
|
+
const value = getFpNumeral(manager, args[1]);
|
|
461
|
+
if (rm === undefined || value === undefined) return undefined;
|
|
462
|
+
if (isNan(value) || isInf(value) || value.exponent >= width) return undefined;
|
|
463
|
+
const integer = mpfToSbv(rm, value);
|
|
464
|
+
const upper = isSigned ? (1n << BigInt(width - 1)) - 1n : (1n << BigInt(width)) - 1n;
|
|
465
|
+
const lower = isSigned ? -(1n << BigInt(width - 1)) : 0n;
|
|
466
|
+
return integer >= lower && integer <= upper ? manager.mkBvNumeral(integer, width) : undefined;
|
|
467
|
+
};
|
|
468
|
+
|
|
469
|
+
const mkBv2rm = (manager: AstManager, arg: number): Result => {
|
|
470
|
+
const value = getBvNumeral(manager, arg);
|
|
471
|
+
if (value === undefined) return undefined;
|
|
472
|
+
const bits = Number(value);
|
|
473
|
+
return mkRmNumeral(
|
|
474
|
+
manager,
|
|
475
|
+
bits === BV_RM_TIES_TO_AWAY
|
|
476
|
+
? MPF_ROUND_NEAREST_TAWAY
|
|
477
|
+
: bits === BV_RM_TIES_TO_EVEN
|
|
478
|
+
? MPF_ROUND_NEAREST_TEVEN
|
|
479
|
+
: bits === BV_RM_TO_NEGATIVE
|
|
480
|
+
? MPF_ROUND_TOWARD_NEGATIVE
|
|
481
|
+
: bits === BV_RM_TO_POSITIVE
|
|
482
|
+
? MPF_ROUND_TOWARD_POSITIVE
|
|
483
|
+
: MPF_ROUND_TOWARD_ZERO,
|
|
484
|
+
);
|
|
485
|
+
};
|
|
486
|
+
|
|
487
|
+
const mkFp = (manager: AstManager, args: number[]): Result => {
|
|
488
|
+
const sign = getBvNumeral(manager, args[0]);
|
|
489
|
+
const exponent = getBvNumeral(manager, args[1]);
|
|
490
|
+
const sig = getBvNumeral(manager, args[2]);
|
|
491
|
+
if (sign === undefined || exponent === undefined || sig === undefined) return undefined;
|
|
492
|
+
const ebits = manager.getBvSize(manager.sorts[args[1]]);
|
|
493
|
+
const sbits = manager.getBvSize(manager.sorts[args[2]]) + 1;
|
|
494
|
+
return mkFpNumeral(manager, mkFromBits(ebits, sbits, sign === 1n, exponent, sig));
|
|
495
|
+
};
|
|
496
|
+
|
|
497
|
+
const mkBvwrap = (manager: AstManager, arg: number): Result => {
|
|
498
|
+
if (manager.getOp(arg) !== OP_FPA_FP) return undefined;
|
|
499
|
+
const parts = [0, 1, 2].map((index) => manager.getArg(arg, index));
|
|
500
|
+
if (!parts.every((part) => manager.getOp(part) === OP_EXTRACT)) return undefined;
|
|
501
|
+
const width = parts.reduce((total, part) => {
|
|
502
|
+
const parameters = manager.funcDecls[manager.decls[part]].parameters;
|
|
503
|
+
return total + parameters[0] - parameters[1] + 1;
|
|
504
|
+
}, 0);
|
|
505
|
+
const format = getFloatSortOf(manager, arg);
|
|
506
|
+
if (width !== format.ebits + format.sbits) return undefined;
|
|
507
|
+
const source = manager.getArg(parts[0], 0);
|
|
508
|
+
return parts.every((part) => manager.getArg(part, 0) === source) &&
|
|
509
|
+
manager.getBvSize(manager.sorts[source]) === width
|
|
510
|
+
? source
|
|
511
|
+
: undefined;
|
|
512
|
+
};
|
|
513
|
+
|
|
514
|
+
export const mkFpaAppCore = (manager: AstManager, decl: number, args: number[]): Result => {
|
|
515
|
+
const op = manager.funcDecls[decl].op;
|
|
516
|
+
switch (op) {
|
|
517
|
+
case OP_FPA_ADD:
|
|
518
|
+
return manager.ids[args[2]] < manager.ids[args[1]]
|
|
519
|
+
? rewrite(mkFpaApp(manager, OP_FPA_ADD, [args[0], args[2], args[1]]), 2)
|
|
520
|
+
: mkRmBinary(manager, args, mpfAdd);
|
|
521
|
+
case OP_FPA_SUB:
|
|
522
|
+
return rewrite(
|
|
523
|
+
mkFpaApp(manager, OP_FPA_ADD, [args[0], args[1], mkFpaApp(manager, OP_FPA_NEG, [args[2]])]),
|
|
524
|
+
2,
|
|
525
|
+
);
|
|
526
|
+
case OP_FPA_NEG:
|
|
527
|
+
return mkNeg(manager, args[0]);
|
|
528
|
+
case OP_FPA_MUL:
|
|
529
|
+
return mkRmBinary(manager, args, mpfMul);
|
|
530
|
+
case OP_FPA_DIV:
|
|
531
|
+
return mkRmBinary(manager, args, mpfDiv);
|
|
532
|
+
case OP_FPA_REM: {
|
|
533
|
+
const first = getFpNumeral(manager, args[0]);
|
|
534
|
+
const second = getFpNumeral(manager, args[1]);
|
|
535
|
+
return first === undefined || second === undefined
|
|
536
|
+
? undefined
|
|
537
|
+
: mkFpNumeral(manager, mpfRem(first, second));
|
|
538
|
+
}
|
|
539
|
+
case OP_FPA_ABS: {
|
|
540
|
+
if (isNanExpr(manager, args[0])) return args[0];
|
|
541
|
+
const value = getFpNumeral(manager, args[0]);
|
|
542
|
+
return value === undefined
|
|
543
|
+
? undefined
|
|
544
|
+
: mkFpNumeral(manager, isNeg(value) ? mpfNeg(value) : value);
|
|
545
|
+
}
|
|
546
|
+
case OP_FPA_MIN:
|
|
547
|
+
case OP_FPA_MIN_I:
|
|
548
|
+
return mkMinMax(manager, args, true);
|
|
549
|
+
case OP_FPA_MAX:
|
|
550
|
+
case OP_FPA_MAX_I:
|
|
551
|
+
return mkMinMax(manager, args, false);
|
|
552
|
+
case OP_FPA_FMA:
|
|
553
|
+
return mkFma(manager, args);
|
|
554
|
+
case OP_FPA_SQRT:
|
|
555
|
+
return mkRmUnary(manager, args, mpfSqrt);
|
|
556
|
+
case OP_FPA_ROUND_TO_INTEGRAL:
|
|
557
|
+
return mkRmUnary(manager, args, mpfRoundToIntegral);
|
|
558
|
+
case OP_FPA_EQ: {
|
|
559
|
+
const first = getFpNumeral(manager, args[0]);
|
|
560
|
+
const second = getFpNumeral(manager, args[1]);
|
|
561
|
+
return first === undefined || second === undefined
|
|
562
|
+
? undefined
|
|
563
|
+
: mkBool(manager, mpfEq(first, second));
|
|
564
|
+
}
|
|
565
|
+
case OP_FPA_LT:
|
|
566
|
+
return mkLt(manager, args[0], args[1]);
|
|
567
|
+
case OP_FPA_GT:
|
|
568
|
+
return rewrite(mkFpaApp(manager, OP_FPA_LT, [args[1], args[0]]), 1);
|
|
569
|
+
case OP_FPA_LE:
|
|
570
|
+
return mkLe(manager, args[0], args[1]);
|
|
571
|
+
case OP_FPA_GE:
|
|
572
|
+
return rewrite(mkFpaApp(manager, OP_FPA_LE, [args[1], args[0]]), 1);
|
|
573
|
+
case OP_FPA_IS_ZERO:
|
|
574
|
+
return mkPredicate(manager, args[0], isZero);
|
|
575
|
+
case OP_FPA_IS_NAN:
|
|
576
|
+
return mkIsNan(manager, args[0]);
|
|
577
|
+
case OP_FPA_IS_INF:
|
|
578
|
+
return mkIsInf(manager, args[0]);
|
|
579
|
+
case OP_FPA_IS_NORMAL:
|
|
580
|
+
return mkIsNormal(manager, args[0]);
|
|
581
|
+
case OP_FPA_IS_SUBNORMAL:
|
|
582
|
+
return mkPredicate(manager, args[0], isDenormal);
|
|
583
|
+
case OP_FPA_IS_NEGATIVE:
|
|
584
|
+
return mkPredicate(manager, args[0], isNeg);
|
|
585
|
+
case OP_FPA_IS_POSITIVE:
|
|
586
|
+
return mkPredicate(manager, args[0], (value) => !isNeg(value) && !isNan(value));
|
|
587
|
+
case OP_FPA_FP:
|
|
588
|
+
return mkFp(manager, args);
|
|
589
|
+
case OP_FPA_TO_FP:
|
|
590
|
+
return mkToFp(manager, decl, args);
|
|
591
|
+
case OP_FPA_TO_FP_UNSIGNED: {
|
|
592
|
+
const parameters = manager.funcDecls[decl].parameters;
|
|
593
|
+
const rm = getRmNumeral(manager, args[0]);
|
|
594
|
+
const bits = getBvNumeral(manager, args[1]);
|
|
595
|
+
return rm === undefined || bits === undefined
|
|
596
|
+
? undefined
|
|
597
|
+
: mkFpNumeral(
|
|
598
|
+
manager,
|
|
599
|
+
mpfFromRational(parameters[0], parameters[1], rm, 0n, Rational.of(bits)),
|
|
600
|
+
);
|
|
601
|
+
}
|
|
602
|
+
case OP_FPA_TO_UBV:
|
|
603
|
+
case OP_FPA_TO_UBV_I:
|
|
604
|
+
return mkToBv(manager, decl, args, false);
|
|
605
|
+
case OP_FPA_TO_SBV:
|
|
606
|
+
case OP_FPA_TO_SBV_I:
|
|
607
|
+
return mkToBv(manager, decl, args, true);
|
|
608
|
+
case OP_FPA_TO_IEEE_BV:
|
|
609
|
+
case OP_FPA_TO_IEEE_BV_I: {
|
|
610
|
+
const value = getFpNumeral(manager, args[0]);
|
|
611
|
+
return value === undefined || isNan(value)
|
|
612
|
+
? undefined
|
|
613
|
+
: manager.mkBvNumeral(mpfToIeeeBv(value), value.ebits + value.sbits);
|
|
614
|
+
}
|
|
615
|
+
case OP_FPA_TO_REAL:
|
|
616
|
+
case OP_FPA_TO_REAL_I: {
|
|
617
|
+
const value = getFpNumeral(manager, args[0]);
|
|
618
|
+
return value === undefined || isNan(value) || isInf(value)
|
|
619
|
+
? undefined
|
|
620
|
+
: manager.mkRealNumeral(mpfToRational(value));
|
|
621
|
+
}
|
|
622
|
+
case OP_FPA_BVWRAP:
|
|
623
|
+
return mkBvwrap(manager, args[0]);
|
|
624
|
+
case OP_FPA_BV2RM:
|
|
625
|
+
return mkBv2rm(manager, args[0]);
|
|
626
|
+
default:
|
|
627
|
+
return undefined;
|
|
628
|
+
}
|
|
629
|
+
};
|
|
630
|
+
|
|
631
|
+
export const mkFpaEqCore = (manager: AstManager, left: number, right: number): Result => {
|
|
632
|
+
const first = getFpNumeral(manager, left);
|
|
633
|
+
const second = getFpNumeral(manager, right);
|
|
634
|
+
if (first === undefined || second === undefined) return undefined;
|
|
635
|
+
return mkBool(
|
|
636
|
+
manager,
|
|
637
|
+
(isNan(first) && isNan(second)) ||
|
|
638
|
+
(!(isZero(first) && isZero(second) && first.sign !== second.sign) && mpfEq(first, second)),
|
|
639
|
+
);
|
|
640
|
+
};
|