tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  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 +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,11 @@
1
- import { getChildren, isLocallyResolved, type Definition, type Expression } from "./ast";
1
+ import {
2
+ getChildren,
3
+ getDefinitionExpressions,
4
+ getReferencedName,
5
+ isLocallyResolved,
6
+ type Definition,
7
+ type Expression,
8
+ } from "./ast";
2
9
  import type { Environment } from "./evaluate";
3
10
  import { ACTION_LEVEL, CONSTANT_LEVEL, TEMPORAL_LEVEL, VARIABLE_LEVEL } from "./levels";
4
11
 
@@ -21,6 +28,9 @@ const READS_IMPURE = 16;
21
28
  const VARIABLE_LEVEL_FLAGS = 32;
22
29
  const ACTION_LEVEL_FLAGS = VARIABLE_LEVEL_FLAGS | 64;
23
30
  const TEMPORAL_LEVEL_FLAGS = ACTION_LEVEL_FLAGS | 128;
31
+ const RANDOM = 256;
32
+ const ABOVE_CONSTANT_BOUND = 512;
33
+ const TLC_EVAL = 1024;
24
34
 
25
35
  const ACTION_KINDS = new Set<Expression["kind"]>([
26
36
  "Prime",
@@ -58,12 +68,12 @@ const IMPURE_BUILTINS = new Set([
58
68
 
59
69
  const STREAMED_BUILTINS = new Set(["UNION", "\\cup"]);
60
70
 
61
- const getReferencedName = (expression: Expression) => {
62
- if (expression.kind === "Identifier") return expression.name;
63
- if (expression.kind === "Apply" || expression.kind === "OperatorReference")
64
- return expression.operator;
65
- return undefined;
66
- };
71
+ const RANDOM_BUILTINS = new Set([
72
+ "RandomSubset",
73
+ "RandomSetOfSubsets",
74
+ "TestRandomSetOfSubsets",
75
+ "RandomSubsetSet",
76
+ ]);
67
77
 
68
78
  const isImpureBuiltin = (name: string, environment: DefinitionNames) =>
69
79
  IMPURE_BUILTINS.has(name) || environment.builtins.get(name)?.isStateLevel === true;
@@ -72,6 +82,7 @@ interface Edge {
72
82
  callee: Definition;
73
83
  isOverridden: boolean;
74
84
  isLevelCounted: boolean;
85
+ isOperatorArgument: boolean;
75
86
  }
76
87
 
77
88
  const collectLocalFacts = (
@@ -96,20 +107,34 @@ const collectLocalFacts = (
96
107
  }
97
108
  return undefined;
98
109
  };
99
- const visit = (node: Expression, isLevelCounted: boolean) => {
110
+ const contexts = new Map<Expression, number>();
111
+ const visit = (node: Expression, isLevelCounted: boolean, isOperatorArgument: boolean) => {
100
112
  const kind = node.kind;
113
+ if (kind === "Selection") {
114
+ const seen = contexts.get(node.expression) ?? 0;
115
+ const context = isLevelCounted ? (isOperatorArgument ? 1 : 2) : isOperatorArgument ? 4 : 8;
116
+ if ((seen & context) !== 0) return;
117
+ contexts.set(node.expression, seen | context);
118
+ }
119
+ // TLC's getLevelBound takes an operator argument for a constant.
120
+ const nonconstantFlags = isOperatorArgument ? NONCONSTANT : NONCONSTANT | ABOVE_CONSTANT_BOUND;
101
121
  if (
102
122
  NONCONSTANT_KINDS.has(kind) ||
103
123
  (kind === "UnboundedQuantifier" && node.isTemporal === true) ||
104
124
  (kind === "Apply" && NONCONSTANT_OPERATORS.has(node.operator))
105
125
  ) {
106
- row[0] |= NONCONSTANT;
126
+ row[0] |= nonconstantFlags;
107
127
  }
108
128
  if (NONCONSTANT_KINDS.has(kind)) row[0] |= READS_IMPURE;
109
129
  const ownLevelFlags = getOwnLevelFlags(node);
110
130
  if (isLevelCounted && ownLevelFlags !== undefined) row[0] |= ownLevelFlags;
111
131
  const isInnerLevelCounted = isLevelCounted && ownLevelFlags === undefined;
112
132
  const name = getReferencedName(node);
133
+ // TLC's getLevelBound takes a parameter named like a variable for that variable.
134
+ if (name !== undefined && isLocallyResolved(node) && environment.variableIndex.has(name)) {
135
+ if (!isOperatorArgument) row[0] |= ABOVE_CONSTANT_BOUND;
136
+ if (isInnerLevelCounted) row[0] |= VARIABLE_LEVEL_FLAGS;
137
+ }
113
138
  if (name !== undefined && !isLocallyResolved(node)) {
114
139
  const target = environment.substitutions.get(name) ?? name;
115
140
  const definition = environment.definitions.get(target);
@@ -117,22 +142,34 @@ const collectLocalFacts = (
117
142
  const variableIndex = environment.variableIndex.get(name);
118
143
  if (
119
144
  variableIndex !== undefined ||
120
- environment.builtins.get(name)?.isStateLevel ||
145
+ environment.builtins.get(target)?.isStateLevel ||
121
146
  (definition && environment.variableIndex.has(definition.name))
122
147
  ) {
123
- row[0] |= NONCONSTANT;
148
+ row[0] |= nonconstantFlags;
124
149
  }
125
150
  if (variableIndex !== undefined) {
126
151
  if (isInnerLevelCounted) row[0] |= VARIABLE_LEVEL_FLAGS;
127
152
  if (!isOverridden) row[1 + (variableIndex >>> 5)] |= 1 << (variableIndex & 31);
128
153
  }
129
154
  if (definition) {
130
- edges.push({ callee: definition, isOverridden, isLevelCounted: isInnerLevelCounted });
155
+ edges.push({
156
+ callee: definition,
157
+ isOverridden,
158
+ isLevelCounted: isInnerLevelCounted,
159
+ isOperatorArgument:
160
+ isOperatorArgument ||
161
+ kind === "OperatorReference" ||
162
+ (kind === "Identifier" &&
163
+ definition.kind === "Operator" &&
164
+ definition.params.length > 0),
165
+ });
131
166
  } else {
132
- if (isImpureBuiltin(name, environment)) {
133
- row[0] |= IMPURE | (name === "Assert" ? 0 : REPEATED_EFFECT);
167
+ if (isImpureBuiltin(target, environment)) {
168
+ row[0] |= IMPURE | (target === "Assert" ? 0 : REPEATED_EFFECT);
134
169
  }
135
- if (STREAMED_BUILTINS.has(name)) row[0] |= STREAMED;
170
+ if (STREAMED_BUILTINS.has(target)) row[0] |= STREAMED;
171
+ if (RANDOM_BUILTINS.has(target)) row[0] |= RANDOM;
172
+ if (target === "TLCEval") row[0] |= TLC_EVAL;
136
173
  if (!isOverridden && isImpureBuiltin(target, environment)) row[0] |= READS_IMPURE;
137
174
  const builtin = environment.builtins.get(target);
138
175
  if (
@@ -146,17 +183,14 @@ const collectLocalFacts = (
146
183
  }
147
184
  }
148
185
  }
149
- getChildren(node).forEach((child) => visit(child, isInnerLevelCounted));
186
+ getChildren(node).forEach((child) =>
187
+ visit(child, isInnerLevelCounted, isOperatorArgument || kind === "Lambda"),
188
+ );
150
189
  };
151
- expressions.forEach((expression) => visit(expression, true));
190
+ expressions.forEach((expression) => visit(expression, true, false));
152
191
  return { row, edges };
153
192
  };
154
193
 
155
- const getDefinitionExpressions = (definition: Definition) =>
156
- definition.kind === "Function"
157
- ? [...definition.bounds.map((bound) => bound.set), definition.body]
158
- : [definition.body];
159
-
160
194
  const closeRows = (local: Uint32Array, words: number, edges: Int32Array[], mask: number) => {
161
195
  const count = edges.length;
162
196
  const closed = local.slice();
@@ -224,11 +258,12 @@ const closeRows = (local: Uint32Array, words: number, edges: Int32Array[], mask:
224
258
  return closed;
225
259
  };
226
260
 
227
- const PURITY_MASK = IMPURE | REPEATED_EFFECT | STREAMED;
261
+ const PURITY_MASK = IMPURE | REPEATED_EFFECT | STREAMED | RANDOM | TLC_EVAL;
228
262
  const READ_MASK = NONCONSTANT | READS_IMPURE;
263
+ const STARTUP_MASK = NONCONSTANT | ABOVE_CONSTANT_BOUND;
229
264
 
230
265
  const isEvaluatedOnce = (definition: Definition, flags: number) =>
231
- definition.kind === "Operator" && definition.params.length === 0 && (flags & NONCONSTANT) === 0;
266
+ definition.kind === "Operator" && definition.params.length === 0 && (flags & STARTUP_MASK) === 0;
232
267
 
233
268
  export const createDefinitionFacts = (environment: DefinitionNames): DefinitionFacts => {
234
269
  const definitions = [...new Set(environment.definitions.values())];
@@ -252,18 +287,32 @@ export const createDefinitionFacts = (environment: DefinitionNames): DefinitionF
252
287
  new Int32Array(own.filter((edge) => !edge.isOverridden && edge.isLevelCounted).map(getId)),
253
288
  );
254
289
  const levels = closeRows(local, words, levelEdges, TEMPORAL_LEVEL_FLAGS);
290
+ const startupEdges = edges.map(
291
+ (own) =>
292
+ new Int32Array(
293
+ own.filter((edge) => !edge.isOverridden && !edge.isOperatorArgument).map(getId),
294
+ ),
295
+ );
296
+ const startup = closeRows(local, words, startupEdges, ABOVE_CONSTANT_BOUND);
255
297
  const purityEdges = edges.map(
256
298
  (own) =>
257
299
  new Int32Array(
258
300
  own
259
301
  .map(getId)
260
- .filter((callee) => !isEvaluatedOnce(definitions[callee], reads[callee * words])),
302
+ .filter(
303
+ (callee) =>
304
+ !isEvaluatedOnce(
305
+ definitions[callee],
306
+ reads[callee * words] | startup[callee * words],
307
+ ),
308
+ ),
261
309
  ),
262
310
  );
263
311
  const purity = closeRows(localImpurity, words, purityEdges, PURITY_MASK);
264
312
  const rows = reads.map((word, position) =>
265
313
  position % words === 0
266
314
  ? (word & READ_MASK) |
315
+ (startup[position] & ABOVE_CONSTANT_BOUND) |
267
316
  (levels[position] & TEMPORAL_LEVEL_FLAGS) |
268
317
  (purity[position] & PURITY_MASK)
269
318
  : word,
@@ -287,6 +336,7 @@ const getExpressionsRow = (expressions: Expression[], environment: Environment)
287
336
  const callee = getRow(edge.callee, environment);
288
337
  if (!edge.isOverridden) {
289
338
  row[0] |= callee[0] & READ_MASK;
339
+ if (!edge.isOperatorArgument) row[0] |= callee[0] & ABOVE_CONSTANT_BOUND;
290
340
  if (edge.isLevelCounted) row[0] |= callee[0] & TEMPORAL_LEVEL_FLAGS;
291
341
  for (let word = 1; word < words; word++) row[word] |= callee[word];
292
342
  }
@@ -296,9 +346,25 @@ const getExpressionsRow = (expressions: Expression[], environment: Environment)
296
346
  };
297
347
 
298
348
  export const isConstantLevel = (definition: Definition, environment: Environment) =>
299
- (getRow(definition, environment)[0] & NONCONSTANT) === 0;
349
+ (getRow(definition, environment)[0] & STARTUP_MASK) === 0;
350
+
351
+ export const isEvaluatedAtStartup = (definition: Definition, environment: Environment) =>
352
+ (getRow(definition, environment)[0] & ABOVE_CONSTANT_BOUND) === 0;
353
+
354
+ const EFFECT_FLAGS = {
355
+ any: IMPURE,
356
+ repeated: REPEATED_EFFECT,
357
+ streamed: STREAMED,
358
+ // What a second evaluation shows: output again, or other random draws.
359
+ replayed: REPEATED_EFFECT | RANDOM,
360
+ varying: IMPURE | RANDOM,
361
+ };
300
362
 
301
- const EFFECT_FLAGS = { any: IMPURE, repeated: REPEATED_EFFECT, streamed: STREAMED };
363
+ export const isExpressionImpure = (
364
+ expressions: Expression[],
365
+ environment: Environment,
366
+ effect: keyof typeof EFFECT_FLAGS,
367
+ ) => (getExpressionsRow(expressions, environment)[0] & EFFECT_FLAGS[effect]) !== 0;
302
368
 
303
369
  export const isImpureDefinition = (
304
370
  definition: Definition,
@@ -306,6 +372,9 @@ export const isImpureDefinition = (
306
372
  effect: keyof typeof EFFECT_FLAGS = "any",
307
373
  ) => (getRow(definition, environment)[0] & EFFECT_FLAGS[effect]) !== 0;
308
374
 
375
+ export const isTlcEvalReached = (expression: Expression, environment: Environment) =>
376
+ (getExpressionsRow([expression], environment)[0] & TLC_EVAL) !== 0;
377
+
309
378
  export const getDefinitionLevel = (definition: Definition, environment: Environment) => {
310
379
  const flags = getRow(definition, environment)[0] & TEMPORAL_LEVEL_FLAGS;
311
380
  return flags === TEMPORAL_LEVEL_FLAGS
package/src/dfid.ts CHANGED
@@ -1,21 +1,25 @@
1
1
  import type { Expression } from "./ast";
2
2
  import type { CheckOptions } from "./check";
3
+ import type { CoverageOutput } from "./coverage";
3
4
  import {
4
5
  getErrorExitCode,
5
6
  getUnexpectedException,
6
7
  isStackOverflow,
7
8
  TlaEvaluationError,
8
- TlaIncompleteSuccessorError,
9
9
  TlaStackOverflowError,
10
10
  TlaTooManyStatesError,
11
11
  TlaUnsupportedError,
12
12
  } from "./errors";
13
- import { createTracingEnvironment } from "./evaluate";
13
+ import { createTracingEnvironment, type State } from "./evaluate";
14
14
  import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
15
15
  import { createLivenessChecker } from "./liveness-checker";
16
- import { getIncompleteSuccessorMessage, prepareSearch, reportAssumptionViolation } from "./search";
17
- import { getNextActions, type SpecAction } from "./spec-description";
18
- import { forEachInitialState, forEachSuccessor } from "./successors";
16
+ import {
17
+ addActionCoverage,
18
+ getIncompleteSuccessorMessage,
19
+ prepareSearch,
20
+ reportAssumptionViolation,
21
+ } from "./search";
22
+ import { forEachInitialState, forEachSuccessor, getSuccessors, type Successor } from "./successors";
19
23
  import {
20
24
  formatNestedMessage,
21
25
  formatTlcDate,
@@ -26,9 +30,10 @@ import {
26
30
  withUnexpectedException,
27
31
  } from "./tlc/messages";
28
32
  import { getTlcFingerprint } from "./tlc/fingerprint";
29
- import { replaySuccessors } from "./tlc/replay";
33
+ import { createJavaRandom } from "./tlc/random";
34
+ import { replayInitialStates, replaySuccessors, walkSuccessors } from "./tlc/replay";
30
35
  import { getOptimisticProbability, getActualProbability } from "./tlc/summary";
31
- import { createModelValue, formatState, getSetBound, type Value } from "./values";
36
+ import { createModelValue, formatState, getSetBound, isSameValue, type Value } from "./values";
32
37
 
33
38
  export interface DepthFirstOptions extends CheckOptions {
34
39
  maxDepth: number;
@@ -39,6 +44,7 @@ export type DepthFirstOutput =
39
44
  | { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
40
45
  | { kind: "behavior"; states: Record<string, Value>[]; isInvariant: boolean }
41
46
  | { kind: "nested-expressions"; callStack: Expression[] }
47
+ | CoverageOutput
42
48
  | { kind: "success"; optimistic: number; actual: number };
43
49
 
44
50
  interface StateEntry {
@@ -52,7 +58,8 @@ interface CheckerState {
52
58
  continuedCode: number;
53
59
  isKeepingCallStack: boolean;
54
60
  errorEntry: StateEntry | undefined;
55
- stopCode: number;
61
+ /** DFIDWorker's stopCode: 0 while it searches, 1 once every initial state is done, 2 after an error. */
62
+ stopCode: "searching" | "done" | "error";
56
63
  isMoreLevel: boolean;
57
64
  }
58
65
 
@@ -130,7 +137,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
130
137
  withUnexpectedException(() =>
131
138
  createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
132
139
  getFingerprint: () => 0,
133
- getSuccessors: () => [],
140
+ forEachActionSuccessors: () => {},
134
141
  }),
135
142
  ),
136
143
  )?.branches;
@@ -163,7 +170,17 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
163
170
  );
164
171
  if (assumptionStatus !== undefined) return assumptionStatus;
165
172
 
166
- const nextActions = getNextActions(config, environment, prepared.specification.instanceActions);
173
+ const description = prepared.getDescription();
174
+ const nextActions = description.actions;
175
+ const coverage = prepared.coverage;
176
+ const covered = coverage && addActionCoverage(coverage, environment, description);
177
+ // Deviation from TLC: TLCExt#pickSuccessor casts the DFID checker to ModelChecker and fails, so tla-ts asks as model checking does.
178
+ runtime.getSuccessorAction = (state, next) =>
179
+ nextActions.find((action) =>
180
+ getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
181
+ successor.state.every((value, index) => isSameValue(value, next[index])),
182
+ ),
183
+ );
167
184
  const statuses = new Map<bigint, number>();
168
185
  const fingerprintSet = { level: 1, leveled: 0, buckets: INITIAL_BUCKETS };
169
186
  const setStatus = (fingerprint: bigint, status: number) => {
@@ -188,7 +205,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
188
205
  continuedCode: NO_ERROR,
189
206
  isKeepingCallStack: false,
190
207
  errorEntry: undefined,
191
- stopCode: 0,
208
+ stopCode: "searching",
192
209
  isMoreLevel: false,
193
210
  };
194
211
  const setErrorState = (entry: StateEntry, isKeepingCallStack: boolean, code: number) => {
@@ -197,12 +214,14 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
197
214
  checker.errorCode = code;
198
215
  checker.isDone = true;
199
216
  checker.isKeepingCallStack = isKeepingCallStack;
200
- checker.stopCode = 2;
217
+ checker.stopCode = "error";
201
218
  return true;
202
219
  };
203
220
  const toRecord = (state: (Value | undefined)[]) =>
204
221
  search.toRecord(state.map((value) => value ?? createModelValue("null")));
205
222
  const printSummary = () => {
223
+ const report = nextActions.length > 0 ? prepared.getCoverage() : undefined;
224
+ if (report) output({ kind: "coverage", coverage: report });
206
225
  const counts = `${generatedCount} states generated, ${statuses.size} distinct states found`;
207
226
  if (isTool) {
208
227
  message(
@@ -239,7 +258,13 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
239
258
  return false;
240
259
  };
241
260
  const init = search.spec.init;
242
- if (init) forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
261
+ if (covered) {
262
+ replayInitialStates(covered.inits, environment, addGenerated, (partial) =>
263
+ addGenerated([...partial]),
264
+ );
265
+ } else if (init) {
266
+ forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
267
+ }
243
268
  generatedCount = generated.length;
244
269
  for (const state of generated) {
245
270
  if (!state.every((value) => value !== undefined)) {
@@ -260,16 +285,21 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
260
285
  config.alias === undefined
261
286
  ? search.toRecord(state)
262
287
  : search.evaluateAlias(config.alias, state, state, isTool);
263
- const violated = isContinued
264
- ? search.getViolatedInvariants(state)
265
- : [search.findViolatedInvariant(state)].filter((invariant) => invariant !== undefined);
266
- for (const invariant of violated) {
288
+ const reportInvariant = (name: string) =>
267
289
  message(
268
290
  MESSAGE_CODE.invariantViolatedInitial,
269
- `Invariant ${invariant.name} is violated by the initial state:\n${formatState(alias())}`,
291
+ `Invariant ${name} is violated by the initial state:\n${formatState(alias())}`,
270
292
  );
271
- if (!isContinued) return MESSAGE_CODE.invariantViolatedInitial;
272
- checker.continuedCode = MESSAGE_CODE.invariantViolatedInitial;
293
+ if (isContinued) {
294
+ search.forEachViolatedInvariant(state, (invariant) => {
295
+ reportInvariant(invariant.name);
296
+ checker.continuedCode = MESSAGE_CODE.invariantViolatedInitial;
297
+ });
298
+ }
299
+ const violated = isContinued ? undefined : search.findViolatedInvariant(state);
300
+ if (violated) {
301
+ reportInvariant(violated.name);
302
+ return MESSAGE_CODE.invariantViolatedInitial;
273
303
  }
274
304
  const predicate = search.findFailedInitialPredicate(state);
275
305
  if (predicate) {
@@ -283,25 +313,56 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
283
313
  return NO_ERROR;
284
314
  };
285
315
 
286
- const getActionSuccessors = (action: SpecAction, state: Value[]) => {
287
- const successors: Value[][] = [];
288
- try {
316
+ let actionSuccessors: Value[][] = [];
317
+ let incompleteSuccessor: State | undefined;
318
+ let actionSuccessorCount = 0;
319
+ const addActionSuccessor = (successor: Value[]) => {
320
+ actionSuccessorCount++;
321
+ if (incompleteSuccessor) return false;
322
+ if (actionSuccessors.length === getSetBound()) throw new TlaTooManyStatesError();
323
+ actionSuccessors.push(successor);
324
+ return false;
325
+ };
326
+ const visitActionSuccessor = (successor: Successor) => addActionSuccessor(successor.state);
327
+ const addIncompleteSuccessor = (partial: State) => {
328
+ actionSuccessorCount++;
329
+ incompleteSuccessor ??= [...partial];
330
+ return true;
331
+ };
332
+ // TLC's Tool#getNextStates generates every successor of the action before DFIDWorker finds an incomplete one.
333
+ const getActionSuccessors = (index: number, state: Value[]) => {
334
+ const action = nextActions[index];
335
+ const coveredAction = covered?.actions[index];
336
+ actionSuccessors = [];
337
+ incompleteSuccessor = undefined;
338
+ actionSuccessorCount = 0;
339
+ if (coverage && coveredAction) {
340
+ walkSuccessors(
341
+ coveredAction,
342
+ coveredAction.node,
343
+ state,
344
+ environment,
345
+ addActionSuccessor,
346
+ addIncompleteSuccessor,
347
+ );
348
+ coverage.primary[coveredAction.node] += actionSuccessorCount;
349
+ } else {
289
350
  forEachSuccessor(
290
351
  action.expression,
291
352
  state,
292
353
  environment,
293
- (successor) => {
294
- if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
295
- successors.push(successor.state);
296
- return false;
297
- },
354
+ visitActionSuccessor,
298
355
  action.scope,
356
+ undefined,
357
+ undefined,
358
+ addIncompleteSuccessor,
299
359
  );
300
- return { successors, incomplete: undefined };
301
- } catch (error) {
302
- if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
303
- return { successors, incomplete: error };
304
360
  }
361
+ return {
362
+ successors: actionSuccessors,
363
+ incomplete: incompleteSuccessor,
364
+ count: actionSuccessorCount,
365
+ };
305
366
  };
306
367
 
307
368
  const findCheckFailure = (state: Value[], successor: Value[], isNew: boolean) => {
@@ -367,12 +428,12 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
367
428
  };
368
429
  currentState = state;
369
430
  try {
370
- for (const action of nextActions) {
371
- const next = getActionSuccessors(action, state);
431
+ for (let index = 0; index < nextActions.length; index++) {
432
+ const action = nextActions[index];
433
+ const next = getActionSuccessors(index, state);
372
434
  const incomplete = next.incomplete;
373
- const count = next.successors.length + (incomplete ? 1 : 0);
374
- generatedCount += count;
375
- isDeadlocked &&= count === 0;
435
+ generatedCount += next.count;
436
+ isDeadlocked &&= next.count === 0;
376
437
  for (const successor of next.successors) {
377
438
  processedSuccessor = successor;
378
439
  levels.set(successor, depth + 2);
@@ -398,11 +459,13 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
398
459
  if (failure) return report(failure.code, failure.text, !failure.isViolated);
399
460
  }
400
461
  if (incomplete) {
401
- processedSuccessor = incomplete.state;
462
+ processedSuccessor = incomplete;
402
463
  return report(
403
464
  MESSAGE_CODE.incompleteSuccessor,
404
465
  getIncompleteSuccessorMessage(
405
- incomplete.variables,
466
+ environment.variables.filter(
467
+ (_variable, position) => incomplete[position] === undefined,
468
+ ),
406
469
  action.name,
407
470
  nextActions.length,
408
471
  options.version,
@@ -442,28 +505,28 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
442
505
  throw failure;
443
506
  }
444
507
  };
445
- const getNextIndex = (successors: StateEntry[], level: number) => {
508
+ const hasNext = (successors: StateEntry[], level: number) => {
446
509
  while (successors.length > 0) {
447
510
  const status = getStatus(successors[0].fingerprint);
448
- if (!isCompleted(status) && level < status >>> 2) return 0;
511
+ if (!isCompleted(status) && level < status >>> 2) return true;
449
512
  successors[0] = successors[successors.length - 1];
450
513
  successors.pop();
451
514
  }
452
- return -1;
515
+ return false;
453
516
  };
454
517
  const searchLevel = (toLevel: number) => {
455
518
  const initials = [...initialEntries];
456
- checker.stopCode = 0;
519
+ checker.stopCode = "searching";
457
520
  checker.isMoreLevel = false;
458
521
  let stackLevel = 0;
459
522
  try {
460
- while (checker.stopCode === 0) {
523
+ while (checker.stopCode === "searching") {
461
524
  while (initials.length > 0 && isCompleted(getStatus(initials[0].fingerprint))) {
462
525
  initials[0] = initials[initials.length - 1];
463
526
  initials.pop();
464
527
  }
465
528
  if (initials.length === 0) {
466
- checker.stopCode = 1;
529
+ checker.stopCode = "done";
467
530
  return;
468
531
  }
469
532
  stack[0] = initials[0];
@@ -474,8 +537,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
474
537
  checker.isMoreLevel ||= !isInitialNoLeaf;
475
538
  stackLevel = 1;
476
539
  while (!isInitialLeaf) {
477
- const index = getNextIndex(successorStack[stackLevel - 1], stackLevel);
478
- if (index === -1) {
540
+ if (!hasNext(successorStack[stackLevel - 1], stackLevel)) {
479
541
  const entry = stack[stackLevel - 1];
480
542
  statuses.set(
481
543
  entry.fingerprint,
@@ -485,7 +547,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
485
547
  stackLevel--;
486
548
  continue;
487
549
  }
488
- stack[stackLevel] = successorStack[stackLevel - 1][index];
550
+ stack[stackLevel] = successorStack[stackLevel - 1][0];
489
551
  successorStack[stackLevel] = [];
490
552
  const isLeaf = stackLevel >= toLevel - 1;
491
553
  const isNoLeaf = expandState(stackLevel, isLeaf, successorStack[stackLevel]);
@@ -496,7 +558,7 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
496
558
  }
497
559
  } catch (error) {
498
560
  if (!(error instanceof TlaEvaluationError)) throw error;
499
- checker.stopCode = 2;
561
+ checker.stopCode = "error";
500
562
  if (setErrorState(stack[stackLevel], true, MESSAGE_CODE.general)) {
501
563
  const unexpected = getUnexpectedMessage("", error);
502
564
  message(
@@ -608,11 +670,14 @@ export const checkDepthFirst = (options: DepthFirstOptions): number => {
608
670
  );
609
671
  fingerprintSet.level++;
610
672
  fingerprintSet.leveled = LEVELED - fingerprintSet.leveled;
673
+ // TLC starts a new DFIDWorker thread for each level, whose generator for random values starts over from the seed.
674
+ const random = createJavaRandom(runtime.seed);
675
+ runtime.getRandom = () => random;
611
676
  searchLevel(level);
612
677
  checker.isDone = false;
613
678
  levelCode = checker.isKeepingCallStack ? NO_ERROR : checker.errorCode;
614
679
  if (levelCode !== NO_ERROR) return finish(levelCode);
615
- isTerminated = checker.stopCode === 2 || !checker.isMoreLevel;
680
+ isTerminated = checker.stopCode === "error" || !checker.isMoreLevel;
616
681
  }
617
682
  return finish(levelCode);
618
683
  };