tla-ts 0.0.9 → 0.0.10-dev.094b9b512

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 (622) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +40 -37
  5. package/dist/deciders.js +47 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  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 +2658 -410
  15. package/dist/prove.js +2657 -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 +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +208 -54
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +18 -43
  66. package/src/obligations/anonymize.ts +119 -90
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +2 -2
  69. package/src/obligations/expression.ts +38 -25
  70. package/src/obligations/format.ts +1 -9
  71. package/src/obligations/generate.ts +67 -63
  72. package/src/obligations/index.ts +38 -20
  73. package/src/obligations/levels.ts +28 -17
  74. package/src/obligations/module.ts +29 -54
  75. package/src/obligations/normalize.ts +31 -36
  76. package/src/obligations/operators.ts +1 -2
  77. package/src/obligations/pragma.ts +53 -25
  78. package/src/obligations/printer.ts +90 -57
  79. package/src/obligations/proof.ts +4 -5
  80. package/src/obligations/regroup.ts +1 -4
  81. package/src/obligations/simplify.ts +58 -62
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +51 -27
  84. package/src/obligations/substitution.ts +2 -4
  85. package/src/obligations/temporal.ts +13 -19
  86. package/src/obligations/tuples.ts +3 -9
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +57 -71
  89. package/src/parser.ts +961 -387
  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 +19 -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 -62
  101. package/src/prover/isabelle/isar/attrib.ts +219 -0
  102. package/src/prover/isabelle/isar/context.ts +336 -0
  103. package/src/prover/isabelle/isar/induct.ts +392 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +513 -225
  106. package/src/prover/isabelle/isar/proof.ts +569 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +234 -0
  108. package/src/prover/isabelle/isar/theory.ts +490 -89
  109. package/src/prover/isabelle/isar/toplevel.ts +341 -0
  110. package/src/prover/isabelle/isar/type-check.ts +100 -37
  111. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  112. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  113. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  114. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  115. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  116. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  118. package/src/prover/isabelle/provers/classical.ts +59 -60
  119. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  120. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  121. package/src/prover/isabelle/pure/consts.ts +1 -7
  122. package/src/prover/isabelle/pure/conv.ts +3 -17
  123. package/src/prover/isabelle/pure/drule.ts +96 -44
  124. package/src/prover/isabelle/pure/envir.ts +3 -52
  125. package/src/prover/isabelle/pure/goal.ts +2 -8
  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 +2 -15
  129. package/src/prover/isabelle/pure/name.ts +2 -9
  130. package/src/prover/isabelle/pure/net.ts +3 -59
  131. package/src/prover/isabelle/pure/object-logic.ts +16 -15
  132. package/src/prover/isabelle/pure/pattern.ts +2 -19
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  134. package/src/prover/isabelle/pure/rewriter.ts +32 -73
  135. package/src/prover/isabelle/pure/search.ts +3 -10
  136. package/src/prover/isabelle/pure/seq.ts +1 -10
  137. package/src/prover/isabelle/pure/simplifier.ts +28 -15
  138. package/src/prover/isabelle/pure/table.ts +3 -32
  139. package/src/prover/isabelle/pure/tactic.ts +12 -22
  140. package/src/prover/isabelle/pure/tactical.ts +48 -47
  141. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  142. package/src/prover/isabelle/pure/term.ts +2 -43
  143. package/src/prover/isabelle/pure/thm.ts +27 -47
  144. package/src/prover/isabelle/pure/type.ts +2 -15
  145. package/src/prover/isabelle/pure/unify.ts +20 -30
  146. package/src/prover/isabelle/pure/variable.ts +3 -7
  147. package/src/prover/isabelle/tla/classical-setup.ts +18 -24
  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 +46 -43
  152. package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
  153. package/src/prover/ocaml.ts +0 -6
  154. package/src/prover/prep/action.ts +32 -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 +0 -2
  159. package/src/prover/prep/methods.ts +137 -83
  160. package/src/prover/prep/normalize.ts +38 -36
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +371 -132
  163. package/src/prover/ptl/decide.ts +104 -44
  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 +61 -29
  170. package/src/prover/smt/data.ts +497 -387
  171. package/src/prover/smt/encode.ts +156 -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 +1025 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +182 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -15
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +43 -0
  185. package/src/prover/smt/solver/aig.ts +890 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +613 -48
  187. package/src/prover/smt/solver/arith-terms.ts +123 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +312 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -57
  192. package/src/prover/smt/solver/ast-lt.ts +166 -21
  193. package/src/prover/smt/solver/ast-util.ts +161 -7
  194. package/src/prover/smt/solver/ast.ts +1466 -178
  195. package/src/prover/smt/solver/auf-solver.ts +8 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +874 -0
  198. package/src/prover/smt/solver/bound-manager.ts +186 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +602 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +224 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
  208. package/src/prover/smt/solver/card2bv.ts +112 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  210. package/src/prover/smt/solver/cg-table.ts +28 -34
  211. package/src/prover/smt/solver/check-logic.ts +326 -0
  212. package/src/prover/smt/solver/clause.ts +1 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +79 -12
  215. package/src/prover/smt/solver/context.ts +510 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +34 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
  220. package/src/prover/smt/solver/demodulator.ts +789 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
  222. package/src/prover/smt/solver/der.ts +40 -30
  223. package/src/prover/smt/solver/diff-neq.ts +207 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +67 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +513 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  228. package/src/prover/smt/solver/e-matching.ts +4 -35
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
  231. package/src/prover/smt/solver/enode.ts +93 -22
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +308 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +885 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1094 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +343 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
  253. package/src/prover/smt/solver/expr-ref.ts +1 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
  255. package/src/prover/smt/solver/expr2polynomial.ts +147 -0
  256. package/src/prover/smt/solver/factor.ts +152 -0
  257. package/src/prover/smt/solver/fd-solver.ts +269 -0
  258. package/src/prover/smt/solver/fingerprints.ts +16 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +149 -0
  260. package/src/prover/smt/solver/flat-literals.ts +1 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +873 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
  267. package/src/prover/smt/solver/goal.ts +177 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +191 -0
  269. package/src/prover/smt/solver/guard-set.ts +220 -0
  270. package/src/prover/smt/solver/hash.ts +0 -8
  271. package/src/prover/smt/solver/hashtable.ts +27 -23
  272. package/src/prover/smt/solver/inf-eps.ts +64 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +102 -0
  274. package/src/prover/smt/solver/internalizer.ts +72 -130
  275. package/src/prover/smt/solver/lackr.ts +383 -0
  276. package/src/prover/smt/solver/lbool.ts +1 -2
  277. package/src/prover/smt/solver/lia2card.ts +269 -0
  278. package/src/prover/smt/solver/lia2pb.ts +141 -0
  279. package/src/prover/smt/solver/literal.ts +0 -3
  280. package/src/prover/smt/solver/logic-tactics.ts +349 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  283. package/src/prover/smt/solver/lp/containers.ts +12 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +24 -27
  285. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  287. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  289. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  293. package/src/prover/smt/solver/lp/int-cube.ts +18 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  295. package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  300. package/src/prover/smt/solver/lp/nex.ts +1 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  302. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +69 -132
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  320. package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  327. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +6 -5
  329. package/src/prover/smt/solver/macro-finder.ts +533 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +117 -126
  331. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
  333. package/src/prover/smt/solver/max-cliques.ts +107 -0
  334. package/src/prover/smt/solver/maxcore.ts +318 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
  336. package/src/prover/smt/solver/maxlex.ts +123 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +99 -0
  338. package/src/prover/smt/solver/maxsmt.ts +93 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +845 -0
  346. package/src/prover/smt/solver/model-checker.ts +20 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +186 -39
  348. package/src/prover/smt/solver/model-finder.ts +15 -32
  349. package/src/prover/smt/solver/model-generator.ts +57 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +58 -111
  351. package/src/prover/smt/solver/model-printer.ts +215 -0
  352. package/src/prover/smt/solver/mpf.ts +712 -0
  353. package/src/prover/smt/solver/mus.ts +52 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +362 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
  367. package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
  368. package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
  369. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
  370. package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
  371. package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
  372. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  373. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
  374. package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
  375. package/src/prover/smt/solver/muz/substitution.ts +154 -0
  376. package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
  377. package/src/prover/smt/solver/nlqsat.ts +484 -0
  378. package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
  379. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  380. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  381. package/src/prover/smt/solver/nlsat/explain.ts +61 -69
  382. package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
  383. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  384. package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
  385. package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
  386. package/src/prover/smt/solver/nlsat/solver.ts +227 -99
  387. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
  388. package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
  389. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  390. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  391. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  392. package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
  393. package/src/prover/smt/solver/nnf.ts +108 -60
  394. package/src/prover/smt/solver/normalize-bounds.ts +54 -0
  395. package/src/prover/smt/solver/occf.ts +98 -0
  396. package/src/prover/smt/solver/opt-context.ts +787 -0
  397. package/src/prover/smt/solver/opt-nlsat.ts +366 -0
  398. package/src/prover/smt/solver/opt-pareto.ts +284 -0
  399. package/src/prover/smt/solver/opt-preprocess.ts +102 -0
  400. package/src/prover/smt/solver/opt-solver.ts +300 -0
  401. package/src/prover/smt/solver/opt-value.ts +56 -0
  402. package/src/prover/smt/solver/optsmt.ts +691 -0
  403. package/src/prover/smt/solver/parallel-tactic.ts +301 -0
  404. package/src/prover/smt/solver/pattern-inference.ts +19 -23
  405. package/src/prover/smt/solver/pb-rewriter.ts +296 -0
  406. package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
  407. package/src/prover/smt/solver/poly-rewriter.ts +203 -77
  408. package/src/prover/smt/solver/probes.ts +514 -0
  409. package/src/prover/smt/solver/propagate-values.ts +34 -30
  410. package/src/prover/smt/solver/proto-model.ts +648 -63
  411. package/src/prover/smt/solver/pull-quant.ts +29 -23
  412. package/src/prover/smt/solver/purify-arith.ts +598 -0
  413. package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
  414. package/src/prover/smt/solver/qe-lite-der.ts +3 -31
  415. package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
  416. package/src/prover/smt/solver/qe-lite.ts +40 -49
  417. package/src/prover/smt/solver/qe-mbp.ts +281 -0
  418. package/src/prover/smt/solver/qe.ts +1508 -0
  419. package/src/prover/smt/solver/qel.ts +26 -0
  420. package/src/prover/smt/solver/qi-queue.ts +1 -16
  421. package/src/prover/smt/solver/qsat.ts +840 -0
  422. package/src/prover/smt/solver/quant-hoist.ts +195 -0
  423. package/src/prover/smt/solver/quant-tactics.ts +18 -74
  424. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  425. package/src/prover/smt/solver/quantifier-manager.ts +9 -23
  426. package/src/prover/smt/solver/quasi-macros.ts +254 -0
  427. package/src/prover/smt/solver/random-gen.ts +1 -2
  428. package/src/prover/smt/solver/rational.ts +29 -8
  429. package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
  430. package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
  431. package/src/prover/smt/solver/reduce-args.ts +226 -0
  432. package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
  433. package/src/prover/smt/solver/ref-vector.ts +1 -6
  434. package/src/prover/smt/solver/relevancy.ts +3 -16
  435. package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
  436. package/src/prover/smt/solver/rewriter.ts +478 -120
  437. package/src/prover/smt/solver/rlimit.ts +27 -21
  438. package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
  439. package/src/prover/smt/solver/sat/big.ts +178 -0
  440. package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
  441. package/src/prover/smt/solver/sat/clause.ts +221 -0
  442. package/src/prover/smt/solver/sat/cleaner.ts +96 -0
  443. package/src/prover/smt/solver/sat/config.ts +125 -0
  444. package/src/prover/smt/solver/sat/consequences.ts +204 -0
  445. package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
  446. package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
  447. package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
  448. package/src/prover/smt/solver/sat/model-converter.ts +156 -0
  449. package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
  450. package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
  451. package/src/prover/smt/solver/sat/probing.ts +169 -0
  452. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  453. package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
  454. package/src/prover/smt/solver/sat/scc.ts +143 -0
  455. package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
  456. package/src/prover/smt/solver/sat/solver.ts +2128 -0
  457. package/src/prover/smt/solver/sat/var-queue.ts +119 -0
  458. package/src/prover/smt/solver/sat/watch-list.ts +136 -0
  459. package/src/prover/smt/solver/search-tree.ts +285 -0
  460. package/src/prover/smt/solver/seq-axioms.ts +1013 -0
  461. package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
  462. package/src/prover/smt/solver/seq-derive.ts +1303 -0
  463. package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
  464. package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
  465. package/src/prover/smt/solver/seq-factory.ts +91 -0
  466. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  467. package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
  468. package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
  469. package/src/prover/smt/solver/seq-re-util.ts +777 -0
  470. package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
  471. package/src/prover/smt/solver/seq-regex-live.ts +202 -0
  472. package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +318 -0
  475. package/src/prover/smt/solver/seq-subset.ts +166 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +355 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +299 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +85 -0
  479. package/src/prover/smt/solver/smt-logics.ts +67 -0
  480. package/src/prover/smt/solver/smt-setup.ts +492 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +767 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
  483. package/src/prover/smt/solver/smtlib-script.ts +1493 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +931 -0
  485. package/src/prover/smt/solver/solver.ts +120 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +319 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  489. package/src/prover/smt/solver/tactic.ts +1936 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +206 -0
  491. package/src/prover/smt/solver/theory-array.ts +1275 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1239 -0
  493. package/src/prover/smt/solver/theory-char.ts +356 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +599 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +422 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +24 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +7 -27
  504. package/src/prover/smt/solver/theory-lra.ts +194 -8
  505. package/src/prover/smt/solver/theory-pb.ts +932 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +308 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +880 -0
  511. package/src/prover/smt/solver/theory-seq.ts +984 -0
  512. package/src/prover/smt/solver/theory.ts +175 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
  514. package/src/prover/smt/solver/var-subst.ts +33 -35
  515. package/src/prover/smt/table.ts +1 -9
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -15
  535. package/src/prover/zenon/encode.ts +1 -8
  536. package/src/prover/zenon/eqrel.ts +2 -13
  537. package/src/prover/zenon/equality-rules.ts +0 -4
  538. package/src/prover/zenon/expr.ts +8 -26
  539. package/src/prover/zenon/index-table.ts +26 -57
  540. package/src/prover/zenon/isar-case.ts +9 -19
  541. package/src/prover/zenon/isar.ts +36 -64
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -20
  544. package/src/prover/zenon/mltoll.ts +66 -104
  545. package/src/prover/zenon/node.ts +20 -14
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +10 -12
  548. package/src/prover/zenon/phrase.ts +1 -11
  549. package/src/prover/zenon/proof.ts +0 -9
  550. package/src/prover/zenon/propositional-rules.ts +0 -5
  551. package/src/prover/zenon/rules.ts +2 -6
  552. package/src/prover/zenon/search.ts +11 -33
  553. package/src/prover/zenon/tla/functions.ts +59 -31
  554. package/src/prover/zenon/tla/llproof.ts +67 -76
  555. package/src/prover/zenon/tla/records.ts +57 -33
  556. package/src/prover/zenon/tla/rewrites.ts +12 -19
  557. package/src/prover/zenon/tla/sets.ts +88 -57
  558. package/src/prover/zenon/tla/terms.ts +0 -6
  559. package/src/prover/zenon/tla/tla.ts +66 -64
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -184
  562. package/src/runtime.ts +22 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +6 -34
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +1 -9
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +541 -163
  581. package/src/simulate.ts +709 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +0 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -31
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +266 -99
  589. package/src/symmetry.ts +33 -25
  590. package/src/tableau.ts +27 -24
  591. package/src/tlc/fingerprint.ts +183 -67
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +36 -47
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +139 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typescript/actions.ts +479 -0
  605. package/src/typescript/collections.ts +614 -0
  606. package/src/typescript/compile.ts +63 -0
  607. package/src/typescript/context.ts +94 -0
  608. package/src/typescript/emit.ts +121 -0
  609. package/src/typescript/expressions.ts +496 -0
  610. package/src/typescript/formula.ts +154 -0
  611. package/src/typescript/functions.ts +284 -0
  612. package/src/typescript/model.ts +162 -0
  613. package/src/typescript/names.ts +114 -0
  614. package/src/typescript/program.ts +48 -0
  615. package/src/typescript/properties.ts +139 -0
  616. package/src/typescript/scope.ts +112 -0
  617. package/src/typescript/steps.ts +167 -0
  618. package/src/typescript/types.ts +171 -0
  619. package/src/values.ts +832 -484
  620. package/src/worker.ts +7 -8
  621. package/src/prover/isabelle/isar/statement.ts +0 -57
  622. package/src/prover/tlaps-module.ts +0 -510
@@ -1,17 +1,18 @@
1
- // A port of tlapm's Expr.Deref: a subexpression reference such as Op!2!<< resolves to the
2
- // subexpression it names, abstracted over the bound names it uses.
1
+ // A port of tlapm's Expr.Deref.
3
2
 
4
3
  import { TlaProofError, TlapmBugError } from "../errors";
5
4
  import { consAll, consSubstitution, shift, substituteExpr } from "./substitution";
6
5
  import {
7
6
  at,
8
7
  getErrorNote,
8
+ getErrorSetting,
9
9
  getBoundFresh,
10
10
  getChildren,
11
11
  getFresh,
12
12
  getParamFresh,
13
13
  mapChildren,
14
14
  mapSelectorArgs,
15
+ warnError,
15
16
  type Bound,
16
17
  type Defn,
17
18
  type Expr,
@@ -20,6 +21,8 @@ import {
20
21
  type Param,
21
22
  type Selector,
22
23
  } from "./expression";
24
+ import { renderDoc } from "./format";
25
+ import { printExpression } from "./printer";
23
26
 
24
27
  interface Resolution {
25
28
  params: Param[];
@@ -48,7 +51,6 @@ const stripParensAndAtomic = (expression: Expr): Expr => {
48
51
  return rest;
49
52
  };
50
53
 
51
- // Parentheses go everywhere but in the definitions of a LET.
52
54
  const stripParens = (expression: Expr): Expr => {
53
55
  if (expression.kind === "Let") {
54
56
  return at(
@@ -63,8 +65,6 @@ const stripParens = (expression: Expr): Expr => {
63
65
  const hasNegativeIndex = (expression: Expr): boolean =>
64
66
  expression.kind === "Ix" ? expression.index <= 0 : getChildren(expression).some(hasNegativeIndex);
65
67
 
66
- // Visit.iter's context for each binder, stopping at labels with other names and at declarations
67
- // in an ASSUME.
68
68
  const findLabel = (expression: Expr, label: string, context: Hyp[]): LabelMatch | undefined => {
69
69
  const search = (inner: Expr, innerContext = context) => findLabel(inner, label, innerContext);
70
70
  const searchBounds = (bounds: Bound[], body: Expr) =>
@@ -133,7 +133,6 @@ const findLabel = (expression: Expr, label: string, context: Hyp[]): LabelMatch
133
133
  }
134
134
  };
135
135
 
136
- // The first count indices in reverse, and the rest past the parameters.
137
136
  const getReversal = (count: number, paramCount: number) =>
138
137
  consAll(
139
138
  Array.from({ length: count }, (_item, index): Expr => ({ kind: "Ix", index: index + 1 })),
@@ -152,6 +151,8 @@ const instantiate = (onWarning: Warn, expression: Expr, args: Expr[]): Expr => {
152
151
  const expected = expression.bounds.length;
153
152
  const message = `Arity mismatch in subexpression instance.\nExpected ${expected} argument${expected === 1 ? "" : "s"}, but found${args.length < expected ? " only" : ""} ${args.length}.`;
154
153
  onWarning(getErrorNote(expression.location, message));
154
+ // Errors.set takes the message from Printf, which keeps the @ of Format's @\n.
155
+ onWarning(getErrorSetting(expression.location, message.replace("\n", "@\n")));
155
156
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_inst" });
156
157
  }
157
158
  const body = expression.kind === "SetOf" ? expression.element : expression.body;
@@ -198,12 +199,13 @@ const instantiate = (onWarning: Warn, expression: Expr, args: Expr[]): Expr => {
198
199
  if (args.length !== 1) {
199
200
  const message = `Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${args.length}.`;
200
201
  onWarning(getErrorNote(expression.location, message));
202
+ onWarning(getErrorSetting(expression.location, message.replace("\n", "@\n")));
201
203
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_inst" });
202
204
  }
203
205
  return substituteExpr(consAll(args, shift(0)), expression.body);
204
206
  default: {
205
207
  const message = "Cannot instantiate non-binding expression";
206
- onWarning(getErrorNote(expression.location, message));
208
+ warnError(onWarning, expression.location, message);
207
209
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_inst" });
208
210
  }
209
211
  }
@@ -225,7 +227,7 @@ const abstract = (onWarning: Warn, definitionCount: number, expression: Expr): [
225
227
  return [{ name: expression.name, shape: 0 }];
226
228
  default: {
227
229
  const message = "Cannot abstract over bound variables in a non-binding expression";
228
- onWarning(getErrorNote(expression.location, message));
230
+ warnError(onWarning, expression.location, message);
229
231
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_at" });
230
232
  }
231
233
  }
@@ -243,7 +245,7 @@ const getNumbered = (
243
245
  ): [Defn[], Expr] => {
244
246
  const checkAtMost = (count: number) => {
245
247
  if (position <= count) return;
246
- onWarning(getErrorNote(origin.location, message));
248
+ warnError(onWarning, origin.location, message);
247
249
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_num" });
248
250
  };
249
251
  const pick = (items: Expr[]) => {
@@ -261,7 +263,7 @@ const getNumbered = (
261
263
  const hyp = sequent.context[position - 1];
262
264
  if (hyp && hyp.kind !== "Fact") {
263
265
  const hypMessage = "subexpression reference does not resolve to an expression";
264
- onWarning(getErrorNote(expression.location, hypMessage));
266
+ warnError(onWarning, expression.location, hypMessage);
265
267
  throw new TlaProofError(hypMessage, { failure: "Expr.Deref.deref_num" });
266
268
  }
267
269
  const shifted = substituteExpr(
@@ -275,10 +277,10 @@ const getNumbered = (
275
277
  `subexpression of ASSUME/PROVE uses identifiers declared therein\nTlapm does not handle yet such subexpression namings.`,
276
278
  ),
277
279
  );
278
- throw new TlaProofError(
279
- "Subexpression of ASSUME/PROVE uses identifiers declared therein\n\nTlapm does not handle yet such subexpression namings.",
280
- { failure: "Expr.Deref.deref_num" },
281
- );
280
+ const message =
281
+ "Subexpression of ASSUME/PROVE uses identifiers declared therein\n\nTlapm does not handle yet such subexpression namings.";
282
+ onWarning(getErrorSetting(expression.location, message));
283
+ throw new TlaProofError(message, { failure: "Expr.Deref.deref_num" });
282
284
  }
283
285
  return shifted;
284
286
  }
@@ -343,18 +345,17 @@ const getNumbered = (
343
345
  ]);
344
346
  }
345
347
  const emptyMessage = "Expression has no subexpressions";
346
- onWarning(getErrorNote(expression.location, emptyMessage));
348
+ warnError(onWarning, expression.location, emptyMessage);
347
349
  throw new TlaProofError(emptyMessage, { failure: "Expr.Deref.deref_num" });
348
350
  })();
349
351
  if (isUnresolved(result)) {
350
352
  const badMessage = `Cannot resolve subexpression reference !${position}`;
351
- onWarning(getErrorNote(expression.location, badMessage));
353
+ warnError(onWarning, expression.location, badMessage);
352
354
  throw new TlaProofError(badMessage, { failure: "Expr.Deref.deref_num" });
353
355
  }
354
356
  return [expression.kind === "Let" ? expression.definitions : [], result];
355
357
  };
356
358
 
357
- // Reorders label arguments given in source order to the order of the label's de Bruijn indices.
358
359
  const permute = (indices: number[], args: Expr[]) => {
359
360
  const count = indices.length;
360
361
  let current = indices;
@@ -381,7 +382,7 @@ const resolveLabel = (
381
382
  if (indices.length !== labelArgs.length && labelArgs.length > 0) {
382
383
  const plural = indices.length === 1 ? "" : "s";
383
384
  const message = `Expected ${indices.length} argument${plural} for labelled reference !${label}, but found ${labelArgs.length}`;
384
- onWarning(getErrorNote(found.expression.location, message));
385
+ warnError(onWarning, found.expression.location, message);
385
386
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_lsub" });
386
387
  }
387
388
  const params =
@@ -436,8 +437,9 @@ const resolveLetOperator = (
436
437
  args: Expr[],
437
438
  ): Resolution => {
438
439
  if (expression.kind !== "Let") {
439
- onWarning(getErrorNote(expression.location, `not a LET expression`));
440
- throw new TlaProofError("not a LET expression", { failure: "Expr.Deref.deref_letop" });
440
+ const message = "not a LET expression";
441
+ warnError(onWarning, expression.location, message);
442
+ throw new TlaProofError(message, { failure: "Expr.Deref.deref_letop" });
441
443
  }
442
444
  const index = expression.definitions.findIndex(
443
445
  (definition) => definition.kind === "Operator" && definition.name === label,
@@ -445,7 +447,7 @@ const resolveLetOperator = (
445
447
  const definition = expression.definitions[index];
446
448
  if (!definition || definition.kind !== "Operator") {
447
449
  const message = `no definition of operator ${label}`;
448
- onWarning(getErrorNote(expression.location, message));
450
+ warnError(onWarning, expression.location, message);
449
451
  throw new TlaProofError(message, { failure: "Expr.Deref.deref_letop" });
450
452
  }
451
453
  const body = definition.body;
@@ -487,6 +489,7 @@ const resolveLetOperator = (
487
489
 
488
490
  const resolveSelectors = (
489
491
  onWarning: Warn,
492
+ hyps: Hyp[],
490
493
  isLabel: boolean,
491
494
  state: Resolution,
492
495
  selectors: Selector[],
@@ -507,13 +510,14 @@ const resolveSelectors = (
507
510
  return { ...stripParensAndAtomic(abstracted), isAtomic: true };
508
511
  }
509
512
  if (state.expression.isAtomic) {
510
- onWarning(getErrorNote(state.expression.location, `Expression has no subexpressions`));
513
+ const message = "Expression has no subexpressions";
514
+ warnError(onWarning, state.expression.location, message);
511
515
  return UNRESOLVED;
512
516
  }
513
517
  const expression = isLabel ? state.expression : stripParens(state.expression);
514
518
  const count = state.definitions.length;
515
519
  const next = ((): Resolution & { rest: Selector[]; isLabel: boolean } => {
516
- const numbered = (position: number, message: string) => {
520
+ const resolveNumbered = (position: number, message: string) => {
517
521
  const [definitions, inner] = getNumbered(
518
522
  onWarning,
519
523
  expression,
@@ -531,16 +535,33 @@ const resolveSelectors = (
531
535
  return { ...result, rest: after, isLabel: true };
532
536
  }
533
537
  if (isLabel) return { params: [], definitions: [], expression, rest, isLabel: false };
538
+ onWarning(getErrorSetting(expression.location, "!: is forbidden for this expression.\n"));
539
+ const scope = [
540
+ ...hyps,
541
+ ...state.definitions.map((definition): Hyp => ({
542
+ kind: "Defn",
543
+ definition,
544
+ whereDefined: "User",
545
+ visibility: "Visible",
546
+ isLocal: true,
547
+ })),
548
+ ];
549
+ onWarning(
550
+ getErrorNote(
551
+ expression.location,
552
+ `!: is forbidden for this expression:\n${renderDoc(printExpression(scope, expression))}`,
553
+ ),
554
+ );
534
555
  throw new TlaProofError("!: is forbidden for this expression.\n", {
535
556
  failure: "Expr.Deref.deref: !:",
536
557
  });
537
558
  }
538
559
  case "Number":
539
- return numbered(selector.value, `Cannot resolve !${selector.value}`);
560
+ return resolveNumbered(selector.value, `Cannot resolve !${selector.value}`);
540
561
  case "Left":
541
- return numbered(1, "Cannot resolve !<<");
562
+ return resolveNumbered(1, "Cannot resolve !<<");
542
563
  case "Right":
543
- return numbered(2, "Cannot resolve !>>");
564
+ return resolveNumbered(2, "Cannot resolve !>>");
544
565
  case "Instance":
545
566
  return {
546
567
  params: [],
@@ -564,6 +585,7 @@ const resolveSelectors = (
564
585
  })();
565
586
  return resolveSelectors(
566
587
  onWarning,
588
+ hyps,
567
589
  next.isLabel,
568
590
  {
569
591
  params: [...state.params, ...next.params],
@@ -587,19 +609,21 @@ const getInitialResolution = (onWarning: Warn, operator: Expr, args: Expr[]): Re
587
609
 
588
610
  export const resolveSubexpression = (
589
611
  onWarning: Warn,
612
+ hyps: Hyp[],
590
613
  operator: Expr,
591
614
  args: Expr[],
592
615
  selectors: Selector[],
593
616
  ) => {
594
617
  const result = resolveSelectors(
595
618
  onWarning,
619
+ hyps,
596
620
  true,
597
621
  getInitialResolution(onWarning, operator, args),
598
622
  selectors,
599
623
  );
600
624
  if (isUnresolved(result)) {
601
625
  const message = "Could not resolve subexpression reference";
602
- onWarning(getErrorNote(operator.location, message));
626
+ warnError(onWarning, operator.location, message);
603
627
  throw new TlaProofError(message, { failure: "Expr.Anon: 2" });
604
628
  }
605
629
  return result;
@@ -1,4 +1,4 @@
1
- // tlapm's E_subst: substitutions for de Bruijn indices, applied to every part of an expression.
1
+ // A port of tlapm's E_subst.
2
2
 
3
3
  import { TlaProofError } from "../errors";
4
4
  import {
@@ -31,7 +31,6 @@ export const consSubstitution = (expression: Expr, rest: Substitution): Substitu
31
31
  rest,
32
32
  });
33
33
 
34
- // Binds the expressions in order, so the last one becomes index 1.
35
34
  export const consAll = (expressions: Expr[], rest: Substitution) =>
36
35
  expressions.reduce((inner, expression) => consSubstitution(expression, inner), rest);
37
36
 
@@ -63,7 +62,6 @@ const applyIndex = (substitution: Substitution, index: number, from: Expr): Expr
63
62
  export const substituteExprs = (substitution: Substitution, expressions: Expr[]) =>
64
63
  expressions.map((expression) => substituteExpr(substitution, expression));
65
64
 
66
- // Beta-reduces a lambda applied to arguments, as E_subst.normalize does.
67
65
  export const normalizeApply = (operator: Expr, args: Expr[]): ExprCore => {
68
66
  if (operator.kind === "Lambda") {
69
67
  if (operator.params.length !== args.length) throw new TlaProofError("Arity mismatch");
@@ -96,7 +94,7 @@ export const substituteDefn = (substitution: Substitution, definition: Defn): De
96
94
  instance: {
97
95
  ...definition.instance,
98
96
  substitutions: definition.instance.substitutions.map((entry) => ({
99
- name: entry.name,
97
+ ...entry,
100
98
  expression: substituteExpr(inner, entry.expression),
101
99
  })),
102
100
  },
@@ -1,5 +1,4 @@
1
- // tlapm's expansions of temporal operators (Expr.Tla_norm), constant detection (Expr.Constness), and
2
- // the time of a fact (Expr.Temporal_props): a fact holds always when it is closed under [].
1
+ // A port of tlapm's Expr.Tla_norm, Expr.Constness and Expr.Temporal_props.
3
2
 
4
3
  import {
5
4
  adjoin,
@@ -9,6 +8,8 @@ import {
9
8
  getFresh,
10
9
  getLocalDefn,
11
10
  getScopeAt,
11
+ getTrue,
12
+ isBuiltinApply,
12
13
  mapChildren,
13
14
  type Builtin,
14
15
  type Expr,
@@ -27,17 +28,15 @@ const applyUnchanged = (expression: Expr) => applyBuiltin("UNCHANGED", [expressi
27
28
  const getEquality = (expression: Expr) =>
28
29
  applyBuiltin("Eq", [applyBuiltin("Prime", [expression], expression), expression], expression);
29
30
 
30
- // E_tla_norm.rewrite_unch: UNCHANGED <<x, <<y>>>> as x' = x /\ y' = y.
31
31
  export const rewriteUnchanged = (expression: Expr): Expr => {
32
32
  const flatten = (inner: Expr): Expr[] =>
33
33
  inner.kind === "Tuple" ? inner.elements.flatMap(flatten) : [inner];
34
34
  const items = flatten(expression);
35
- if (items.length === 0) return at({ kind: "Internal", builtin: "TRUE" }, expression);
35
+ if (items.length === 0) return getTrue(expression);
36
36
  if (items.length === 1) return getEquality(items[0]);
37
37
  return at({ kind: "List", bullet: "And", items: items.map(getEquality) }, expression);
38
38
  };
39
39
 
40
- // Each visitor rewrites the outermost match and leaves the rest of the tree as it is.
41
40
  const rewrite =
42
41
  (match: (expression: Expr, recurse: (inner: Expr) => Expr) => Expr | undefined) =>
43
42
  (expression: Expr): Expr => {
@@ -46,7 +45,7 @@ const rewrite =
46
45
  };
47
46
 
48
47
  export const expandLeadsto = rewrite((expression, recurse) =>
49
- expression.kind === "Apply" && isApplied(expression, ["Leadsto"])
48
+ isBuiltinApply(expression, "Leadsto")
50
49
  ? applyBuiltin(
51
50
  "BoxTrue",
52
51
  [
@@ -105,11 +104,8 @@ export const expandAction = rewrite((expression, recurse) => {
105
104
  return applyBuiltin(expression.modal === "Box" ? "BoxTrue" : "Diamond", [step], expression);
106
105
  });
107
106
 
108
- // Only getTime uses this, so the locations rewriteUnchanged gives do not matter.
109
107
  const expandUnchanged = rewrite((expression) =>
110
- expression.kind === "Apply" && isApplied(expression, ["UNCHANGED"])
111
- ? rewriteUnchanged(expression.args[0])
112
- : undefined,
108
+ isBuiltinApply(expression, "UNCHANGED") ? rewriteUnchanged(expression.args[0]) : undefined,
113
109
  );
114
110
 
115
111
  const TEMPORAL_BUILTINS: Builtin[] = [
@@ -127,6 +123,11 @@ const TEMPORAL_BUILTINS: Builtin[] = [
127
123
 
128
124
  const constantBodies = new WeakMap<Expr, boolean>();
129
125
 
126
+ interface ConstnessState {
127
+ scope: Scope | undefined;
128
+ isGood: boolean;
129
+ }
130
+
130
131
  const isConstantHyp = (scope: Scope | undefined, hyp: Hyp) => {
131
132
  switch (hyp.kind) {
132
133
  case "Fresh":
@@ -183,10 +184,7 @@ export const isConstant = (scope: Scope | undefined, expression: Expr): boolean
183
184
  expression.body,
184
185
  );
185
186
  case "Sequent": {
186
- const inner = expression.sequent.context.reduce<{
187
- scope: Scope | undefined;
188
- isGood: boolean;
189
- }>(
187
+ const inner = expression.sequent.context.reduce<ConstnessState>(
190
188
  (state, hyp) => ({
191
189
  scope: adjoin(state.scope, hyp),
192
190
  isGood: state.isGood && isConstantHyp(state.scope, hyp),
@@ -203,7 +201,7 @@ export const isConstant = (scope: Scope | undefined, expression: Expr): boolean
203
201
  case "Apply":
204
202
  return recurse(expression.operator) && expression.args.every(recurse);
205
203
  case "Let": {
206
- const inner = expression.definitions.reduce<{ scope: Scope | undefined; isGood: boolean }>(
204
+ const inner = expression.definitions.reduce<ConstnessState>(
207
205
  (state, definition) => ({
208
206
  scope: adjoin(state.scope, getLocalDefn(definition)),
209
207
  isGood:
@@ -275,8 +273,6 @@ export const isConstant = (scope: Scope | undefined, expression: Expr): boolean
275
273
  }
276
274
  };
277
275
 
278
- // Temporal_props.box_closure: whether the formula is equivalent to [] of itself, judged by its
279
- // shape. Under a negation or on the left of =>, <> takes the place of [].
280
276
  const isClosed = (scope: Scope | undefined, expression: Expr, isBox: boolean): boolean => {
281
277
  if (isConstant(scope, expression)) return true;
282
278
  if (expression.kind === "Internal")
@@ -313,8 +309,6 @@ export const getTime = (scope: Scope | undefined, expression: Expr): Time =>
313
309
  ? "Always"
314
310
  : "Now";
315
311
 
316
- // Temporal_props.check_time_change: a proof stays in the always scope while no fact it assumes
317
- // holds only now.
318
312
  export const getScopeTime = (context: Hyp[], time: Time): Time =>
319
313
  time === "Always" && context.some((hyp) => hyp.kind === "Fact" && hyp.time === "Now")
320
314
  ? "Now"
@@ -1,4 +1,4 @@
1
- // tlapm's E_tuply_declarations: declarations such as <<x, y>> \in S become declarations of names.
1
+ // A port of tlapm's E_tuply_declarations.
2
2
 
3
3
  import type { Bound, BoundDomain, Defn, Expr } from "./expression";
4
4
 
@@ -25,7 +25,6 @@ export const getUnbounded = (names: string[]): Bound[] =>
25
25
  const getFactors = (domain: Expr | undefined, names: string[]) =>
26
26
  domain?.kind === "Product" && domain.factors.length === names.length ? domain.factors : undefined;
27
27
 
28
- // Each name is the matching item of the tuple: x == t[1], y == t[2].
29
28
  const getItemDefinitions = (tuple: string, names: string[]): Defn[] =>
30
29
  names.map((name, index) => ({
31
30
  kind: "Operator",
@@ -50,8 +49,6 @@ const getNamedBound = (bound: Extract<TuplyBound, { kind: "Name" }>): Bound => (
50
49
  domain: bound.domain,
51
50
  });
52
51
 
53
- // \E <<x, y>> \in A \X B: P becomes \E x \in A, y \in B: P, and \E <<x, y>> \in S: P becomes
54
- // \E x, y: <<x, y>> \in S /\ P. Each domain quantifies separately, the last one innermost.
55
52
  export const expandQuant = (
56
53
  quantifier: "Forall" | "Exists",
57
54
  bounds: TuplyBound[],
@@ -91,8 +88,6 @@ export const expandQuant = (
91
88
  }, body);
92
89
  };
93
90
 
94
- // CHOOSE <<x, y>> \in A \X B: P binds t \in A \X B with x == t[1], y == t[2], and any other
95
- // domain binds t with \E x, y: t = <<x, y>> /\ P. {<<x, y>> \in S: P} binds t the same way.
96
91
  export const expandChoose = (
97
92
  binder: { kind: "Choose"; domain: Expr | undefined } | { kind: "SetSt"; domain: Expr },
98
93
  names: string[],
@@ -117,8 +112,6 @@ export const expandChoose = (
117
112
  };
118
113
  };
119
114
 
120
- // A set or function constructor binds each tuple as fcn#x, with its names defined in a LET around
121
- // the value. A set constructor over a matching product binds the names to its factors instead.
122
115
  const expandConstructorBounds = (bounds: TuplyBound[], value: Expr, isSetOf: boolean) => {
123
116
  const expanded = bounds.map((bound): { bounds: Bound[]; definitions: Defn[] } => {
124
117
  if (bound.kind === "Name") return { bounds: [getNamedBound(bound)], definitions: [] };
@@ -153,7 +146,8 @@ const expandConstructorBounds = (bounds: TuplyBound[], value: Expr, isSetOf: boo
153
146
  const definitions = expanded.flatMap((item) => item.definitions);
154
147
  return {
155
148
  bounds: expanded.flatMap((item) => item.bounds),
156
- value: definitions.length === 0 ? value : { kind: "Let" as const, definitions, body: value },
149
+ value:
150
+ definitions.length === 0 ? value : ({ kind: "Let", definitions, body: value } satisfies Expr),
157
151
  };
158
152
  };
159
153
 
@@ -1,4 +1,3 @@
1
- import { createEnvironment } from "./environment";
2
1
  import {
3
2
  createFingerprintTable,
4
3
  insertSharedFingerprint,
@@ -6,19 +5,11 @@ import {
6
5
  writeStateFingerprint,
7
6
  } from "./fingerprints";
8
7
  import type { CoordinatorMessage, StartMessage, WorkerMessage } from "./parallel";
9
- import { createSearch } from "./search";
8
+ import { createCheckEnvironment, createSearch } from "./search";
10
9
  import { getSuccessors, type Successor } from "./successors";
11
- import { createTlcOrder } from "./tlc/order";
12
10
  import { OUT_DEGREE_BUCKETS } from "./tlc/summary";
13
11
  import { createStateDecoder, createStateEncoder, type EncodedStates } from "./transfer";
14
- import {
15
- createCanonicalizer,
16
- getRankedString,
17
- getRankedStringCount,
18
- setStringOrder,
19
- setValueVersion,
20
- type Value,
21
- } from "./values";
12
+ import { createCanonicalizer, getUnorderedString, type Value } from "./values";
22
13
  import { createBreak, getParentPort, type Port } from "./worker";
23
14
 
24
15
  const LOCKED = -1;
@@ -42,25 +33,16 @@ const runWorker = (start: StartMessage, parent: Port) => {
42
33
  const modules = new Map(start.modules);
43
34
  const loadModule = (name: string) => modules.get(name);
44
35
  const classes = new Map(start.classes);
45
- const order = createTlcOrder(start.source, loadModule);
46
- setStringOrder(order.getStringOrder(start.config));
47
- setValueVersion(start.version);
48
- const startupStrings = getRankedStringCount();
49
- const specification = createEnvironment(start.config, {
50
- source: start.source,
51
- loadModule,
52
- order,
53
- loadClass: (name) => classes.get(name),
54
- print: () => {},
55
- files: { readFile: undefined, writeFile: undefined },
56
- isTool: start.isTool,
57
- isTraceRecorded: start.isTraceRecorded,
58
- isWarningEnabled: start.isWarningEnabled,
59
- version: start.version,
60
- });
36
+ const created = createCheckEnvironment(
37
+ start.config,
38
+ { ...start, loadModule, loadClass: (name) => classes.get(name), seed: undefined },
39
+ () => {},
40
+ true,
41
+ );
42
+ const specification = created.specification;
61
43
  const environment = specification.environment;
62
- const search = createSearch(start.config, environment, () =>
63
- order.getDeclarationOrder("variable"),
44
+ const search = createSearch(start.config, environment, specification.variableLocations, () =>
45
+ created.order.getDeclarationOrder("variable"),
64
46
  );
65
47
  const nextAction = search?.spec.next;
66
48
  if (!search || nextAction === undefined)
@@ -68,24 +50,20 @@ const runWorker = (start: StartMessage, parent: Port) => {
68
50
  const workerIndex = start.index;
69
51
  const canonicalize = createCanonicalizer();
70
52
  const decode = createStateDecoder(environment.variables.length);
71
- const shared = { fingerprints: start.fingerprints };
53
+ let sharedFingerprints = start.fingerprints;
72
54
  const requests = start.requests;
73
55
  const remaining = start.remaining;
74
- // Under symmetry, a successor the worker generated before has the representative it had then,
75
- // so the worker skips the search for one.
76
56
  const generatedStates = search.isSymmetric ? createFingerprintTable() : undefined;
77
57
  const fingerprint = new Int32Array(2);
78
- const waiters = { resume: () => {}, loot: (_states: EncodedStates) => {} };
58
+ let resumeLevel = () => {};
59
+ let receiveLoot = (_states: EncodedStates) => {};
79
60
  start.ports.forEach((port) => {
80
- port?.addEventListener("message", (event) => waiters.loot(event.data as EncodedStates));
61
+ port?.addEventListener("message", (event) => receiveLoot(event.data as EncodedStates));
81
62
  port?.start?.();
82
63
  });
83
- const frontier = { states: decode(start.seed).map(canonicalize) };
64
+ let frontier = decode(start.seed).map(canonicalize);
84
65
  const takeBreak = createBreak();
85
66
 
86
- // A worker that runs out of states asks a peer for some by writing its index + 1 to the peer's
87
- // request word. The peer sends half of the states it hasn't started, keeps expanding, and wakes
88
- // the workers waiting to ask it next.
89
67
  const answerRequest = (expansion: Expansion, request: number) => {
90
68
  const thief = Atomics.load(requests, workerIndex) - 1;
91
69
  const given = Math.floor((expansion.end - expansion.origin - 1) / 2);
@@ -99,8 +77,6 @@ const runWorker = (start: StartMessage, parent: Port) => {
99
77
  Atomics.notify(requests, workerIndex);
100
78
  };
101
79
 
102
- // A worker answers any request before it pauses or runs out of states, and takes no more until
103
- // it resumes.
104
80
  const lockRequests = (expansion: Expansion) => {
105
81
  Atomics.store(remaining, workerIndex, 0);
106
82
  if (Atomics.compareExchange(requests, workerIndex, 0, LOCKED) === 0) return;
@@ -112,7 +88,6 @@ const runWorker = (start: StartMessage, parent: Port) => {
112
88
  Atomics.store(requests, workerIndex, 0);
113
89
  };
114
90
 
115
- // The worker pauses before a successor when the shared table needs to grow, and resumes there.
116
91
  const expand = (expansion: Expansion) => {
117
92
  for (; expansion.origin < expansion.end; expansion.origin++) {
118
93
  const state = expansion.states[expansion.origin];
@@ -126,7 +101,7 @@ const runWorker = (start: StartMessage, parent: Port) => {
126
101
  }
127
102
  const successors = expansion.successors;
128
103
  for (; expansion.index < successors.length; expansion.index++) {
129
- if (isSharedFingerprintsFull(shared.fingerprints)) return "paused";
104
+ if (isSharedFingerprintsFull(sharedFingerprints)) return "paused";
130
105
  const successor = successors[expansion.index];
131
106
  if (search.findViolatedActionProperty(state, successor.state)) return undefined;
132
107
  if (!search.satisfiesActionConstraints(state, successor.state)) {
@@ -141,7 +116,7 @@ const runWorker = (start: StartMessage, parent: Port) => {
141
116
  canonicalize(successor.state);
142
117
  const fingerprintState = search.getFingerprintState(successor.state);
143
118
  writeStateFingerprint(fingerprintState, fingerprint);
144
- if (!insertSharedFingerprint(shared.fingerprints, fingerprint[0], fingerprint[1])) continue;
119
+ if (!insertSharedFingerprint(sharedFingerprints, fingerprint[0], fingerprint[1])) continue;
145
120
  if (search.findViolatedInvariant(successor.state, state)) return undefined;
146
121
  if (!search.satisfiesConstraints(successor.state, state)) continue;
147
122
  expansion.next.push(successor.state);
@@ -156,9 +131,6 @@ const runWorker = (start: StartMessage, parent: Port) => {
156
131
  return "done";
157
132
  };
158
133
 
159
- // Each attempt asks the peer with the most states left. While another worker's request to that
160
- // peer is open, the worker waits for the peer to answer it. The worker stops once no peer that
161
- // takes requests has two states left.
162
134
  const steal = async (expansion: Expansion) => {
163
135
  const skipped = new Set<number>();
164
136
  for (;;) {
@@ -173,7 +145,7 @@ const runWorker = (start: StartMessage, parent: Port) => {
173
145
  if (request === LOCKED) skipped.add(victim);
174
146
  if (request > 0) Atomics.wait(requests, victim, request);
175
147
  if (request !== 0) continue;
176
- const loot = await new Promise<EncodedStates>((resolve) => (waiters.loot = resolve));
148
+ const loot = await new Promise<EncodedStates>((resolve) => (receiveLoot = resolve));
177
149
  if (loot.count === 0) {
178
150
  skipped.add(victim);
179
151
  continue;
@@ -191,9 +163,9 @@ const runWorker = (start: StartMessage, parent: Port) => {
191
163
 
192
164
  const runLevel = async (): Promise<WorkerMessage | undefined> => {
193
165
  const expansion: Expansion = {
194
- states: frontier.states,
166
+ states: frontier,
195
167
  origin: 0,
196
- end: frontier.states.length,
168
+ end: frontier.length,
197
169
  successors: undefined,
198
170
  index: 0,
199
171
  added: 0,
@@ -206,8 +178,7 @@ const runWorker = (start: StartMessage, parent: Port) => {
206
178
  for (;;) {
207
179
  const status = expand(expansion);
208
180
  if (status === undefined) return undefined;
209
- // HACK: Bun runs its garbage collection timers on the event loop, so a worker that expands a
210
- // long level without returning to the loop holds on to memory it no longer uses.
181
+ // HACK: Bun frees memory on event loop timers, so a long level returns to the loop.
211
182
  if (status === "break") {
212
183
  await takeBreak();
213
184
  expansion.breakAt = performance.now() + BREAK_INTERVAL;
@@ -215,7 +186,7 @@ const runWorker = (start: StartMessage, parent: Port) => {
215
186
  }
216
187
  lockRequests(expansion);
217
188
  if (status === "paused") {
218
- const resumed = new Promise<void>((resolve) => (waiters.resume = resolve));
189
+ const resumed = new Promise<void>((resolve) => (resumeLevel = resolve));
219
190
  report({ type: "paused" });
220
191
  await resumed;
221
192
  unlockRequests(expansion);
@@ -223,11 +194,10 @@ const runWorker = (start: StartMessage, parent: Port) => {
223
194
  }
224
195
  if (!(await steal(expansion))) break;
225
196
  }
226
- if (getRankedStringCount() !== startupStrings) {
227
- return { type: "abort", string: getRankedString(startupStrings) };
228
- }
229
- frontier.states = expansion.next;
230
- Atomics.store(remaining, workerIndex, frontier.states.length);
197
+ const unorderedString = getUnorderedString();
198
+ if (unorderedString !== undefined) return { type: "abort", string: unorderedString };
199
+ frontier = expansion.next;
200
+ Atomics.store(remaining, workerIndex, frontier.length);
231
201
  return {
232
202
  type: "level",
233
203
  generated: expansion.generated,
@@ -247,11 +217,11 @@ const runWorker = (start: StartMessage, parent: Port) => {
247
217
  const message = event.data as CoordinatorMessage;
248
218
  if (message.type === "level") startLevel();
249
219
  if (message.type === "resize") {
250
- shared.fingerprints = message.fingerprints;
251
- waiters.resume();
220
+ sharedFingerprints = message.fingerprints;
221
+ resumeLevel();
252
222
  }
253
223
  });
254
- Atomics.store(remaining, workerIndex, frontier.states.length);
224
+ Atomics.store(remaining, workerIndex, frontier.length);
255
225
  report({ type: "ready" });
256
226
  };
257
227