tla-ts 0.0.8 → 0.0.9-dev.0493be549

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 (390) hide show
  1. package/README.md +30 -0
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +28 -28
  5. package/dist/deciders.js +43 -43
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +98 -19
  8. package/dist/index.d.ts +98 -19
  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 +116 -36
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +128 -106
  21. package/dist/transfer.js +128 -106
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +7 -21
  26. package/src/bags.ts +99 -99
  27. package/src/builtins.ts +44 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check.ts +605 -311
  30. package/src/cli/options.ts +12 -6
  31. package/src/cli/run.ts +2 -2
  32. package/src/cli/runtime-invariants.ts +135 -0
  33. package/src/cli/shared.ts +20 -9
  34. package/src/cli/tlapm.ts +0 -12
  35. package/src/cli/tlc-arguments.ts +646 -0
  36. package/src/cli/tlc-usage.ts +362 -0
  37. package/src/cli/tlc.ts +545 -218
  38. package/src/cli/typescript.ts +23 -0
  39. package/src/cli/xml-exporter.ts +4 -16
  40. package/src/cli.ts +0 -1
  41. package/src/codegen.ts +191 -69
  42. package/src/config.ts +140 -109
  43. package/src/coverage.ts +837 -0
  44. package/src/dependencies.ts +314 -24
  45. package/src/dfid.ts +618 -0
  46. package/src/environment.ts +263 -129
  47. package/src/errors.ts +70 -55
  48. package/src/evaluate.ts +734 -980
  49. package/src/exit-codes.ts +37 -3
  50. package/src/fingerprints.ts +10 -10
  51. package/src/index.ts +3 -0
  52. package/src/instances.ts +79 -11
  53. package/src/java-overrides.ts +2 -12
  54. package/src/json-reader.ts +456 -0
  55. package/src/json.ts +262 -139
  56. package/src/levels.ts +2 -3
  57. package/src/lexer.ts +150 -70
  58. package/src/liveness-checker.ts +10 -18
  59. package/src/liveness.ts +122 -64
  60. package/src/obligations/action.ts +4 -28
  61. package/src/obligations/anonymize.ts +84 -80
  62. package/src/obligations/equality.ts +1 -1
  63. package/src/obligations/expression.ts +2 -19
  64. package/src/obligations/format.ts +1 -9
  65. package/src/obligations/generate.ts +1 -11
  66. package/src/obligations/index.ts +0 -11
  67. package/src/obligations/levels.ts +4 -8
  68. package/src/obligations/module.ts +1 -15
  69. package/src/obligations/normalize.ts +5 -24
  70. package/src/obligations/operators.ts +1 -2
  71. package/src/obligations/pragma.ts +1 -10
  72. package/src/obligations/printer.ts +47 -46
  73. package/src/obligations/proof.ts +1 -5
  74. package/src/obligations/regroup.ts +1 -4
  75. package/src/obligations/simplify.ts +3 -14
  76. package/src/obligations/source.ts +1 -21
  77. package/src/obligations/subexpression.ts +5 -11
  78. package/src/obligations/substitution.ts +1 -3
  79. package/src/obligations/temporal.ts +8 -14
  80. package/src/obligations/tuples.ts +3 -9
  81. package/src/parallel-worker.ts +31 -38
  82. package/src/parallel.ts +41 -17
  83. package/src/parser.ts +436 -90
  84. package/src/pcal/ast.ts +7 -28
  85. package/src/pcal/parse.ts +11 -39
  86. package/src/pcal/tokenize.ts +4 -20
  87. package/src/pcal/translate.ts +10 -42
  88. package/src/pcal/validate.ts +3 -21
  89. package/src/pretty-print.ts +1 -2
  90. package/src/prover/decide-pool.ts +5 -10
  91. package/src/prover/deciders.ts +0 -4
  92. package/src/prover/first-order.ts +0 -11
  93. package/src/prover/isabelle/decide.ts +0 -6
  94. package/src/prover/isabelle/encode.ts +11 -23
  95. package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
  96. package/src/prover/isabelle/isar/method.ts +25 -38
  97. package/src/prover/isabelle/isar/proof.ts +1 -10
  98. package/src/prover/isabelle/isar/statement.ts +1 -6
  99. package/src/prover/isabelle/isar/theory.ts +15 -26
  100. package/src/prover/isabelle/isar/type-check.ts +11 -25
  101. package/src/prover/isabelle/provers/blast/blast.ts +10 -41
  102. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  103. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  104. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  105. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  106. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  107. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  108. package/src/prover/isabelle/provers/classical.ts +14 -42
  109. package/src/prover/isabelle/provers/hypsubst.ts +11 -25
  110. package/src/prover/isabelle/pure/bicompose.ts +16 -13
  111. package/src/prover/isabelle/pure/consts.ts +1 -7
  112. package/src/prover/isabelle/pure/conv.ts +1 -9
  113. package/src/prover/isabelle/pure/drule.ts +24 -40
  114. package/src/prover/isabelle/pure/envir.ts +3 -52
  115. package/src/prover/isabelle/pure/goal.ts +1 -7
  116. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  117. package/src/prover/isabelle/pure/list.ts +0 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -14
  119. package/src/prover/isabelle/pure/name.ts +2 -9
  120. package/src/prover/isabelle/pure/net.ts +3 -59
  121. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  122. package/src/prover/isabelle/pure/pattern.ts +2 -19
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
  124. package/src/prover/isabelle/pure/rewriter.ts +26 -58
  125. package/src/prover/isabelle/pure/search.ts +3 -10
  126. package/src/prover/isabelle/pure/seq.ts +1 -10
  127. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  128. package/src/prover/isabelle/pure/table.ts +1 -31
  129. package/src/prover/isabelle/pure/tactic.ts +12 -22
  130. package/src/prover/isabelle/pure/tactical.ts +6 -12
  131. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  132. package/src/prover/isabelle/pure/term.ts +2 -43
  133. package/src/prover/isabelle/pure/thm.ts +13 -36
  134. package/src/prover/isabelle/pure/type.ts +2 -15
  135. package/src/prover/isabelle/pure/unify.ts +20 -30
  136. package/src/prover/isabelle/pure/variable.ts +3 -7
  137. package/src/prover/isabelle/tla/classical-setup.ts +9 -19
  138. package/src/prover/isabelle/tla/context.ts +8 -16
  139. package/src/prover/isabelle/tla/logic.ts +4 -11
  140. package/src/prover/isabelle/tla/simpdata.ts +46 -34
  141. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  142. package/src/prover/ocaml.ts +0 -6
  143. package/src/prover/prep/action.ts +4 -36
  144. package/src/prover/prep/enabled-axioms.ts +12 -19
  145. package/src/prover/prep/fingerprint.ts +0 -16
  146. package/src/prover/prep/level-comparison.ts +8 -12
  147. package/src/prover/prep/md5.ts +0 -2
  148. package/src/prover/prep/methods.ts +9 -36
  149. package/src/prover/prep/normalize.ts +4 -28
  150. package/src/prover/prove-worker.ts +0 -2
  151. package/src/prover/prove.ts +0 -36
  152. package/src/prover/ptl/decide.ts +7 -12
  153. package/src/prover/ptl/encode.ts +14 -36
  154. package/src/prover/ptl/sat.ts +24 -32
  155. package/src/prover/ptl/tableau.ts +12 -26
  156. package/src/prover/smt/axioms.ts +0 -7
  157. package/src/prover/smt/context.ts +19 -26
  158. package/src/prover/smt/data.ts +51 -54
  159. package/src/prover/smt/encode.ts +14 -35
  160. package/src/prover/smt/extensionality.ts +0 -10
  161. package/src/prover/smt/flatten.ts +3 -22
  162. package/src/prover/smt/format.ts +5 -10
  163. package/src/prover/smt/instances.ts +0 -10
  164. package/src/prover/smt/rewrite.ts +66 -101
  165. package/src/prover/smt/solver/act-cache.ts +0 -15
  166. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  167. package/src/prover/smt/solver/array.ts +1 -3
  168. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  169. package/src/prover/smt/solver/ast-lt.ts +1 -11
  170. package/src/prover/smt/solver/ast-util.ts +1 -6
  171. package/src/prover/smt/solver/ast.ts +1 -143
  172. package/src/prover/smt/solver/auf-solver.ts +6 -39
  173. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  174. package/src/prover/smt/solver/cg-table.ts +1 -18
  175. package/src/prover/smt/solver/clause.ts +1 -27
  176. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  177. package/src/prover/smt/solver/context.ts +4 -61
  178. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  179. package/src/prover/smt/solver/der.ts +2 -21
  180. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  181. package/src/prover/smt/solver/e-matching.ts +3 -34
  182. package/src/prover/smt/solver/enode.ts +1 -21
  183. package/src/prover/smt/solver/expr-ref.ts +1 -5
  184. package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
  185. package/src/prover/smt/solver/fingerprints.ts +1 -12
  186. package/src/prover/smt/solver/flat-literals.ts +1 -9
  187. package/src/prover/smt/solver/goal.ts +2 -14
  188. package/src/prover/smt/solver/hash.ts +0 -8
  189. package/src/prover/smt/solver/hashtable.ts +1 -12
  190. package/src/prover/smt/solver/internalizer.ts +6 -98
  191. package/src/prover/smt/solver/lbool.ts +1 -2
  192. package/src/prover/smt/solver/literal.ts +0 -3
  193. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  194. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  195. package/src/prover/smt/solver/lp/containers.ts +12 -30
  196. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  197. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  198. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  199. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  200. package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
  201. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  202. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  203. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  204. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  205. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  206. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  207. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  208. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  209. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  210. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  211. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  212. package/src/prover/smt/solver/lp/nex.ts +1 -6
  213. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  214. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  215. package/src/prover/smt/solver/lp/nla-core.ts +35 -130
  216. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  217. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  218. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  220. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  221. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  222. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  223. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  224. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  225. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  226. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  227. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  228. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  229. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  230. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  231. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  232. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  233. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  234. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  235. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  236. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  237. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  238. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  239. package/src/prover/smt/solver/mam-compiler.ts +14 -56
  240. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  241. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  242. package/src/prover/smt/solver/model-checker.ts +2 -36
  243. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  244. package/src/prover/smt/solver/model-finder.ts +3 -15
  245. package/src/prover/smt/solver/model-generator.ts +1 -12
  246. package/src/prover/smt/solver/model-macro-solver.ts +12 -69
  247. package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
  248. package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
  249. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  250. package/src/prover/smt/solver/nlsat/explain.ts +3 -47
  251. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  252. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
  253. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  254. package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
  255. package/src/prover/smt/solver/nlsat/solver.ts +7 -67
  256. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  257. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
  258. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  259. package/src/prover/smt/solver/nnf.ts +3 -38
  260. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  261. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  262. package/src/prover/smt/solver/propagate-values.ts +1 -10
  263. package/src/prover/smt/solver/proto-model.ts +3 -48
  264. package/src/prover/smt/solver/pull-quant.ts +1 -12
  265. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  266. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  267. package/src/prover/smt/solver/qe-lite.ts +3 -33
  268. package/src/prover/smt/solver/qi-queue.ts +1 -16
  269. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  270. package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
  271. package/src/prover/smt/solver/quantifier-manager.ts +1 -8
  272. package/src/prover/smt/solver/random-gen.ts +1 -2
  273. package/src/prover/smt/solver/rational.ts +1 -8
  274. package/src/prover/smt/solver/ref-vector.ts +1 -6
  275. package/src/prover/smt/solver/relevancy.ts +2 -15
  276. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  277. package/src/prover/smt/solver/rewriter.ts +3 -85
  278. package/src/prover/smt/solver/rlimit.ts +2 -20
  279. package/src/prover/smt/solver/smtlib-parser.ts +2 -37
  280. package/src/prover/smt/solver/solver.ts +23 -34
  281. package/src/prover/smt/solver/sort.ts +1 -5
  282. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  283. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  284. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
  285. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  286. package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
  287. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  288. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  289. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  290. package/src/prover/smt/solver/theory-lra.ts +1 -8
  291. package/src/prover/smt/solver/var-subst.ts +2 -26
  292. package/src/prover/smt/table.ts +0 -8
  293. package/src/prover/tlapm/cache.ts +20 -25
  294. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  295. package/src/prover/tlapm/tlapm.ts +12 -17
  296. package/src/prover/verdict.ts +0 -2
  297. package/src/prover/zenon/check/check.ts +0 -9
  298. package/src/prover/zenon/check/definitions.ts +5 -15
  299. package/src/prover/zenon/check/equality.ts +0 -8
  300. package/src/prover/zenon/check/functions.ts +0 -4
  301. package/src/prover/zenon/check/keys.ts +0 -7
  302. package/src/prover/zenon/check/propositional.ts +0 -3
  303. package/src/prover/zenon/check/records.ts +0 -5
  304. package/src/prover/zenon/check/relations.ts +0 -13
  305. package/src/prover/zenon/check/rewrites.ts +0 -6
  306. package/src/prover/zenon/check/sets.ts +0 -3
  307. package/src/prover/zenon/check/terms.ts +0 -17
  308. package/src/prover/zenon/check/tla.ts +0 -6
  309. package/src/prover/zenon/decide.ts +0 -12
  310. package/src/prover/zenon/encode.ts +1 -8
  311. package/src/prover/zenon/eqrel.ts +0 -13
  312. package/src/prover/zenon/equality-rules.ts +0 -4
  313. package/src/prover/zenon/expr.ts +1 -26
  314. package/src/prover/zenon/index-table.ts +17 -38
  315. package/src/prover/zenon/isar-case.ts +9 -19
  316. package/src/prover/zenon/isar.ts +1 -29
  317. package/src/prover/zenon/limits.ts +0 -4
  318. package/src/prover/zenon/llproof.ts +0 -9
  319. package/src/prover/zenon/mltoll.ts +54 -76
  320. package/src/prover/zenon/node.ts +1 -11
  321. package/src/prover/zenon/ocaml.ts +1 -17
  322. package/src/prover/zenon/parse.ts +2 -7
  323. package/src/prover/zenon/phrase.ts +1 -11
  324. package/src/prover/zenon/proof.ts +0 -9
  325. package/src/prover/zenon/propositional-rules.ts +0 -5
  326. package/src/prover/zenon/rules.ts +2 -6
  327. package/src/prover/zenon/search.ts +1 -17
  328. package/src/prover/zenon/tla/functions.ts +57 -29
  329. package/src/prover/zenon/tla/llproof.ts +63 -70
  330. package/src/prover/zenon/tla/records.ts +56 -27
  331. package/src/prover/zenon/tla/rewrites.ts +12 -19
  332. package/src/prover/zenon/tla/sets.ts +68 -39
  333. package/src/prover/zenon/tla/terms.ts +0 -6
  334. package/src/prover/zenon/tla/tla.ts +59 -58
  335. package/src/randomization.ts +84 -35
  336. package/src/resolve.ts +18 -60
  337. package/src/runtime.ts +11 -4
  338. package/src/sany/builtins.ts +3 -4
  339. package/src/sany/generator.ts +128 -176
  340. package/src/sany/levels.ts +6 -30
  341. package/src/sany/lexer.ts +7 -23
  342. package/src/sany/linter.ts +31 -29
  343. package/src/sany/modules.ts +1 -5
  344. package/src/sany/nodes.ts +0 -31
  345. package/src/sany/parse-error.ts +39 -117
  346. package/src/sany/report.ts +29 -63
  347. package/src/sany/selectors.ts +15 -39
  348. package/src/sany/source.ts +1 -17
  349. package/src/sany/xml.ts +13 -63
  350. package/src/search.ts +536 -180
  351. package/src/simulate.ts +694 -0
  352. package/src/spec-description.ts +167 -49
  353. package/src/standard-definitions.ts +2 -3
  354. package/src/standard-modules.ts +264 -68
  355. package/src/state-graph.ts +51 -18
  356. package/src/subexpressions.ts +31 -5
  357. package/src/substitution-levels.ts +2 -3
  358. package/src/successors.ts +269 -85
  359. package/src/symmetry.ts +59 -147
  360. package/src/tableau.ts +27 -24
  361. package/src/tlc/fingerprint.ts +226 -151
  362. package/src/tlc/jar-data.ts +113 -6
  363. package/src/tlc/messages.ts +122 -37
  364. package/src/tlc/order.ts +56 -82
  365. package/src/tlc/random.ts +16 -16
  366. package/src/tlc/replay.ts +564 -212
  367. package/src/tlc/summary.ts +2 -4
  368. package/src/tlc/tlc-operators.ts +81 -36
  369. package/src/tlc/tlcext-operators.ts +138 -117
  370. package/src/tlc/trace-spec.ts +273 -0
  371. package/src/tlc/value-stream.ts +143 -0
  372. package/src/tlc/version.ts +2 -4
  373. package/src/transfer.ts +22 -25
  374. package/src/typescript/actions.ts +481 -0
  375. package/src/typescript/collections.ts +600 -0
  376. package/src/typescript/compile.ts +65 -0
  377. package/src/typescript/context.ts +94 -0
  378. package/src/typescript/emit.ts +121 -0
  379. package/src/typescript/expressions.ts +496 -0
  380. package/src/typescript/formula.ts +152 -0
  381. package/src/typescript/functions.ts +284 -0
  382. package/src/typescript/model.ts +163 -0
  383. package/src/typescript/names.ts +114 -0
  384. package/src/typescript/program.ts +48 -0
  385. package/src/typescript/properties.ts +139 -0
  386. package/src/typescript/scope.ts +112 -0
  387. package/src/typescript/steps.ts +165 -0
  388. package/src/typescript/types.ts +171 -0
  389. package/src/values.ts +910 -318
  390. package/src/worker.ts +7 -8
@@ -0,0 +1,694 @@
1
+ import type { CheckOptions, TraceStep, Violation } from "./check";
2
+ import {
3
+ isStackOverflow,
4
+ TlaEvaluationError,
5
+ TlaIncompleteSuccessorError,
6
+ TlaModuleError,
7
+ TlaStackOverflowError,
8
+ TlaTooManyStatesError,
9
+ TlaUnsupportedError,
10
+ UNEXPECTED_EVAL_EXCEPTION,
11
+ UNEXPECTED_EXCEPTION,
12
+ } from "./errors";
13
+ import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
14
+ import { createLivenessChecker } from "./liveness-checker";
15
+ import { getIncompleteSuccessorMessage, prepareSearch, reportAssumptionViolation } from "./search";
16
+ import {
17
+ getActionLabel,
18
+ getInitActions,
19
+ getNextActions,
20
+ toActionValue,
21
+ type SpecAction,
22
+ } from "./spec-description";
23
+ import { forEachInitialState, forEachSuccessor } from "./successors";
24
+ import {
25
+ formatInnerMessage,
26
+ formatNestedMessage,
27
+ formatTlcDate,
28
+ getCodedMessage,
29
+ getFailureMessage,
30
+ isEvalException,
31
+ isHeadedError,
32
+ MESSAGE_CODE,
33
+ withUnexpectedException,
34
+ } from "./tlc/messages";
35
+ import { createJavaRandom, nextPrime } from "./tlc/random";
36
+ import { createCounterExample } from "./tlc/tlcext-operators";
37
+ import {
38
+ createModelValue,
39
+ createRecord,
40
+ formatState,
41
+ getSetBound,
42
+ isSameValue,
43
+ type Value,
44
+ } from "./values";
45
+
46
+ export interface SimulationOptions extends CheckOptions {
47
+ traceDepth: number;
48
+ traceCount: bigint | undefined;
49
+ aril: bigint;
50
+ isGenerating: boolean;
51
+ scheduler: "random" | "rl" | "rlaction";
52
+ onSimulation: (output: SimulationOutput) => void;
53
+ }
54
+
55
+ export interface SimulationStatistics {
56
+ generatedStates: number;
57
+ traces: number;
58
+ levelMean: number;
59
+ levelM2: number;
60
+ seed: bigint;
61
+ aril: bigint;
62
+ }
63
+
64
+ export type SimulationOutput =
65
+ | { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
66
+ | { kind: "behavior"; trace: TraceStep[]; isLastStateOnly: boolean }
67
+ | { kind: "progress"; statistics: SimulationStatistics }
68
+ | { kind: "summary"; statistics: SimulationStatistics };
69
+
70
+ interface TraceNode {
71
+ state: Value[];
72
+ action: SpecAction;
73
+ predecessor: TraceNode | undefined;
74
+ level: number;
75
+ deferred?: (next: Value[]) => void;
76
+ }
77
+
78
+ interface WorkerError {
79
+ code: number;
80
+ message: string;
81
+ toolMessage: string;
82
+ node: TraceNode;
83
+ isException: boolean;
84
+ isSummarized: boolean;
85
+ violation?: Violation;
86
+ }
87
+
88
+ const FATAL_CODES = new Set<number>([
89
+ MESSAGE_CODE.invariantEvaluationFailed,
90
+ MESSAGE_CODE.actionPropertyEvaluationFailed,
91
+ MESSAGE_CODE.incompleteSuccessor,
92
+ ]);
93
+
94
+ const INFINITE_DEPTH = 2147483647;
95
+
96
+ const RL_ALPHA = 0.3;
97
+ const RL_GAMMA = 0.7;
98
+ const RL_REWARD = -10;
99
+
100
+ const isSameState = (left: Value[], right: Value[]) =>
101
+ left.every((value, index) => isSameValue(value, right[index]));
102
+
103
+ export const simulate = (options: SimulationOptions): number => {
104
+ const isTool = options.isTool ?? false;
105
+ const output = options.onSimulation;
106
+ const prepared = prepareSearch(options);
107
+ const config = prepared.config;
108
+ const specification = prepared.specification;
109
+ const environment = prepared.environment;
110
+ const runtime = environment.runtime;
111
+ const search = prepared.search;
112
+ const seed = options.seed ?? 0n;
113
+ const traceDepth = options.traceDepth === -1 ? INFINITE_DEPTH : options.traceDepth;
114
+ // TLC.process seeds its RandomGenerator and draws -aril doubles, and each worker's generator is
115
+ // seeded with the next long of it.
116
+ const random = createJavaRandom(seed);
117
+ for (let index = 0n; index < options.aril; index++) random.nextDouble();
118
+ const workerRandom = createJavaRandom(random.nextLong());
119
+ const statistics: SimulationStatistics = {
120
+ generatedStates: 0,
121
+ traces: 0,
122
+ levelMean: 0,
123
+ levelM2: 0,
124
+ seed,
125
+ aril: options.aril,
126
+ };
127
+ const message = (code: number, text: string, toolText = text, isError = true) =>
128
+ output({ kind: "message", code, isError, message: text, toolMessage: toolText });
129
+ const printSummary = () => output({ kind: "summary", statistics: { ...statistics } });
130
+ const nodes = new WeakMap<(Value | undefined)[], TraceNode>();
131
+ const initActions = getInitActions(config, environment, specification.instanceActions);
132
+ const nextActions = getNextActions(config, environment, specification.instanceActions);
133
+ const worker = { traceCount: 0, currentTrace: 0 };
134
+ runtime.getLevel = (state) => nodes.get(state)?.level ?? 0;
135
+ runtime.getBehavior = (state) => {
136
+ const node = nodes.get(state);
137
+ return node ? getTrace(node).map((step) => step.state) : [state];
138
+ };
139
+ runtime.getSimulationValue = (key, state) => {
140
+ const node = state && nodes.get(state);
141
+ switch (key) {
142
+ case "diameter":
143
+ return worker.currentTrace === 0 ? 0 : worker.traceCount + 1;
144
+ case "generated":
145
+ case "distinct":
146
+ case "queue":
147
+ throw new TlaModuleError(`TLCGet(${key}) was undefined.`);
148
+ case "action":
149
+ return node && toActionValue(node.action);
150
+ case "config":
151
+ return createRecord([
152
+ ["mode", options.isGenerating ? "generate" : "simulate"],
153
+ ["depth", traceDepth === INFINITE_DEPTH ? -1 : traceDepth],
154
+ ["traces", Number(BigInt.asIntN(32, options.traceCount ?? (1n << 63n) - 1n))],
155
+ ["deadlock", config.checkDeadlock],
156
+ ["seed", String(seed)],
157
+ ["aril", String(options.aril)],
158
+ ["worker", 1],
159
+ ["install", "unknown"],
160
+ ["sched", options.scheduler],
161
+ ]);
162
+ case "stats": {
163
+ const actions = new Map<string, number>();
164
+ for (let step = node; step && step.level > 1; step = step.predecessor) {
165
+ actions.set(step.action.name, (actions.get(step.action.name) ?? 0) + 1);
166
+ }
167
+ return createRecord([
168
+ ["traces", statistics.traces],
169
+ ["duration", Math.floor((Date.now() - runtime.startedAt) / 1000)],
170
+ ["generated", statistics.generatedStates],
171
+ [
172
+ "behavior",
173
+ createRecord([
174
+ ["actions", createRecord([...actions])],
175
+ ["id", worker.currentTrace],
176
+ ]),
177
+ ],
178
+ ["worker", 0],
179
+ ["distinct", -1],
180
+ ["distinctvalues", -1],
181
+ ["retries", -1],
182
+ ["actions", createRecord([])],
183
+ ["levelmean", statistics.levelMean],
184
+ ["levelvariance", Math.round(statistics.levelM2 / (statistics.traces + 1))],
185
+ ]);
186
+ }
187
+ }
188
+ return undefined;
189
+ };
190
+ runtime.isStarted = true;
191
+ if (!search) {
192
+ throw new TlaUnsupportedError("tla-ts can't simulate a specification without variables");
193
+ }
194
+ const reportPostcondition = (isAfterViolation: boolean) => {
195
+ const postcondition = search.findPostconditionViolation(isAfterViolation);
196
+ if (!postcondition) return undefined;
197
+ if (postcondition.counts !== undefined) (options.onPrint ?? console.log)(postcondition.counts);
198
+ message(
199
+ postcondition.code,
200
+ postcondition.message,
201
+ formatInnerMessage(postcondition.code, postcondition.message, true),
202
+ );
203
+ return postcondition;
204
+ };
205
+ const temporalProperties = search.properties.liveness;
206
+ const createTemporalChecker = (successors: number[][], states: Value[][]) =>
207
+ withLivenessExitCode(() =>
208
+ withUnexpectedException(() =>
209
+ createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
210
+ getFingerprint: (successor) =>
211
+ Number(BigInt.asIntN(32, runtime.getFingerprint(successor.state))),
212
+ getSuccessors: (index) =>
213
+ successors[index].map((successor) => ({ index: successor, state: states[successor] })),
214
+ }),
215
+ ),
216
+ );
217
+ const branches = createTemporalChecker([], [])?.branches;
218
+ if (branches) options.onProgress?.({ kind: "liveness-prepared", branches });
219
+ const assumptionStatus = reportAssumptionViolation(
220
+ specification.assumptions,
221
+ environment,
222
+ message,
223
+ );
224
+ if (assumptionStatus !== undefined) return assumptionStatus;
225
+ const initAction = initActions[initActions.length - 1];
226
+ const toNode = (state: Value[], action: SpecAction, predecessor: TraceNode | undefined) => {
227
+ const node: TraceNode = { state, action, predecessor, level: (predecessor?.level ?? 0) + 1 };
228
+ nodes.set(state, node);
229
+ return node;
230
+ };
231
+ const getTrace = (last: TraceNode) => {
232
+ const trace: TraceNode[] = [];
233
+ for (let node: TraceNode | undefined = last; node; node = node.predecessor) {
234
+ const predecessor = node.predecessor;
235
+ if (predecessor && isSameState(node.state, predecessor.state)) continue;
236
+ trace.unshift(node);
237
+ }
238
+ trace.forEach((node, index) => {
239
+ node.predecessor = trace[index - 1];
240
+ node.level = index + 1;
241
+ });
242
+ return trace;
243
+ };
244
+ const toRecord = (state: (Value | undefined)[]) =>
245
+ search.toRecord(state.map((value) => value ?? createModelValue("null")));
246
+ // Simulator.printBehavior evaluates the alias of each state with its successor, the last state
247
+ // with itself.
248
+ const toTraceSteps = (trace: TraceNode[]): TraceStep[] =>
249
+ trace.map((node, index) => ({
250
+ action: node.action.name,
251
+ label: getActionLabel(node.action, options.version, node.level === 1),
252
+ state:
253
+ config.alias === undefined || !node.state.every((value) => value !== undefined)
254
+ ? toRecord(node.state)
255
+ : search.evaluateAlias(
256
+ config.alias,
257
+ node.state,
258
+ (trace[index + 1] ?? node).state,
259
+ isTool,
260
+ ),
261
+ }));
262
+ const getCounterExample = (trace: TraceNode[]) =>
263
+ createCounterExample(
264
+ trace.map((node) => search.toRecord(node.state)),
265
+ trace.slice(1).map((node) => toActionValue(node.action)),
266
+ undefined,
267
+ );
268
+
269
+ const initialStates: TraceNode[] = [];
270
+ const isComplete = (state: (Value | undefined)[]): state is Value[] =>
271
+ state.every((value) => value !== undefined);
272
+ const generated: (Value | undefined)[][] = [];
273
+ const reportInitialException = (error: unknown, state: Value[] | undefined) => {
274
+ const failure = toEvaluationError(error);
275
+ if (!state) {
276
+ message(
277
+ MESSAGE_CODE.general,
278
+ `${getUnexpectedPrefix(failure)}${failure.message}`,
279
+ `${getUnexpectedPrefix(failure)}${formatNestedMessage(failure.message, true)}`,
280
+ );
281
+ printSummary();
282
+ return EXIT_STATUS.error;
283
+ }
284
+ const text = getFailureMessage(failure, false);
285
+ const initial = `While working on the initial state:\n${formatState(toRecord(state))}`;
286
+ message(
287
+ MESSAGE_CODE.initialState,
288
+ `${text.message}\n${initial}`,
289
+ `${text.toolMessage}\n${initial}`,
290
+ );
291
+ printSummary();
292
+ return getMessageExitStatus(MESSAGE_CODE.initialState);
293
+ };
294
+ const init = search.spec.init;
295
+ const addGenerated = (state: (Value | undefined)[]) => {
296
+ if (generated.length === getSetBound()) throw new TlaTooManyStatesError();
297
+ generated.push(state);
298
+ return false;
299
+ };
300
+ try {
301
+ if (init) forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
302
+ } catch (error) {
303
+ return reportInitialException(error, undefined);
304
+ }
305
+ statistics.generatedStates = generated.length;
306
+ message(
307
+ MESSAGE_CODE.computingInitProgress,
308
+ `Computed ${generated.length} initial states...`,
309
+ undefined,
310
+ false,
311
+ );
312
+ for (const state of generated) {
313
+ if (!isComplete(state)) {
314
+ message(
315
+ MESSAGE_CODE.initialStateIncomplete,
316
+ `State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
317
+ );
318
+ return EXIT_STATUS.error;
319
+ }
320
+ try {
321
+ const node = toNode(state, initAction, undefined);
322
+ const violated = search.findViolatedInvariant(state);
323
+ if (violated) {
324
+ const alias = toTraceSteps([node])[0].state;
325
+ message(
326
+ MESSAGE_CODE.invariantViolatedInitial,
327
+ `Invariant ${violated.name} is violated by the initial state:\n${formatState(alias)}`,
328
+ );
329
+ runtime.counterExample = getCounterExample([node]);
330
+ reportPostcondition(true);
331
+ return EXIT_STATUS.safetyViolation;
332
+ }
333
+ // Simulator#simulate checks no implied init, where tla-ts checks them as the model checker
334
+ // does, after the invariants.
335
+ const predicate = search.findFailedInitialPredicate(state);
336
+ if (predicate) {
337
+ const alias = toTraceSteps([node])[0].state;
338
+ message(
339
+ MESSAGE_CODE.propertyViolatedInitial,
340
+ `Property ${predicate.name} is violated by the initial state:\n${formatState(alias)}`,
341
+ );
342
+ runtime.counterExample = getCounterExample([node]);
343
+ reportPostcondition(true);
344
+ return EXIT_STATUS.livenessViolation;
345
+ }
346
+ if (search.satisfiesConstraints(state)) {
347
+ search.trackStatePossible(state);
348
+ initialStates.push(node);
349
+ }
350
+ } catch (error) {
351
+ return reportInitialException(error, state);
352
+ }
353
+ }
354
+ if (generated.length === 0) {
355
+ message(
356
+ MESSAGE_CODE.noInitialStates,
357
+ "There is no state satisfying the initial state predicate.",
358
+ );
359
+ return EXIT_STATUS.error;
360
+ }
361
+ if (initialStates.length === 0) {
362
+ message(
363
+ MESSAGE_CODE.noInitialStatesInModel,
364
+ "There is no state satisfying the initial state predicate and the state-constraint(s).",
365
+ );
366
+ return EXIT_STATUS.error;
367
+ }
368
+ message(
369
+ MESSAGE_CODE.initGenerated1,
370
+ `Finished computing initial states: ${initialStates.length} distinct state generated at ${formatTlcDate(new Date())}.`,
371
+ undefined,
372
+ false,
373
+ );
374
+
375
+ const findTemporalViolation = (last: TraceNode): Violation | undefined => {
376
+ if (temporalProperties.length === 0) return undefined;
377
+ const trace = getTrace(last);
378
+ const fingerprints = trace.map((node) => runtime.getFingerprint(node.state));
379
+ const indices = new Map<bigint, number>();
380
+ const states: Value[][] = [];
381
+ const successors: number[][] = [];
382
+ fingerprints.forEach((fingerprint, position) => {
383
+ if (!indices.has(fingerprint)) {
384
+ indices.set(fingerprint, states.length);
385
+ states.push(trace[position].state);
386
+ successors.push([]);
387
+ }
388
+ if (position === 0) return;
389
+ const source = indices.get(fingerprints[position - 1]) ?? 0;
390
+ const target = indices.get(fingerprint) ?? 0;
391
+ if (source !== target && !successors[source].includes(target)) {
392
+ successors[source].push(target);
393
+ }
394
+ });
395
+ const checker = createTemporalChecker(successors, states);
396
+ if (!checker) return undefined;
397
+ checker.addInitialState(0, states[0]);
398
+ states.forEach((state, index) =>
399
+ checker.addState(
400
+ index,
401
+ state,
402
+ successors[index].map((successor) => ({ index: successor, state: states[successor] })),
403
+ ),
404
+ );
405
+ const lasso = checker.findViolation();
406
+ if (!lasso) return undefined;
407
+ // StateTraceResolver recovers the states of the counterexample by their position in the
408
+ // behavior, so TLC prints as many states of the behavior as the counterexample has.
409
+ const getLength = (path: number[]) =>
410
+ path.filter((index, position) => position === 0 || index !== path[position - 1]).length;
411
+ const path = [...lasso.prefix, ...lasso.cycle];
412
+ const length = getLength(path);
413
+ const cyclePosition = getLength(path.slice(0, lasso.prefix.length + 1));
414
+ const printed = trace.slice(0, length);
415
+ const isStuttering =
416
+ fingerprints[length - 1] === runtime.getFingerprint(states[path[lasso.prefix.length]]);
417
+ const loopStart = isStuttering ? length - 1 : cyclePosition - 1;
418
+ const properties = checker.getViolatedProperties(
419
+ printed.map((node) => node.state),
420
+ cyclePosition - 1,
421
+ );
422
+ const back = trace[length];
423
+ return {
424
+ name: properties[0],
425
+ properties,
426
+ trace: toTraceSteps(printed),
427
+ loopStart,
428
+ loopLabel: back && getActionLabel(back.action, options.version, back.level === 1),
429
+ };
430
+ };
431
+ const toWorkerError = (code: number, text: string, node: TraceNode): WorkerError => ({
432
+ code,
433
+ message: text,
434
+ toolMessage: text,
435
+ node,
436
+ isException: false,
437
+ isSummarized: true,
438
+ });
439
+ const getSuccessors = (current: TraceNode, action: SpecAction) => {
440
+ const successors: TraceNode[] = [];
441
+ const failure: { error: WorkerError | undefined } = { error: undefined };
442
+ runtime.deferred = undefined;
443
+ try {
444
+ forEachSuccessor(
445
+ action.expression,
446
+ current.state,
447
+ environment,
448
+ (successor) => {
449
+ const node = toNode(successor.state, action, current);
450
+ node.deferred = runtime.deferred;
451
+ runtime.deferred = undefined;
452
+ statistics.generatedStates++;
453
+ try {
454
+ const violated = search.findViolatedInvariant(node.state, current.state);
455
+ if (violated) {
456
+ failure.error = toWorkerError(
457
+ MESSAGE_CODE.invariantViolatedBehavior,
458
+ `Invariant ${violated.name} is violated.`,
459
+ node,
460
+ );
461
+ return true;
462
+ }
463
+ const property = search.findViolatedActionProperty(current.state, node.state);
464
+ if (property) {
465
+ failure.error = toWorkerError(
466
+ MESSAGE_CODE.actionPropertyViolatedBehavior,
467
+ `Action property ${property.name} is violated.`,
468
+ node,
469
+ );
470
+ return true;
471
+ }
472
+ } catch (error) {
473
+ if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
474
+ const text = getFailureMessage(error, true);
475
+ failure.error = {
476
+ ...toWorkerError(text.code, text.message, node),
477
+ toolMessage: text.toolMessage,
478
+ };
479
+ return true;
480
+ }
481
+ if (!search.satisfiesConstraints(node.state, current.state)) return false;
482
+ search.trackStatePossible(node.state);
483
+ if (!search.satisfiesActionConstraints(current.state, node.state)) return false;
484
+ search.trackActionPossible(current.state, node.state);
485
+ if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
486
+ successors.push(node);
487
+ return false;
488
+ },
489
+ action.scope,
490
+ options.isGenerating ? workerRandom : undefined,
491
+ );
492
+ } catch (error) {
493
+ if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
494
+ const node = toNode(
495
+ error.state.map((value) => value ?? createModelValue("null")),
496
+ action,
497
+ current,
498
+ );
499
+ const text = getIncompleteSuccessorMessage(
500
+ error.variables,
501
+ action.name,
502
+ nextActions.length,
503
+ options.version,
504
+ );
505
+ return { successors, error: toWorkerError(MESSAGE_CODE.incompleteSuccessor, text, node) };
506
+ }
507
+ return { successors, error: failure.error };
508
+ };
509
+ const current = { node: initialStates[0] };
510
+ const qualities = nextActions.map(() => new Map<bigint | SpecAction, number>());
511
+ const getQualityKey = (node: TraceNode) =>
512
+ options.scheduler === "rlaction" ? node.action : runtime.getFingerprint(node.state);
513
+ const getRewardOf = (node: TraceNode) =>
514
+ search.getReward(node.predecessor?.state, node.state, RL_REWARD);
515
+ const getNextActionIndex = (node: TraceNode) => {
516
+ if (options.scheduler === "random") {
517
+ return Math.floor(workerRandom.nextDouble() * nextActions.length);
518
+ }
519
+ const key = getQualityKey(node);
520
+ qualities.forEach((quality) => {
521
+ if (!quality.has(key)) quality.set(key, 0);
522
+ });
523
+ const weights = qualities.map((quality) => Math.exp(quality.get(key) ?? 0));
524
+ const total = weights.reduce((sum, weight) => sum + weight, 0);
525
+ const ranked = weights
526
+ .map((weight, index) => ({ index, weight: weight / total }))
527
+ .sort((left, right) => right.weight - left.weight);
528
+ const random = workerRandom.nextDouble();
529
+ const cumulative = { weight: 0 };
530
+ const chosen = ranked.find((item, position) => {
531
+ cumulative.weight = position === 0 ? item.weight : cumulative.weight + item.weight;
532
+ return cumulative.weight >= random;
533
+ });
534
+ return (chosen ?? ranked[ranked.length - 1]).index;
535
+ };
536
+ const markDisabled = (index: number, node: TraceNode) => {
537
+ if (options.scheduler === "random") return;
538
+ // TLC's rlaction scheduler stores the reward, then overwrites it as the rl scheduler does.
539
+ if (options.scheduler === "rlaction") getRewardOf(node);
540
+ qualities[index].set(getQualityKey(node), -Number.MAX_VALUE);
541
+ };
542
+ const learnTrace = (last: TraceNode) => {
543
+ for (let node = last; node.predecessor; node = node.predecessor) {
544
+ const key = getQualityKey(node);
545
+ const maxQuality = qualities.reduce(
546
+ (max, quality) => Math.max(max, quality.get(key) ?? -Number.MAX_VALUE),
547
+ -Number.MAX_VALUE,
548
+ );
549
+ const quality = qualities[nextActions.indexOf(node.action)];
550
+ const predecessorKey = getQualityKey(node.predecessor);
551
+ quality.set(
552
+ predecessorKey,
553
+ (1 - RL_ALPHA) * (quality.get(predecessorKey) ?? 0) +
554
+ RL_ALPHA * (getRewardOf(node) + RL_GAMMA * maxQuality),
555
+ );
556
+ }
557
+ };
558
+ const simulateTrace = (): WorkerError | "stopped" | undefined => {
559
+ current.node = initialStates[Math.floor(workerRandom.nextDouble() * initialStates.length)];
560
+ for (let depth = 0; depth < traceDepth; depth++) {
561
+ if (runtime.isStopped) return "stopped";
562
+ const choice = { index: getNextActionIndex(current.node) };
563
+ const prime = nextPrime(workerRandom);
564
+ const found: { successors: TraceNode[] } = { successors: [] };
565
+ for (let attempt = 0; attempt < nextActions.length; attempt++) {
566
+ const result = getSuccessors(current.node, nextActions[choice.index]);
567
+ if (result.error) return result.error;
568
+ found.successors = result.successors;
569
+ if (found.successors.length > 0) break;
570
+ markDisabled(choice.index, current.node);
571
+ choice.index = (choice.index + prime) % nextActions.length;
572
+ }
573
+ if (found.successors.length === 0) {
574
+ if (config.checkDeadlock) {
575
+ return toWorkerError(MESSAGE_CODE.deadlockReached, "Deadlock reached.", current.node);
576
+ }
577
+ break;
578
+ }
579
+ current.node =
580
+ found.successors[Math.floor(workerRandom.nextDouble() * found.successors.length)];
581
+ current.node.deferred?.(current.node.state);
582
+ }
583
+ if (runtime.isStopped) return "stopped";
584
+ const violation = findTemporalViolation(current.node);
585
+ if (violation) {
586
+ return {
587
+ ...toWorkerError(MESSAGE_CODE.temporalPropertyViolated, "", current.node),
588
+ isException: true,
589
+ violation,
590
+ };
591
+ }
592
+ const length = Math.min(traceDepth, current.node.level);
593
+ const delta = length - statistics.levelMean;
594
+ statistics.levelMean += Math.trunc(delta / Math.max(statistics.traces, 1));
595
+ statistics.levelM2 += delta * (length - statistics.levelMean);
596
+ if (options.scheduler === "rl") learnTrace(current.node);
597
+ return undefined;
598
+ };
599
+ const toException = (error: unknown, node: TraceNode): WorkerError => {
600
+ const failure = toEvaluationError(error);
601
+ const coded = isEvalException(failure) ? undefined : getCodedMessage(failure.message);
602
+ if (coded) {
603
+ return {
604
+ code: coded.code,
605
+ message: failure.message,
606
+ toolMessage: formatInnerMessage(coded.code, failure.message, true),
607
+ node,
608
+ isException: true,
609
+ isSummarized: false,
610
+ };
611
+ }
612
+ const prefix = getUnexpectedPrefix(failure);
613
+ return {
614
+ code: MESSAGE_CODE.general,
615
+ message: `${prefix}${failure.message}`,
616
+ toolMessage: `${prefix}${formatNestedMessage(failure.message, true)}`,
617
+ node,
618
+ isException: true,
619
+ isSummarized: prefix !== UNEXPECTED_EXCEPTION,
620
+ };
621
+ };
622
+
623
+ const enumerableRandom = createJavaRandom(seed);
624
+ runtime.getRandom = () => enumerableRandom;
625
+ const errors: WorkerError[] = [];
626
+ const isContinued = options.isContinued ?? false;
627
+ const traceLimit = options.traceCount ?? (1n << 63n) - 1n;
628
+ while (true) {
629
+ statistics.traces++;
630
+ worker.currentTrace = statistics.traces;
631
+ const outcome = (() => {
632
+ try {
633
+ return simulateTrace();
634
+ } catch (error) {
635
+ return toException(error, current.node);
636
+ }
637
+ })();
638
+ if (outcome === "stopped") break;
639
+ worker.traceCount++;
640
+ if (outcome) errors.push(outcome);
641
+ if (outcome?.isException) break;
642
+ if (BigInt(worker.traceCount) >= traceLimit) break;
643
+ // The worker runs on through its behaviors while the Simulator prints an error that stops it.
644
+ // Without a bound on them, it starts the next before the Simulator stops it.
645
+ const isStopping = outcome !== undefined && (!isContinued || FATAL_CODES.has(outcome.code));
646
+ if (isStopping && options.traceCount === undefined) {
647
+ statistics.traces++;
648
+ break;
649
+ }
650
+ }
651
+ const printed = errors.findIndex(
652
+ (error) => error.isException || !isContinued || FATAL_CODES.has(error.code),
653
+ );
654
+ const reported = printed === -1 ? errors : errors.slice(0, printed + 1);
655
+ reported.forEach((error) => {
656
+ if (error.violation) {
657
+ options.onProgress?.({
658
+ kind: "violation",
659
+ status: "liveness-violation",
660
+ violation: error.violation,
661
+ });
662
+ printSummary();
663
+ return;
664
+ }
665
+ message(error.code, error.message, error.toolMessage);
666
+ const nodes = getTrace(error.node);
667
+ output({
668
+ kind: "behavior",
669
+ trace: toTraceSteps(nodes),
670
+ isLastStateOnly: traceDepth === INFINITE_DEPTH,
671
+ });
672
+ if (error.isSummarized) printSummary();
673
+ });
674
+ const last = reported[reported.length - 1];
675
+ const errorStatus = last ? getMessageExitStatus(last.code) : EXIT_STATUS.success;
676
+ if (last) runtime.counterExample = getCounterExample(getTrace(last.node));
677
+ const postcondition = reportPostcondition(last !== undefined);
678
+ const postconditionStatus = postcondition
679
+ ? getMessageExitStatus(postcondition.code)
680
+ : EXIT_STATUS.success;
681
+ const status = Math.max(errorStatus, postconditionStatus);
682
+ output({ kind: "progress", statistics: { ...statistics } });
683
+ if (status === EXIT_STATUS.success) printSummary();
684
+ return status;
685
+ };
686
+
687
+ const toEvaluationError = (error: unknown) => {
688
+ if (isStackOverflow(error)) return new TlaStackOverflowError();
689
+ if (!(error instanceof TlaEvaluationError)) throw error;
690
+ return error;
691
+ };
692
+
693
+ const getUnexpectedPrefix = (error: TlaEvaluationError) =>
694
+ isEvalException(error) ? UNEXPECTED_EVAL_EXCEPTION : UNEXPECTED_EXCEPTION;