tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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.
Files changed (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
package/src/tlc/replay.ts CHANGED
@@ -1,14 +1,25 @@
1
1
  import type { Expression, SourceLocation } from "../ast";
2
2
  import { TlaEvaluationError } from "../errors";
3
3
  import { isConstantLevel } from "../dependencies";
4
+ import {
5
+ chargeContexts,
6
+ countCoverage,
7
+ createChargedEnumerator,
8
+ getCoverageNode,
9
+ runAtCoverageNode,
10
+ type Coverage,
11
+ } from "../coverage";
4
12
  import {
5
13
  bindDefinitions,
6
14
  bindLazyArguments,
7
15
  bindOperatorArguments,
16
+ describeRange,
8
17
  evaluate,
9
- forEachBinding,
18
+ forEachBoundElement,
10
19
  freezeCallStack,
11
20
  getLazyFunction,
21
+ getQuantifierElements,
22
+ mapBoundSets,
12
23
  toKeepLazyContext,
13
24
  lookupScope,
14
25
  resolveApplyOperator,
@@ -20,41 +31,46 @@ import {
20
31
  type State,
21
32
  toUnspecifiedSubscriptError,
22
33
  } from "../evaluate";
23
- import { getStreamedElements, isTlcEnumerable, setTrace, valuesEqual, type Value } from "../values";
24
-
25
- // When TLC fails to compute the initial states or the successors of a state, it computes them
26
- // again with its CallStackTool, which records each node it visits, and prints where the failure
27
- // occurred. The replay below walks the predicates as TLC's Tool.getInitStates and
28
- // Tool.getNextStates do, in their order and with their nesting, so that it records the nodes TLC
29
- // records. It evaluates the other expressions with an environment that records the nodes too.
34
+ import {
35
+ getStreamedElements,
36
+ isEqualLikeTlc,
37
+ isTlcEnumerable,
38
+ setTrace,
39
+ type Value,
40
+ } from "../values";
41
+ import { substitutionFrames } from "../instances";
42
+ import { MESSAGE_CODE } from "./messages";
30
43
 
31
44
  interface ReplayAction {
32
45
  expression: Expression;
33
46
  scope: Scope | undefined;
34
47
  }
35
48
 
36
- // TLC's ActionItemList: the conjuncts left to process, the first at the head.
37
49
  interface ActionItem {
38
50
  kind: "Predicate" | "Unchanged" | "Changed";
39
51
  expression: Expression;
40
52
  scope: Scope | undefined;
53
+ node: number;
41
54
  rest: ActionItem | undefined;
42
55
  }
43
56
 
44
57
  interface Replay {
45
58
  environment: Environment;
46
- callStack: CallStack;
59
+ callStack: CallStack | undefined;
60
+ coverage: Coverage | undefined;
47
61
  isInit: boolean;
48
- // Whether the replay computes ENABLED rather than the successors of the state.
49
62
  isEnabled: boolean;
50
- // The state whose successors the replay computes.
51
63
  current: Value[] | undefined;
52
64
  onState: (state: Value[]) => void;
65
+ onIncomplete: ((state: State) => boolean) | undefined;
53
66
  }
54
67
 
55
68
  const withFrame = <Result>(replay: Replay, expression: Expression, run: () => Result): Result => {
56
69
  const callStack = replay.callStack;
57
- callStack.expressions.push(expression);
70
+ if (!callStack) return run();
71
+ const isEntered = callStack.expressions.at(-1) === expression;
72
+ const frames = (!isEntered && substitutionFrames.get(expression)) || [];
73
+ callStack.expressions.push(...frames, expression);
58
74
  const outerSets = setTrace.sets;
59
75
  const sets = outerSets ?? [];
60
76
  const depth = sets.length;
@@ -62,16 +78,38 @@ const withFrame = <Result>(replay: Replay, expression: Expression, run: () => Re
62
78
  try {
63
79
  return run();
64
80
  } catch (error) {
65
- // A quantifier enumerates its bounds outside any evaluation.
66
81
  freezeCallStack(callStack, sets.slice(depth), error);
67
82
  throw error;
68
83
  } finally {
69
- if (!callStack.isFrozen) callStack.expressions.pop();
84
+ if (!callStack.isFrozen) callStack.expressions.length -= frames.length + 1;
70
85
  sets.length = depth;
71
86
  setTrace.sets = outerSets;
72
87
  }
73
88
  };
74
89
 
90
+ const getNode = (replay: Replay, node: number, expression: Expression) =>
91
+ replay.coverage ? getCoverageNode(replay.coverage, node, expression) : -1;
92
+
93
+ const runAt = <Result>(replay: Replay, node: number, run: () => Result) =>
94
+ replay.coverage ? runAtCoverageNode(replay.coverage, node, run) : run();
95
+
96
+ const evaluateAt = (replay: Replay, node: number, expression: Expression, context: Context) =>
97
+ runAt(replay, node, () => evaluate(expression, context));
98
+
99
+ const evaluateOperatorAt = (
100
+ replay: Replay,
101
+ node: number,
102
+ expression: Expression,
103
+ context: Context,
104
+ ) => {
105
+ const value = evaluateAt(replay, node, expression, context);
106
+ const coverage = replay.coverage;
107
+ if (coverage?.covered.has(expression)) {
108
+ for (let item = node; item !== -1; item = coverage.prefixes[item]) coverage.primary[item]--;
109
+ }
110
+ return value;
111
+ };
112
+
75
113
  const getContext = (replay: Replay, scope: Scope | undefined, partial: State): Context =>
76
114
  replay.isInit
77
115
  ? { environment: replay.environment, scope, state: partial, next: undefined }
@@ -87,8 +125,6 @@ const assign = (partial: State, index: number, value: Value) => {
87
125
  return copy;
88
126
  };
89
127
 
90
- // SANY parses an infix chain such as A /\ B /\ C as (A /\ B) /\ C, where tla-ts keeps one
91
- // junction, so the replay recreates the node of each prefix.
92
128
  const getPrefix = (expression: Expression & { kind: "And" | "Or" }, count: number): Expression => {
93
129
  const first = expression.operands[0].location;
94
130
  const range = expression.location.range;
@@ -98,48 +134,48 @@ const getPrefix = (expression: Expression & { kind: "And" | "Or" }, count: numbe
98
134
  return { ...expression, operands: expression.operands.slice(0, count), location };
99
135
  };
100
136
 
137
+ const getPrefixNode = (replay: Replay, node: number) =>
138
+ replay.coverage ? replay.coverage.prefixes[node] : -1;
139
+
101
140
  const getIdentifierName = (expression: Expression) =>
102
141
  expression.kind === "Identifier" ? expression.name : undefined;
103
142
 
104
- // The state variable an expression names, as TLC's getVar finds it through definitions and
105
- // operator arguments.
106
143
  const getVariable = (
107
- replay: Replay,
144
+ environment: Environment,
108
145
  expression: Expression,
109
146
  scope: Scope | undefined,
110
147
  ): number | undefined => {
111
- if (expression.kind === "Label") return getVariable(replay, expression.body, scope);
148
+ if (expression.kind === "Label") return getVariable(environment, expression.body, scope);
112
149
  const name = getIdentifierName(expression);
113
150
  if (name === undefined) return undefined;
114
151
  const binding = lookupScope(scope, name);
115
- if (binding?.kind === "Thunk") return getVariable(replay, binding.expression, binding.scope);
152
+ if (binding?.kind === "Thunk") return getVariable(environment, binding.expression, binding.scope);
116
153
  if (binding) return undefined;
117
- const index = replay.environment.variableIndex.get(name);
154
+ const index = environment.variableIndex.get(name);
118
155
  if (index !== undefined) return index;
119
- const operator = resolveGlobalOperator(name, replay.environment);
156
+ const operator = resolveGlobalOperator(name, environment);
120
157
  return operator?.kind === "Closure" && operator.params.length === 0
121
- ? getVariable(replay, operator.body, operator.scope)
158
+ ? getVariable(environment, operator.body, operator.scope)
122
159
  : undefined;
123
160
  };
124
161
 
125
- // The variable a primed expression such as x' assigns, as TLC's getPrimedVar finds it.
126
162
  const getPrimedVariable = (
127
- replay: Replay,
163
+ environment: Environment,
128
164
  expression: Expression,
129
165
  scope: Scope | undefined,
130
166
  ): number | undefined => {
131
- if (expression.kind === "Prime") return getVariable(replay, expression.expression, scope);
132
- if (expression.kind === "Label") return getPrimedVariable(replay, expression.body, scope);
167
+ if (expression.kind === "Prime") return getVariable(environment, expression.expression, scope);
168
+ if (expression.kind === "Label") return getPrimedVariable(environment, expression.body, scope);
133
169
  const name = getIdentifierName(expression);
134
170
  if (name === undefined) return undefined;
135
171
  const binding = lookupScope(scope, name);
136
172
  if (binding?.kind === "Thunk") {
137
- return getPrimedVariable(replay, binding.expression, binding.scope);
173
+ return getPrimedVariable(environment, binding.expression, binding.scope);
138
174
  }
139
175
  if (binding) return undefined;
140
- const operator = resolveGlobalOperator(name, replay.environment);
176
+ const operator = resolveGlobalOperator(name, environment);
141
177
  return operator?.kind === "Closure" && operator.params.length === 0
142
- ? getPrimedVariable(replay, operator.body, operator.scope)
178
+ ? getPrimedVariable(environment, operator.body, operator.scope)
143
179
  : undefined;
144
180
  };
145
181
 
@@ -149,37 +185,55 @@ const isTrue = (value: Value) => {
149
185
  return value;
150
186
  };
151
187
 
152
- // Once every variable has a value, TLC's getInitStates and getNextStatesAllAssigned evaluate the
153
- // conjuncts left instead of walking them, so a disjunction among them takes one step. Its enabled
154
- // doesn't, and Tool#getNextStates0 takes this shortcut only with warnings on.
155
188
  export const isAssignedShortcut = (replay: Pick<Replay, "environment" | "isInit" | "isEnabled">) =>
156
189
  !replay.isEnabled && (replay.isInit || replay.environment.runtime.isWarningEnabled);
157
190
 
158
- // TLC's getInitStates(ActionItemList) and getNextStates(ActionItemList): processes the conjuncts
159
- // left once a conjunct holds.
160
- const proceed = (replay: Replay, items: ActionItem | undefined, partial: State): void => {
191
+ const proceed = (
192
+ replay: Replay,
193
+ items: ActionItem | undefined,
194
+ partial: State,
195
+ node: number,
196
+ ): boolean => {
197
+ const isProduced = proceedItems(replay, items, partial, node);
198
+ if (isProduced && replay.coverage && !replay.isInit) countCoverage(replay.coverage, node);
199
+ return isProduced;
200
+ };
201
+
202
+ const addState = (replay: Replay, state: Value[], node: number) => {
203
+ const coverage = replay.coverage;
204
+ if (coverage && replay.isInit) {
205
+ countCoverage(coverage, node);
206
+ countCoverage(coverage, coverage.roots[node]);
207
+ }
208
+ replay.onState(state);
209
+ return true;
210
+ };
211
+
212
+ const proceedItems = (
213
+ replay: Replay,
214
+ items: ActionItem | undefined,
215
+ partial: State,
216
+ node: number,
217
+ ): boolean => {
161
218
  if (items === undefined) {
162
- if (isComplete(partial)) replay.onState(partial);
163
- return;
219
+ if (isComplete(partial)) return addState(replay, partial, node);
220
+ return replay.onIncomplete?.(partial) ?? false;
164
221
  }
165
222
  if (isComplete(partial) && isAssignedShortcut(replay)) {
166
- proceedAssigned(replay, items, partial);
167
- return;
223
+ return proceedAssigned(replay, items, partial, node);
168
224
  }
169
225
  if (items.kind === "Predicate") {
170
- visit(replay, items.expression, items.rest, items.scope, partial);
171
- return;
226
+ return visit(replay, items.expression, items.rest, items.scope, partial, items.node);
172
227
  }
173
228
  if (items.kind === "Unchanged") {
174
- visitUnchanged(replay, items.expression, items.rest, items.scope, partial);
175
- return;
229
+ return visitUnchanged(replay, items.expression, items.rest, items.scope, partial, items.node);
176
230
  }
177
- if (isChanged(replay, items, partial)) proceed(replay, items.rest, partial);
231
+ return isChanged(replay, items, partial) && proceed(replay, items.rest, partial, items.node);
178
232
  };
179
233
 
180
234
  const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
181
235
  const environment = replay.environment;
182
- const before = evaluate(item.expression, {
236
+ const before = evaluateAt(replay, item.node, item.expression, {
183
237
  environment,
184
238
  scope: item.scope,
185
239
  state: replay.current,
@@ -187,7 +241,7 @@ const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
187
241
  });
188
242
  const after = (() => {
189
243
  try {
190
- return evaluate(item.expression, {
244
+ return evaluateAt(replay, item.node, item.expression, {
191
245
  environment,
192
246
  scope: item.scope,
193
247
  state: partial,
@@ -199,24 +253,37 @@ const isChanged = (replay: Replay, item: ActionItem, partial: State) => {
199
253
  : error;
200
254
  }
201
255
  })();
202
- return !valuesEqual(before, after);
256
+ try {
257
+ return !isEqualLikeTlc(before, after);
258
+ } catch (error) {
259
+ if (replay.callStack) freezeCallStack(replay.callStack, [before], error);
260
+ throw error;
261
+ }
203
262
  };
204
263
 
205
- const proceedAssigned = (replay: Replay, items: ActionItem | undefined, partial: Value[]): void => {
264
+ const proceedAssigned = (
265
+ replay: Replay,
266
+ items: ActionItem | undefined,
267
+ partial: Value[],
268
+ node: number,
269
+ ): boolean => {
206
270
  for (let item = items; item !== undefined; item = item.rest) {
207
271
  if (item.kind === "Unchanged") {
208
- visitUnchanged(replay, item.expression, item.rest, item.scope, partial);
209
- return;
272
+ return visitUnchanged(replay, item.expression, item.rest, item.scope, partial, item.node);
210
273
  }
211
- if (
274
+ const isHeld =
212
275
  item.kind === "Changed"
213
- ? !isChanged(replay, item, partial)
214
- : !isTrue(evaluate(item.expression, getContext(replay, item.scope, partial)))
215
- ) {
216
- return;
276
+ ? isChanged(replay, item, partial)
277
+ : isTrue(
278
+ evaluateAt(replay, item.node, item.expression, getContext(replay, item.scope, partial)),
279
+ );
280
+ if (!isHeld) {
281
+ const coverage = replay.coverage;
282
+ if (coverage && replay.isInit) coverage.secondary[coverage.roots[node]]++;
283
+ return false;
217
284
  }
218
285
  }
219
- replay.onState(partial);
286
+ return addState(replay, partial, node);
220
287
  };
221
288
 
222
289
  const visit = (
@@ -225,39 +292,74 @@ const visit = (
225
292
  items: ActionItem | undefined,
226
293
  scope: Scope | undefined,
227
294
  partial: State,
228
- ): void =>
295
+ parent: number,
296
+ ): boolean =>
297
+ visitAt(replay, expression, items, scope, partial, getNode(replay, parent, expression));
298
+
299
+ const visitAt = (
300
+ replay: Replay,
301
+ expression: Expression,
302
+ items: ActionItem | undefined,
303
+ scope: Scope | undefined,
304
+ partial: State,
305
+ node: number,
306
+ ): boolean =>
229
307
  withFrame(replay, expression, () => {
230
308
  switch (expression.kind) {
231
- case "Let":
232
- visit(
233
- replay,
234
- expression.body,
235
- items,
236
- bindDefinitions(expression.definitions, getContext(replay, scope, partial)),
237
- partial,
238
- );
239
- return;
309
+ case "Let": {
310
+ const context = getContext(replay, scope, partial);
311
+ const definitions = expression.definitions;
312
+ const bound =
313
+ replay.coverage && !replay.isEnabled
314
+ ? bindDefinitions(definitions, context, {
315
+ impure: new Set(definitions),
316
+ streamed: new Set(),
317
+ })
318
+ : bindDefinitions(definitions, context);
319
+ return visit(replay, expression.body, items, bound, partial, node);
320
+ }
240
321
  case "Label":
241
- visit(replay, expression.body, items, scope, partial);
242
- return;
322
+ return visit(replay, expression.body, items, scope, partial, node);
323
+ case "Selection":
324
+ return visit(replay, expression.expression, items, scope, partial, node);
243
325
  default:
244
326
  if (LITERAL_KINDS.has(expression.kind))
245
327
  throw new TlaEvaluationError("The state relation is not a boolean expression.");
246
- withFrame(replay, expression, () =>
247
- visitApplication(replay, expression, items, scope, partial),
328
+ return withFrame(replay, expression, () =>
329
+ visitApplication(replay, expression, items, scope, partial, node),
248
330
  );
249
331
  }
250
332
  });
251
333
 
252
- // The value of a user-defined operator TLC evaluates instead of walking its body.
253
334
  const visitValue = (
254
335
  replay: Replay,
255
336
  value: Value,
256
337
  items: ActionItem | undefined,
257
338
  partial: State,
258
- ) => {
259
- if (isTrue(value)) proceed(replay, items, partial);
260
- };
339
+ node: number,
340
+ ) => isTrue(value) && proceed(replay, items, partial, node);
341
+
342
+ const BUILT_IN_OPERATORS = new Set([
343
+ "=",
344
+ "#",
345
+ "~",
346
+ "<=>",
347
+ "/\\",
348
+ "\\/",
349
+ "=>",
350
+ "\\in",
351
+ "\\notin",
352
+ "\\subseteq",
353
+ "\\cup",
354
+ "\\cap",
355
+ "\\",
356
+ "SUBSET",
357
+ "UNION",
358
+ "DOMAIN",
359
+ "~>",
360
+ "-+->",
361
+ "\\cdot",
362
+ ]);
261
363
 
262
364
  const visitDefined = (
263
365
  replay: Replay,
@@ -265,21 +367,21 @@ const visitDefined = (
265
367
  items: ActionItem | undefined,
266
368
  scope: Scope | undefined,
267
369
  partial: State,
268
- ) => {
370
+ node: number,
371
+ ): boolean => {
269
372
  const context = getContext(replay, scope, partial);
270
373
  if (expression.kind === "Identifier") {
271
374
  const binding = lookupScope(scope, expression.name);
272
375
  if (binding?.kind === "Thunk" && binding.cache === undefined) {
273
- visit(replay, binding.expression, items, binding.scope, partial);
274
- return;
376
+ const thunkNode = replay.coverage?.values.get(binding) ?? node;
377
+ return visit(replay, binding.expression, items, binding.scope, partial, thunkNode);
275
378
  }
276
379
  if (
277
380
  binding?.kind === "Operator" &&
278
381
  binding.operator.kind === "Closure" &&
279
382
  binding.operator.params.length === 0
280
383
  ) {
281
- visit(replay, binding.operator.body, items, binding.operator.scope, partial);
282
- return;
384
+ return visit(replay, binding.operator.body, items, binding.operator.scope, partial, node);
283
385
  }
284
386
  const definition = binding ? undefined : replay.environment.definitions.get(expression.name);
285
387
  const operator = binding
@@ -291,48 +393,49 @@ const visitDefined = (
291
393
  !replay.environment.variableIndex.has(expression.name) &&
292
394
  !(definition && isConstantLevel(definition, replay.environment))
293
395
  ) {
294
- visit(replay, operator.body, items, operator.scope, partial);
295
- return;
396
+ return visit(replay, operator.body, items, operator.scope, partial, node);
296
397
  }
297
- visitValue(replay, evaluate(expression, context), items, partial);
298
- return;
398
+ return visitValue(
399
+ replay,
400
+ evaluateOperatorAt(replay, node, expression, context),
401
+ items,
402
+ partial,
403
+ node,
404
+ );
299
405
  }
300
406
  const operator = resolveApplyOperator(expression, context);
301
407
  if (operator?.kind === "Closure" && operator.params.length === expression.args.length) {
302
- visit(
303
- replay,
304
- operator.body,
305
- items,
408
+ const bound = runAt(replay, node, () =>
306
409
  bindOperatorArguments(operator, expression.args, context),
307
- partial,
308
410
  );
309
- return;
411
+ return visit(replay, operator.body, items, bound, partial, node);
310
412
  }
311
- visitValue(replay, evaluate(expression, context), items, partial);
413
+ const value = BUILT_IN_OPERATORS.has(expression.operator)
414
+ ? evaluateAt(replay, node, expression, context)
415
+ : evaluateOperatorAt(replay, node, expression, context);
416
+ return visitValue(replay, value, items, partial, node);
312
417
  };
313
418
 
314
- // A variable takes the value when it has none yet, and otherwise must already have it.
315
419
  const proceedWithValue = (
316
420
  replay: Replay,
317
421
  items: ActionItem | undefined,
318
422
  partial: State,
319
423
  index: number,
320
424
  value: Value,
425
+ node: number,
321
426
  ) => {
322
427
  const assigned = partial[index];
323
- if (assigned === undefined) {
324
- proceed(replay, items, assign(partial, index, value));
325
- return;
326
- }
327
- if (valuesEqual(assigned, value)) proceed(replay, items, partial);
428
+ if (assigned === undefined) return proceed(replay, items, assign(partial, index, value), node);
429
+ return isEqualLikeTlc(assigned, value) && proceed(replay, items, partial, node);
328
430
  };
329
431
 
330
432
  const createItem = (
331
433
  kind: ActionItem["kind"],
332
434
  expression: Expression,
333
435
  scope: Scope | undefined,
436
+ node: number,
334
437
  rest: ActionItem | undefined,
335
- ): ActionItem => ({ kind, expression, scope, rest });
438
+ ): ActionItem => ({ kind, expression, scope, node, rest });
336
439
 
337
440
  const visitAssignment = (
338
441
  replay: Replay,
@@ -340,65 +443,130 @@ const visitAssignment = (
340
443
  items: ActionItem | undefined,
341
444
  scope: Scope | undefined,
342
445
  partial: State,
446
+ node: number,
343
447
  ) => {
344
448
  const [target, source] = expression.args;
345
449
  const index = replay.isInit
346
- ? getVariable(replay, target, scope)
347
- : getPrimedVariable(replay, target, scope);
450
+ ? getVariable(replay.environment, target, scope)
451
+ : getPrimedVariable(replay.environment, target, scope);
348
452
  const context = getContext(replay, scope, partial);
349
453
  if (index === undefined) {
350
- if (evaluate(expression, context) === true) proceed(replay, items, partial);
351
- return;
454
+ return (
455
+ evaluateAt(replay, node, expression, context) === true &&
456
+ proceed(replay, items, partial, node)
457
+ );
352
458
  }
353
- const value = evaluate(source, context);
459
+ const value = evaluateAt(replay, node, source, context);
354
460
  const assigned = partial[index];
355
461
  if (expression.operator === "=") {
356
- proceedWithValue(replay, items, partial, index, value);
357
- return;
462
+ return proceedWithValue(replay, items, partial, index, value, node);
358
463
  }
359
464
  const set: Value = expression.operator === "\\subseteq" ? { kind: "Subset", base: value } : value;
465
+ if (typeof set === "object" && set !== value) replay.callStack?.sources.set(set, source);
360
466
  if (assigned !== undefined) {
361
- if (evaluate(expression, context) === true) proceed(replay, items, partial);
362
- return;
467
+ return (
468
+ evaluateAt(replay, node, expression, context) === true &&
469
+ proceed(replay, items, partial, node)
470
+ );
363
471
  }
364
472
  if (!isTlcEnumerable(set))
365
473
  throw new TlaEvaluationError("The right side of \\IN is not enumerable.");
366
- for (const element of getStreamedElements(set)) {
367
- proceed(replay, items, assign(partial, index, element));
368
- }
474
+ const elements = getStreamedElements(set);
475
+ const enumerator =
476
+ replay.coverage && createChargedEnumerator(replay.coverage, set, elements, false);
477
+ const isProduced = elements.reduce<boolean>((isProduced, element) => {
478
+ enumerator?.next();
479
+ return proceed(replay, items, assign(partial, index, element), node) || isProduced;
480
+ }, false);
481
+ enumerator?.next();
482
+ return isProduced;
369
483
  };
370
484
 
371
485
  const ASSIGNMENT_OPERATORS = new Set(["=", "\\in", "\\subseteq"]);
372
486
 
373
487
  export const LITERAL_KINDS = new Set<Expression["kind"]>(["Number", "Decimal", "String"]);
374
488
 
489
+ const ENABLED_TEMPORAL_FORMS: Partial<Record<Expression["kind"], string>> = {
490
+ Always: "[]",
491
+ Eventually: "<>",
492
+ WeakFairness: "WF",
493
+ StrongFairness: "SF",
494
+ };
495
+
496
+ export const getEnabledFailure = (expression: Expression) => {
497
+ const form =
498
+ expression.kind === "Apply" && (expression.operator === "~>" || expression.operator === "-+->")
499
+ ? expression.operator === "~>"
500
+ ? "a ~> b"
501
+ : "a -+-> formula"
502
+ : ENABLED_TEMPORAL_FORMS[expression.kind];
503
+ if (form !== undefined) {
504
+ return `In computing ENABLED, TLC encountered a temporal formula (${form}).\n${describeRange(expression)}`;
505
+ }
506
+ if (expression.kind === "UnboundedQuantifier") {
507
+ return expression.isTemporal
508
+ ? `In computing ENABLED, TLC encountered temporal quantifier.\n${describeRange(expression)}`
509
+ : `In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${expression.quantifier === "Forall" ? "\\A" : "\\E"} x \\in S: P(x).\n${describeRange(expression)}`;
510
+ }
511
+ if (expression.kind === "Choose" && expression.set === undefined) {
512
+ return `In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${describeRange(expression)}`;
513
+ }
514
+ return undefined;
515
+ };
516
+
517
+ const getBindings = (
518
+ replay: Replay,
519
+ expression: Expression & { kind: "Exists" | "Forall" },
520
+ context: Context,
521
+ node: number,
522
+ ) => {
523
+ const bindings: (Scope | undefined)[] = [];
524
+ const version = replay.environment.runtime.version;
525
+ const bounded = runAt(replay, node, () =>
526
+ mapBoundSets(expression.bounds, (set) => {
527
+ const value = evaluate(set, context);
528
+ return { value, elements: getQuantifierElements(value, set, version) };
529
+ }),
530
+ );
531
+ const sets = bounded.map((item) => item.elements);
532
+ forEachBoundElement(expression.bounds, sets, context.scope, (bound) => {
533
+ bindings.push(bound);
534
+ return false;
535
+ });
536
+ const coverage = replay.coverage;
537
+ const charge =
538
+ coverage &&
539
+ chargeContexts(
540
+ coverage,
541
+ bounded.map((item) => item.value),
542
+ sets,
543
+ );
544
+ return { bindings, charge };
545
+ };
546
+
375
547
  const visitApplication = (
376
548
  replay: Replay,
377
549
  expression: Expression,
378
550
  items: ActionItem | undefined,
379
551
  scope: Scope | undefined,
380
552
  partial: State,
381
- ): void => {
553
+ node: number,
554
+ ): boolean => {
382
555
  const context = getContext(replay, scope, partial);
383
556
  switch (expression.kind) {
384
557
  case "Identifier":
385
- visitDefined(replay, expression, items, scope, partial);
386
- return;
558
+ return visitDefined(replay, expression, items, scope, partial, node);
387
559
  case "Apply": {
388
560
  if (ASSIGNMENT_OPERATORS.has(expression.operator) && expression.args.length === 2) {
389
- visitAssignment(replay, expression, items, scope, partial);
390
- return;
561
+ return visitAssignment(replay, expression, items, scope, partial, node);
391
562
  }
392
563
  if (expression.operator === "=>" && expression.args.length === 2) {
393
- if (isTrue(evaluate(expression.args[0], context))) {
394
- visit(replay, expression.args[1], items, scope, partial);
395
- return;
564
+ if (isTrue(evaluateAt(replay, node, expression.args[0], context))) {
565
+ return visit(replay, expression.args[1], items, scope, partial, node);
396
566
  }
397
- proceed(replay, items, partial);
398
- return;
567
+ return proceed(replay, items, partial, node);
399
568
  }
400
- visitDefined(replay, expression, items, scope, partial);
401
- return;
569
+ return visitDefined(replay, expression, items, scope, partial, node);
402
570
  }
403
571
  case "And": {
404
572
  const operands = expression.operands;
@@ -406,254 +574,435 @@ const visitApplication = (
406
574
  const rest = operands
407
575
  .slice(1)
408
576
  .reduceRight<ActionItem | undefined>(
409
- (tail, operand) => createItem("Predicate", operand, scope, tail),
577
+ (tail, operand) => createItem("Predicate", operand, scope, node, tail),
410
578
  items,
411
579
  );
412
- visit(replay, operands[0], rest, scope, partial);
413
- return;
580
+ return visit(replay, operands[0], rest, scope, partial, node);
414
581
  }
415
582
  const last = operands[operands.length - 1];
416
- visit(
583
+ return visitAt(
417
584
  replay,
418
585
  getPrefix(expression, operands.length - 1),
419
- createItem("Predicate", last, scope, items),
586
+ createItem("Predicate", last, scope, node, items),
420
587
  scope,
421
588
  partial,
589
+ getPrefixNode(replay, node),
422
590
  );
423
- return;
424
591
  }
425
592
  case "Or": {
426
593
  const operands = expression.operands;
427
594
  if (expression.isBulleted || operands.length === 2) {
428
- operands.forEach((operand) => visit(replay, operand, items, scope, partial));
429
- return;
595
+ return operands.reduce(
596
+ (isProduced, operand) =>
597
+ visit(replay, operand, items, scope, partial, node) || isProduced,
598
+ false,
599
+ );
430
600
  }
431
- visit(replay, getPrefix(expression, operands.length - 1), items, scope, partial);
432
- visit(replay, operands[operands.length - 1], items, scope, partial);
433
- return;
601
+ const isPrefixProduced = visitAt(
602
+ replay,
603
+ getPrefix(expression, operands.length - 1),
604
+ items,
605
+ scope,
606
+ partial,
607
+ getPrefixNode(replay, node),
608
+ );
609
+ const isLastProduced = visit(
610
+ replay,
611
+ operands[operands.length - 1],
612
+ items,
613
+ scope,
614
+ partial,
615
+ node,
616
+ );
617
+ return isPrefixProduced || isLastProduced;
618
+ }
619
+ case "Exists": {
620
+ const bound = getBindings(replay, expression, context, node);
621
+ return bound.bindings.reduce((isProduced, scope) => {
622
+ bound.charge?.();
623
+ return visit(replay, expression.body, items, scope, partial, node) || isProduced;
624
+ }, false);
434
625
  }
435
- case "Exists":
436
- forEachBinding(expression.bounds, context, (bound) => {
437
- visit(replay, expression.body, items, bound, partial);
438
- return false;
439
- });
440
- return;
441
626
  case "Forall": {
442
- const bounds: (Scope | undefined)[] = [];
443
- forEachBinding(expression.bounds, context, (bound) => {
444
- bounds.push(bound);
445
- return false;
446
- });
447
- if (bounds.length === 0) {
448
- proceed(replay, items, partial);
449
- return;
450
- }
451
- // TLC adds each binding after the first to the front of the conjuncts left.
627
+ const bound = getBindings(replay, expression, context, node);
628
+ const bounds = bound.bindings;
629
+ bounds.forEach(() => bound.charge?.());
630
+ if (bounds.length === 0) return proceed(replay, items, partial, node);
452
631
  const rest = bounds
453
632
  .slice(1)
454
633
  .reduce<ActionItem | undefined>(
455
- (tail, bound) => createItem("Predicate", expression.body, bound, tail),
634
+ (tail, bound) => createItem("Predicate", expression.body, bound, node, tail),
456
635
  items,
457
636
  );
458
- visit(replay, expression.body, rest, bounds[0], partial);
459
- return;
637
+ return visit(replay, expression.body, rest, bounds[0], partial, node);
460
638
  }
461
639
  case "If":
462
- visit(
640
+ return visit(
463
641
  replay,
464
- isTrue(evaluate(expression.condition, context))
642
+ isTrue(evaluateAt(replay, node, expression.condition, context))
465
643
  ? expression.consequent
466
644
  : expression.alternative,
467
645
  items,
468
646
  scope,
469
647
  partial,
648
+ node,
470
649
  );
471
- return;
472
650
  case "Case": {
473
651
  const arm = expression.arms.find((candidate) =>
474
- isTrue(evaluate(candidate.condition, context)),
652
+ isTrue(evaluateAt(replay, node, candidate.condition, context)),
475
653
  );
476
654
  const body = arm?.body ?? expression.other;
477
655
  if (body === undefined) {
478
656
  throw new TlaEvaluationError("TLC encountered a CASE with no conditions true.");
479
657
  }
480
- visit(replay, body, items, scope, partial);
481
- return;
658
+ return visit(replay, body, items, scope, partial, node);
482
659
  }
483
660
  case "FunctionApplication": {
484
661
  const lambda = getLazyFunction(
485
- evaluate(expression.function, replay.isInit ? context : toKeepLazyContext(context)),
662
+ evaluateAt(
663
+ replay,
664
+ node,
665
+ expression.function,
666
+ replay.isInit ? context : toKeepLazyContext(context),
667
+ ),
486
668
  );
487
669
  if (lambda) {
488
- visit(replay, lambda.body, items, bindLazyArguments(lambda, expression, context), partial);
489
- return;
670
+ const bound = runAt(replay, node, () => bindLazyArguments(lambda, expression, context));
671
+ return visit(replay, lambda.body, items, bound, partial, node);
490
672
  }
491
673
  break;
492
674
  }
493
675
  case "Unchanged":
494
676
  if (!replay.isInit) {
495
- visitUnchanged(replay, expression.expression, items, scope, partial);
496
- return;
677
+ return visitUnchanged(replay, expression.expression, items, scope, partial, node);
497
678
  }
498
679
  break;
499
680
  case "BoxAction":
500
681
  if (!replay.isInit) {
501
- visit(replay, expression.action, items, scope, partial);
502
- visitUnchanged(replay, expression.subscript, items, scope, partial);
503
- return;
682
+ const isProduced = visit(replay, expression.action, items, scope, partial, node);
683
+ return (
684
+ visitUnchanged(replay, expression.subscript, items, scope, partial, node) || isProduced
685
+ );
504
686
  }
505
687
  break;
506
688
  case "AngleAction":
507
689
  if (!replay.isInit) {
508
- visit(
690
+ return visit(
509
691
  replay,
510
692
  expression.action,
511
- createItem("Changed", expression.subscript, scope, items),
693
+ createItem("Changed", expression.subscript, scope, node, items),
512
694
  scope,
513
695
  partial,
696
+ node,
514
697
  );
515
- return;
516
698
  }
517
699
  break;
518
700
  }
519
- visitValue(replay, evaluate(expression, context), items, partial);
701
+ const failure = replay.isEnabled ? getEnabledFailure(expression) : undefined;
702
+ if (failure !== undefined) throw new TlaEvaluationError(failure);
703
+ return visitValue(replay, evaluateAt(replay, node, expression, context), items, partial, node);
520
704
  };
521
705
 
522
- // TLC's processUnchanged.
706
+ export const warnChangedUnchanged = (
707
+ environment: Environment,
708
+ index: number,
709
+ expression: Expression,
710
+ ) =>
711
+ environment.runtime.warn(
712
+ MESSAGE_CODE.unchangedVariableChanged,
713
+ `The variable ${environment.variables[index]} was changed while it is specified as UNCHANGED at\n${describeRange(expression)}`,
714
+ );
715
+
523
716
  const visitUnchanged = (
524
717
  replay: Replay,
525
718
  expression: Expression,
526
719
  items: ActionItem | undefined,
527
720
  scope: Scope | undefined,
528
721
  partial: State,
529
- ): void =>
722
+ parent: number,
723
+ ): boolean =>
530
724
  withFrame(replay, expression, () => {
531
- const index = getVariable(replay, expression, scope);
725
+ const node = getNode(replay, parent, expression);
726
+ const index = getVariable(replay.environment, expression, scope);
532
727
  if (index !== undefined) {
533
728
  const value = replay.current?.[index];
534
- if (value !== undefined) proceedWithValue(replay, items, partial, index, value);
535
- return;
729
+ if (value === undefined) return false;
730
+ if (replay.isEnabled && replay.coverage) countCoverage(replay.coverage, node);
731
+ const assigned = partial[index];
732
+ if (assigned !== undefined && !isEqualLikeTlc(assigned, value)) {
733
+ warnChangedUnchanged(replay.environment, index, expression);
734
+ return false;
735
+ }
736
+ return proceedWithValue(replay, items, partial, index, value, node);
536
737
  }
537
738
  if (expression.kind === "Tuple") {
538
739
  const [first, ...others] = expression.elements;
539
- if (first === undefined) {
540
- proceed(replay, items, partial);
541
- return;
542
- }
740
+ if (first === undefined) return proceed(replay, items, partial, node);
543
741
  const rest = others.reduceRight<ActionItem | undefined>(
544
- (tail, element) => createItem("Unchanged", element, scope, tail),
742
+ (tail, element) => createItem("Unchanged", element, scope, node, tail),
545
743
  items,
546
744
  );
547
- visitUnchanged(replay, first, rest, scope, partial);
548
- return;
745
+ return visitUnchanged(replay, first, rest, scope, partial, node);
549
746
  }
550
747
  if (expression.kind === "Identifier") {
551
748
  const binding = lookupScope(scope, expression.name);
552
749
  if (binding?.kind === "Thunk") {
553
- visitUnchanged(replay, binding.expression, items, binding.scope, partial);
554
- return;
750
+ return visitUnchanged(replay, binding.expression, items, binding.scope, partial, node);
555
751
  }
556
752
  const operator = binding
557
753
  ? undefined
558
754
  : resolveGlobalOperator(expression.name, replay.environment);
559
755
  if (operator?.kind === "Closure" && operator.params.length === 0) {
560
- visitUnchanged(replay, operator.body, items, operator.scope, partial);
561
- return;
756
+ return visitUnchanged(replay, operator.body, items, operator.scope, partial, node);
757
+ }
758
+ }
759
+ // Deviation from TLC: Tool#enabledUnchanged evaluates the application in the partial next state and fails on an unassigned variable.
760
+ if (replay.isEnabled && expression.kind === "Apply") {
761
+ const context = getContext(replay, scope, partial);
762
+ const operator = resolveApplyOperator(expression, context);
763
+ if (operator?.kind === "Closure" && operator.params.length === expression.args.length) {
764
+ return visitUnchanged(
765
+ replay,
766
+ operator.body,
767
+ items,
768
+ bindOperatorArguments(operator, expression.args, context),
769
+ partial,
770
+ node,
771
+ );
562
772
  }
563
773
  }
564
774
  const environment = replay.environment;
565
- const before = evaluate(expression, {
775
+ const before = evaluateAt(replay, node, expression, {
566
776
  environment,
567
777
  scope,
568
778
  state: replay.current,
569
779
  next: undefined,
570
780
  });
571
- const after = evaluate(expression, { environment, scope, state: partial, next: undefined });
572
- if (valuesEqual(before, after)) proceed(replay, items, partial);
781
+ const after = evaluateAt(replay, node, expression, {
782
+ environment,
783
+ scope,
784
+ state: partial,
785
+ next: undefined,
786
+ });
787
+ return isEqualLikeTlc(before, after) && proceed(replay, items, partial, node);
573
788
  });
574
789
 
575
790
  const createReplay = (
576
791
  environment: Environment,
577
- isInit: boolean,
792
+ kind: "init" | "next" | "enabled",
578
793
  current: Value[] | undefined,
579
794
  onState: (state: Value[]) => void,
580
- isEnabled = false,
581
- ): Replay => {
582
- const callStack = environment.callStack;
583
- if (!callStack) throw new Error("The replay needs an environment that records its call stack");
584
- return { environment, callStack, isInit, isEnabled, current, onState };
585
- };
795
+ onIncomplete?: (state: State) => boolean,
796
+ ): Replay => ({
797
+ environment,
798
+ callStack: environment.callStack,
799
+ coverage:
800
+ kind === "enabled" && environment.coverage?.current === -1 ? undefined : environment.coverage,
801
+ isInit: kind === "init",
802
+ isEnabled: kind === "enabled",
803
+ current,
804
+ onState,
805
+ onIncomplete,
806
+ });
586
807
 
587
808
  const ENABLED_FOUND = new Error("The replay found a successor");
588
809
 
589
- // TLC's Tool#enabled, which walks the action as getNextStates does and stops at the first
590
- // successor.
591
810
  export const replayEnabled = (
592
811
  expression: Expression,
593
812
  scope: Scope | undefined,
594
813
  state: Value[],
595
814
  environment: Environment,
596
815
  ) => {
597
- const replay = createReplay(
598
- environment,
599
- false,
600
- state,
601
- () => {
602
- throw ENABLED_FOUND;
603
- },
604
- true,
605
- );
606
- const depth = replay.callStack.expressions.length;
816
+ const found = () => {
817
+ throw ENABLED_FOUND;
818
+ };
819
+ const node = environment.coverage?.current ?? -1;
820
+ const replay = createReplay(environment, "enabled", state, found, found);
821
+ const callStack = replay.callStack;
822
+ const depth = callStack?.expressions.length ?? 0;
607
823
  try {
608
- // The ENABLED of a fairness condition WF_v(A) passes A to TLC's enabled with v to change, where
609
- // liveness.ts builds <<A>>_v at the location of A.
610
824
  if (expression.kind === "AngleAction" && expression.location === expression.action.location) {
611
- const changed = createItem("Changed", expression.subscript, scope, undefined);
612
- visit(replay, expression.action, changed, scope, getEmptyState(environment));
825
+ const changed = createItem("Changed", expression.subscript, scope, node, undefined);
826
+ visit(replay, expression.action, changed, scope, getEmptyState(environment), node);
613
827
  } else {
614
- visit(replay, expression, undefined, scope, getEmptyState(environment));
828
+ visit(replay, expression, undefined, scope, getEmptyState(environment), node);
615
829
  }
616
830
  return false;
617
831
  } catch (error) {
618
832
  if (error !== ENABLED_FOUND) throw error;
619
- // The frames the walk left are those of the successor, not of a failure.
620
- replay.callStack.expressions.length = depth;
621
- replay.callStack.isFrozen = false;
833
+ if (callStack) {
834
+ callStack.expressions.length = depth;
835
+ callStack.isFrozen = false;
836
+ }
622
837
  return true;
623
838
  }
624
839
  };
625
840
 
626
- // TLC's getInitStates, which conjoins the initial predicates of the specification.
627
841
  export const replayInitialStates = (
628
- inits: ReplayAction[],
842
+ inits: (ReplayAction & { node?: number })[],
629
843
  environment: Environment,
630
844
  onState: (state: Value[]) => void,
845
+ onIncomplete?: (state: State) => boolean,
631
846
  ) => {
632
847
  const [first, ...others] = inits;
633
848
  if (first === undefined) return;
634
- const replay = createReplay(environment, true, undefined, onState);
849
+ const replay = createReplay(environment, "init", undefined, onState, onIncomplete);
635
850
  const rest = others.reduceRight<ActionItem | undefined>(
636
- (tail, init) => createItem("Predicate", init.expression, init.scope, tail),
851
+ (tail, init) => createItem("Predicate", init.expression, init.scope, init.node ?? -1, tail),
637
852
  undefined,
638
853
  );
639
- visit(replay, first.expression, rest, first.scope, getEmptyState(environment));
854
+ visit(replay, first.expression, rest, first.scope, getEmptyState(environment), first.node ?? -1);
640
855
  };
641
856
 
642
- // TLC's getNextStates for each action TLC splits the next-state relation into. TLC checks the
643
- // successors of an action once it has computed them all.
644
- export const replaySuccessors = <Action extends ReplayAction>(
857
+ export const replaySuccessors = <Action extends ReplayAction & { node?: number }>(
645
858
  actions: Action[],
646
859
  state: Value[],
647
860
  environment: Environment,
648
861
  onState: (state: Value[], action: Action) => void,
649
862
  ) => {
650
- // TLC fails to split a next-state relation that is not an operator application before it checks
651
- // the spec, so it replays nothing.
652
863
  if (actions.some((action) => LITERAL_KINDS.has(action.expression.kind))) return;
864
+ const coverage = environment.coverage;
653
865
  actions.forEach((action) => {
654
866
  const successors: Value[][] = [];
655
- const replay = createReplay(environment, false, state, (next) => successors.push(next));
656
- visit(replay, action.expression, undefined, action.scope, getEmptyState(environment));
867
+ const node = action.node ?? -1;
868
+ walkSuccessors(action, node, state, environment, (next) => {
869
+ if (coverage && node !== -1) coverage.primary[node]++;
870
+ successors.push(next);
871
+ });
657
872
  successors.forEach((successor) => onState(successor, action));
658
873
  });
659
874
  };
875
+
876
+ export const walkSuccessors = (
877
+ action: ReplayAction,
878
+ node: number,
879
+ state: Value[],
880
+ environment: Environment,
881
+ onState: (state: Value[]) => void,
882
+ onIncomplete?: (state: State) => boolean,
883
+ ) => {
884
+ const replay = createReplay(environment, "next", state, onState, onIncomplete);
885
+ visit(replay, action.expression, undefined, action.scope, getEmptyState(environment), node);
886
+ };
887
+
888
+ export const getPrimedRanges = (actions: ReplayAction[], environment: Environment) => {
889
+ const ranges: Expression[] = [];
890
+ const createContext = (scope: Scope | undefined): Context => ({
891
+ environment,
892
+ scope,
893
+ state: undefined,
894
+ next: undefined,
895
+ });
896
+ const collectUnchanged = (expression: Expression, scope: Scope | undefined): void => {
897
+ if (
898
+ getVariable(environment, expression, undefined) !== undefined &&
899
+ expression.kind === "Identifier"
900
+ ) {
901
+ ranges.push(expression);
902
+ return;
903
+ }
904
+ if (expression.kind === "Tuple") {
905
+ expression.elements.forEach((element) => collectUnchanged(element, scope));
906
+ return;
907
+ }
908
+ if (expression.kind !== "Identifier") return;
909
+ const binding = lookupScope(scope, expression.name);
910
+ const operator = binding ? undefined : resolveGlobalOperator(expression.name, environment);
911
+ if (operator?.kind === "Closure" && operator.params.length === 0) {
912
+ collectUnchanged(operator.body, operator.scope);
913
+ }
914
+ };
915
+ const collect = (
916
+ expression: Expression,
917
+ scope: Scope | undefined,
918
+ visited: Set<Expression>,
919
+ ): void => {
920
+ switch (expression.kind) {
921
+ case "Let":
922
+ collect(
923
+ expression.body,
924
+ bindDefinitions(expression.definitions, createContext(scope)),
925
+ visited,
926
+ );
927
+ return;
928
+ case "Label":
929
+ collect(expression.body, scope, visited);
930
+ return;
931
+ case "Selection":
932
+ collect(expression.expression, scope, visited);
933
+ return;
934
+ case "FunctionApplication":
935
+ collect(expression.function, scope, visited);
936
+ return;
937
+ case "If":
938
+ collect(expression.consequent, scope, visited);
939
+ collect(expression.alternative, scope, visited);
940
+ return;
941
+ case "Case":
942
+ expression.arms.forEach((arm) => collect(arm.body, scope, visited));
943
+ if (expression.other) collect(expression.other, scope, visited);
944
+ return;
945
+ case "And":
946
+ case "Or":
947
+ expression.operands.forEach((operand) => collect(operand, scope, visited));
948
+ return;
949
+ case "Exists":
950
+ case "Forall":
951
+ collect(expression.body, scope, visited);
952
+ return;
953
+ case "Unchanged":
954
+ collectUnchanged(expression.expression, scope);
955
+ return;
956
+ case "AngleAction":
957
+ collect(expression.action, scope, visited);
958
+ return;
959
+ case "BoxAction":
960
+ collect(expression.action, scope, visited);
961
+ ranges.push(expression.subscript);
962
+ return;
963
+ case "Identifier":
964
+ case "Apply": {
965
+ if (expression.kind === "Apply") {
966
+ if (expression.operator === "=>") {
967
+ expression.args.forEach((arg) => collect(arg, scope, visited));
968
+ return;
969
+ }
970
+ if (expression.operator === "=" || expression.operator === "\\in") {
971
+ if (getPrimedVariable(environment, expression.args[0], scope) !== undefined) {
972
+ ranges.push(expression);
973
+ }
974
+ return;
975
+ }
976
+ }
977
+ const name = expression.kind === "Identifier" ? expression.name : expression.operator;
978
+ const binding = lookupScope(scope, name);
979
+ if (binding?.kind === "Thunk") {
980
+ collect(binding.expression, binding.scope, visited);
981
+ return;
982
+ }
983
+ const operator =
984
+ expression.kind === "Apply"
985
+ ? resolveApplyOperator(expression, createContext(scope))
986
+ : binding?.kind === "Operator"
987
+ ? binding.operator
988
+ : binding
989
+ ? undefined
990
+ : resolveGlobalOperator(name, environment);
991
+ if (operator?.kind !== "Closure" || visited.has(operator.body)) return;
992
+ const definition = environment.definitions.get(name);
993
+ if (definition?.isRecursive) return;
994
+ const args = expression.kind === "Apply" ? expression.args : [];
995
+ if (operator.params.length !== args.length) return;
996
+ visited.add(operator.body);
997
+ collect(
998
+ operator.body,
999
+ bindOperatorArguments(operator, args, createContext(scope)),
1000
+ visited,
1001
+ );
1002
+ visited.delete(operator.body);
1003
+ }
1004
+ }
1005
+ };
1006
+ actions.forEach((action) => collect(action.expression, action.scope, new Set()));
1007
+ return ranges.flatMap((expression) => expression.location.range ?? []);
1008
+ };