tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.702eb98
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 +26 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +515 -0
- package/dist/prove.js +515 -0
- package/dist/run-cli.cjs +30 -47
- package/dist/run-cli.js +30 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +28 -7
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +26 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +27 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +477 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +27 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +29 -0
- package/src/prove/prove.ts +417 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +97 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +13 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +68 -25
- package/src/values.ts +8 -3
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
|
@@ -0,0 +1,221 @@
|
|
|
1
|
+
// Prep.find_meth and Prep.compute_meth: the methods the pragmas an obligation cites select, each a
|
|
2
|
+
// prover with its time limit, or a frontend that rewrites the obligation first. A malformed method
|
|
3
|
+
// throws a TlaProverError, since Prep.ship catches compute_meth's failure and fails only that
|
|
4
|
+
// obligation.
|
|
5
|
+
|
|
6
|
+
import { TlapmBugError, TlaProverError } from "../../errors";
|
|
7
|
+
import type { Expr, Hyp, Locus, Sequent } from "../../obligations/expression";
|
|
8
|
+
import type { OldMethod, PragmaSetting } from "../../obligations/pragma";
|
|
9
|
+
|
|
10
|
+
// A method, named after the Method.t constructor tlapm reports it by. A Z3 resource budget turns
|
|
11
|
+
// the time limit off.
|
|
12
|
+
export interface Method {
|
|
13
|
+
prover: string;
|
|
14
|
+
timeLimitMs: number;
|
|
15
|
+
rlimit?: number;
|
|
16
|
+
tactic?: string;
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
// The methods that rewrite an obligation in Prep.expand_enabled_cdot instead of proving it.
|
|
20
|
+
export const FRONTENDS = new Set([
|
|
21
|
+
"expandenabled",
|
|
22
|
+
"expandcdot",
|
|
23
|
+
"autouse",
|
|
24
|
+
"lambdify",
|
|
25
|
+
"enabledaxioms",
|
|
26
|
+
"levelcomparison",
|
|
27
|
+
]);
|
|
28
|
+
|
|
29
|
+
// Method.default_*_timeout, in seconds.
|
|
30
|
+
const SMT_SECONDS = 5;
|
|
31
|
+
const ZENON_SECONDS = 10;
|
|
32
|
+
const ISABELLE_SECONDS = 30;
|
|
33
|
+
const LS4_SECONDS = 10;
|
|
34
|
+
|
|
35
|
+
// Method.rlimit_base and Method.max_rlimit.
|
|
36
|
+
const RLIMIT_BASE = 3_000_000;
|
|
37
|
+
const MAX_RLIMIT = 0xffff_ffff;
|
|
38
|
+
|
|
39
|
+
// Params.default_method: what tlapm tries when a step cites no prover.
|
|
40
|
+
export const DEFAULT_METHODS: Method[] = [
|
|
41
|
+
{ prover: "smt", timeLimitMs: SMT_SECONDS * 1000 },
|
|
42
|
+
{ prover: "zenon", timeLimitMs: ZENON_SECONDS * 1000 },
|
|
43
|
+
{ prover: "isabelle", timeLimitMs: ISABELLE_SECONDS * 1000, tactic: "auto" },
|
|
44
|
+
];
|
|
45
|
+
|
|
46
|
+
// compute_meth's names for each prover, and the Method.t constructor and default time each
|
|
47
|
+
// selects. The SMT solvers take a resource budget.
|
|
48
|
+
const PROVERS: Record<string, { prover: string; seconds: number; isBudgeted?: boolean }> = {
|
|
49
|
+
zenon: { prover: "zenon", seconds: ZENON_SECONDS },
|
|
50
|
+
isabelle: { prover: "isabelle", seconds: ISABELLE_SECONDS },
|
|
51
|
+
yices: { prover: "yices", seconds: 30 },
|
|
52
|
+
ls4: { prover: "ls4", seconds: LS4_SECONDS },
|
|
53
|
+
z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
|
|
54
|
+
smt: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
|
|
55
|
+
cvc3: { prover: "cvc3", seconds: SMT_SECONDS },
|
|
56
|
+
cooper: { prover: "cooper", seconds: 0 },
|
|
57
|
+
fail: { prover: "fail", seconds: 0 },
|
|
58
|
+
smt2lib: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
|
|
59
|
+
smt2z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
|
|
60
|
+
smt3: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
|
|
61
|
+
z33: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
|
|
62
|
+
cvc33: { prover: "cvc3", seconds: SMT_SECONDS },
|
|
63
|
+
yices3: { prover: "yices", seconds: SMT_SECONDS },
|
|
64
|
+
verit: { prover: "verit", seconds: SMT_SECONDS },
|
|
65
|
+
zipper: { prover: "zipper", seconds: 30 },
|
|
66
|
+
spass: { prover: "spass", seconds: SMT_SECONDS },
|
|
67
|
+
tptp: { prover: "tptp", seconds: SMT_SECONDS },
|
|
68
|
+
trivial: { prover: "trivial", seconds: 0 },
|
|
69
|
+
...Object.fromEntries([...FRONTENDS].map((name) => [name, { prover: name, seconds: 0 }])),
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
const getProverMethod = (
|
|
73
|
+
name: string,
|
|
74
|
+
timeout: number | undefined,
|
|
75
|
+
rlimit: number | undefined,
|
|
76
|
+
tactic: string | undefined,
|
|
77
|
+
): Method => {
|
|
78
|
+
const known = PROVERS[name];
|
|
79
|
+
if (!known) throw new TlaProverError(`Unknown prover: ${name}`);
|
|
80
|
+
if (rlimit !== undefined && !known.isBudgeted)
|
|
81
|
+
throw new TlaProverError(
|
|
82
|
+
'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
|
|
83
|
+
);
|
|
84
|
+
return {
|
|
85
|
+
prover: known.prover,
|
|
86
|
+
timeLimitMs: rlimit === undefined ? (timeout ?? known.seconds) * 1000 : Infinity,
|
|
87
|
+
...(rlimit !== undefined && { rlimit }),
|
|
88
|
+
...(known.prover === "isabelle" && { tactic: tactic ?? "auto" }),
|
|
89
|
+
};
|
|
90
|
+
};
|
|
91
|
+
|
|
92
|
+
// parse_rlimit: "rN" is N times the base resource count, at least 1.
|
|
93
|
+
const getRlimit = (budget: string) => {
|
|
94
|
+
const count = Number.parseFloat(budget.slice(1));
|
|
95
|
+
if (!/^[rR]./.test(budget) || !Number.isFinite(count) || count <= 0)
|
|
96
|
+
throw new TlaProverError(`Invalid SMT budget "${budget}"`);
|
|
97
|
+
return Math.max(1, Math.trunc(Math.min(count * RLIMIT_BASE, MAX_RLIMIT)));
|
|
98
|
+
};
|
|
99
|
+
|
|
100
|
+
// compute_meth: a group of a pragma's settings, where each @ takes the next argument the pragma is
|
|
101
|
+
// applied to.
|
|
102
|
+
const computeMethod = (settings: PragmaSetting[], args: Expr[]): Method => {
|
|
103
|
+
const values = settings.reduce<{
|
|
104
|
+
args: Expr[];
|
|
105
|
+
prover?: string;
|
|
106
|
+
timeout?: number;
|
|
107
|
+
rlimit?: number;
|
|
108
|
+
tactic?: string;
|
|
109
|
+
}>(
|
|
110
|
+
(state, setting) => {
|
|
111
|
+
const value = setting.value;
|
|
112
|
+
const argument = value.kind === "Default" ? state.args[0] : undefined;
|
|
113
|
+
const rest = value.kind === "Default" ? state.args.slice(1) : state.args;
|
|
114
|
+
if (value.kind === "Default" && !argument)
|
|
115
|
+
throw new TlaProverError("Some arguments are missing");
|
|
116
|
+
const text =
|
|
117
|
+
value.kind === "String"
|
|
118
|
+
? value.value
|
|
119
|
+
: argument?.kind === "String"
|
|
120
|
+
? argument.value
|
|
121
|
+
: undefined;
|
|
122
|
+
switch (setting.hint) {
|
|
123
|
+
case "prover":
|
|
124
|
+
case "tactic":
|
|
125
|
+
if (text === undefined) throw new TlaProverError(`This argument should be a string`);
|
|
126
|
+
return { ...state, args: rest, [setting.hint]: text };
|
|
127
|
+
case "timeout": {
|
|
128
|
+
if (value.kind === "Float") return { ...state, args: rest, timeout: value.value };
|
|
129
|
+
if (text !== undefined) return { ...state, args: rest, rlimit: getRlimit(text) };
|
|
130
|
+
if (argument?.kind !== "Num")
|
|
131
|
+
throw new TlaProverError("This argument should be a number of seconds");
|
|
132
|
+
return {
|
|
133
|
+
...state,
|
|
134
|
+
args: rest,
|
|
135
|
+
timeout: Number(`${argument.integer}.${argument.fraction}`),
|
|
136
|
+
};
|
|
137
|
+
}
|
|
138
|
+
default:
|
|
139
|
+
throw new TlaProverError(`Unknown keyword in proof method definition: ${setting.hint}`);
|
|
140
|
+
}
|
|
141
|
+
},
|
|
142
|
+
{ args },
|
|
143
|
+
);
|
|
144
|
+
if (values.args.length > 0) throw new TlaProverError("Too many arguments");
|
|
145
|
+
if (values.prover === undefined) throw new TlaProverError("Missing prover name");
|
|
146
|
+
return getProverMethod(values.prover, values.timeout, values.rlimit, values.tactic);
|
|
147
|
+
};
|
|
148
|
+
|
|
149
|
+
// An old-style method, as Method_prs reads it, with its default time unless it names one.
|
|
150
|
+
const getOldMethod = (method: OldMethod) =>
|
|
151
|
+
getProverMethod(method.name, method.timeout, undefined, method.tactic);
|
|
152
|
+
|
|
153
|
+
type Cited =
|
|
154
|
+
| { kind: "Premeth"; groups: PragmaSetting[][] }
|
|
155
|
+
| { kind: "Meth"; method: OldMethod }
|
|
156
|
+
| undefined;
|
|
157
|
+
|
|
158
|
+
// find_meth: an obligation whose proof names a method keeps it. Otherwise each visible fact that
|
|
159
|
+
// cites a pragma, alone or applied to arguments, adds the methods its groups compute, and each that
|
|
160
|
+
// cites a theorem or carries an old-style method adds that method. A pragma that a fact from
|
|
161
|
+
// another BY or USE cites drops the methods found so far: tlapm compares the USE locations
|
|
162
|
+
// physically, as tla-ts compares the objects.
|
|
163
|
+
const getCitedMethods = (sequent: Sequent) => {
|
|
164
|
+
const cited: Cited[] = [];
|
|
165
|
+
const state: { methods: Method[]; useLocation: Locus | undefined | null } = {
|
|
166
|
+
methods: [],
|
|
167
|
+
useLocation: null,
|
|
168
|
+
};
|
|
169
|
+
sequent.context.forEach((hyp: Hyp, index) => {
|
|
170
|
+
const expression = hyp.kind === "Fact" && hyp.visibility === "Visible" && hyp.expression;
|
|
171
|
+
if (expression && expression.kind === "With") {
|
|
172
|
+
state.methods.push(getOldMethod(expression.method));
|
|
173
|
+
cited.push(undefined);
|
|
174
|
+
return;
|
|
175
|
+
}
|
|
176
|
+
if (hyp.kind === "Defn" && hyp.definition.kind === "Bpragma") {
|
|
177
|
+
cited.push({ kind: "Premeth", groups: hyp.definition.methods });
|
|
178
|
+
return;
|
|
179
|
+
}
|
|
180
|
+
if (hyp.kind === "Defn" && hyp.definition.kind === "Operator" && hyp.visibility === "Visible") {
|
|
181
|
+
const body = hyp.definition.body;
|
|
182
|
+
cited.push(body.kind === "With" ? { kind: "Meth", method: body.method } : undefined);
|
|
183
|
+
return;
|
|
184
|
+
}
|
|
185
|
+
cited.push(undefined);
|
|
186
|
+
if (!expression || hyp.kind !== "Fact") return;
|
|
187
|
+
const operator = expression.kind === "Apply" ? expression.operator : expression;
|
|
188
|
+
if (operator.kind !== "Ix") return;
|
|
189
|
+
const entry = cited[index - operator.index];
|
|
190
|
+
if (entry?.kind === "Premeth") {
|
|
191
|
+
if (hyp.useLocation !== state.useLocation) {
|
|
192
|
+
state.methods = [];
|
|
193
|
+
state.useLocation = hyp.useLocation;
|
|
194
|
+
}
|
|
195
|
+
const args = expression.kind === "Apply" ? expression.args : [];
|
|
196
|
+
state.methods.push(...entry.groups.map((group) => computeMethod(group, args)));
|
|
197
|
+
return;
|
|
198
|
+
}
|
|
199
|
+
if (entry?.kind !== "Meth") return;
|
|
200
|
+
// find_meth asserts that a theorem with a method is not applied to arguments.
|
|
201
|
+
if (expression.kind === "Apply") throw new TlapmBugError();
|
|
202
|
+
state.methods.push(getOldMethod(entry.method));
|
|
203
|
+
});
|
|
204
|
+
return state.methods;
|
|
205
|
+
};
|
|
206
|
+
|
|
207
|
+
// The methods find_meth selects: the frontends to apply, and the provers to try in order, which
|
|
208
|
+
// are tlapm's default ones when the obligation cites only frontends or nothing.
|
|
209
|
+
export const findMethods = (obligation: { sequent: Sequent; method?: OldMethod }) => {
|
|
210
|
+
const methods =
|
|
211
|
+
obligation.method === undefined
|
|
212
|
+
? getCitedMethods(obligation.sequent)
|
|
213
|
+
: [getOldMethod(obligation.method)];
|
|
214
|
+
const provers = methods.filter((method) => !FRONTENDS.has(method.prover));
|
|
215
|
+
return {
|
|
216
|
+
frontends: new Set(
|
|
217
|
+
methods.flatMap((method) => (FRONTENDS.has(method.prover) ? [method.prover] : [])),
|
|
218
|
+
),
|
|
219
|
+
provers: provers.length > 0 ? provers : DEFAULT_METHODS,
|
|
220
|
+
};
|
|
221
|
+
};
|
|
@@ -0,0 +1,22 @@
|
|
|
1
|
+
import {
|
|
2
|
+
applyBuiltin,
|
|
3
|
+
isEqualExpr,
|
|
4
|
+
shiftExpr,
|
|
5
|
+
type Expr,
|
|
6
|
+
type Sequent,
|
|
7
|
+
} from "../../obligations/expression";
|
|
8
|
+
|
|
9
|
+
// Prep.trivial: the goal is TRUE, or find_fact finds it as a hypothesis, visible or not: a fact
|
|
10
|
+
// alpha-equivalent to it, or the x \in S of a declaration NEW x \in S.
|
|
11
|
+
export const isTrivial = (sequent: Sequent) =>
|
|
12
|
+
(sequent.active.kind === "Internal" && sequent.active.builtin === "TRUE") ||
|
|
13
|
+
sequent.context.some((hyp, index) => {
|
|
14
|
+
if (hyp.kind === "Fact")
|
|
15
|
+
return isEqualExpr(hyp.expression, shiftExpr(index - sequent.context.length, sequent.active));
|
|
16
|
+
if (hyp.kind !== "Fresh" || !hyp.domain) return false;
|
|
17
|
+
const variable: Expr = { kind: "Ix", index: 1 };
|
|
18
|
+
return isEqualExpr(
|
|
19
|
+
applyBuiltin("Mem", [variable, shiftExpr(1, hyp.domain)], {}),
|
|
20
|
+
shiftExpr(index + 1 - sequent.context.length, sequent.active),
|
|
21
|
+
);
|
|
22
|
+
});
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
// A worker of the decide pool: it decides each request with the backend its prover selects.
|
|
2
|
+
|
|
3
|
+
import { TlaProverError, TlaUnsupportedError } from "../errors";
|
|
4
|
+
import { getParentPort } from "../worker";
|
|
5
|
+
import { DECIDERS } from "./deciders";
|
|
6
|
+
import type { DecideRequest, DecideResponse } from "./decide-pool";
|
|
7
|
+
|
|
8
|
+
const getResponse = (request: DecideRequest): DecideResponse => {
|
|
9
|
+
try {
|
|
10
|
+
return {
|
|
11
|
+
verdict: DECIDERS[request.prover](request.text, { timeLimitMs: request.timeLimitMs }),
|
|
12
|
+
};
|
|
13
|
+
} catch (error) {
|
|
14
|
+
if (error instanceof TlaProverError) {
|
|
15
|
+
return { error: { name: "TlaProverError", message: error.message } };
|
|
16
|
+
}
|
|
17
|
+
if (error instanceof TlaUnsupportedError) {
|
|
18
|
+
return { error: { name: "TlaUnsupportedError", message: error.message } };
|
|
19
|
+
}
|
|
20
|
+
throw error;
|
|
21
|
+
}
|
|
22
|
+
};
|
|
23
|
+
|
|
24
|
+
void getParentPort().then((parent) => {
|
|
25
|
+
parent.addEventListener("message", (event) =>
|
|
26
|
+
parent.postMessage(getResponse(event.data as DecideRequest)),
|
|
27
|
+
);
|
|
28
|
+
parent.start?.();
|
|
29
|
+
});
|
|
@@ -0,0 +1,417 @@
|
|
|
1
|
+
// Proves a module's obligations with tla-ts's own backends, in tlapm's order, or with tlapm.
|
|
2
|
+
|
|
3
|
+
import { TlaProverError, TlaUnsupportedError } from "../errors";
|
|
4
|
+
import { getChildren, mapHyp, type Expr, type Hyp, type Sequent } from "../obligations/expression";
|
|
5
|
+
import { getObligations, type PrintedObligation } from "../obligations";
|
|
6
|
+
import { isWorkerSupported } from "../worker";
|
|
7
|
+
import { DECIDERS } from "./deciders";
|
|
8
|
+
import { createDecidePool } from "./decide-pool";
|
|
9
|
+
import { encodeIsabelle } from "./isabelle/encode";
|
|
10
|
+
import { processObligation } from "./prep/action";
|
|
11
|
+
import { expandDefs } from "./prep/defs";
|
|
12
|
+
import { normalizeSequent } from "./prep/elab";
|
|
13
|
+
import { expandEnabledCdot } from "./prep/enabled";
|
|
14
|
+
import { getFingerprint } from "./prep/fingerprint";
|
|
15
|
+
import { flatten } from "./prep/flatten";
|
|
16
|
+
import { findMethods, type Method } from "./prep/pragma";
|
|
17
|
+
import { isTrivial } from "./prep/trivial";
|
|
18
|
+
import { encodePtl } from "./ptl/encode";
|
|
19
|
+
import { encodeSmt } from "./smt/encode";
|
|
20
|
+
import type { EncodingSession } from "./smt/rewrite";
|
|
21
|
+
import { encodeZenon } from "./zenon/encode";
|
|
22
|
+
import type { TlapmResult } from "./tlapm/tlapm";
|
|
23
|
+
import { TLAPS_MODULE } from "./tlaps-module";
|
|
24
|
+
import type { DecideOptions, Verdict } from "./verdict";
|
|
25
|
+
|
|
26
|
+
interface ObligationBase {
|
|
27
|
+
id: number;
|
|
28
|
+
location: string;
|
|
29
|
+
text: string;
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
export interface ProvedObligation extends ObligationBase {
|
|
33
|
+
status: "proved";
|
|
34
|
+
prover: string;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
export interface TrivialObligation extends ObligationBase {
|
|
38
|
+
status: "trivial";
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
export interface UnprovedObligation extends ObligationBase {
|
|
42
|
+
status: "failed" | "unsupported";
|
|
43
|
+
reason: string;
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
export type ProofObligation = ProvedObligation | TrivialObligation | UnprovedObligation;
|
|
47
|
+
|
|
48
|
+
export type ProofStatus = ProofObligation["status"];
|
|
49
|
+
|
|
50
|
+
export interface ProveResult {
|
|
51
|
+
obligations: ProofObligation[];
|
|
52
|
+
missingProofCount: number;
|
|
53
|
+
omittedProofCount: number;
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
// tla-ts runs its own backends, and tlapm runs tlapm on the module.
|
|
57
|
+
export const PROVE_BACKENDS = ["tla-ts", "tlapm"] as const;
|
|
58
|
+
|
|
59
|
+
export type ProveBackend = (typeof PROVE_BACKENDS)[number];
|
|
60
|
+
|
|
61
|
+
export const isProveBackend = (name: string | undefined): name is ProveBackend =>
|
|
62
|
+
PROVE_BACKENDS.some((backend) => backend === name);
|
|
63
|
+
|
|
64
|
+
export interface ProveOptions {
|
|
65
|
+
source: string;
|
|
66
|
+
loadModule?: (name: string) => string | undefined;
|
|
67
|
+
backend?: ProveBackend;
|
|
68
|
+
signal?: AbortSignal;
|
|
69
|
+
onObligation?: (obligation: ProofObligation) => void;
|
|
70
|
+
workers?: number;
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
// What one prover concluded about an obligation, as Fpfile keeps it. Fpfile keeps one Isabelle
|
|
74
|
+
// result, which only a method with the same tactic reuses.
|
|
75
|
+
interface PriorResult {
|
|
76
|
+
isProved: boolean;
|
|
77
|
+
timeLimitMs: number;
|
|
78
|
+
tactic: string | undefined;
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
// An obligation being proved. The SMT encoder numbers the CASE errors it standardizes across the
|
|
82
|
+
// run, so an obligation it encodes one in waits for every earlier obligation and keeps a session
|
|
83
|
+
// from the count they leave.
|
|
84
|
+
interface ObligationTask {
|
|
85
|
+
done: Promise<void>;
|
|
86
|
+
session: { initial: number; current: EncodingSession } | undefined;
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
// What tlapm keeps across the obligations of one run: the SMT encoder's counter, and what each
|
|
90
|
+
// prover concluded for each fingerprint. An obligation waits for the last earlier one with its
|
|
91
|
+
// fingerprint, so obligations prove concurrently as they would in turn.
|
|
92
|
+
interface ProveRun {
|
|
93
|
+
tasks: ObligationTask[];
|
|
94
|
+
results: Map<string, Map<string, PriorResult>>;
|
|
95
|
+
lastByFingerprint: Map<string, Promise<void>>;
|
|
96
|
+
decide: (
|
|
97
|
+
prover: string,
|
|
98
|
+
text: string,
|
|
99
|
+
options: DecideOptions,
|
|
100
|
+
priority: number,
|
|
101
|
+
) => Promise<Verdict>;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
interface Backend {
|
|
105
|
+
// The text tlapm sends the backend for an obligation after Prep.normalize_expand, through the
|
|
106
|
+
// frontend and Prep.flatten that Prep.ship applies first. It throws a TlaUnsupportedError for
|
|
107
|
+
// what tla-ts can't encode.
|
|
108
|
+
encode: (id: number, sequent: Sequent, method: Method, session: EncodingSession) => string;
|
|
109
|
+
}
|
|
110
|
+
|
|
111
|
+
// Action.process_obligation, the frontend for every backend but LS4, Isabelle included, then
|
|
112
|
+
// Prep.flatten.
|
|
113
|
+
const shipFirstOrder = (sequent: Sequent) => flatten(processObligation(sequent));
|
|
114
|
+
|
|
115
|
+
const SMT: Backend = {
|
|
116
|
+
// Prep.gen_smt_solve writes the resource budget before the encoding.
|
|
117
|
+
encode: (_id, sequent, method, session) =>
|
|
118
|
+
(method.rlimit === undefined ? "" : `(set-option :rlimit ${method.rlimit})\n`) +
|
|
119
|
+
encodeSmt(shipFirstOrder(sequent), session),
|
|
120
|
+
};
|
|
121
|
+
|
|
122
|
+
// tla-ts's backends, by the prover of the method that selects each.
|
|
123
|
+
const BACKENDS: Record<string, Backend> = {
|
|
124
|
+
smt: SMT,
|
|
125
|
+
z3: SMT,
|
|
126
|
+
zenon: { encode: (id, sequent) => encodeZenon(id, shipFirstOrder(sequent)) },
|
|
127
|
+
// tlapm names the theory after its temporary file, and tla-ts after the obligation.
|
|
128
|
+
isabelle: {
|
|
129
|
+
encode: (id, sequent, method) =>
|
|
130
|
+
encodeIsabelle(id, shipFirstOrder(sequent), method.tactic ?? "auto", `tlapm_${id}`),
|
|
131
|
+
},
|
|
132
|
+
// Pltl.process_obligation is LS4's frontend.
|
|
133
|
+
ls4: { encode: (_id, sequent) => encodePtl(sequent) },
|
|
134
|
+
};
|
|
135
|
+
|
|
136
|
+
// Whether an expression has a CASE with no OTHER. The frontends and Prep.flatten add none, so the
|
|
137
|
+
// SMT encoder standardizes one only in an obligation that has one after Prep.normalize_expand.
|
|
138
|
+
const hasIncompleteCase = (expression: Expr): boolean =>
|
|
139
|
+
(expression.kind === "Case" && expression.other === undefined) ||
|
|
140
|
+
getChildren(expression).some(hasIncompleteCase);
|
|
141
|
+
|
|
142
|
+
const incompleteCaseHyps = new WeakMap<Hyp, boolean>();
|
|
143
|
+
|
|
144
|
+
const isIncompleteCaseHyp = (hyp: Hyp) => {
|
|
145
|
+
const known = incompleteCaseHyps.get(hyp);
|
|
146
|
+
if (known !== undefined) return known;
|
|
147
|
+
const expressions: Expr[] = [];
|
|
148
|
+
mapHyp(
|
|
149
|
+
hyp,
|
|
150
|
+
(inner) => {
|
|
151
|
+
expressions.push(inner);
|
|
152
|
+
return inner;
|
|
153
|
+
},
|
|
154
|
+
"all",
|
|
155
|
+
);
|
|
156
|
+
const isIncomplete = expressions.some(hasIncompleteCase);
|
|
157
|
+
incompleteCaseHyps.set(hyp, isIncomplete);
|
|
158
|
+
return isIncomplete;
|
|
159
|
+
};
|
|
160
|
+
|
|
161
|
+
const getModuleName = (source: string) => /-{4,}\s*MODULE\s+(\w+)/.exec(source)?.[1] ?? "Main";
|
|
162
|
+
|
|
163
|
+
const getBase = (obligation: PrintedObligation): ObligationBase => ({
|
|
164
|
+
id: obligation.id,
|
|
165
|
+
location: obligation.location,
|
|
166
|
+
text: obligation.text,
|
|
167
|
+
});
|
|
168
|
+
|
|
169
|
+
const getUnproved = (
|
|
170
|
+
obligation: PrintedObligation,
|
|
171
|
+
status: "failed" | "unsupported",
|
|
172
|
+
reason: string,
|
|
173
|
+
): ProofObligation => ({ ...getBase(obligation), status, reason });
|
|
174
|
+
|
|
175
|
+
// Prep.normalize_expand: expand_defs, Elab.normalize, then the frontends the step cites.
|
|
176
|
+
const normalizeExpand = (sequent: Sequent, frontends: Set<string>) =>
|
|
177
|
+
expandEnabledCdot(normalizeSequent(expandDefs(sequent)), frontends);
|
|
178
|
+
|
|
179
|
+
// The text one backend receives for an obligation, for comparing with tlapm's.
|
|
180
|
+
export const encodeForBackend = (
|
|
181
|
+
obligation: PrintedObligation,
|
|
182
|
+
prover: string,
|
|
183
|
+
session: EncodingSession,
|
|
184
|
+
) => {
|
|
185
|
+
const backend = BACKENDS[prover];
|
|
186
|
+
if (!backend) throw new TlaUnsupportedError(`the ${prover} backend`);
|
|
187
|
+
const methods = findMethods(obligation);
|
|
188
|
+
const method = methods.provers.find((candidate) => candidate.prover === prover) ?? {
|
|
189
|
+
prover,
|
|
190
|
+
timeLimitMs: Infinity,
|
|
191
|
+
};
|
|
192
|
+
return backend.encode(
|
|
193
|
+
obligation.id,
|
|
194
|
+
normalizeExpand(obligation.sequent, methods.frontends),
|
|
195
|
+
method,
|
|
196
|
+
session,
|
|
197
|
+
);
|
|
198
|
+
};
|
|
199
|
+
|
|
200
|
+
// The SMT encoder's session for an obligation, from the count of CASE errors every earlier
|
|
201
|
+
// obligation leaves.
|
|
202
|
+
const getSession = async (run: ProveRun, index: number) => {
|
|
203
|
+
const task = run.tasks[index];
|
|
204
|
+
if (task.session) return task.session.current;
|
|
205
|
+
const earlier = run.tasks.slice(0, index);
|
|
206
|
+
await Promise.all(earlier.map((innerTask) => innerTask.done));
|
|
207
|
+
const initial = earlier.reduce(
|
|
208
|
+
(total, innerTask) =>
|
|
209
|
+
total +
|
|
210
|
+
(innerTask.session ? innerTask.session.current.caseErrors - innerTask.session.initial : 0),
|
|
211
|
+
0,
|
|
212
|
+
);
|
|
213
|
+
task.session = { initial, current: { caseErrors: initial } };
|
|
214
|
+
return task.session.current;
|
|
215
|
+
};
|
|
216
|
+
|
|
217
|
+
// Prep.ship: the provers the step cites, or tlapm's default ones when it cites none, each tried in
|
|
218
|
+
// turn until one proves the obligation. Prep.already_processed reuses what a prover concluded for
|
|
219
|
+
// an earlier obligation with the same fingerprint: a proof, or a failure within at least as much
|
|
220
|
+
// time. Unless the first prover's proof is reused, a trivial obligation needs no prover.
|
|
221
|
+
const proveWithBackends = async (
|
|
222
|
+
obligation: PrintedObligation,
|
|
223
|
+
index: number,
|
|
224
|
+
run: ProveRun,
|
|
225
|
+
signal: AbortSignal | undefined,
|
|
226
|
+
): Promise<ProofObligation> => {
|
|
227
|
+
if (obligation.kind.kind === "Error")
|
|
228
|
+
return getUnproved(obligation, "failed", obligation.kind.message);
|
|
229
|
+
const methods = findMethods(obligation);
|
|
230
|
+
const fingerprint = getFingerprint(obligation.sequent);
|
|
231
|
+
const earlier = run.lastByFingerprint.get(fingerprint);
|
|
232
|
+
run.lastByFingerprint.set(fingerprint, run.tasks[index].done);
|
|
233
|
+
await earlier;
|
|
234
|
+
const results = run.results.get(fingerprint) ?? new Map<string, PriorResult>();
|
|
235
|
+
run.results.set(fingerprint, results);
|
|
236
|
+
const getProved = (prover: string): ProofObligation => ({
|
|
237
|
+
...getBase(obligation),
|
|
238
|
+
status: "proved",
|
|
239
|
+
prover,
|
|
240
|
+
});
|
|
241
|
+
const getPrior = (method: Method) => {
|
|
242
|
+
const prior = results.get(method.prover);
|
|
243
|
+
return prior?.tactic === method.tactic ? prior : undefined;
|
|
244
|
+
};
|
|
245
|
+
const setPrior = (method: Method, isProved: boolean) =>
|
|
246
|
+
results.set(method.prover, {
|
|
247
|
+
isProved,
|
|
248
|
+
timeLimitMs: method.timeLimitMs,
|
|
249
|
+
tactic: method.tactic,
|
|
250
|
+
});
|
|
251
|
+
if (getPrior(methods.provers[0])?.isProved) return getProved(methods.provers[0].prover);
|
|
252
|
+
const sequent = normalizeExpand(obligation.sequent, methods.frontends);
|
|
253
|
+
if (obligation.kind.kind === "Support" && isTrivial(sequent))
|
|
254
|
+
return { ...getBase(obligation), status: "trivial" };
|
|
255
|
+
const reasons: string[] = [];
|
|
256
|
+
const state = { isDecided: false };
|
|
257
|
+
for (const method of methods.provers) {
|
|
258
|
+
const prior = getPrior(method);
|
|
259
|
+
if (prior?.isProved) return getProved(method.prover);
|
|
260
|
+
if (prior && prior.timeLimitMs >= method.timeLimitMs) {
|
|
261
|
+
state.isDecided = true;
|
|
262
|
+
reasons.push(`${method.prover} failed on an obligation with the same fingerprint`);
|
|
263
|
+
continue;
|
|
264
|
+
}
|
|
265
|
+
// Prep.prove_with: the Trivial method proves anything.
|
|
266
|
+
if (method.prover === "trivial") return getProved(method.prover);
|
|
267
|
+
const backend = BACKENDS[method.prover];
|
|
268
|
+
if (!backend) {
|
|
269
|
+
reasons.push(`tla-ts has no ${method.prover} backend`);
|
|
270
|
+
continue;
|
|
271
|
+
}
|
|
272
|
+
try {
|
|
273
|
+
const isCaseNumbered =
|
|
274
|
+
backend === SMT &&
|
|
275
|
+
(sequent.context.some(isIncompleteCaseHyp) || hasIncompleteCase(sequent.active));
|
|
276
|
+
const session = isCaseNumbered ? await getSession(run, index) : { caseErrors: 0 };
|
|
277
|
+
const text = backend.encode(obligation.id, sequent, method, session);
|
|
278
|
+
const verdict = await run.decide(
|
|
279
|
+
method.prover,
|
|
280
|
+
text,
|
|
281
|
+
{ timeLimitMs: method.timeLimitMs, signal },
|
|
282
|
+
index,
|
|
283
|
+
);
|
|
284
|
+
setPrior(method, verdict === "unsat");
|
|
285
|
+
if (verdict === "unsat") return getProved(method.prover);
|
|
286
|
+
state.isDecided = true;
|
|
287
|
+
reasons.push(`${method.prover} answered ${verdict}`);
|
|
288
|
+
} catch (error) {
|
|
289
|
+
if (error instanceof TlaProverError) {
|
|
290
|
+
setPrior(method, false);
|
|
291
|
+
state.isDecided = true;
|
|
292
|
+
reasons.push(`${method.prover} failed: ${error.message}`);
|
|
293
|
+
continue;
|
|
294
|
+
}
|
|
295
|
+
if (!(error instanceof TlaUnsupportedError)) throw error;
|
|
296
|
+
reasons.push(`${method.prover} can't encode ${error.message}`);
|
|
297
|
+
}
|
|
298
|
+
}
|
|
299
|
+
return getUnproved(obligation, state.isDecided ? "failed" : "unsupported", reasons.join(", "));
|
|
300
|
+
};
|
|
301
|
+
|
|
302
|
+
// The one place an error becomes a result: what tla-ts can't handle is unsupported, and what tlapm
|
|
303
|
+
// refuses, as a frontend's soundness check, fails.
|
|
304
|
+
const getResult = async (
|
|
305
|
+
obligation: PrintedObligation,
|
|
306
|
+
getProved: () => Promise<ProofObligation>,
|
|
307
|
+
) => {
|
|
308
|
+
try {
|
|
309
|
+
return await getProved();
|
|
310
|
+
} catch (error) {
|
|
311
|
+
if (error instanceof TlaUnsupportedError)
|
|
312
|
+
return getUnproved(obligation, "unsupported", error.message);
|
|
313
|
+
if (error instanceof TlaProverError) return getUnproved(obligation, "failed", error.message);
|
|
314
|
+
throw error;
|
|
315
|
+
}
|
|
316
|
+
};
|
|
317
|
+
|
|
318
|
+
const getFromTlapm = (obligation: PrintedObligation, result: TlapmResult | undefined) =>
|
|
319
|
+
result
|
|
320
|
+
? { ...getBase(obligation), ...result }
|
|
321
|
+
: getUnproved(obligation, "unsupported", "tlapm reported no result");
|
|
322
|
+
|
|
323
|
+
export const prove = async (options: ProveOptions): Promise<ProveResult> => {
|
|
324
|
+
const name = getModuleName(options.source);
|
|
325
|
+
const modules = new Map<string, string>();
|
|
326
|
+
const results = getObligations(
|
|
327
|
+
[{ file: `${name}.tla`, source: options.source }],
|
|
328
|
+
(moduleName) => {
|
|
329
|
+
const source = options.loadModule?.(moduleName);
|
|
330
|
+
if (source !== undefined) modules.set(moduleName, source);
|
|
331
|
+
const loaded = source ?? (moduleName === "TLAPS" ? TLAPS_MODULE : undefined);
|
|
332
|
+
return loaded === undefined ? undefined : { file: `${moduleName}.tla`, source: loaded };
|
|
333
|
+
},
|
|
334
|
+
);
|
|
335
|
+
const obligations = results.flatMap((result) => result.obligations);
|
|
336
|
+
const counts = {
|
|
337
|
+
missingProofCount: results.reduce((total, result) => total + result.summary.absent.length, 0),
|
|
338
|
+
omittedProofCount: results.reduce((total, result) => total + result.summary.omitted.length, 0),
|
|
339
|
+
};
|
|
340
|
+
if (options.backend === "tlapm") {
|
|
341
|
+
if (typeof process === "undefined" || process.versions?.node === undefined)
|
|
342
|
+
throw new TlaUnsupportedError("The tlapm backend runs only in Node and Bun.");
|
|
343
|
+
const tlapm = await import("./tlapm/tlapm");
|
|
344
|
+
const byId = new Map(obligations.map((obligation) => [obligation.id, obligation]));
|
|
345
|
+
const reported = await tlapm.proveWithTlapm(
|
|
346
|
+
name,
|
|
347
|
+
new Map([[name, options.source], ...modules]),
|
|
348
|
+
{
|
|
349
|
+
signal: options.signal,
|
|
350
|
+
onResult: (id, result) => {
|
|
351
|
+
const obligation = byId.get(id);
|
|
352
|
+
if (obligation) options.onObligation?.(getFromTlapm(obligation, result));
|
|
353
|
+
},
|
|
354
|
+
},
|
|
355
|
+
);
|
|
356
|
+
return {
|
|
357
|
+
obligations: obligations.map((obligation) =>
|
|
358
|
+
getFromTlapm(obligation, reported.get(obligation.id)),
|
|
359
|
+
),
|
|
360
|
+
...counts,
|
|
361
|
+
};
|
|
362
|
+
}
|
|
363
|
+
const count = options.workers ?? 1;
|
|
364
|
+
const pool = count > 1 && isWorkerSupported() ? await createDecidePool(count) : undefined;
|
|
365
|
+
const onAbort = () => pool?.terminate(options.signal?.reason);
|
|
366
|
+
options.signal?.addEventListener("abort", onAbort);
|
|
367
|
+
const run: ProveRun = {
|
|
368
|
+
tasks: [],
|
|
369
|
+
results: new Map(),
|
|
370
|
+
lastByFingerprint: new Map(),
|
|
371
|
+
decide:
|
|
372
|
+
pool?.decide ??
|
|
373
|
+
(async (prover, text, decideOptions) => DECIDERS[prover](text, decideOptions)),
|
|
374
|
+
};
|
|
375
|
+
// A few obligations per worker prove at once, and each reports once every earlier one has.
|
|
376
|
+
const limit = pool ? count * 4 : 1;
|
|
377
|
+
const pending: Promise<ProofObligation>[] = [];
|
|
378
|
+
const isSettled: boolean[] = [];
|
|
379
|
+
const running = new Set<Promise<void>>();
|
|
380
|
+
const proved: ProofObligation[] = [];
|
|
381
|
+
const reportSettled = async () => {
|
|
382
|
+
while (isSettled[proved.length]) {
|
|
383
|
+
options.signal?.throwIfAborted();
|
|
384
|
+
const result = await pending[proved.length];
|
|
385
|
+
proved.push(result);
|
|
386
|
+
options.onObligation?.(result);
|
|
387
|
+
// HACK: backends on this thread run synchronously, so yield to let an abort land.
|
|
388
|
+
await new Promise((resolve) => setTimeout(resolve));
|
|
389
|
+
}
|
|
390
|
+
};
|
|
391
|
+
try {
|
|
392
|
+
for (const [index, obligation] of obligations.entries()) {
|
|
393
|
+
options.signal?.throwIfAborted();
|
|
394
|
+
const done = Promise.withResolvers<void>();
|
|
395
|
+
run.tasks.push({ done: done.promise, session: undefined });
|
|
396
|
+
const result = getResult(obligation, () =>
|
|
397
|
+
proveWithBackends(obligation, index, run, options.signal),
|
|
398
|
+
);
|
|
399
|
+
pending.push(result);
|
|
400
|
+
running.add(done.promise);
|
|
401
|
+
const settle = () => {
|
|
402
|
+
isSettled[index] = true;
|
|
403
|
+
running.delete(done.promise);
|
|
404
|
+
done.resolve();
|
|
405
|
+
};
|
|
406
|
+
void result.then(settle, settle);
|
|
407
|
+
if (running.size >= limit) await Promise.race(running);
|
|
408
|
+
await reportSettled();
|
|
409
|
+
}
|
|
410
|
+
await Promise.all(running);
|
|
411
|
+
await reportSettled();
|
|
412
|
+
} finally {
|
|
413
|
+
options.signal?.removeEventListener("abort", onAbort);
|
|
414
|
+
pool?.terminate(new TlaProverError("prove stopped"));
|
|
415
|
+
}
|
|
416
|
+
return { obligations: proved, ...counts };
|
|
417
|
+
};
|