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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,765 @@
1
+ import type { CheckOptions, TraceStep, Violation } from "./check";
2
+ import type { CoverageOutput } from "./coverage";
3
+ import {
4
+ isStackOverflow,
5
+ TlaEvaluationError,
6
+ TlaIncompleteSuccessorError,
7
+ TlaModuleError,
8
+ TlaStackOverflowError,
9
+ TlaTooManyStatesError,
10
+ TlaUnsupportedError,
11
+ UNEXPECTED_EVAL_EXCEPTION,
12
+ UNEXPECTED_EXCEPTION,
13
+ } from "./errors";
14
+ import type { State } from "./evaluate";
15
+ import { EXIT_STATUS, getMessageExitStatus, withLivenessChecksExitCode } from "./exit-codes";
16
+ import { getHashMapOrder } from "./java-hash";
17
+ import { createLivenessChecks } from "./liveness-checker";
18
+ import {
19
+ addActionCoverage,
20
+ getIncompleteSuccessorMessage,
21
+ prepareSearch,
22
+ reportAssumptionViolation,
23
+ STOP_WALK,
24
+ walkCoveredSuccessors,
25
+ } from "./search";
26
+ import { getActionLabel, toActionValue, type SpecAction } from "./spec-description";
27
+ import { forEachInitialState, forEachSuccessor, type Successor } from "./successors";
28
+ import {
29
+ formatInnerMessage,
30
+ formatNestedMessage,
31
+ formatTlcDate,
32
+ getCodedMessage,
33
+ getFailureMessage,
34
+ isEvalException,
35
+ isHeadedError,
36
+ MESSAGE_CODE,
37
+ withUnexpectedException,
38
+ type FailureMessage,
39
+ } from "./tlc/messages";
40
+ import { createJavaRandom, nextPrime, type JavaRandom } from "./tlc/random";
41
+ import { replayInitialStates } from "./tlc/replay";
42
+ import {
43
+ createActionRecord,
44
+ createCounterExample,
45
+ createTlcRecord,
46
+ type CounterExampleLoop,
47
+ } from "./tlc/tlcext-operators";
48
+ import {
49
+ computeLikeTlcOnFailure,
50
+ createModelValue,
51
+ createRecord,
52
+ formatState,
53
+ getSetBound,
54
+ markNormalized,
55
+ valuesEqual,
56
+ type Value,
57
+ } from "./values";
58
+
59
+ export interface SimulationOptions extends CheckOptions {
60
+ traceDepth: number;
61
+ traceCount: bigint | undefined;
62
+ aril: bigint;
63
+ isGenerating: boolean;
64
+ scheduler: "random" | "rl" | "rlaction";
65
+ onSimulation: (output: SimulationOutput) => void;
66
+ }
67
+
68
+ export interface SimulationStatistics {
69
+ generatedStates: number;
70
+ traces: number;
71
+ levelMean: number;
72
+ levelM2: number;
73
+ seed: bigint;
74
+ aril: bigint;
75
+ }
76
+
77
+ export type SimulationOutput =
78
+ | { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
79
+ | { kind: "behavior"; trace: TraceStep[]; isLastStateOnly: boolean }
80
+ | CoverageOutput
81
+ | { kind: "progress"; statistics: SimulationStatistics }
82
+ | { kind: "summary"; statistics: SimulationStatistics };
83
+
84
+ interface TraceNode {
85
+ state: Value[];
86
+ action: SpecAction;
87
+ predecessor: TraceNode | undefined;
88
+ level: number;
89
+ deferred?: (next: Value[]) => void;
90
+ incomplete?: State;
91
+ }
92
+
93
+ interface WorkerError {
94
+ code: number;
95
+ message: string;
96
+ toolMessage: string;
97
+ node: TraceNode;
98
+ isException: boolean;
99
+ isSummarized: boolean;
100
+ violation?: Violation;
101
+ failures?: FailureMessage[];
102
+ counterExample?: Value;
103
+ }
104
+
105
+ const FATAL_CODES = new Set<number>([
106
+ MESSAGE_CODE.invariantEvaluationFailed,
107
+ MESSAGE_CODE.actionPropertyEvaluationFailed,
108
+ MESSAGE_CODE.incompleteSuccessor,
109
+ ]);
110
+
111
+ const INFINITE_DEPTH = 2147483647;
112
+
113
+ const RL_ALPHA = 0.3;
114
+ const RL_GAMMA = 0.7;
115
+ const RL_REWARD = -10;
116
+
117
+ const isUnequal = () => false;
118
+
119
+ // TLC's SimulationWorker#getTrace drops a step its TLCState#equals finds stuttering, which sorts the records it compares.
120
+ const isRepeatedState = (state: Value[], predecessor: Value[], order: number[]) => {
121
+ for (let position = 0; position < order.length; position++) {
122
+ const index = order[position];
123
+ // Deviation from TLC: TLCState#equals fails on values it can't compare, which hangs TLC's simulation.
124
+ if (!computeLikeTlcOnFailure(valuesEqual, isUnequal, state[index], predecessor[index])) {
125
+ return false;
126
+ }
127
+ }
128
+ return true;
129
+ };
130
+
131
+ const getTrace = (last: TraceNode, order: number[]) => {
132
+ const trace: TraceNode[] = [];
133
+ for (let node: TraceNode | undefined = last; node; node = node.predecessor) {
134
+ const predecessor = node.predecessor;
135
+ if (predecessor && isRepeatedState(node.state, predecessor.state, order)) continue;
136
+ trace.unshift(node);
137
+ }
138
+ trace.forEach((node, index) => {
139
+ node.predecessor = trace[index - 1];
140
+ node.level = index + 1;
141
+ });
142
+ return trace;
143
+ };
144
+
145
+ const createScheduler = (
146
+ scheduler: SimulationOptions["scheduler"],
147
+ nextActions: SpecAction[],
148
+ random: JavaRandom,
149
+ getFingerprint: (state: Value[]) => bigint,
150
+ getReward: (state: Value[] | undefined, next: Value[], fallback: number) => number,
151
+ ) => {
152
+ const qualities = nextActions.map(() => new Map<bigint | SpecAction, number>());
153
+ const getQualityKey = (node: TraceNode) =>
154
+ scheduler === "rlaction" ? node.action : getFingerprint(node.state);
155
+ const getRewardOf = (node: TraceNode) =>
156
+ getReward(node.predecessor?.state, node.state, RL_REWARD);
157
+ return {
158
+ getNextActionIndex: (node: TraceNode) => {
159
+ if (scheduler === "random") {
160
+ return Math.floor(random.nextDouble() * nextActions.length);
161
+ }
162
+ const key = getQualityKey(node);
163
+ qualities.forEach((quality) => {
164
+ if (!quality.has(key)) quality.set(key, 0);
165
+ });
166
+ const weights = qualities.map((quality) => Math.exp(quality.get(key) ?? 0));
167
+ const total = weights.reduce((sum, weight) => sum + weight, 0);
168
+ const ranked = weights
169
+ .map((weight, index) => ({ index, weight: weight / total }))
170
+ .sort((left, right) => right.weight - left.weight);
171
+ const threshold = random.nextDouble();
172
+ let cumulativeWeight = 0;
173
+ const chosen = ranked.find((item, position) => {
174
+ cumulativeWeight = position === 0 ? item.weight : cumulativeWeight + item.weight;
175
+ return cumulativeWeight >= threshold;
176
+ });
177
+ return (chosen ?? ranked[ranked.length - 1]).index;
178
+ },
179
+ markDisabled: (index: number, node: TraceNode) => {
180
+ if (scheduler === "random") return;
181
+ // TLC's rlaction scheduler stores the reward, then overwrites it as the rl scheduler does.
182
+ if (scheduler === "rlaction") getRewardOf(node);
183
+ qualities[index].set(getQualityKey(node), -Number.MAX_VALUE);
184
+ },
185
+ learnTrace: (last: TraceNode) => {
186
+ for (let node = last; node.predecessor; node = node.predecessor) {
187
+ const key = getQualityKey(node);
188
+ const maxQuality = qualities.reduce(
189
+ (max, quality) => Math.max(max, quality.get(key) ?? -Number.MAX_VALUE),
190
+ -Number.MAX_VALUE,
191
+ );
192
+ const quality = qualities[nextActions.indexOf(node.action)];
193
+ const predecessorKey = getQualityKey(node.predecessor);
194
+ quality.set(
195
+ predecessorKey,
196
+ (1 - RL_ALPHA) * (quality.get(predecessorKey) ?? 0) +
197
+ RL_ALPHA * (getRewardOf(node) + RL_GAMMA * maxQuality),
198
+ );
199
+ }
200
+ },
201
+ };
202
+ };
203
+
204
+ export const simulate = (options: SimulationOptions): number => {
205
+ const output = options.onSimulation;
206
+ const prepared = prepareSearch(options);
207
+ const config = prepared.config;
208
+ const specification = prepared.specification;
209
+ const environment = prepared.environment;
210
+ const runtime = environment.runtime;
211
+ const search = prepared.search;
212
+ const seed = options.seed ?? 0n;
213
+ const traceDepth = options.traceDepth === -1 ? INFINITE_DEPTH : options.traceDepth;
214
+ const traceLimit = options.traceCount ?? (1n << 63n) - 1n;
215
+ const random = createJavaRandom(seed);
216
+ for (let index = 0n; index < options.aril; index++) random.nextDouble();
217
+ const workerRandom = createJavaRandom(random.nextLong());
218
+ const statistics: SimulationStatistics = {
219
+ generatedStates: 0,
220
+ traces: 0,
221
+ levelMean: 0,
222
+ levelM2: 0,
223
+ seed,
224
+ aril: options.aril,
225
+ };
226
+ const reportMessage = (code: number, text: string, toolText = text, isError = true) =>
227
+ output({ kind: "message", code, isError, message: text, toolMessage: toolText });
228
+ const reportCoverage = () => {
229
+ const report = prepared.getCoverage();
230
+ if (report) output({ kind: "coverage", coverage: report });
231
+ };
232
+ const printSummary = () => {
233
+ reportCoverage();
234
+ output({ kind: "summary", statistics: { ...statistics } });
235
+ };
236
+ const nodes = new WeakMap<(Value | undefined)[], TraceNode>();
237
+ const description = prepared.getDescription();
238
+ const initActions = description.inits;
239
+ const nextActions = description.actions;
240
+ const coverage = prepared.coverage;
241
+ const covered = coverage && addActionCoverage(coverage, environment, description);
242
+ let traceCount = 0;
243
+ let currentTrace = 0;
244
+ let evaluatedAction: SpecAction | undefined;
245
+ runtime.getSuccessorAction = () => evaluatedAction;
246
+ runtime.getLevel = (state) => nodes.get(state)?.level ?? 0;
247
+ runtime.getSimulationValue = (key, state) => {
248
+ const node = state && nodes.get(state);
249
+ switch (key) {
250
+ case "diameter":
251
+ return currentTrace === 0 ? 0 : traceCount + 1;
252
+ case "generated":
253
+ case "distinct":
254
+ case "queue":
255
+ throw new TlaModuleError(`TLCGet(${key}) was undefined.`);
256
+ case "action":
257
+ return node && toActionValue(node.action);
258
+ case "config":
259
+ return createTlcRecord([
260
+ ["mode", options.isGenerating ? "generate" : "simulate"],
261
+ ["depth", traceDepth === INFINITE_DEPTH ? -1 : traceDepth],
262
+ ["traces", Number(BigInt.asIntN(32, traceLimit))],
263
+ ["deadlock", config.checkDeadlock],
264
+ ["seed", String(seed)],
265
+ ["aril", String(options.aril)],
266
+ ["worker", 1],
267
+ ["install", "unknown"],
268
+ ["sched", options.scheduler],
269
+ ]);
270
+ case "stats": {
271
+ const actions = new Map<string, number>();
272
+ for (let step = node; step && step.level > 1; step = step.predecessor) {
273
+ actions.set(step.action.name, (actions.get(step.action.name) ?? 0) + 1);
274
+ }
275
+ // TLC's SimulationWorker counts the actions of a behavior in a HashMap.
276
+ const counts = getHashMapOrder([...actions.keys()]).map((name): [string, Value] => [
277
+ name,
278
+ actions.get(name) ?? 0,
279
+ ]);
280
+ return createTlcRecord([
281
+ ["traces", statistics.traces],
282
+ ["duration", Math.floor((Date.now() - runtime.startedAt) / 1000)],
283
+ ["generated", statistics.generatedStates],
284
+ [
285
+ "behavior",
286
+ createTlcRecord([
287
+ ["actions", createTlcRecord(counts)],
288
+ ["id", currentTrace],
289
+ ]),
290
+ ],
291
+ ["worker", 0],
292
+ ["distinct", -1],
293
+ ["distinctvalues", -1],
294
+ ["retries", -1],
295
+ ["actions", createRecord([])],
296
+ ["levelmean", statistics.levelMean],
297
+ ["levelvariance", Math.round(statistics.levelM2 / (statistics.traces + 1))],
298
+ ]);
299
+ }
300
+ }
301
+ return undefined;
302
+ };
303
+ runtime.isStarted = true;
304
+ if (!search) {
305
+ throw new TlaUnsupportedError("tla-ts can't simulate a specification without variables");
306
+ }
307
+ runtime.getBehavior = (state) => {
308
+ const node = nodes.get(state);
309
+ return node ? getTrace(node, search.getTlcOrder()).map((step) => step.state) : [state];
310
+ };
311
+ const reportPostcondition = (isAfterViolation: boolean) => {
312
+ const postcondition = search.findPostconditionViolation(isAfterViolation);
313
+ if (!postcondition) return undefined;
314
+ if (postcondition.counts !== undefined) (options.onPrint ?? console.log)(postcondition.counts);
315
+ reportMessage(
316
+ postcondition.code,
317
+ postcondition.message,
318
+ formatInnerMessage(postcondition.code, postcondition.message, true),
319
+ );
320
+ return postcondition;
321
+ };
322
+ const livenessChecks = withLivenessChecksExitCode(() =>
323
+ withUnexpectedException(() =>
324
+ createLivenessChecks(search.properties.liveness, search.spec.temporals, environment),
325
+ ),
326
+ );
327
+ const branches = livenessChecks?.solutions.length;
328
+ if (branches) options.onProgress?.({ kind: "liveness-prepared", branches });
329
+ const assumptionStatus = reportAssumptionViolation(
330
+ specification.assumptions,
331
+ environment,
332
+ reportMessage,
333
+ );
334
+ if (assumptionStatus !== undefined) return assumptionStatus;
335
+ const initAction = initActions[initActions.length - 1];
336
+ const toNode = (state: Value[], action: SpecAction, predecessor: TraceNode | undefined) => {
337
+ const node: TraceNode = { state, action, predecessor, level: (predecessor?.level ?? 0) + 1 };
338
+ nodes.set(state, node);
339
+ return node;
340
+ };
341
+ const toRecord = (state: (Value | undefined)[]) =>
342
+ search.toRecord(state.map((value) => value ?? createModelValue("null")));
343
+ const toTraceSteps = (trace: TraceNode[]): TraceStep[] =>
344
+ trace.map((node, index) => {
345
+ const successor = trace[index + 1] ?? node;
346
+ return {
347
+ action: node.action.name,
348
+ label: getActionLabel(node.action, options.version, node.level === 1),
349
+ state:
350
+ config.alias === undefined
351
+ ? toRecord(node.state)
352
+ : search.evaluateAlias(
353
+ config.alias,
354
+ node.incomplete ?? node.state,
355
+ successor.incomplete ?? successor.state,
356
+ options.isTool ?? false,
357
+ ),
358
+ };
359
+ });
360
+ const getCounterExample = (
361
+ trace: TraceNode[],
362
+ steps = toTraceSteps(trace),
363
+ loop?: CounterExampleLoop,
364
+ ) =>
365
+ createCounterExample(
366
+ steps.map((step) => step.state),
367
+ trace.slice(1).map((node) => toActionValue(node.action)),
368
+ loop,
369
+ );
370
+ // TLC's Simulator binds CounterExample to an initial state that violates an invariant, not to its alias.
371
+ const getInitialCounterExample = (node: TraceNode) =>
372
+ createCounterExample([toRecord(node.state)], [], undefined);
373
+
374
+ const initialStates: TraceNode[] = [];
375
+ const isComplete = (state: (Value | undefined)[]): state is Value[] =>
376
+ state.every((value) => value !== undefined);
377
+ const generated: (Value | undefined)[][] = [];
378
+ const reportInitialException = (error: unknown, state: Value[] | undefined) => {
379
+ const failure = toEvaluationError(error);
380
+ if (!state) {
381
+ reportMessage(
382
+ MESSAGE_CODE.general,
383
+ `${getUnexpectedPrefix(failure)}${failure.message}`,
384
+ `${getUnexpectedPrefix(failure)}${formatNestedMessage(failure.message, true)}`,
385
+ );
386
+ printSummary();
387
+ return EXIT_STATUS.error;
388
+ }
389
+ const text = getFailureMessage(failure, false);
390
+ const initial = `While working on the initial state:\n${formatState(toRecord(state))}`;
391
+ reportMessage(
392
+ MESSAGE_CODE.initialState,
393
+ `${text.message}\n${initial}`,
394
+ `${text.toolMessage}\n${initial}`,
395
+ );
396
+ printSummary();
397
+ return getMessageExitStatus(MESSAGE_CODE.initialState);
398
+ };
399
+ const init = search.spec.init;
400
+ const addGenerated = (state: (Value | undefined)[]) => {
401
+ if (generated.length === getSetBound()) throw new TlaTooManyStatesError();
402
+ generated.push(state);
403
+ return false;
404
+ };
405
+ try {
406
+ if (covered) {
407
+ replayInitialStates(covered.inits, environment, addGenerated, (partial) =>
408
+ addGenerated([...partial]),
409
+ );
410
+ } else if (init) {
411
+ forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
412
+ }
413
+ } catch (error) {
414
+ return reportInitialException(error, undefined);
415
+ }
416
+ statistics.generatedStates = generated.length;
417
+ reportMessage(
418
+ MESSAGE_CODE.computingInitProgress,
419
+ `Computed ${generated.length} initial states...`,
420
+ undefined,
421
+ false,
422
+ );
423
+ const generatedNodes: TraceNode[] = [];
424
+ for (const state of generated) {
425
+ if (!isComplete(state)) {
426
+ reportMessage(
427
+ MESSAGE_CODE.initialStateIncomplete,
428
+ `State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
429
+ );
430
+ return EXIT_STATUS.error;
431
+ }
432
+ try {
433
+ const node = toNode(state, initAction, undefined);
434
+ const violated = search.findViolatedInvariant(state);
435
+ if (violated) {
436
+ const alias = toTraceSteps([node])[0].state;
437
+ reportMessage(
438
+ MESSAGE_CODE.invariantViolatedInitial,
439
+ `Invariant ${violated.name} is violated by the initial state:\n${formatState(alias)}`,
440
+ );
441
+ runtime.counterExample = getInitialCounterExample(node);
442
+ reportPostcondition(true);
443
+ return EXIT_STATUS.safetyViolation;
444
+ }
445
+ generatedNodes.push(node);
446
+ if (search.satisfiesConstraints(state)) {
447
+ search.trackStatePossible(state);
448
+ initialStates.push(node);
449
+ }
450
+ } catch (error) {
451
+ return reportInitialException(error, state);
452
+ }
453
+ }
454
+ if (generated.length === 0) {
455
+ reportMessage(
456
+ MESSAGE_CODE.noInitialStates,
457
+ "There is no state satisfying the initial state predicate.",
458
+ );
459
+ return EXIT_STATUS.error;
460
+ }
461
+ if (initialStates.length === 0) {
462
+ reportMessage(
463
+ MESSAGE_CODE.noInitialStatesInModel,
464
+ "There is no state satisfying the initial state predicate and the state-constraint(s).",
465
+ );
466
+ return EXIT_STATUS.error;
467
+ }
468
+ // Deviation from TLC: its simulator checks no implied init, tla-ts checks them after TLC's own checks of the initial states.
469
+ for (const node of generatedNodes) {
470
+ try {
471
+ const predicate = search.findFailedInitialPredicate(node.state);
472
+ if (predicate) {
473
+ const alias = toTraceSteps([node])[0].state;
474
+ reportMessage(
475
+ MESSAGE_CODE.propertyViolatedInitial,
476
+ `Property ${predicate.name} is violated by the initial state:\n${formatState(alias)}`,
477
+ );
478
+ runtime.counterExample = getInitialCounterExample(node);
479
+ reportPostcondition(true);
480
+ return EXIT_STATUS.livenessViolation;
481
+ }
482
+ } catch (error) {
483
+ return reportInitialException(error, node.state);
484
+ }
485
+ }
486
+ reportMessage(
487
+ MESSAGE_CODE.initGenerated1,
488
+ `Finished computing initial states: ${initialStates.length} distinct state generated at ${formatTlcDate(new Date())}.`,
489
+ undefined,
490
+ false,
491
+ );
492
+ // TLC's Simulator deep-normalizes the initial states, which sorts their records.
493
+ initialStates.forEach((node) => node.state.forEach(markNormalized));
494
+
495
+ const toWorkerError = (code: number, text: string, node: TraceNode): WorkerError => ({
496
+ code,
497
+ message: text,
498
+ toolMessage: text,
499
+ node,
500
+ isException: false,
501
+ isSummarized: true,
502
+ });
503
+ const getSuccessors = (current: TraceNode, index: number) => {
504
+ const action = nextActions[index];
505
+ const coveredAction = covered?.actions[index];
506
+ const successors: TraceNode[] = [];
507
+ let failure: WorkerError | undefined;
508
+ runtime.deferred = undefined;
509
+ evaluatedAction = action;
510
+ const visit = (successor: Successor) => {
511
+ const node = toNode(successor.state, action, current);
512
+ node.deferred = runtime.deferred;
513
+ runtime.deferred = undefined;
514
+ statistics.generatedStates++;
515
+ try {
516
+ const violated = search.findViolatedInvariant(node.state, current.state);
517
+ if (violated) {
518
+ failure = toWorkerError(
519
+ MESSAGE_CODE.invariantViolatedBehavior,
520
+ `Invariant ${violated.name} is violated.`,
521
+ node,
522
+ );
523
+ return true;
524
+ }
525
+ const property = search.findViolatedActionProperty(current.state, node.state);
526
+ if (property) {
527
+ failure = toWorkerError(
528
+ MESSAGE_CODE.actionPropertyViolatedBehavior,
529
+ `Action property ${property.name} is violated.`,
530
+ node,
531
+ );
532
+ return true;
533
+ }
534
+ } catch (error) {
535
+ if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
536
+ const text = getFailureMessage(error, true);
537
+ failure = {
538
+ ...toWorkerError(text.code, text.message, node),
539
+ toolMessage: text.toolMessage,
540
+ };
541
+ return true;
542
+ }
543
+ if (!search.satisfiesConstraints(node.state, current.state)) return false;
544
+ search.trackStatePossible(node.state);
545
+ if (!search.satisfiesActionConstraints(current.state, node.state)) return false;
546
+ search.trackActionPossible(current.state, node.state);
547
+ if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
548
+ if (coverage && coveredAction) coverage.secondary[coveredAction.node]++;
549
+ successors.push(node);
550
+ return false;
551
+ };
552
+ try {
553
+ if (coverage && coveredAction && !options.isGenerating) {
554
+ walkCoveredSuccessors(coverage, coveredAction, current.state, environment, (state) => {
555
+ if (visit({ state, action: action.name })) throw STOP_WALK;
556
+ });
557
+ } else {
558
+ forEachSuccessor(
559
+ action.expression,
560
+ current.state,
561
+ environment,
562
+ coverage && coveredAction
563
+ ? (successor) => {
564
+ coverage.primary[coveredAction.node]++;
565
+ return visit(successor);
566
+ }
567
+ : visit,
568
+ action.scope,
569
+ options.isGenerating ? workerRandom : undefined,
570
+ );
571
+ }
572
+ } catch (error) {
573
+ if (error === STOP_WALK) return { successors, error: failure };
574
+ if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
575
+ const node = toNode(
576
+ error.state.map((value) => value ?? createModelValue("null")),
577
+ action,
578
+ current,
579
+ );
580
+ node.incomplete = error.state;
581
+ const text = getIncompleteSuccessorMessage(
582
+ error.variables,
583
+ action.name,
584
+ nextActions.length,
585
+ options.version,
586
+ );
587
+ return { successors, error: toWorkerError(MESSAGE_CODE.incompleteSuccessor, text, node) };
588
+ }
589
+ return { successors, error: failure };
590
+ };
591
+ let currentNode = initialStates[0];
592
+ const scheduler = createScheduler(
593
+ options.scheduler,
594
+ nextActions,
595
+ workerRandom,
596
+ runtime.getFingerprint,
597
+ search.getReward,
598
+ );
599
+ const getTemporalViolation = (last: TraceNode): WorkerError | undefined => {
600
+ if (!livenessChecks) return undefined;
601
+ const trace = getTrace(last, search.getTlcOrder());
602
+ // TLC's LiveCheck#checkTrace fingerprints each state, which sorts its records.
603
+ for (let position = 0; position < trace.length; position++) {
604
+ trace[position].state.forEach(markNormalized);
605
+ }
606
+ const found = livenessChecks.findTraceViolation(
607
+ trace.map((node) => node.state),
608
+ trace.map((node) => runtime.getFingerprint(node.state)),
609
+ );
610
+ if (!found) return undefined;
611
+ const back = found.backPosition === undefined ? undefined : trace[found.backPosition];
612
+ const lasso = found.positions.map((position) => trace[position]);
613
+ const loopStart = back ? found.cyclePosition - 1 : lasso.length - 1;
614
+ const steps = toTraceSteps(lasso);
615
+ const loopAction = back ? toActionValue(back.action) : createActionRecord(undefined);
616
+ return {
617
+ ...toWorkerError(MESSAGE_CODE.temporalPropertyViolated, "", last),
618
+ isException: true,
619
+ violation: {
620
+ name: found.properties[0],
621
+ properties: found.properties,
622
+ trace: steps,
623
+ loopStart,
624
+ loopLabel: back && getActionLabel(back.action, options.version, back.level === 1),
625
+ },
626
+ failures: found.failures.map((failure) => toException(failure, last)),
627
+ counterExample: getCounterExample(lasso, steps, { start: loopStart, action: loopAction }),
628
+ };
629
+ };
630
+ const simulateTrace = (): WorkerError | "stopped" | undefined => {
631
+ currentNode = initialStates[Math.floor(workerRandom.nextDouble() * initialStates.length)];
632
+ for (let depth = 0; depth < traceDepth; depth++) {
633
+ if (runtime.isStopped) return "stopped";
634
+ let actionIndex = scheduler.getNextActionIndex(currentNode);
635
+ const prime = nextPrime(workerRandom);
636
+ let successors: TraceNode[] = [];
637
+ for (let attempt = 0; attempt < nextActions.length; attempt++) {
638
+ const result = getSuccessors(currentNode, actionIndex);
639
+ // Deviation from TLC: TLCSet("exit") interrupts TLC's SimulationWorker, whose BlockingQueue#put then drops a violation found in the same step.
640
+ if (result.error) return result.error;
641
+ successors = result.successors;
642
+ if (successors.length > 0) break;
643
+ scheduler.markDisabled(actionIndex, currentNode);
644
+ actionIndex = (actionIndex + prime) % nextActions.length;
645
+ }
646
+ if (successors.length === 0) {
647
+ if (config.checkDeadlock) {
648
+ return toWorkerError(MESSAGE_CODE.deadlockReached, "Deadlock reached.", currentNode);
649
+ }
650
+ break;
651
+ }
652
+ currentNode = successors[Math.floor(workerRandom.nextDouble() * successors.length)];
653
+ currentNode.deferred?.(currentNode.state);
654
+ }
655
+ if (runtime.isStopped) return "stopped";
656
+ const violation = getTemporalViolation(currentNode);
657
+ if (violation) return violation;
658
+ const length = Math.min(traceDepth, currentNode.level);
659
+ const delta = length - statistics.levelMean;
660
+ statistics.levelMean += Math.trunc(delta / Math.max(statistics.traces, 1));
661
+ statistics.levelM2 += delta * (length - statistics.levelMean);
662
+ if (options.scheduler === "rl") scheduler.learnTrace(currentNode);
663
+ return undefined;
664
+ };
665
+ const toException = (error: unknown, node: TraceNode): WorkerError => {
666
+ const failure = toEvaluationError(error);
667
+ const coded = isEvalException(failure) ? undefined : getCodedMessage(failure.message);
668
+ if (coded) {
669
+ return {
670
+ code: coded.code,
671
+ message: failure.message,
672
+ toolMessage: formatInnerMessage(coded.code, failure.message, true),
673
+ node,
674
+ isException: true,
675
+ isSummarized: false,
676
+ };
677
+ }
678
+ const prefix = getUnexpectedPrefix(failure);
679
+ return {
680
+ code: MESSAGE_CODE.general,
681
+ message: `${prefix}${failure.message}`,
682
+ toolMessage: `${prefix}${formatNestedMessage(failure.message, true)}`,
683
+ node,
684
+ isException: true,
685
+ isSummarized: prefix !== UNEXPECTED_EXCEPTION,
686
+ };
687
+ };
688
+
689
+ const enumerableRandom = createJavaRandom(seed);
690
+ runtime.getRandom = () => enumerableRandom;
691
+ const errors: WorkerError[] = [];
692
+ const isContinued = options.isContinued ?? false;
693
+ while (true) {
694
+ statistics.traces++;
695
+ currentTrace = statistics.traces;
696
+ const outcome = (() => {
697
+ try {
698
+ return simulateTrace();
699
+ } catch (error) {
700
+ return toException(error, currentNode);
701
+ }
702
+ })();
703
+ if (outcome === "stopped") break;
704
+ traceCount++;
705
+ if (outcome) errors.push(outcome);
706
+ if (outcome?.isException) break;
707
+ if (BigInt(traceCount) >= traceLimit) break;
708
+ // TLC's worker starts one more behavior before the Simulator stops it, unless traces are bounded.
709
+ const isStopping = outcome !== undefined && (!isContinued || FATAL_CODES.has(outcome.code));
710
+ if (isStopping && options.traceCount === undefined) {
711
+ statistics.traces++;
712
+ break;
713
+ }
714
+ }
715
+ const printed = errors.findIndex(
716
+ (error) => error.isException || !isContinued || FATAL_CODES.has(error.code),
717
+ );
718
+ const reported = printed === -1 ? errors : errors.slice(0, printed + 1);
719
+ reported.forEach((error) => {
720
+ if (error.violation) {
721
+ error.failures?.forEach((failure) =>
722
+ reportMessage(failure.code, failure.message, failure.toolMessage),
723
+ );
724
+ options.onProgress?.({
725
+ kind: "violation",
726
+ status: "liveness-violation",
727
+ violation: error.violation,
728
+ });
729
+ printSummary();
730
+ return;
731
+ }
732
+ reportMessage(error.code, error.message, error.toolMessage);
733
+ output({
734
+ kind: "behavior",
735
+ trace: toTraceSteps(getTrace(error.node, search.getTlcOrder())),
736
+ isLastStateOnly: traceDepth === INFINITE_DEPTH,
737
+ });
738
+ if (error.isSummarized) printSummary();
739
+ });
740
+ const last = reported[reported.length - 1];
741
+ const errorStatus = last ? getMessageExitStatus(last.code) : EXIT_STATUS.success;
742
+ if (last) {
743
+ runtime.counterExample =
744
+ last.counterExample ?? getCounterExample(getTrace(last.node, search.getTlcOrder()));
745
+ }
746
+ const postcondition = reportPostcondition(last !== undefined);
747
+ const postconditionStatus = postcondition
748
+ ? getMessageExitStatus(postcondition.code)
749
+ : EXIT_STATUS.success;
750
+ const status = Math.max(errorStatus, postconditionStatus);
751
+ output({ kind: "progress", statistics: { ...statistics } });
752
+ // TLC's ProgressReport prints the coverage again with its last progress unless -coverage spans more progress reports.
753
+ if (options.coverage !== undefined && options.coverage <= 1) reportCoverage();
754
+ if (status === EXIT_STATUS.success) printSummary();
755
+ return status;
756
+ };
757
+
758
+ const toEvaluationError = (error: unknown) => {
759
+ if (isStackOverflow(error)) return new TlaStackOverflowError();
760
+ if (!(error instanceof TlaEvaluationError)) throw error;
761
+ return error;
762
+ };
763
+
764
+ const getUnexpectedPrefix = (error: TlaEvaluationError) =>
765
+ isEvalException(error) ? UNEXPECTED_EVAL_EXCEPTION : UNEXPECTED_EXCEPTION;