tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.28c823e4b

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (390) hide show
  1. package/README.md +7 -0
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +3 -3
  4. package/dist/deciders.cjs +28 -28
  5. package/dist/deciders.js +52 -52
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +105 -10
  8. package/dist/index.d.ts +105 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +116 -36
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +4 -23
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +40 -78
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check.ts +564 -366
  30. package/src/cli/options.ts +10 -5
  31. package/src/cli/run.ts +0 -2
  32. package/src/cli/runtime-invariants.ts +136 -0
  33. package/src/cli/shared.ts +18 -11
  34. package/src/cli/tlapm.ts +0 -12
  35. package/src/cli/tlc-arguments.ts +640 -0
  36. package/src/cli/tlc-usage.ts +361 -0
  37. package/src/cli/tlc.ts +525 -216
  38. package/src/cli/typescript.ts +0 -3
  39. package/src/cli/xml-exporter.ts +4 -16
  40. package/src/cli.ts +0 -1
  41. package/src/codegen.ts +191 -64
  42. package/src/config.ts +140 -109
  43. package/src/coverage.ts +837 -0
  44. package/src/dependencies.ts +6 -40
  45. package/src/dfid.ts +618 -0
  46. package/src/environment.ts +237 -119
  47. package/src/errors.ts +56 -56
  48. package/src/evaluate.ts +543 -341
  49. package/src/exit-codes.ts +37 -3
  50. package/src/fingerprints.ts +10 -10
  51. package/src/index.ts +3 -0
  52. package/src/instances.ts +38 -31
  53. package/src/java-overrides.ts +4 -19
  54. package/src/json-reader.ts +455 -0
  55. package/src/json.ts +255 -139
  56. package/src/levels.ts +8 -17
  57. package/src/lexer.ts +80 -100
  58. package/src/liveness-checker.ts +77 -117
  59. package/src/liveness.ts +106 -62
  60. package/src/obligations/action.ts +4 -28
  61. package/src/obligations/anonymize.ts +84 -80
  62. package/src/obligations/equality.ts +1 -1
  63. package/src/obligations/expression.ts +2 -19
  64. package/src/obligations/format.ts +1 -9
  65. package/src/obligations/generate.ts +1 -11
  66. package/src/obligations/index.ts +0 -11
  67. package/src/obligations/levels.ts +4 -8
  68. package/src/obligations/module.ts +1 -15
  69. package/src/obligations/normalize.ts +5 -24
  70. package/src/obligations/operators.ts +1 -2
  71. package/src/obligations/pragma.ts +1 -10
  72. package/src/obligations/printer.ts +47 -46
  73. package/src/obligations/proof.ts +1 -5
  74. package/src/obligations/regroup.ts +1 -4
  75. package/src/obligations/simplify.ts +3 -14
  76. package/src/obligations/source.ts +1 -21
  77. package/src/obligations/subexpression.ts +5 -11
  78. package/src/obligations/substitution.ts +1 -3
  79. package/src/obligations/temporal.ts +8 -14
  80. package/src/obligations/tuples.ts +3 -9
  81. package/src/parallel-worker.ts +24 -33
  82. package/src/parallel.ts +48 -40
  83. package/src/parser.ts +565 -282
  84. package/src/pcal/ast.ts +53 -86
  85. package/src/pcal/parse.ts +144 -219
  86. package/src/pcal/tokenize.ts +91 -131
  87. package/src/pcal/translate.ts +83 -130
  88. package/src/pcal/validate.ts +48 -68
  89. package/src/pretty-print.ts +7 -8
  90. package/src/prover/decide-pool.ts +5 -10
  91. package/src/prover/deciders.ts +0 -4
  92. package/src/prover/first-order.ts +0 -11
  93. package/src/prover/isabelle/decide.ts +0 -6
  94. package/src/prover/isabelle/encode.ts +11 -23
  95. package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
  96. package/src/prover/isabelle/isar/method.ts +25 -38
  97. package/src/prover/isabelle/isar/proof.ts +1 -10
  98. package/src/prover/isabelle/isar/statement.ts +1 -6
  99. package/src/prover/isabelle/isar/theory.ts +15 -26
  100. package/src/prover/isabelle/isar/type-check.ts +11 -25
  101. package/src/prover/isabelle/provers/blast/blast.ts +10 -41
  102. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  103. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  104. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  105. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  106. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  107. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  108. package/src/prover/isabelle/provers/classical.ts +14 -42
  109. package/src/prover/isabelle/provers/hypsubst.ts +11 -25
  110. package/src/prover/isabelle/pure/bicompose.ts +16 -13
  111. package/src/prover/isabelle/pure/consts.ts +1 -7
  112. package/src/prover/isabelle/pure/conv.ts +1 -9
  113. package/src/prover/isabelle/pure/drule.ts +24 -40
  114. package/src/prover/isabelle/pure/envir.ts +3 -52
  115. package/src/prover/isabelle/pure/goal.ts +1 -7
  116. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  117. package/src/prover/isabelle/pure/list.ts +0 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -14
  119. package/src/prover/isabelle/pure/name.ts +2 -9
  120. package/src/prover/isabelle/pure/net.ts +3 -59
  121. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  122. package/src/prover/isabelle/pure/pattern.ts +2 -19
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
  124. package/src/prover/isabelle/pure/rewriter.ts +26 -58
  125. package/src/prover/isabelle/pure/search.ts +3 -10
  126. package/src/prover/isabelle/pure/seq.ts +1 -10
  127. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  128. package/src/prover/isabelle/pure/table.ts +1 -31
  129. package/src/prover/isabelle/pure/tactic.ts +12 -22
  130. package/src/prover/isabelle/pure/tactical.ts +6 -12
  131. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  132. package/src/prover/isabelle/pure/term.ts +2 -43
  133. package/src/prover/isabelle/pure/thm.ts +13 -36
  134. package/src/prover/isabelle/pure/type.ts +2 -15
  135. package/src/prover/isabelle/pure/unify.ts +20 -30
  136. package/src/prover/isabelle/pure/variable.ts +3 -7
  137. package/src/prover/isabelle/tla/classical-setup.ts +9 -19
  138. package/src/prover/isabelle/tla/context.ts +8 -16
  139. package/src/prover/isabelle/tla/logic.ts +4 -11
  140. package/src/prover/isabelle/tla/simpdata.ts +46 -34
  141. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  142. package/src/prover/ocaml.ts +0 -6
  143. package/src/prover/prep/action.ts +4 -36
  144. package/src/prover/prep/enabled-axioms.ts +12 -19
  145. package/src/prover/prep/fingerprint.ts +0 -16
  146. package/src/prover/prep/level-comparison.ts +8 -12
  147. package/src/prover/prep/md5.ts +0 -2
  148. package/src/prover/prep/methods.ts +9 -36
  149. package/src/prover/prep/normalize.ts +4 -28
  150. package/src/prover/prove-worker.ts +0 -2
  151. package/src/prover/prove.ts +0 -36
  152. package/src/prover/ptl/decide.ts +7 -12
  153. package/src/prover/ptl/encode.ts +14 -36
  154. package/src/prover/ptl/sat.ts +24 -32
  155. package/src/prover/ptl/tableau.ts +12 -26
  156. package/src/prover/smt/axioms.ts +0 -7
  157. package/src/prover/smt/context.ts +19 -26
  158. package/src/prover/smt/data.ts +51 -54
  159. package/src/prover/smt/encode.ts +14 -35
  160. package/src/prover/smt/extensionality.ts +0 -10
  161. package/src/prover/smt/flatten.ts +3 -22
  162. package/src/prover/smt/format.ts +5 -10
  163. package/src/prover/smt/instances.ts +0 -10
  164. package/src/prover/smt/rewrite.ts +66 -101
  165. package/src/prover/smt/solver/act-cache.ts +0 -15
  166. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  167. package/src/prover/smt/solver/array.ts +1 -3
  168. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  169. package/src/prover/smt/solver/ast-lt.ts +1 -11
  170. package/src/prover/smt/solver/ast-util.ts +1 -6
  171. package/src/prover/smt/solver/ast.ts +1 -143
  172. package/src/prover/smt/solver/auf-solver.ts +6 -39
  173. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  174. package/src/prover/smt/solver/cg-table.ts +1 -18
  175. package/src/prover/smt/solver/clause.ts +1 -27
  176. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  177. package/src/prover/smt/solver/context.ts +4 -61
  178. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  179. package/src/prover/smt/solver/der.ts +2 -21
  180. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  181. package/src/prover/smt/solver/e-matching.ts +3 -34
  182. package/src/prover/smt/solver/enode.ts +1 -21
  183. package/src/prover/smt/solver/expr-ref.ts +1 -5
  184. package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
  185. package/src/prover/smt/solver/fingerprints.ts +1 -12
  186. package/src/prover/smt/solver/flat-literals.ts +1 -9
  187. package/src/prover/smt/solver/goal.ts +2 -14
  188. package/src/prover/smt/solver/hash.ts +0 -8
  189. package/src/prover/smt/solver/hashtable.ts +1 -12
  190. package/src/prover/smt/solver/internalizer.ts +6 -98
  191. package/src/prover/smt/solver/lbool.ts +1 -2
  192. package/src/prover/smt/solver/literal.ts +0 -3
  193. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  194. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  195. package/src/prover/smt/solver/lp/containers.ts +12 -30
  196. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  197. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  198. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  199. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  200. package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
  201. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  202. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  203. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  204. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  205. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  206. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  207. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  208. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  209. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  210. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  211. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  212. package/src/prover/smt/solver/lp/nex.ts +1 -6
  213. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  214. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  215. package/src/prover/smt/solver/lp/nla-core.ts +35 -130
  216. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  217. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  218. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  220. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  221. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  222. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  223. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  224. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  225. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  226. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  227. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  228. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  229. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  230. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  231. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  232. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  233. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  234. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  235. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  236. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  237. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  238. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  239. package/src/prover/smt/solver/mam-compiler.ts +14 -56
  240. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  241. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  242. package/src/prover/smt/solver/model-checker.ts +2 -36
  243. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  244. package/src/prover/smt/solver/model-finder.ts +3 -15
  245. package/src/prover/smt/solver/model-generator.ts +1 -12
  246. package/src/prover/smt/solver/model-macro-solver.ts +12 -69
  247. package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
  248. package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
  249. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  250. package/src/prover/smt/solver/nlsat/explain.ts +3 -47
  251. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  252. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
  253. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  254. package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
  255. package/src/prover/smt/solver/nlsat/solver.ts +7 -67
  256. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  257. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
  258. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  259. package/src/prover/smt/solver/nnf.ts +3 -38
  260. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  261. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  262. package/src/prover/smt/solver/propagate-values.ts +1 -10
  263. package/src/prover/smt/solver/proto-model.ts +3 -48
  264. package/src/prover/smt/solver/pull-quant.ts +1 -12
  265. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  266. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  267. package/src/prover/smt/solver/qe-lite.ts +3 -33
  268. package/src/prover/smt/solver/qi-queue.ts +1 -16
  269. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  270. package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
  271. package/src/prover/smt/solver/quantifier-manager.ts +1 -8
  272. package/src/prover/smt/solver/random-gen.ts +1 -2
  273. package/src/prover/smt/solver/rational.ts +1 -8
  274. package/src/prover/smt/solver/ref-vector.ts +1 -6
  275. package/src/prover/smt/solver/relevancy.ts +2 -15
  276. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  277. package/src/prover/smt/solver/rewriter.ts +3 -85
  278. package/src/prover/smt/solver/rlimit.ts +2 -20
  279. package/src/prover/smt/solver/smtlib-parser.ts +2 -37
  280. package/src/prover/smt/solver/solver.ts +1 -16
  281. package/src/prover/smt/solver/sort.ts +1 -5
  282. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  283. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  284. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
  285. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  286. package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
  287. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  288. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  289. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  290. package/src/prover/smt/solver/theory-lra.ts +1 -8
  291. package/src/prover/smt/solver/var-subst.ts +2 -26
  292. package/src/prover/smt/table.ts +0 -8
  293. package/src/prover/tlapm/cache.ts +20 -25
  294. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  295. package/src/prover/tlapm/tlapm.ts +12 -17
  296. package/src/prover/verdict.ts +0 -2
  297. package/src/prover/zenon/check/check.ts +0 -9
  298. package/src/prover/zenon/check/definitions.ts +5 -15
  299. package/src/prover/zenon/check/equality.ts +0 -8
  300. package/src/prover/zenon/check/functions.ts +0 -4
  301. package/src/prover/zenon/check/keys.ts +0 -7
  302. package/src/prover/zenon/check/propositional.ts +0 -3
  303. package/src/prover/zenon/check/records.ts +0 -5
  304. package/src/prover/zenon/check/relations.ts +0 -13
  305. package/src/prover/zenon/check/rewrites.ts +0 -6
  306. package/src/prover/zenon/check/sets.ts +0 -3
  307. package/src/prover/zenon/check/terms.ts +0 -17
  308. package/src/prover/zenon/check/tla.ts +0 -6
  309. package/src/prover/zenon/decide.ts +0 -12
  310. package/src/prover/zenon/encode.ts +1 -8
  311. package/src/prover/zenon/eqrel.ts +0 -13
  312. package/src/prover/zenon/equality-rules.ts +0 -4
  313. package/src/prover/zenon/expr.ts +1 -26
  314. package/src/prover/zenon/index-table.ts +17 -38
  315. package/src/prover/zenon/isar-case.ts +9 -19
  316. package/src/prover/zenon/isar.ts +1 -29
  317. package/src/prover/zenon/limits.ts +0 -4
  318. package/src/prover/zenon/llproof.ts +0 -9
  319. package/src/prover/zenon/mltoll.ts +54 -76
  320. package/src/prover/zenon/node.ts +1 -11
  321. package/src/prover/zenon/ocaml.ts +1 -17
  322. package/src/prover/zenon/parse.ts +2 -7
  323. package/src/prover/zenon/phrase.ts +1 -11
  324. package/src/prover/zenon/proof.ts +0 -9
  325. package/src/prover/zenon/propositional-rules.ts +0 -5
  326. package/src/prover/zenon/rules.ts +2 -6
  327. package/src/prover/zenon/search.ts +1 -17
  328. package/src/prover/zenon/tla/functions.ts +57 -29
  329. package/src/prover/zenon/tla/llproof.ts +63 -70
  330. package/src/prover/zenon/tla/records.ts +56 -27
  331. package/src/prover/zenon/tla/rewrites.ts +12 -19
  332. package/src/prover/zenon/tla/sets.ts +68 -39
  333. package/src/prover/zenon/tla/terms.ts +0 -6
  334. package/src/prover/zenon/tla/tla.ts +59 -58
  335. package/src/randomization.ts +81 -35
  336. package/src/resolve.ts +12 -112
  337. package/src/runtime.ts +22 -22
  338. package/src/sany/builtins.ts +2 -5
  339. package/src/sany/generator.ts +149 -252
  340. package/src/sany/levels.ts +6 -34
  341. package/src/sany/lexer.ts +41 -61
  342. package/src/sany/linter.ts +1 -9
  343. package/src/sany/modules.ts +1 -5
  344. package/src/sany/nodes.ts +0 -31
  345. package/src/sany/parse-error.ts +39 -117
  346. package/src/sany/report.ts +29 -63
  347. package/src/sany/selectors.ts +15 -39
  348. package/src/sany/source.ts +1 -17
  349. package/src/sany/xml.ts +13 -63
  350. package/src/search.ts +495 -155
  351. package/src/simulate.ts +685 -0
  352. package/src/spec-description.ts +176 -69
  353. package/src/standard-definitions.ts +0 -4
  354. package/src/standard-modules.ts +254 -69
  355. package/src/state-graph.ts +50 -24
  356. package/src/subexpressions.ts +69 -52
  357. package/src/substitution-levels.ts +2 -3
  358. package/src/successors.ts +260 -91
  359. package/src/symmetry.ts +33 -25
  360. package/src/tableau.ts +27 -24
  361. package/src/tlc/fingerprint.ts +183 -67
  362. package/src/tlc/jar-data.ts +112 -6
  363. package/src/tlc/messages.ts +110 -44
  364. package/src/tlc/order.ts +37 -60
  365. package/src/tlc/random.ts +33 -45
  366. package/src/tlc/replay.ts +549 -217
  367. package/src/tlc/summary.ts +36 -47
  368. package/src/tlc/tlc-operators.ts +76 -41
  369. package/src/tlc/tlcext-operators.ts +139 -122
  370. package/src/tlc/trace-spec.ts +269 -0
  371. package/src/tlc/value-stream.ts +139 -0
  372. package/src/tlc/version.ts +1 -4
  373. package/src/transfer.ts +22 -25
  374. package/src/typescript/actions.ts +8 -21
  375. package/src/typescript/collections.ts +0 -15
  376. package/src/typescript/compile.ts +0 -5
  377. package/src/typescript/context.ts +0 -12
  378. package/src/typescript/emit.ts +0 -1
  379. package/src/typescript/expressions.ts +0 -12
  380. package/src/typescript/formula.ts +4 -12
  381. package/src/typescript/functions.ts +6 -17
  382. package/src/typescript/model.ts +10 -11
  383. package/src/typescript/names.ts +0 -2
  384. package/src/typescript/program.ts +0 -3
  385. package/src/typescript/properties.ts +6 -8
  386. package/src/typescript/scope.ts +0 -5
  387. package/src/typescript/steps.ts +0 -10
  388. package/src/typescript/types.ts +1 -8
  389. package/src/values.ts +749 -330
  390. package/src/worker.ts +7 -8
@@ -1,7 +1,6 @@
1
1
  import { TlaEvaluationError } from "./errors";
2
2
  import { hasRepeatedEffects, type Environment } from "./evaluate";
3
3
  import {
4
- createTautologyError,
5
4
  evaluateLive,
6
5
  evaluateOnLasso,
7
6
  toLiveExpression,
@@ -28,16 +27,11 @@ export interface LiveSuccessor {
28
27
  export interface Lasso {
29
28
  prefix: number[];
30
29
  cycle: number[];
31
- // Whether the solution that the lasso violates constrains the cycle, as a liveness property does.
32
- // TLC warns that a stuttering counterexample to one may come from a missing fairness constraint.
33
30
  isCycleConstrained: boolean;
34
31
  }
35
32
 
36
33
  export interface LivenessChecker {
37
- // How many solutions of the negated properties TLC checks, which it calls branches.
38
34
  branches: number;
39
- // With a tracing environment, the checks record their call stack as TLC's replay of a failed
40
- // check does.
41
35
  addInitialState: (index: number, state: Value[], tracing?: Environment) => void;
42
36
  addState: (
43
37
  index: number,
@@ -54,32 +48,23 @@ interface SearchGraph {
54
48
  getSuccessors: (index: number, state: Value[]) => LiveSuccessor[];
55
49
  }
56
50
 
57
- // Numbers in a typed array that doubles as it fills, so a graph of millions of nodes takes a few
58
- // bytes for each.
59
51
  interface Pool<Data extends Int32Array | Uint8Array> {
60
52
  data: Data;
61
53
  length: number;
62
54
  create: (length: number) => Data;
63
55
  }
64
56
 
65
- // TLC's behavior graph for one solution: a node per state, or per state and tableau node.
66
57
  interface BehaviorGraph {
67
58
  solution: Solution;
68
- // One id per distinct action check across the solutions.
69
59
  actionIds: Int32Array;
70
60
  nodeStates: number[];
71
61
  nodeTableaux: number[];
72
- // Where a node's edges start in edgeTargets, or UNWRITTEN until TLC writes the node with its
73
- // successors, and how many it has.
74
62
  edgeStarts: number[];
75
63
  edgeCounts: number[];
76
64
  edgeTargets: Pool<Int32Array>;
77
- // The results of the action checks on each edge, and of the state checks on each state, which
78
- // are the same for every node of the state.
79
65
  edgeActions: Pool<Uint8Array>;
80
66
  stateResults: Pool<Uint8Array>;
81
67
  initial: number[];
82
- // The nodes of each state in the order they are recorded, a list through nextSiblings.
83
68
  firstNodes: Pool<Int32Array>;
84
69
  lastNodes: Pool<Int32Array>;
85
70
  nextSiblings: number[];
@@ -104,7 +89,6 @@ const containsAlways = (expression: LiveExpression): boolean => {
104
89
  }
105
90
  };
106
91
 
107
- // TLC's OrderOfSolution#hasEmptyPEMAndBoxFreePromises, negated.
108
92
  const isCycleConstrained = (solution: Solution) =>
109
93
  solution.promises.some((promise) => containsAlways(promise.body)) ||
110
94
  solution.models.some(
@@ -141,8 +125,7 @@ const writeToPool = <Data extends Int32Array | Uint8Array>(
141
125
 
142
126
  const NO_NODE = -1;
143
127
 
144
- // A Map holds at most 2^24 entries, so each tableau node of a state finds its node in an
145
- // open-addressing table of (state plus one, tableau node, node) triples.
128
+ // A Map holds at most 2^24 entries, so an open-addressing table of (state plus one, tableau node, node) triples finds each node.
146
129
  interface NodeTable {
147
130
  slots: Int32Array;
148
131
  size: number;
@@ -178,7 +161,6 @@ const getStateResult = (behavior: BehaviorGraph, node: number, position: number)
178
161
  behavior.nodeStates[node] * behavior.solution.stateChecks.length + position
179
162
  ] === 1;
180
163
 
181
- // A node owns one entry in each per-node array of its graph.
182
164
  const pushNode = (behavior: BehaviorGraph, state: number, tableauNode: number) => {
183
165
  behavior.nodeStates.push(state);
184
166
  behavior.nodeTableaux.push(tableauNode);
@@ -225,17 +207,14 @@ export const createLivenessChecker = (
225
207
  const formula =
226
208
  fairness.length === 0 ? violation : createJunction("And", [...fairness, violation]);
227
209
  const solutions = getSolutions(formula);
228
- if (solutions.length === 0) {
229
- throw createTautologyError();
230
- }
231
210
  const actionIds = new Map<string, number>();
232
211
  const behaviors = solutions.map((solution): BehaviorGraph => ({
233
212
  solution,
234
213
  actionIds: Int32Array.from(solution.actionChecks, (predicate) => {
235
214
  const key = getTermKey(predicate);
236
- const id = actionIds.get(key) ?? actionIds.size;
237
- actionIds.set(key, id);
238
- return id;
215
+ const actionId = actionIds.get(key) ?? actionIds.size;
216
+ actionIds.set(key, actionId);
217
+ return actionId;
239
218
  }),
240
219
  nodeStates: [],
241
220
  nodeTableaux: [],
@@ -252,23 +231,17 @@ export const createLivenessChecker = (
252
231
  isDone: [],
253
232
  errorNode: undefined,
254
233
  }));
255
- const capacity = { multiplier: 1 };
234
+ let capacityMultiplier = 1;
256
235
 
257
- // TLC evaluates every check on its own. Without side effects the order can't show, so the
258
- // checks of one state share their results.
259
236
  const isShared = !hasRepeatedEffects(environment);
260
- const evaluation = { environment };
261
- const shared = {
262
- states: new Map<Value[], Map<LiveExpression, boolean>>(),
263
- actions: new Map<Value[], Map<Value[], Int8Array>>(),
264
- };
237
+ let evaluationEnvironment = environment;
238
+ const sharedStates = new Map<Value[], Map<LiveExpression, boolean>>();
239
+ const sharedActions = new Map<Value[], Map<Value[], Int8Array>>();
265
240
  const getStateCache = (state: Value[]) => {
266
- const cache = shared.states.get(state) ?? new Map<LiveExpression, boolean>();
267
- shared.states.set(state, cache);
241
+ const cache = sharedStates.get(state) ?? new Map<LiveExpression, boolean>();
242
+ sharedStates.set(state, cache);
268
243
  return cache;
269
244
  };
270
- // TLCGet("level") reads the level of the state whose successors the checks run on.
271
- // A check that fails leaves no source, so the failure's trace reads the levels of the search.
272
245
  const evaluateFrom = <Result>(source: number | undefined, evaluate: () => Result) => {
273
246
  environment.runtime.setLivenessSource(source);
274
247
  try {
@@ -282,7 +255,7 @@ export const createLivenessChecker = (
282
255
  predicate,
283
256
  state,
284
257
  undefined,
285
- evaluation.environment,
258
+ evaluationEnvironment,
286
259
  isShared ? getStateCache(state) : new Map(),
287
260
  );
288
261
  const checkState = (behavior: BehaviorGraph, source: number, state: Value[]) =>
@@ -301,27 +274,27 @@ export const createLivenessChecker = (
301
274
  const predicates = behavior.solution.actionChecks;
302
275
  if (!isShared) {
303
276
  return Uint8Array.from(predicates, (predicate) =>
304
- evaluateLive(predicate, state, successor, evaluation.environment, new Map()) ? 1 : 0,
277
+ evaluateLive(predicate, state, successor, evaluationEnvironment, new Map()) ? 1 : 0,
305
278
  );
306
279
  }
307
280
  const stateCache = getStateCache(state);
308
- const results = shared.actions.get(state) ?? new Map<Value[], Int8Array>();
309
- shared.actions.set(state, results);
281
+ const results = sharedActions.get(state) ?? new Map<Value[], Int8Array>();
282
+ sharedActions.set(state, results);
310
283
  const known = results.get(successor) ?? new Int8Array(actionIds.size).fill(-1);
311
284
  results.set(successor, known);
312
- return Uint8Array.from(behavior.actionIds, (id, position) => {
313
- if (known[id] === -1) {
314
- known[id] = evaluateLive(
285
+ return Uint8Array.from(behavior.actionIds, (actionId, position) => {
286
+ if (known[actionId] === -1) {
287
+ known[actionId] = evaluateLive(
315
288
  predicates[position],
316
289
  state,
317
290
  successor,
318
- evaluation.environment,
291
+ evaluationEnvironment,
319
292
  stateCache,
320
293
  )
321
294
  ? 1
322
295
  : 0;
323
296
  }
324
- return known[id];
297
+ return known[actionId];
325
298
  });
326
299
  });
327
300
  const isConsistent = (
@@ -333,8 +306,6 @@ export const createLivenessChecker = (
333
306
  evaluateFrom(source, () =>
334
307
  tableau.nodes[node].statePredicates.every((predicate) => evaluateState(predicate, state)),
335
308
  );
336
- // TLC 1.7.4 doesn't stop at a tableau node that accepts every behavior, so it finds a violation
337
- // of a property like a safety property only in its liveness checks.
338
309
  const isAccepting = (tableau: Tableau, node: number) => {
339
310
  if (environment.runtime.version === "1.7.4") return false;
340
311
  const tableauNode = tableau.nodes[node];
@@ -403,16 +374,12 @@ export const createLivenessChecker = (
403
374
  behavior.edgeCounts[node] = targets.length;
404
375
  };
405
376
 
406
- // TLC collects a state's successors and the state itself in a SetOfStates, a hash set it
407
- // iterates in slot order. Its capacity starts at 16 times a factor that grows with every set
408
- // that outgrows it.
377
+ // TLC iterates a state's successors and the state itself in the slot order of a SetOfStates, a hash set whose capacity grows with every set that outgrows it.
409
378
  const getSuccessorSet = (index: number, state: Value[], successors: LiveSuccessor[]) => {
410
- const table = {
411
- slots: Array.from<LiveSuccessor | undefined>({
412
- length: SUCCESSOR_CAPACITY * capacity.multiplier,
413
- }),
414
- count: 0,
415
- };
379
+ let successorSlots = Array.from<LiveSuccessor | undefined>({
380
+ length: SUCCESSOR_CAPACITY * capacityMultiplier,
381
+ });
382
+ let successorCount = 0;
416
383
  const insertSuccessor = (slots: (LiveSuccessor | undefined)[], successor: LiveSuccessor) => {
417
384
  for (
418
385
  let slot = (search.getFingerprint(successor) & 0x7fffffff) % slots.length;
@@ -429,20 +396,19 @@ export const createLivenessChecker = (
429
396
  }
430
397
  };
431
398
  const addSuccessor = (successor: LiveSuccessor) => {
432
- if (table.count >= table.slots.length >> 1) {
433
- const old = table.slots;
434
- table.slots = Array.from<LiveSuccessor | undefined>({ length: 2 * old.length + 1 });
435
- for (const entry of old) if (entry) insertSuccessor(table.slots, entry);
399
+ if (successorCount >= successorSlots.length >> 1) {
400
+ const old = successorSlots;
401
+ successorSlots = Array.from<LiveSuccessor | undefined>({ length: 2 * old.length + 1 });
402
+ for (const entry of old) if (entry) insertSuccessor(successorSlots, entry);
436
403
  }
437
- if (insertSuccessor(table.slots, successor)) table.count++;
404
+ if (insertSuccessor(successorSlots, successor)) successorCount++;
438
405
  };
439
406
  successors.forEach(addSuccessor);
440
407
  addSuccessor({ index, state });
441
- if (table.slots.length > SUCCESSOR_CAPACITY * capacity.multiplier) capacity.multiplier++;
442
- return table.slots.filter((entry): entry is LiveSuccessor => entry !== undefined);
408
+ if (successorSlots.length > SUCCESSOR_CAPACITY * capacityMultiplier) capacityMultiplier++;
409
+ return successorSlots.filter((entry): entry is LiveSuccessor => entry !== undefined);
443
410
  };
444
411
 
445
- // TLC's TableauLiveChecker#addNextState for a node it finds after it expanded the node's state.
446
412
  const expandLate = (
447
413
  behavior: BehaviorGraph,
448
414
  tableau: Tableau,
@@ -480,8 +446,7 @@ export const createLivenessChecker = (
480
446
  const isDone = behavior.isDone[successor.index] === true;
481
447
  for (const next of tableauNode.successors) {
482
448
  if (!isConsistent(tableau, next, index, successor.state)) continue;
483
- // A successor the search never stored follows a violation or an error, after which nothing
484
- // checks the graph. TLC records its node, which it never expands.
449
+ // Deviation from TLC: TLC records the node of a successor the search never stored, which it never expands.
485
450
  if (successor.index === -1) continue;
486
451
  const existing = getNodeId(behavior, successor.index, next);
487
452
  if (existing !== undefined && successors.includes(existing)) continue;
@@ -504,7 +469,7 @@ export const createLivenessChecker = (
504
469
  stateResults: Uint8Array,
505
470
  index: number,
506
471
  ) => {
507
- const consistency = tableau.nodes.map((_, node) =>
472
+ const consistency = tableau.nodes.map((_tableauNode, node) =>
508
473
  set.map((successor) => isConsistent(tableau, node, index, successor.state)),
509
474
  );
510
475
  behavior.isDone[index] = true;
@@ -554,7 +519,6 @@ export const createLivenessChecker = (
554
519
  writeNode(behavior, index, successors, actions, stateResults);
555
520
  };
556
521
 
557
- // The shortest path from an initial node to the node, last node first, as TLC's getPath finds it.
558
522
  const getPath = (behavior: BehaviorGraph, target: number) => {
559
523
  if (behavior.initial.includes(target)) return [target];
560
524
  const parents = new Map<number, number>();
@@ -581,7 +545,6 @@ export const createLivenessChecker = (
581
545
  throw new TlaEvaluationError(`Couldn't re-create liveness trace (path) starting at: ${target}`);
582
546
  };
583
547
 
584
- // TLC's LiveWorker#checkSccs, a Tarjan search that pushes every successor of a node at once.
585
548
  const findLassoInModel = (
586
549
  behavior: BehaviorGraph,
587
550
  model: Solution["models"][number],
@@ -638,8 +601,6 @@ export const createLivenessChecker = (
638
601
  return getLasso(root, members, membersByState);
639
602
  };
640
603
 
641
- // TLC's LiveWorker#printTrace: a prefix to the root, a greedy walk through the component
642
- // until it satisfies every check, and a breadth-first path back to the root.
643
604
  const getLasso = (
644
605
  root: number,
645
606
  members: Set<number>,
@@ -655,74 +616,75 @@ export const createLivenessChecker = (
655
616
  const stateDone = model.infinitelyOftenStates.map(() => false);
656
617
  const actionDone = model.infinitelyOftenActions.map(() => false);
657
618
  const promiseDone = solution.promises.map(() => false);
658
- const remaining = { count: stateDone.length + actionDone.length + promiseDone.length };
659
- const current = { node: root };
619
+ let remainingCount = stateDone.length + actionDone.length + promiseDone.length;
620
+ let currentNode = root;
660
621
  const isMember = (node: number) => members.has(node);
661
622
  const moveTo = (next: number) => {
662
- cycleStack.push(current.node);
663
- current.node = next;
623
+ cycleStack.push(currentNode);
624
+ currentNode = next;
664
625
  };
665
- while (remaining.count > 0) {
666
- const countAtStart = remaining.count;
626
+ while (remainingCount > 0) {
627
+ const countAtStart = remainingCount;
667
628
  while (true) {
668
629
  model.infinitelyOftenStates.forEach((position, slot) => {
669
- if (!stateDone[slot] && getStateResult(behavior, current.node, position)) {
630
+ if (!stateDone[slot] && getStateResult(behavior, currentNode, position)) {
670
631
  stateDone[slot] = true;
671
- remaining.count--;
632
+ remainingCount--;
672
633
  }
673
634
  });
674
635
  solution.promises.forEach((promise, position) => {
675
- if (!promiseDone[position] && isFulfilled(current.node, promise)) {
636
+ if (!promiseDone[position] && isFulfilled(currentNode, promise)) {
676
637
  promiseDone[position] = true;
677
- remaining.count--;
638
+ remainingCount--;
678
639
  }
679
640
  });
680
- if (remaining.count <= 0) break;
681
- const step = { last: -1, unvisited: -1 };
682
- const countBeforeActions = remaining.count;
683
- const taken = getNodeSuccessors(behavior, current.node).some((next, edge) => {
641
+ if (remainingCount <= 0) break;
642
+ let lastNext = -1;
643
+ let unvisitedNext = -1;
644
+ const countBeforeActions = remainingCount;
645
+ const isTaken = getNodeSuccessors(behavior, currentNode).some((next, edge) => {
684
646
  if (membersByState.has(behavior.nodeStates[next])) {
685
- if (!isMember(next) || !isAllowed(current.node, edge)) return false;
686
- step.last = next;
647
+ if (!isMember(next) || !isAllowed(currentNode, edge)) return false;
648
+ lastNext = next;
687
649
  model.infinitelyOftenActions.forEach((position, slot) => {
688
- if (!actionDone[slot] && getAction(current.node, edge, position)) {
650
+ if (!actionDone[slot] && getAction(currentNode, edge, position)) {
689
651
  actionDone[slot] = true;
690
- remaining.count--;
652
+ remainingCount--;
691
653
  }
692
654
  });
693
655
  }
694
- if (remaining.count < countBeforeActions) {
656
+ if (remainingCount < countBeforeActions) {
695
657
  moveTo(next);
696
658
  seen.clear();
697
659
  return true;
698
660
  }
699
- if (isMember(next) && !seen.has(next)) step.unvisited = next;
661
+ if (isMember(next) && !seen.has(next)) unvisitedNext = next;
700
662
  return false;
701
663
  });
702
- if (taken) break;
703
- if (remaining.count < countAtStart) {
704
- moveTo(step.last);
664
+ if (isTaken) break;
665
+ if (remainingCount < countAtStart) {
666
+ moveTo(lastNext);
705
667
  seen.clear();
706
668
  break;
707
669
  }
708
- while (step.unvisited === -1) {
670
+ while (unvisitedNext === -1) {
709
671
  const previous = cycleStack.pop();
710
672
  if (previous === undefined) {
711
673
  throw new TlaEvaluationError(
712
674
  "TLC failed to build the counterexample of a liveness property",
713
675
  );
714
676
  }
715
- current.node = previous;
716
- step.unvisited =
677
+ currentNode = previous;
678
+ unvisitedNext =
717
679
  getNodeSuccessors(behavior, previous).find(
718
680
  (next) => isMember(next) && !seen.has(next),
719
681
  ) ?? -1;
720
682
  }
721
- moveTo(step.unvisited);
722
- seen.add(step.unvisited);
683
+ moveTo(unvisitedNext);
684
+ seen.add(unvisitedNext);
723
685
  }
724
686
  }
725
- const postfix = getClosingPath(root, current.node, membersByState, isAllowed);
687
+ const postfix = getClosingPath(root, currentNode, membersByState, isAllowed);
726
688
  for (let position = cycleStack.length - 1; position >= 0; position--) {
727
689
  const state = behavior.nodeStates[cycleStack[position]];
728
690
  if (postfix[postfix.length - 1] !== state) postfix.push(state);
@@ -736,7 +698,6 @@ export const createLivenessChecker = (
736
698
  };
737
699
  };
738
700
 
739
- // TLC's LiveWorker#bfsPostFix, the states from the walk's end back to the root, last first.
740
701
  const getClosingPath = (
741
702
  root: number,
742
703
  end: number,
@@ -782,7 +743,7 @@ export const createLivenessChecker = (
782
743
 
783
744
  for (let position = 0; position < queue.length; position++) {
784
745
  const stack = [queue[position], UNVISITED, 0];
785
- const counter = { link: 0 };
746
+ let nextLink = 0;
786
747
  while (stack.length >= 3) {
787
748
  const lowLink = stack.pop() ?? 0;
788
749
  const location = stack.pop();
@@ -799,10 +760,10 @@ export const createLivenessChecker = (
799
760
  stack.push(Math.min(lowLink, links[node]));
800
761
  continue;
801
762
  }
802
- links[node] = counter.link;
763
+ links[node] = nextLink;
803
764
  stack.push(lowLink, node, SCC_MARKER);
804
765
  components.push(node);
805
- const nextLowLink = { value: counter.link++ };
766
+ let nextLowLink = nextLink++;
806
767
  getNodeSuccessors(behavior, node).forEach((next, edge) => {
807
768
  if (!isWritten(behavior, next)) return;
808
769
  if (!isAllowed(node, edge)) {
@@ -810,9 +771,9 @@ export const createLivenessChecker = (
810
771
  return;
811
772
  }
812
773
  if (links[next] === UNVISITED) stack.push(next, UNVISITED);
813
- else nextLowLink.value = Math.min(nextLowLink.value, links[next]);
774
+ else nextLowLink = Math.min(nextLowLink, links[next]);
814
775
  });
815
- stack.push(nextLowLink.value);
776
+ stack.push(nextLowLink);
816
777
  }
817
778
  }
818
779
  return undefined;
@@ -821,9 +782,9 @@ export const createLivenessChecker = (
821
782
  return {
822
783
  branches: behaviors.length,
823
784
  addInitialState: (index, state, tracing) => {
824
- evaluation.environment = tracing ?? environment;
825
- shared.states.clear();
826
- shared.actions.clear();
785
+ evaluationEnvironment = tracing ?? environment;
786
+ sharedStates.clear();
787
+ sharedActions.clear();
827
788
  try {
828
789
  for (const behavior of behaviors) {
829
790
  const tableau = behavior.solution.tableau;
@@ -839,13 +800,13 @@ export const createLivenessChecker = (
839
800
  }
840
801
  }
841
802
  } finally {
842
- evaluation.environment = environment;
803
+ evaluationEnvironment = environment;
843
804
  }
844
805
  },
845
806
  addState: (index, state, successors, tracing) => {
846
- evaluation.environment = tracing ?? environment;
847
- shared.states.clear();
848
- shared.actions.clear();
807
+ evaluationEnvironment = tracing ?? environment;
808
+ sharedStates.clear();
809
+ sharedActions.clear();
849
810
  try {
850
811
  const set = getSuccessorSet(index, state, successors);
851
812
  for (const behavior of behaviors) {
@@ -870,7 +831,7 @@ export const createLivenessChecker = (
870
831
  }
871
832
  return undefined;
872
833
  } finally {
873
- evaluation.environment = environment;
834
+ evaluationEnvironment = environment;
874
835
  }
875
836
  },
876
837
  findViolation: () => {
@@ -882,12 +843,11 @@ export const createLivenessChecker = (
882
843
  }
883
844
  return undefined;
884
845
  },
885
- // TLC names every property that the counterexample violates, once each.
886
846
  getViolatedProperties: (path, cycleStart) => [
887
847
  ...new Set(
888
848
  properties
889
849
  .filter(
890
- (_, position) =>
850
+ (_property, position) =>
891
851
  !evaluateOnLasso(negations[position].body, path, cycleStart, 0, environment),
892
852
  )
893
853
  .map((property) => property.name),