tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32

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 (382) hide show
  1. package/README.md +32 -6
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +27 -27
  5. package/dist/deciders.js +34 -34
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +12 -14
  8. package/dist/index.d.ts +12 -14
  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 +516 -25
  15. package/dist/prove.js +518 -27
  16. package/dist/run.cjs +45 -0
  17. package/dist/run.js +45 -0
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +76 -86
  21. package/dist/transfer.js +73 -83
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +1 -1
  25. package/src/ast.ts +2 -2
  26. package/src/bags.ts +22 -23
  27. package/src/builtins.ts +16 -8
  28. package/src/check.ts +131 -1154
  29. package/src/{cli-options.ts → cli/options.ts} +54 -9
  30. package/src/cli/run.ts +63 -0
  31. package/src/cli/shared.ts +106 -0
  32. package/src/cli/tlapm.ts +374 -0
  33. package/src/{run-cli.ts → cli/tlc.ts} +112 -761
  34. package/src/cli/xml-exporter.ts +221 -0
  35. package/src/cli.ts +1 -1
  36. package/src/codegen.ts +17 -15
  37. package/src/config.ts +5 -5
  38. package/src/dependencies.ts +4 -6
  39. package/src/environment.ts +55 -60
  40. package/src/errors.ts +12 -36
  41. package/src/evaluate.ts +81 -101
  42. package/src/exit-codes.ts +1 -1
  43. package/src/fingerprints.ts +3 -3
  44. package/src/index.ts +2 -2
  45. package/src/instances.ts +56 -46
  46. package/src/java-overrides.ts +79 -41
  47. package/src/json.ts +31 -36
  48. package/src/levels.ts +10 -13
  49. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  50. package/src/liveness.ts +38 -34
  51. package/src/obligations/action.ts +58 -105
  52. package/src/obligations/{anon.ts → anonymize.ts} +44 -52
  53. package/src/obligations/equality.ts +260 -0
  54. package/src/obligations/expression.ts +42 -530
  55. package/src/obligations/format.ts +7 -8
  56. package/src/obligations/generate.ts +93 -783
  57. package/src/obligations/index.ts +23 -23
  58. package/src/obligations/levels.ts +38 -44
  59. package/src/obligations/module.ts +106 -729
  60. package/src/obligations/normalize.ts +554 -0
  61. package/src/obligations/operators.ts +176 -0
  62. package/src/obligations/pragma.ts +35 -29
  63. package/src/obligations/printer.ts +98 -209
  64. package/src/obligations/proof.ts +0 -1
  65. package/src/obligations/regroup.ts +100 -0
  66. package/src/obligations/simplify.ts +668 -0
  67. package/src/obligations/source.ts +92 -192
  68. package/src/obligations/{deref.ts → subexpression.ts} +82 -113
  69. package/src/obligations/substitution.ts +261 -0
  70. package/src/obligations/temporal.ts +32 -30
  71. package/src/obligations/tuples.ts +37 -53
  72. package/src/parallel-worker.ts +37 -33
  73. package/src/parallel.ts +30 -24
  74. package/src/parser.ts +67 -74
  75. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  76. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  77. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  78. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  79. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  80. package/src/{prove → prover}/decide-pool.ts +14 -19
  81. package/src/{prove → prover}/deciders.ts +7 -1
  82. package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
  83. package/src/{prove → prover}/isabelle/decide.ts +3 -6
  84. package/src/{prove → prover}/isabelle/encode.ts +106 -138
  85. package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
  86. package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
  87. package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
  88. package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
  89. package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
  90. package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
  91. package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
  92. package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
  93. package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
  94. package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
  95. package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
  96. package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
  97. package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
  98. package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
  99. package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
  100. package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
  101. package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
  102. package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
  103. package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
  104. package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
  105. package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
  106. package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
  107. package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
  108. package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
  109. package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
  110. package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
  111. package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
  112. package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
  113. package/src/{prove → prover}/ocaml.ts +1 -1
  114. package/src/{prove → prover}/prep/action.ts +54 -66
  115. package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
  116. package/src/{prove → prover}/prep/fingerprint.ts +3 -3
  117. package/src/{prove → prover}/prep/level-comparison.ts +15 -38
  118. package/src/{prove → prover}/prep/md5.ts +2 -9
  119. package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
  120. package/src/prover/prep/normalize.ts +309 -0
  121. package/src/{prove → prover}/prove-worker.ts +4 -11
  122. package/src/prover/prove.ts +492 -0
  123. package/src/{prove → prover}/ptl/encode.ts +19 -31
  124. package/src/{prove → prover}/smt/axioms.ts +78 -79
  125. package/src/{prove → prover}/smt/data.ts +16 -45
  126. package/src/{prove → prover}/smt/encode.ts +134 -28
  127. package/src/{prove → prover}/smt/extensionality.ts +14 -12
  128. package/src/{prove → prover}/smt/flatten.ts +3 -18
  129. package/src/{prove → prover}/smt/format.ts +14 -3
  130. package/src/{prove → prover}/smt/instances.ts +4 -5
  131. package/src/{prove → prover}/smt/rewrite.ts +41 -59
  132. package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
  133. package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
  134. package/src/{prove → prover}/smt/solver/enode.ts +1 -1
  135. package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
  136. package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
  137. package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
  138. package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
  139. package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
  140. package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
  141. package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
  142. package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
  143. package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
  144. package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
  145. package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
  146. package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
  147. package/src/{prove → prover}/smt/solver/solver.ts +2 -2
  148. package/src/prover/tlapm/cache.ts +236 -0
  149. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  150. package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
  151. package/src/prover/verdict.ts +13 -0
  152. package/src/{prove → prover}/zenon/decide.ts +5 -11
  153. package/src/{prove → prover}/zenon/encode.ts +40 -106
  154. package/src/{prove → prover}/zenon/eqrel.ts +1 -1
  155. package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
  156. package/src/{prove → prover}/zenon/expr.ts +2 -2
  157. package/src/{prove → prover}/zenon/index-table.ts +1 -1
  158. package/src/{prove → prover}/zenon/isar.ts +1 -1
  159. package/src/{prove → prover}/zenon/llproof.ts +1 -1
  160. package/src/{prove → prover}/zenon/mltoll.ts +1 -1
  161. package/src/{prove → prover}/zenon/node.ts +1 -1
  162. package/src/{prove → prover}/zenon/search.ts +1 -1
  163. package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
  164. package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
  165. package/src/randomization.ts +19 -24
  166. package/src/resolve.ts +15 -22
  167. package/src/runtime.ts +8 -8
  168. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  169. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  170. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  171. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  172. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  173. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  174. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  175. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  176. package/src/{sany-report.ts → sany/report.ts} +16 -17
  177. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  178. package/src/{sany-source.ts → sany/source.ts} +6 -7
  179. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  180. package/src/search.ts +969 -0
  181. package/src/spec-description.ts +26 -20
  182. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  183. package/src/standard-modules.ts +16 -20
  184. package/src/state-graph.ts +9 -8
  185. package/src/substitution-levels.ts +2 -2
  186. package/src/successors.ts +16 -19
  187. package/src/symmetry.ts +1 -1
  188. package/src/tableau.ts +6 -7
  189. package/src/tlc/fingerprint.ts +214 -0
  190. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  191. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  192. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  193. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  194. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  195. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  196. package/src/transfer.ts +32 -32
  197. package/src/values.ts +72 -67
  198. package/src/worker.ts +1 -4
  199. package/dist/run-cli.cjs +0 -38
  200. package/dist/run-cli.js +0 -38
  201. package/src/canonical.ts +0 -40
  202. package/src/obligations/ctx.ts +0 -64
  203. package/src/prove/prep/defs.ts +0 -27
  204. package/src/prove/prep/elab.ts +0 -156
  205. package/src/prove/prep/enabled.ts +0 -43
  206. package/src/prove/prep/flatten.ts +0 -70
  207. package/src/prove/prep/trivial.ts +0 -22
  208. package/src/prove/prove.ts +0 -417
  209. package/src/prove/smt/axiomatize.ts +0 -69
  210. package/src/prove/smt/simplify.ts +0 -57
  211. package/src/prove/verdict.ts +0 -13
  212. package/src/standard-ranges.ts +0 -116
  213. package/src/value-sources.ts +0 -29
  214. /package/src/{prove → prover}/isabelle/LICENSE +0 -0
  215. /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
  216. /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
  217. /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
  218. /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
  219. /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
  220. /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
  221. /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
  222. /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
  223. /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
  224. /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
  225. /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
  226. /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
  227. /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
  228. /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
  229. /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
  230. /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
  231. /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
  232. /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
  233. /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
  234. /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
  235. /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
  236. /package/src/{prove → prover}/ptl/decide.ts +0 -0
  237. /package/src/{prove → prover}/ptl/sat.ts +0 -0
  238. /package/src/{prove → prover}/ptl/tableau.ts +0 -0
  239. /package/src/{prove → prover}/smt/context.ts +0 -0
  240. /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
  241. /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
  242. /package/src/{prove → prover}/smt/solver/array.ts +0 -0
  243. /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
  244. /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
  245. /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
  246. /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
  247. /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
  248. /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
  249. /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
  250. /package/src/{prove → prover}/smt/solver/context.ts +0 -0
  251. /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
  252. /package/src/{prove → prover}/smt/solver/der.ts +0 -0
  253. /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
  254. /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
  255. /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
  256. /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
  257. /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
  258. /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
  259. /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
  260. /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
  261. /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
  262. /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
  263. /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
  264. /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
  265. /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
  266. /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
  267. /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
  268. /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
  269. /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
  270. /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
  271. /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
  272. /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
  273. /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
  274. /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
  275. /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
  276. /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
  277. /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
  278. /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
  279. /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
  280. /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
  281. /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
  282. /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
  283. /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
  284. /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
  285. /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
  286. /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
  287. /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
  288. /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
  289. /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
  290. /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
  291. /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
  292. /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
  293. /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
  294. /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
  295. /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
  296. /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
  297. /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
  298. /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
  299. /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
  300. /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
  301. /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
  302. /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
  303. /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
  304. /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
  305. /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
  306. /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
  307. /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
  308. /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
  309. /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
  310. /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
  311. /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
  312. /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
  313. /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
  314. /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
  315. /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
  316. /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
  317. /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
  318. /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
  319. /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
  320. /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
  321. /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
  322. /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
  323. /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
  324. /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
  325. /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
  326. /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
  327. /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
  328. /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
  329. /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
  330. /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
  331. /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
  332. /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
  333. /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
  334. /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
  335. /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
  336. /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
  337. /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
  338. /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
  339. /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
  340. /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
  341. /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
  342. /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
  343. /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
  344. /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
  345. /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
  346. /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
  347. /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
  348. /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
  349. /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
  350. /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
  351. /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
  352. /package/src/{prove → prover}/smt/table.ts +0 -0
  353. /package/src/{prove → prover}/tlaps-module.ts +0 -0
  354. /package/src/{prove → prover}/zenon/LICENSE +0 -0
  355. /package/src/{prove → prover}/zenon/check/check.ts +0 -0
  356. /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
  357. /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
  358. /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
  359. /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
  360. /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
  361. /package/src/{prove → prover}/zenon/check/records.ts +0 -0
  362. /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
  363. /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
  364. /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
  365. /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
  366. /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
  367. /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
  368. /package/src/{prove → prover}/zenon/limits.ts +0 -0
  369. /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
  370. /package/src/{prove → prover}/zenon/parse.ts +0 -0
  371. /package/src/{prove → prover}/zenon/phrase.ts +0 -0
  372. /package/src/{prove → prover}/zenon/proof.ts +0 -0
  373. /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
  374. /package/src/{prove → prover}/zenon/rules.ts +0 -0
  375. /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
  376. /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
  377. /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
  378. /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
  379. /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
  380. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  381. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  382. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -21,10 +21,10 @@ import {
21
21
  type Environment,
22
22
  type Scope,
23
23
  } from "./evaluate";
24
- import { TEMPORAL_LEVEL } from "./levels";
24
+ import { ACTION_LEVEL, CONSTANT_LEVEL, TEMPORAL_LEVEL, VARIABLE_LEVEL } from "./levels";
25
25
  import { getLevel } from "./liveness";
26
26
  import { createRecord, createSet, createTuple, formatValue, type Value } from "./values";
27
- import type { TlcVersion } from "./tlc-version";
27
+ import type { TlcVersion } from "./tlc/version";
28
28
 
29
29
  export interface SpecAction {
30
30
  name: string;
@@ -178,7 +178,9 @@ const getInstanceActions = (
178
178
  if (!called || args.length === 0) {
179
179
  return [{ ...instanceAction, parameters: [], expression, scope }];
180
180
  }
181
- if (args.some((arg) => getLevel(arg, scope, environment) !== 0)) return callAction();
181
+ if (args.some((arg) => getLevel(arg, scope, environment) !== CONSTANT_LEVEL)) {
182
+ return callAction();
183
+ }
182
184
  return tryCollect(
183
185
  () => [
184
186
  {
@@ -259,7 +261,9 @@ const getActions = (
259
261
  { name: calledName, location: expression.location, parameters: [], expression, scope },
260
262
  ];
261
263
  if (isConstantDefinition(called, environment)) return callAction();
262
- if (args.some((arg) => getLevel(arg, scope, environment) !== 0)) return callAction();
264
+ if (args.some((arg) => getLevel(arg, scope, environment) !== CONSTANT_LEVEL)) {
265
+ return callAction();
266
+ }
263
267
  return tryCollect(() => {
264
268
  const boundScope = args.reduce<Scope | undefined>(
265
269
  (current, arg, index) => ({
@@ -306,7 +310,7 @@ const describeSpecification = (
306
310
  const called = resolveClosure(expression, scope, environment);
307
311
  if (called && isConstantDefinition(called, environment)) return;
308
312
  if (called && called.params.length === 0) {
309
- if (getLevel(called.body, called.scope, environment) === 1) {
313
+ if (getLevel(called.body, called.scope, environment) === VARIABLE_LEVEL) {
310
314
  description.inits.push(createAction(called.name, called.body));
311
315
  return;
312
316
  }
@@ -333,7 +337,7 @@ const describeSpecification = (
333
337
  return;
334
338
  }
335
339
  const level = getLevel(expression, scope, environment);
336
- if (level <= 1) description.inits.push(createAction(UNNAMED_ACTION, expression));
340
+ if (level <= VARIABLE_LEVEL) description.inits.push(createAction(UNNAMED_ACTION, expression));
337
341
  else if (level === TEMPORAL_LEVEL) {
338
342
  description.temporals.push(createAction(UNNAMED_ACTION, expression));
339
343
  }
@@ -392,7 +396,7 @@ const describeProperty = (
392
396
  const inner = expression.expression;
393
397
  if (inner.kind === "BoxAction") {
394
398
  description.impliedActions.push(createAction(configName, inner));
395
- } else if (getLevel(inner, scope, environment) < 2) {
399
+ } else if (getLevel(inner, scope, environment) < ACTION_LEVEL) {
396
400
  description.invariants.push(createAction(configName, inner));
397
401
  } else {
398
402
  description.impliedTemporals.push(createAction(configName, expression));
@@ -400,8 +404,9 @@ const describeProperty = (
400
404
  return;
401
405
  }
402
406
  const level = getLevel(expression, scope, environment);
403
- if (level <= 1) description.impliedInits.push(createAction(configName, expression));
404
- else if (level === TEMPORAL_LEVEL) {
407
+ if (level <= VARIABLE_LEVEL) {
408
+ description.impliedInits.push(createAction(configName, expression));
409
+ } else if (level === TEMPORAL_LEVEL) {
405
410
  description.impliedTemporals.push(createAction(configName, expression));
406
411
  }
407
412
  };
@@ -413,13 +418,7 @@ const getOperatorDefinition = (name: string, environment: Environment) => {
413
418
  : undefined;
414
419
  };
415
420
 
416
- const describeDefinition = (definition: Definition) =>
417
- createRecord([
418
- ["name", definition.name],
419
- ["location", toLocationValue(definition.location)],
420
- ]);
421
-
422
- const describe = (
421
+ const getSpecDescription = (
423
422
  config: ModelConfig,
424
423
  environment: Environment,
425
424
  instanceActions: Map<string, InstanceAction>,
@@ -478,14 +477,14 @@ export const getInitActions = (
478
477
  config: ModelConfig,
479
478
  environment: Environment,
480
479
  instanceActions: Map<string, InstanceAction>,
481
- ) => describe(config, environment, instanceActions).inits;
480
+ ) => getSpecDescription(config, environment, instanceActions).inits;
482
481
 
483
482
  // TLC's split of the next-state relation into the actions it names in a behavior.
484
483
  export const getNextActions = (
485
484
  config: ModelConfig,
486
485
  environment: Environment,
487
486
  instanceActions: Map<string, InstanceAction>,
488
- ) => describe(config, environment, instanceActions).actions;
487
+ ) => getSpecDescription(config, environment, instanceActions).actions;
489
488
 
490
489
  const formatParameters = (action: SpecAction) =>
491
490
  action.parameters.length === 0
@@ -506,13 +505,20 @@ export const getSpecificationValue = (
506
505
  variableLocations: SourceLocation[],
507
506
  instanceActions: Map<string, InstanceAction>,
508
507
  ): Value => {
509
- const description = describe(config, environment, instanceActions);
508
+ const description = getSpecDescription(config, environment, instanceActions);
510
509
  const toSet = (actions: SpecAction[]) => createSet(actions.map(toActionValue));
511
510
  const toDefinitionSet = (names: string[]) =>
512
511
  createSet(
513
512
  names.flatMap((name) => {
514
513
  const definition = getOperatorDefinition(name, environment);
515
- return definition ? [describeDefinition(definition)] : [];
514
+ return definition
515
+ ? [
516
+ createRecord([
517
+ ["name", definition.name],
518
+ ["location", toLocationValue(definition.location)],
519
+ ]),
520
+ ]
521
+ : [];
516
522
  }),
517
523
  );
518
524
  return createRecord([
@@ -1,11 +1,14 @@
1
+ import type { SourceRange } from "./ast";
1
2
  import type { OperatorLevels } from "./levels";
2
3
 
4
+ // SANY's view of the dummy definitions in tla2sany/StandardModules of the operators that tla-ts
5
+ // implements natively: the levels it computes for them, and where it reports them when a spec
6
+ // defines one again.
7
+
3
8
  type Signature =
4
9
  | [string, number, number[], number[], number[]]
5
10
  | [string, number, number[], number[], number[], number[][], string[]];
6
11
 
7
- // The levels SANY computes for the dummy definitions in tla2sany/StandardModules of the operators
8
- // that tla-ts implements natively.
9
12
  const SIGNATURES: Signature[] = [
10
13
  ["Nat", 0, [], [], []],
11
14
  ["+", 0, [0, 0], [2, 2], [1, 1]],
@@ -103,3 +106,116 @@ export const STANDARD_LEVELS = new Map(
103
106
  },
104
107
  ]),
105
108
  );
109
+
110
+ const RANGES: Record<string, Record<string, [number, number, number, number]>> = {
111
+ Naturals: {
112
+ Nat: [14, 1, 14, 16],
113
+ "+": [15, 1, 15, 19],
114
+ "-": [17, 1, 17, 33],
115
+ "*": [18, 1, 18, 17],
116
+ "^": [19, 1, 19, 19],
117
+ "<": [20, 1, 20, 19],
118
+ ">": [21, 1, 21, 19],
119
+ "<=": [22, 1, 22, 19],
120
+ ">=": [23, 1, 23, 19],
121
+ "%": [33, 1, 33, 20],
122
+ "\\div": [34, 1, 34, 20],
123
+ "..": [35, 1, 35, 20],
124
+ },
125
+ Integers: {
126
+ Int: [18, 1, 18, 12],
127
+ "-.": [22, 1, 22, 13],
128
+ },
129
+ Sequences: {
130
+ Seq: [20, 1, 20, 41],
131
+ Len: [25, 1, 25, 44],
132
+ "\\o": [30, 1, 31, 76],
133
+ Append: [36, 1, 36, 26],
134
+ Head: [41, 1, 41, 15],
135
+ Tail: [42, 1, 42, 61],
136
+ SubSeq: [48, 1, 48, 50],
137
+ SelectSeq: [53, 1, 65, 14],
138
+ },
139
+ FiniteSets: {
140
+ IsFiniteSet: [14, 1, 19, 68],
141
+ Cardinality: [21, 1, 27, 11],
142
+ },
143
+ Bags: {
144
+ IsABag: [20, 1, 24, 41],
145
+ BagToSet: [26, 1, 26, 23],
146
+ SetToBag: [31, 1, 31, 30],
147
+ BagIn: [36, 1, 36, 31],
148
+ EmptyBag: [41, 1, 41, 24],
149
+ "\\oplus": [43, 1, 49, 46],
150
+ "\\ominus": [51, 1, 60, 50],
151
+ BagUnion: [74, 1, 79, 58],
152
+ "\\sqsubseteq": [81, 1, 87, 42],
153
+ SubBag: [89, 1, 110, 11],
154
+ BagOfAll: [122, 1, 130, 66],
155
+ BagCardinality: [132, 1, 138, 8],
156
+ CopiesIn: [140, 1, 145, 33],
157
+ },
158
+ TLC: {
159
+ Print: [17, 1, 17, 22],
160
+ PrintT: [18, 1, 18, 19],
161
+ Assert: [24, 1, 25, 54],
162
+ JavaTime: [26, 1, 26, 32],
163
+ TLCGet: [75, 1, 75, 28],
164
+ TLCSet: [76, 1, 76, 20],
165
+ ":>": [78, 1, 78, 27],
166
+ "@@": [79, 1, 80, 50],
167
+ Permutations: [81, 1, 82, 54],
168
+ SortSeq: [88, 1, 92, 40],
169
+ RandomElement: [110, 1, 110, 41],
170
+ Any: [119, 1, 119, 22],
171
+ ToString: [121, 1, 121, 58],
172
+ TLCEval: [145, 1, 145, 15],
173
+ },
174
+ TLCExt: {
175
+ AssertEq: [14, 1, 20, 14],
176
+ AssertError: [23, 1, 26, 72],
177
+ TLCGetOrDefault: [30, 1, 31, 17],
178
+ TLCGetAndSet: [33, 1, 35, 57],
179
+ Trace: [41, 1, 57, 6],
180
+ CounterExample: [61, 1, 75, 8],
181
+ ToTrace: [77, 1, 87, 12],
182
+ TLCModelValue: [91, 1, 120, 29],
183
+ TLCDefer: [122, 1, 134, 6],
184
+ TLCNoOp: [138, 1, 145, 5],
185
+ PickSuccessor: [148, 1, 162, 37],
186
+ TLCCache: [166, 1, 173, 12],
187
+ TLCFP: [175, 1, 181, 24],
188
+ TLCEvalDefinition: [185, 1, 190, 6],
189
+ },
190
+ Randomization: {
191
+ RandomSubset: [30, 1, 30, 64],
192
+ RandomSetOfSubsets: [48, 1, 49, 67],
193
+ TestRandomSetOfSubsets: [61, 1, 62, 71],
194
+ },
195
+ Json: {
196
+ ToJson: [46, 1, 55, 37],
197
+ ToJsonArray: [57, 1, 64, 42],
198
+ ToJsonObject: [66, 1, 73, 43],
199
+ JsonSerialize: [75, 1, 80, 6],
200
+ JsonDeserialize: [82, 1, 87, 19],
201
+ ndJsonSerialize: [89, 1, 95, 6],
202
+ ndJsonDeserialize: [97, 1, 103, 19],
203
+ },
204
+ _Possible: {
205
+ _Track: [10, 1, 17, 38],
206
+ _Counts: [24, 1, 30, 14],
207
+ _CheckName: [32, 1, 35, 35],
208
+ _PrintCounts: [37, 1, 37, 31],
209
+ },
210
+ };
211
+
212
+ export const getStandardRange = (module: string, name: string): SourceRange | undefined => {
213
+ const range = RANGES[module]?.[name];
214
+ return (
215
+ range && {
216
+ module,
217
+ start: { line: range[0], column: range[1] },
218
+ end: { line: range[2], column: range[3] },
219
+ }
220
+ );
221
+ };
@@ -1,5 +1,6 @@
1
1
  import { TlaEvaluationError, TlaModuleError } from "./errors";
2
2
  import {
3
+ createModuleArgumentError,
3
4
  createOverflowError,
4
5
  defineArithmetic,
5
6
  defineBinary,
@@ -22,18 +23,18 @@ import type { CheckerRuntime } from "./runtime";
22
23
  import { createBagsOperators } from "./bags";
23
24
  import { createJsonOperators, type FileSystem } from "./json";
24
25
  import { createRandomizationOperators } from "./randomization";
25
- import { createPossibleOperators, createTlcExtOperators } from "./tlc-ext";
26
- import { createTlcOperators } from "./tlc-module";
27
- import { TLC_JAVA_METHODS } from "./tlc-modules";
26
+ import { createPossibleOperators, createTlcExtOperators } from "./tlc/tlcext-operators";
27
+ import { createTlcOperators } from "./tlc/tlc-operators";
28
+ import { TLC_JAVA_METHODS } from "./tlc/jar-data";
28
29
  import {
29
30
  createSet,
30
31
  describeKind,
31
32
  createTuple,
32
- differenceSorted,
33
+ getSortedDifference,
33
34
  formatValue,
34
35
  getCardinality,
35
36
  getDomain,
36
- intersectSorted,
37
+ getSortedIntersection,
37
38
  isElementOf,
38
39
  getSequenceElements,
39
40
  isEmptySet,
@@ -45,7 +46,7 @@ import {
45
46
  markStreamedSet,
46
47
  isSetValue,
47
48
  toFiniteSet,
48
- unionSorted,
49
+ getSortedUnion,
49
50
  isEqualLikeTlc,
50
51
  createEnumeratedSet,
51
52
  EMPTY_SET,
@@ -57,7 +58,7 @@ import {
57
58
  type Value,
58
59
  rankString,
59
60
  } from "./values";
60
- import type { TlcVersion } from "./tlc-version";
61
+ import type { TlcVersion } from "./tlc/version";
61
62
 
62
63
  interface StandardModule {
63
64
  extends: string[];
@@ -71,10 +72,10 @@ const BOOLEAN_SET = createSet([false, true]);
71
72
 
72
73
  // Merging the sets pairwise in a balanced tree compares each element about log2 of their count
73
74
  // times.
74
- const unionInTree = (sets: SetValue[], start: number, end: number): SetValue => {
75
+ const getBalancedUnion = (sets: SetValue[], start: number, end: number): SetValue => {
75
76
  if (end - start === 1) return sets[start];
76
77
  const middle = (start + end) >> 1;
77
- return unionSorted(unionInTree(sets, start, middle), unionInTree(sets, middle, end));
78
+ return getSortedUnion(getBalancedUnion(sets, start, middle), getBalancedUnion(sets, middle, end));
78
79
  };
79
80
 
80
81
  const SET_OPERATORS: SetOperationValue["operator"][] = ["\\cup", "\\cap", "\\"];
@@ -83,9 +84,6 @@ type ReducibleSet = SetValue | MixedSetValue | IntervalValue;
83
84
 
84
85
  const isMixedSet = (value: Value) => typeof value === "object" && value.kind === "MixedSet";
85
86
 
86
- const getReducibleElements = (set: ReducibleSet) =>
87
- set.kind === "Interval" ? toFiniteSet(set).elements : set.elements;
88
-
89
87
  // TLC combines a set enumeration or an interval with another set element by element, testing each
90
88
  // element for membership in the other set.
91
89
  const combineReducible = (
@@ -93,7 +91,7 @@ const combineReducible = (
93
91
  set: ReducibleSet,
94
92
  other: Value,
95
93
  ): Value => {
96
- const elements = getReducibleElements(set);
94
+ const elements = set.kind === "Interval" ? toFiniteSet(set).elements : set.elements;
97
95
  if (operator !== "\\cup") {
98
96
  const isKept = operator === "\\cap";
99
97
  return createEnumeratedSet(
@@ -156,10 +154,10 @@ export const CORE_OPERATORS: Builtin[] = [
156
154
  if (operator === "\\cup" && isEmptySet(left)) return right;
157
155
  const merge =
158
156
  operator === "\\cup"
159
- ? unionSorted
157
+ ? getSortedUnion
160
158
  : operator === "\\cap"
161
- ? intersectSorted
162
- : differenceSorted;
159
+ ? getSortedIntersection
160
+ : getSortedDifference;
163
161
  // The merge compares the elements, which TLC tests for membership one by one instead.
164
162
  return computeLikeTlcOnFailure(
165
163
  (finiteLeft, finiteRight) => merge(toFiniteSet(finiteLeft), toFiniteSet(finiteRight)),
@@ -191,7 +189,7 @@ export const CORE_OPERATORS: Builtin[] = [
191
189
  );
192
190
  return createEnumeratedSet(union.elements);
193
191
  }
194
- return sets.length === 0 ? EMPTY_SET : unionInTree(sets.map(toFiniteSet), 0, sets.length);
192
+ return sets.length === 0 ? EMPTY_SET : getBalancedUnion(sets.map(toFiniteSet), 0, sets.length);
195
193
  }),
196
194
  defineOperator("DOMAIN", 1, (args) => {
197
195
  const value = getValue(args, 0, "DOMAIN");
@@ -383,9 +381,7 @@ const createSequencesOperators = (version: TlcVersion) =>
383
381
  (element) => {
384
382
  const result = test.call([element]);
385
383
  if (typeof result !== "boolean") {
386
- throw new TlaModuleError(
387
- `The second argument of SelectSeq should be a operator, but instead it is:\n${formatValue(result)}`,
388
- );
384
+ throw createModuleArgumentError("second", "SelectSeq", "operator", result);
389
385
  }
390
386
  return result;
391
387
  },
@@ -1,6 +1,6 @@
1
1
  // A port of TLC's -dump writers, tlc2.util.StateWriter and tlc2.util.DotStateWriter.
2
2
 
3
- import type { TlcVersion } from "./tlc-version";
3
+ import type { TlcVersion } from "./tlc/version";
4
4
 
5
5
  export interface StateDump {
6
6
  path: string;
@@ -18,7 +18,7 @@ export interface GraphState {
18
18
  getText: () => string;
19
19
  }
20
20
 
21
- export interface GraphAction {
21
+ interface GraphAction {
22
22
  name: string;
23
23
  signature: string;
24
24
  }
@@ -68,9 +68,10 @@ const getStringHash = (text: string) =>
68
68
  0,
69
69
  );
70
70
 
71
- const escape = (text: string) => text.replaceAll("\\", "\\\\").replaceAll('"', '\\"').trim();
71
+ const escapeDotString = (text: string) =>
72
+ text.replaceAll("\\", "\\\\").replaceAll('"', '\\"').trim();
72
73
 
73
- const toDot = (text: string) => escape(text).replaceAll("\n", "\\n");
74
+ const toDotLabel = (text: string) => escapeDotString(text).replaceAll("\n", "\\n");
74
75
 
75
76
  const createPlainWriter = (dump: StateDump, writeFile: WriteFile): StateWriter => {
76
77
  const states: string[] = [];
@@ -144,21 +145,21 @@ const createDotWriter = (
144
145
  };
145
146
  return {
146
147
  writeInitialState: (state) => {
147
- lines.push(`${state.fingerprint} [label="${toDot(state.getLabel())}",style = filled]\n`);
148
+ lines.push(`${state.fingerprint} [label="${toDotLabel(state.getLabel())}",style = filled]\n`);
148
149
  addRank(state);
149
150
  writeSnapshot();
150
151
  },
151
152
  writeSuccessor: (state, successor, isSeen, action) => {
152
153
  const color = dump.colorize ? String(getColor(action)) : "black";
153
154
  const label =
154
- dump.actionLabels && action ? escape(is174 ? action.name : action.signature) : "";
155
+ dump.actionLabels && action ? escapeDotString(is174 ? action.name : action.signature) : "";
155
156
  lines.push(
156
157
  `${state.fingerprint} -> ${successor.fingerprint} [label="${label}",color="${color}",fontcolor="${color}"];\n`,
157
158
  );
158
159
  if (!isSeen) {
159
- const tooltip = is174 ? "" : `,tooltip="${toDot(successor.getText())}"`;
160
+ const tooltip = is174 ? "" : `,tooltip="${toDotLabel(successor.getText())}"`;
160
161
  lines.push(
161
- `${successor.fingerprint} [label="${toDot(successor.getLabel())}"${tooltip}];\n`,
162
+ `${successor.fingerprint} [label="${toDotLabel(successor.getLabel())}"${tooltip}];\n`,
162
163
  );
163
164
  }
164
165
  addRank(state);
@@ -5,10 +5,10 @@ import {
5
5
  analyzeAssumeProve,
6
6
  createLevelAnalyzer,
7
7
  getArgumentKey,
8
- MAX_LEVEL,
9
8
  parseArgumentParamKey,
10
9
  putArgConstraint,
11
10
  putConstraint,
11
+ TEMPORAL_LEVEL,
12
12
  type OperatorLevels,
13
13
  type Scope,
14
14
  } from "./levels";
@@ -47,7 +47,7 @@ interface Substituted {
47
47
  }
48
48
 
49
49
  const getMaxLevel = (operator: OperatorLevels, index: number) =>
50
- operator.maxLevels[index] ?? MAX_LEVEL;
50
+ operator.maxLevels[index] ?? TEMPORAL_LEVEL;
51
51
 
52
52
  export const createInstanceChecker = (getModule: (name: string) => ModuleContext) => {
53
53
  const analyzers = new Map<string, ReturnType<typeof createLevelAnalyzer>>();
package/src/successors.ts CHANGED
@@ -38,7 +38,7 @@ import {
38
38
  type State,
39
39
  } from "./evaluate";
40
40
  import { mapChildren } from "./instances";
41
- import { isAssignedShortcut, LITERAL_KINDS, replayEnabled } from "./tlc-replay";
41
+ import { isAssignedShortcut, LITERAL_KINDS, replayEnabled } from "./tlc/replay";
42
42
  import {
43
43
  formatValue,
44
44
  getStreamedElements,
@@ -131,8 +131,8 @@ const getIfConditionMessage = (run: Run, value: Value, expression: Expression) =
131
131
  return `In computing ${getComputation(run)}, a non-boolean expression (${kind}) was used as the condition of an IF.${run.isInit ? "\n" : ""}${range}`;
132
132
  };
133
133
 
134
- const holds = (run: Run, expression: Expression, context: Context, isWalked = true) =>
135
- holdsValue(run, expression, evaluate(expression, context), isWalked);
134
+ const holds = (run: Run, expression: Expression, context: Context) =>
135
+ holdsValue(run, expression, evaluate(expression, context));
136
136
 
137
137
  const holdsValue = (run: Run, expression: Expression, value: Value, isWalked = true) => {
138
138
  if (typeof value === "boolean") return value;
@@ -758,14 +758,14 @@ const compileAction = (
758
758
  environment: Environment,
759
759
  isInit: boolean,
760
760
  ): Runner => {
761
- const child = (node: Expression) => getRunner(node, environment, isInit);
761
+ const getChildRunner = (node: Expression) => getRunner(node, environment, isInit);
762
762
  switch (expression.kind) {
763
763
  case "And":
764
764
  return compileConjunction(expression.operands, environment, isInit);
765
765
  case "Or":
766
766
  return compileDisjunction(expression.operands, environment, isInit);
767
767
  case "Exists": {
768
- const body = child(expression.body);
768
+ const body = getChildRunner(expression.body);
769
769
  const bound = expression.bounds[0];
770
770
  if (expression.bounds.length === 1 && bound.pattern.kind === "Name") {
771
771
  const name = bound.pattern.name;
@@ -826,7 +826,7 @@ const compileAction = (
826
826
  };
827
827
  }
828
828
  case "Forall": {
829
- const body = child(expression.body);
829
+ const body = getChildRunner(expression.body);
830
830
  const readLocals =
831
831
  !isInit &&
832
832
  getReadVariables(expression, environment) !== undefined &&
@@ -872,8 +872,8 @@ const compileAction = (
872
872
  };
873
873
  }
874
874
  case "If": {
875
- const consequent = child(expression.consequent);
876
- const alternative = child(expression.alternative);
875
+ const consequent = getChildRunner(expression.consequent);
876
+ const alternative = getChildRunner(expression.alternative);
877
877
  return (run, scope, partial, action, isFixed, onComplete) => {
878
878
  const condition = evaluate(expression.condition, getContext(run, scope, partial));
879
879
  if (typeof condition !== "boolean") {
@@ -887,9 +887,9 @@ const compileAction = (
887
887
  const arms = expression.arms.map((arm) => ({
888
888
  condition: arm.condition,
889
889
  source: arm.body,
890
- body: child(arm.body),
890
+ body: getChildRunner(arm.body),
891
891
  }));
892
- const other = expression.other ? child(expression.other) : undefined;
892
+ const other = expression.other ? getChildRunner(expression.other) : undefined;
893
893
  return (run, scope, partial, action, isFixed, onComplete) => {
894
894
  const context = getContext(run, scope, partial);
895
895
  const arm = arms.find((candidate) => {
@@ -912,7 +912,7 @@ const compileAction = (
912
912
  };
913
913
  }
914
914
  case "Let": {
915
- const body = child(expression.body);
915
+ const body = getChildRunner(expression.body);
916
916
  const reevaluated = getReevaluatedDefinitions(expression.definitions, environment);
917
917
  return (run, scope, partial, action, isFixed, onComplete) =>
918
918
  body(
@@ -934,7 +934,7 @@ const compileAction = (
934
934
  }
935
935
  return compileUnchanged(expression.expression, environment);
936
936
  case "AngleAction": {
937
- const body = child(expression.action);
937
+ const body = getChildRunner(expression.action);
938
938
  const unchanged = getUnchangedWrapper(expression.subscript);
939
939
  const isUnchanged = (run: Run, scope: Scope | undefined, nextPartial: State) => {
940
940
  try {
@@ -951,13 +951,13 @@ const compileAction = (
951
951
  });
952
952
  }
953
953
  case "BoxAction":
954
- return child({
954
+ return getChildRunner({
955
955
  kind: "Or",
956
956
  operands: [expression.action, getUnchangedWrapper(expression.subscript)],
957
957
  location: expression.location,
958
958
  });
959
959
  case "Label":
960
- return child(expression.body);
960
+ return getChildRunner(expression.body);
961
961
  case "Identifier":
962
962
  return compileIdentifier(expression, environment, isInit);
963
963
  case "FunctionApplication":
@@ -975,7 +975,7 @@ const compileAction = (
975
975
  }
976
976
  }
977
977
  if (expression.operator === "=>") {
978
- const right = child(args[1]);
978
+ const right = getChildRunner(args[1]);
979
979
  return (run, scope, partial, action, isFixed, onComplete) => {
980
980
  const condition = evaluate(args[0], getContext(run, scope, partial));
981
981
  const isTrue =
@@ -1006,9 +1006,6 @@ const getEmptyState = (environment: Environment) => {
1006
1006
  return state;
1007
1007
  };
1008
1008
 
1009
- const getMissingVariables = (partial: State, environment: Environment) =>
1010
- environment.variables.filter((_, index) => partial[index] === undefined);
1011
-
1012
1009
  const isComplete = (partial: State): partial is Value[] => {
1013
1010
  for (let index = 0; index < partial.length; index++) {
1014
1011
  if (partial[index] === undefined) return false;
@@ -1120,7 +1117,7 @@ export const forEachSuccessor = (
1120
1117
  (partial, action) => {
1121
1118
  if (run.isStopped) return;
1122
1119
  if (!isComplete(partial)) {
1123
- const missing = getMissingVariables(partial, environment);
1120
+ const missing = environment.variables.filter((_, index) => partial[index] === undefined);
1124
1121
  throw new TlaIncompleteSuccessorError(
1125
1122
  `Successor state is not completely specified by action ${action ?? "Next"}. The following variables are not assigned: ${missing.join(", ")}`,
1126
1123
  partial,
package/src/symmetry.ts CHANGED
@@ -2,7 +2,7 @@ import type { Expression } from "./ast";
2
2
  import type { Substitution } from "./config";
3
3
  import { TlaConfigError, TlaEvaluationError, UNEXPECTED_EXCEPTION } from "./errors";
4
4
  import { EXIT_STATUS, setExitCode } from "./exit-codes";
5
- import { MESSAGE_CODE } from "./tlc-messages";
5
+ import { MESSAGE_CODE } from "./tlc/messages";
6
6
  import { evaluate, type Environment } from "./evaluate";
7
7
  import {
8
8
  compareValues,
package/src/tableau.ts CHANGED
@@ -1,7 +1,7 @@
1
1
  import type { Expression } from "./ast";
2
2
  import { TlaEvaluationError } from "./errors";
3
3
  import type { Scope } from "./evaluate";
4
- import { ACTION_LEVEL, TEMPORAL_LEVEL } from "./levels";
4
+ import { ACTION_LEVEL, CONSTANT_LEVEL, TEMPORAL_LEVEL, VARIABLE_LEVEL } from "./levels";
5
5
 
6
6
  interface LiveBoolean {
7
7
  kind: "Boolean";
@@ -84,7 +84,6 @@ interface Triple {
84
84
  second: LiveExpression;
85
85
  }
86
86
 
87
- const STATE_LEVEL = 1;
88
87
  const MAXIMUM_DISJUNCTS = 2147483647;
89
88
 
90
89
  const TRUE: LiveBoolean = { kind: "Boolean", value: true };
@@ -122,10 +121,10 @@ export const createJunction = (
122
121
  export const getLiveLevel = (expression: LiveExpression): number => {
123
122
  switch (expression.kind) {
124
123
  case "Boolean":
125
- return 0;
124
+ return CONSTANT_LEVEL;
126
125
  case "State":
127
126
  case "Enabled":
128
- return STATE_LEVEL;
127
+ return VARIABLE_LEVEL;
129
128
  case "Action":
130
129
  case "Next":
131
130
  return ACTION_LEVEL;
@@ -138,7 +137,7 @@ export const getLiveLevel = (expression: LiveExpression): number => {
138
137
  case "Or":
139
138
  return expression.operands.reduce(
140
139
  (level, operand) => Math.max(level, getLiveLevel(operand)),
141
- 0,
140
+ CONSTANT_LEVEL,
142
141
  );
143
142
  }
144
143
  };
@@ -530,7 +529,7 @@ const createTableauNode = (particle: LiveExpression[]): TableauNode => ({
530
529
  successors: [],
531
530
  // Constant terms count, as after TLC 1.7.4. That version checks only state atoms, so a node with a
532
531
  // FALSE term stays in the graph and yields a bogus counterexample (tlaplus#604).
533
- statePredicates: particle.filter((term) => getLiveLevel(term) <= STATE_LEVEL),
532
+ statePredicates: particle.filter((term) => getLiveLevel(term) <= VARIABLE_LEVEL),
534
533
  });
535
534
 
536
535
  const createTableau = (formula: LiveExpression) => {
@@ -573,7 +572,7 @@ const classify = (expression: LiveExpression, classification: Classification) =>
573
572
  const infinitelyOften = getInfinitelyOftenBody(expression);
574
573
  if (infinitelyOften) {
575
574
  const level = getLiveLevel(infinitelyOften);
576
- if (level <= STATE_LEVEL) {
575
+ if (level <= VARIABLE_LEVEL) {
577
576
  classification.infinitelyOftenStates.push(infinitelyOften);
578
577
  return;
579
578
  }