tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c

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 (509) hide show
  1. package/dist/deciders.cjs +37 -36
  2. package/dist/deciders.js +55 -54
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +4 -1
  5. package/dist/index.d.ts +4 -1
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +1 -1
  9. package/dist/prove.cjs +146 -58
  10. package/dist/prove.js +143 -55
  11. package/dist/run.cjs +43 -43
  12. package/dist/run.js +45 -45
  13. package/dist/transfer.cjs +29 -26
  14. package/dist/transfer.js +43 -40
  15. package/dist/worker.cjs +1 -1
  16. package/dist/worker.js +1 -1
  17. package/package.json +1 -1
  18. package/src/ast.ts +3 -3
  19. package/src/bags.ts +46 -28
  20. package/src/check-trace.ts +2 -16
  21. package/src/check.ts +336 -88
  22. package/src/cli/runtime-invariants.ts +20 -56
  23. package/src/cli/tlapm.ts +261 -68
  24. package/src/cli/tlc-arguments.ts +2 -2
  25. package/src/cli/tlc-output.ts +4 -5
  26. package/src/cli/tlc-usage.ts +0 -1
  27. package/src/cli/tlc.ts +26 -7
  28. package/src/dependencies.ts +23 -2
  29. package/src/dfid.ts +9 -2
  30. package/src/environment.ts +27 -5
  31. package/src/errors.ts +1 -1
  32. package/src/evaluate.ts +9 -3
  33. package/src/exit-codes.ts +5 -2
  34. package/src/instances.ts +1 -1
  35. package/src/levels.ts +134 -86
  36. package/src/liveness-checker.ts +572 -204
  37. package/src/liveness.ts +47 -32
  38. package/src/obligations/action.ts +0 -2
  39. package/src/obligations/anonymize.ts +2 -6
  40. package/src/obligations/equality.ts +0 -2
  41. package/src/obligations/expression.ts +0 -2
  42. package/src/obligations/format.ts +0 -2
  43. package/src/obligations/generate.ts +0 -2
  44. package/src/obligations/index.ts +5 -3
  45. package/src/obligations/levels.ts +0 -2
  46. package/src/obligations/module.ts +0 -2
  47. package/src/obligations/normalize.ts +0 -2
  48. package/src/obligations/operators.ts +0 -2
  49. package/src/obligations/pragma.ts +2 -2
  50. package/src/obligations/printer.ts +0 -2
  51. package/src/obligations/proof.ts +0 -2
  52. package/src/obligations/regroup.ts +0 -2
  53. package/src/obligations/simplify.ts +0 -2
  54. package/src/obligations/subexpression.ts +0 -2
  55. package/src/obligations/substitution.ts +0 -2
  56. package/src/obligations/temporal.ts +0 -2
  57. package/src/obligations/tuples.ts +0 -2
  58. package/src/parallel-worker.ts +8 -2
  59. package/src/parallel.ts +7 -2
  60. package/src/parser.ts +224 -82
  61. package/src/pretty-print.ts +1 -1
  62. package/src/prover/deciders.ts +1 -8
  63. package/src/prover/isabelle/encode.ts +0 -2
  64. package/src/prover/isabelle/isar/attrib.ts +86 -49
  65. package/src/prover/isabelle/isar/context.ts +25 -26
  66. package/src/prover/isabelle/isar/induct.ts +2 -9
  67. package/src/prover/isabelle/isar/method.ts +5 -9
  68. package/src/prover/isabelle/isar/proof.ts +33 -18
  69. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  70. package/src/prover/isabelle/isar/theory.ts +16 -17
  71. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  72. package/src/prover/isabelle/isar/type-check.ts +0 -2
  73. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  74. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  75. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  76. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  77. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  78. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  79. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  80. package/src/prover/isabelle/provers/classical.ts +1 -3
  81. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  82. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  83. package/src/prover/isabelle/pure/consts.ts +0 -2
  84. package/src/prover/isabelle/pure/conv.ts +0 -2
  85. package/src/prover/isabelle/pure/drule.ts +0 -2
  86. package/src/prover/isabelle/pure/envir.ts +0 -2
  87. package/src/prover/isabelle/pure/goal.ts +0 -2
  88. package/src/prover/isabelle/pure/logic.ts +0 -2
  89. package/src/prover/isabelle/pure/name.ts +0 -2
  90. package/src/prover/isabelle/pure/net.ts +0 -2
  91. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  92. package/src/prover/isabelle/pure/pattern.ts +0 -2
  93. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  94. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  95. package/src/prover/isabelle/pure/search.ts +0 -2
  96. package/src/prover/isabelle/pure/seq.ts +0 -2
  97. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  98. package/src/prover/isabelle/pure/table.ts +0 -2
  99. package/src/prover/isabelle/pure/tactic.ts +0 -2
  100. package/src/prover/isabelle/pure/tactical.ts +0 -2
  101. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  102. package/src/prover/isabelle/pure/term.ts +0 -2
  103. package/src/prover/isabelle/pure/thm.ts +0 -2
  104. package/src/prover/isabelle/pure/type.ts +0 -2
  105. package/src/prover/isabelle/pure/unify.ts +0 -2
  106. package/src/prover/isabelle/pure/variable.ts +0 -2
  107. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  108. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  109. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  110. package/src/prover/ocaml.ts +4 -1
  111. package/src/prover/prep/action.ts +1 -0
  112. package/src/prover/prep/methods.ts +50 -3
  113. package/src/prover/prep/normalize.ts +4 -1
  114. package/src/prover/prove.ts +58 -32
  115. package/src/prover/ptl/decide.ts +43 -63
  116. package/src/prover/smt/data.ts +51 -45
  117. package/src/prover/smt/encode.ts +1 -2
  118. package/src/prover/smt/rewrite.ts +3 -7
  119. package/src/prover/smt/simplify.ts +1 -1
  120. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  121. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  122. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  123. package/src/prover/smt/solver/act-cache.ts +0 -1
  124. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  125. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  126. package/src/prover/smt/solver/aig.ts +2 -3
  127. package/src/prover/smt/solver/arith-rewriter.ts +3 -6
  128. package/src/prover/smt/solver/arith-terms.ts +0 -2
  129. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  130. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  131. package/src/prover/smt/solver/asserted-formulas.ts +9 -3
  132. package/src/prover/smt/solver/ast-lt.ts +1 -2
  133. package/src/prover/smt/solver/ast-util.ts +3 -3
  134. package/src/prover/smt/solver/ast.ts +112 -156
  135. package/src/prover/smt/solver/auf-solver.ts +0 -1
  136. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  137. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  138. package/src/prover/smt/solver/bound-manager.ts +39 -29
  139. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  140. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  141. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  142. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  143. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  144. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  145. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  146. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  147. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  148. package/src/prover/smt/solver/card2bv.ts +1 -4
  149. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  150. package/src/prover/smt/solver/cg-table.ts +19 -16
  151. package/src/prover/smt/solver/check-logic.ts +6 -2
  152. package/src/prover/smt/solver/clause.ts +0 -1
  153. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  154. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  155. package/src/prover/smt/solver/context.ts +41 -14
  156. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  157. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  158. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  159. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/demodulator.ts +2 -5
  161. package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
  162. package/src/prover/smt/solver/der.ts +0 -1
  163. package/src/prover/smt/solver/diff-neq.ts +1 -3
  164. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  165. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  166. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  167. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  168. package/src/prover/smt/solver/e-matching.ts +6 -7
  169. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  170. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  171. package/src/prover/smt/solver/enode.ts +15 -2
  172. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  173. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  174. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
  175. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  176. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  177. package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
  178. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  179. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  180. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  181. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  182. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  183. package/src/prover/smt/solver/euf/egraph.ts +68 -43
  184. package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
  185. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  186. package/src/prover/smt/solver/euf/mam.ts +7 -55
  187. package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
  188. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  189. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  190. package/src/prover/smt/solver/euf/q-solver.ts +2 -2
  191. package/src/prover/smt/solver/euf/th-solver.ts +1 -10
  192. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  193. package/src/prover/smt/solver/expr-ref.ts +0 -1
  194. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  195. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  196. package/src/prover/smt/solver/factor.ts +37 -26
  197. package/src/prover/smt/solver/fd-solver.ts +3 -5
  198. package/src/prover/smt/solver/fingerprints.ts +0 -1
  199. package/src/prover/smt/solver/fix-dl-var.ts +1 -3
  200. package/src/prover/smt/solver/flat-literals.ts +0 -1
  201. package/src/prover/smt/solver/fm-tactic.ts +19 -14
  202. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  203. package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
  204. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  205. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  206. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  207. package/src/prover/smt/solver/goal.ts +3 -2
  208. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  209. package/src/prover/smt/solver/guard-set.ts +0 -1
  210. package/src/prover/smt/solver/hash.ts +0 -1
  211. package/src/prover/smt/solver/hashtable.ts +0 -1
  212. package/src/prover/smt/solver/inf-eps.ts +1 -2
  213. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  214. package/src/prover/smt/solver/internalizer.ts +41 -3
  215. package/src/prover/smt/solver/lackr.ts +0 -2
  216. package/src/prover/smt/solver/lbool.ts +0 -1
  217. package/src/prover/smt/solver/lia2card.ts +0 -1
  218. package/src/prover/smt/solver/lia2pb.ts +18 -5
  219. package/src/prover/smt/solver/literal.ts +0 -1
  220. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  221. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  222. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  223. package/src/prover/smt/solver/lp/containers.ts +7 -2
  224. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  225. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  226. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  227. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  228. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  229. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  230. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  231. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  232. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  233. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  234. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  235. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  236. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  237. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  238. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  239. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  240. package/src/prover/smt/solver/lp/nex.ts +2 -2
  241. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  242. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  243. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  244. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  245. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  246. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  247. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  248. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  249. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  250. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  251. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  252. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  253. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  254. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  255. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  256. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  257. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  258. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  259. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  260. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  261. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  262. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  263. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  264. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  265. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  266. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  267. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  268. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  269. package/src/prover/smt/solver/macro-finder.ts +1 -4
  270. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  271. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  272. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  273. package/src/prover/smt/solver/max-cliques.ts +0 -2
  274. package/src/prover/smt/solver/maxcore.ts +5 -14
  275. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  276. package/src/prover/smt/solver/maxlex.ts +0 -8
  277. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  278. package/src/prover/smt/solver/maxsmt.ts +0 -1
  279. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  280. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  281. package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
  282. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  283. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  284. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  285. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  286. package/src/prover/smt/solver/model-checker.ts +0 -1
  287. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  288. package/src/prover/smt/solver/model-finder.ts +0 -1
  289. package/src/prover/smt/solver/model-generator.ts +3 -2
  290. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  291. package/src/prover/smt/solver/model-printer.ts +0 -1
  292. package/src/prover/smt/solver/mpf.ts +2 -5
  293. package/src/prover/smt/solver/mus.ts +1 -3
  294. package/src/prover/smt/solver/muz/dl-context.ts +67 -9
  295. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  296. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  297. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  298. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  299. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  300. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  301. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  302. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  303. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  304. package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
  305. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  306. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  307. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  308. package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
  309. package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
  310. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
  311. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  312. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  313. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  314. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
  315. package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
  316. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  317. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  318. package/src/prover/smt/solver/nlqsat.ts +4 -4
  319. package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
  320. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  321. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  322. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  323. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  324. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  325. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  326. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  327. package/src/prover/smt/solver/nlsat/solver.ts +112 -99
  328. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  329. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  330. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  331. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  332. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  333. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  334. package/src/prover/smt/solver/nnf.ts +0 -1
  335. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  336. package/src/prover/smt/solver/occf.ts +0 -1
  337. package/src/prover/smt/solver/opt-context.ts +15 -10
  338. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  339. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  340. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  341. package/src/prover/smt/solver/opt-solver.ts +22 -11
  342. package/src/prover/smt/solver/opt-value.ts +0 -1
  343. package/src/prover/smt/solver/optsmt.ts +13 -12
  344. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  345. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  346. package/src/prover/smt/solver/pb-rewriter.ts +14 -20
  347. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  348. package/src/prover/smt/solver/poly-rewriter.ts +2 -3
  349. package/src/prover/smt/solver/probes.ts +4 -7
  350. package/src/prover/smt/solver/propagate-values.ts +4 -1
  351. package/src/prover/smt/solver/proto-model.ts +6 -7
  352. package/src/prover/smt/solver/pull-quant.ts +0 -1
  353. package/src/prover/smt/solver/purify-arith.ts +50 -16
  354. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  355. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  356. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  357. package/src/prover/smt/solver/qe-lite.ts +0 -1
  358. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  359. package/src/prover/smt/solver/qe.ts +48 -57
  360. package/src/prover/smt/solver/qel.ts +0 -1
  361. package/src/prover/smt/solver/qi-queue.ts +0 -1
  362. package/src/prover/smt/solver/qsat.ts +70 -91
  363. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  364. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  365. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  366. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  367. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  368. package/src/prover/smt/solver/random-gen.ts +0 -1
  369. package/src/prover/smt/solver/rational.ts +17 -1
  370. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  371. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  372. package/src/prover/smt/solver/reduce-args.ts +0 -1
  373. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  374. package/src/prover/smt/solver/ref-vector.ts +0 -1
  375. package/src/prover/smt/solver/relevancy.ts +0 -1
  376. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  377. package/src/prover/smt/solver/rewriter.ts +1 -2
  378. package/src/prover/smt/solver/rlimit.ts +13 -1
  379. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  380. package/src/prover/smt/solver/sat/big.ts +0 -1
  381. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  382. package/src/prover/smt/solver/sat/clause.ts +1 -6
  383. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  384. package/src/prover/smt/solver/sat/config.ts +4 -7
  385. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  386. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  387. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  388. package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
  389. package/src/prover/smt/solver/sat/model-converter.ts +2 -18
  390. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  391. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  392. package/src/prover/smt/solver/sat/probing.ts +22 -21
  393. package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
  394. package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
  395. package/src/prover/smt/solver/sat/scc.ts +0 -1
  396. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  397. package/src/prover/smt/solver/sat/solver.ts +45 -68
  398. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  399. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  400. package/src/prover/smt/solver/search-tree.ts +0 -1
  401. package/src/prover/smt/solver/seq-axioms.ts +20 -36
  402. package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
  403. package/src/prover/smt/solver/seq-derive.ts +9 -15
  404. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  405. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  406. package/src/prover/smt/solver/seq-factory.ts +0 -1
  407. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  408. package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
  409. package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
  410. package/src/prover/smt/solver/seq-re-util.ts +2 -5
  411. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  412. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  413. package/src/prover/smt/solver/seq-rewriter.ts +31 -34
  414. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  415. package/src/prover/smt/solver/seq-subset.ts +0 -1
  416. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  417. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  418. package/src/prover/smt/solver/smt-kernel.ts +8 -3
  419. package/src/prover/smt/solver/smt-logics.ts +0 -1
  420. package/src/prover/smt/solver/smt-setup.ts +18 -14
  421. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  422. package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
  423. package/src/prover/smt/solver/smtlib-script.ts +957 -750
  424. package/src/prover/smt/solver/solve-eqs.ts +11 -19
  425. package/src/prover/smt/solver/solver.ts +1 -2
  426. package/src/prover/smt/solver/static-features.ts +0 -2
  427. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  428. package/src/prover/smt/solver/tactic.ts +77 -18
  429. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  430. package/src/prover/smt/solver/theory-array.ts +25 -60
  431. package/src/prover/smt/solver/theory-bv.ts +15 -54
  432. package/src/prover/smt/solver/theory-char.ts +0 -1
  433. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  434. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  435. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  436. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  437. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  438. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
  439. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  440. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  441. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
  442. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  443. package/src/prover/smt/solver/theory-lra.ts +0 -2
  444. package/src/prover/smt/solver/theory-pb.ts +12 -11
  445. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  446. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  447. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  448. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  449. package/src/prover/smt/solver/theory-seq-state.ts +8 -26
  450. package/src/prover/smt/solver/theory-seq.ts +32 -55
  451. package/src/prover/smt/solver/theory.ts +16 -2
  452. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  453. package/src/prover/smt/solver/var-subst.ts +2 -3
  454. package/src/prover/smt/table.ts +3 -2
  455. package/src/prover/zenon/decide.ts +9 -13
  456. package/src/prover/zenon/encode.ts +0 -2
  457. package/src/prover/zenon/eqrel.ts +0 -2
  458. package/src/prover/zenon/equality-rules.ts +24 -2
  459. package/src/prover/zenon/expr.ts +21 -2
  460. package/src/prover/zenon/index-table.ts +7 -4
  461. package/src/prover/zenon/isar-case.ts +1 -3
  462. package/src/prover/zenon/isar.ts +2 -4
  463. package/src/prover/zenon/llproof.ts +0 -2
  464. package/src/prover/zenon/mltoll.ts +0 -2
  465. package/src/prover/zenon/node.ts +12 -13
  466. package/src/prover/zenon/parse.ts +0 -2
  467. package/src/prover/zenon/phrase.ts +1 -3
  468. package/src/prover/zenon/proof.ts +0 -2
  469. package/src/prover/zenon/propositional-rules.ts +0 -2
  470. package/src/prover/zenon/rules.ts +2 -3
  471. package/src/prover/zenon/search.ts +0 -2
  472. package/src/prover/zenon/tla/functions.ts +0 -2
  473. package/src/prover/zenon/tla/llproof.ts +0 -2
  474. package/src/prover/zenon/tla/records.ts +0 -2
  475. package/src/prover/zenon/tla/rewrites.ts +0 -2
  476. package/src/prover/zenon/tla/sets.ts +1 -3
  477. package/src/prover/zenon/tla/terms.ts +0 -2
  478. package/src/prover/zenon/tla/tla.ts +0 -2
  479. package/src/resolve.ts +264 -77
  480. package/src/runtime.ts +6 -0
  481. package/src/sany/generation.ts +1 -13
  482. package/src/sany/generator-definitions.ts +2 -1
  483. package/src/sany/generator-expressions.ts +30 -27
  484. package/src/sany/generator-proofs.ts +1 -1
  485. package/src/sany/generator.ts +2 -1
  486. package/src/sany/levels.ts +0 -2
  487. package/src/sany/linter.ts +0 -2
  488. package/src/sany/nodes.ts +1 -1
  489. package/src/sany/selectors.ts +6 -5
  490. package/src/search.ts +198 -45
  491. package/src/simulate.ts +3 -0
  492. package/src/standard-definitions.ts +4 -0
  493. package/src/state-graph.ts +0 -2
  494. package/src/subexpressions.ts +165 -78
  495. package/src/successors.ts +1 -1
  496. package/src/symmetry.ts +2 -2
  497. package/src/tableau.ts +2 -2
  498. package/src/tlc/fingerprint.ts +81 -9
  499. package/src/tlc/jar-data.ts +12 -0
  500. package/src/tlc/order.ts +14 -3
  501. package/src/tlc/summary.ts +29 -14
  502. package/src/tlc/tlcext-operators.ts +61 -16
  503. package/src/tlc/trace-spec.ts +2 -3
  504. package/src/typed-tier.ts +6541 -0
  505. package/src/typescript/types.ts +2 -2
  506. package/src/values.ts +1 -1
  507. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  508. package/src/prover/smt/solver/z3-license.txt +0 -10
  509. package/src/prover/zenon/LICENSE +0 -32
package/src/check.ts CHANGED
@@ -47,6 +47,7 @@ import {
47
47
  getStateHash,
48
48
  isSameState,
49
49
  markSeenState,
50
+ type StateTable,
50
51
  } from "./fingerprints";
51
52
  import type { JavaOverride } from "./java-overrides";
52
53
  import {
@@ -109,6 +110,7 @@ import {
109
110
  import { getFingerprintDistance, OUT_DEGREE_BUCKETS } from "./tlc/summary";
110
111
  import { createActionRecord, createCounterExample } from "./tlc/tlcext-operators";
111
112
  import type { TlcVersion } from "./tlc/version";
113
+ import { runTypedSearch, type TypedResult } from "./typed-tier";
112
114
  import {
113
115
  createCanonicalizer,
114
116
  createModelValue,
@@ -148,6 +150,8 @@ export interface CheckOptions {
148
150
  isTool?: boolean;
149
151
  /** TLC's -continue: reports each violation through onProgress and goes on. */
150
152
  isContinued?: boolean;
153
+ /** Skips fingerprintDistance, which takes fingerprinting every state again after the search. */
154
+ isFingerprintDistanceSkipped?: boolean;
151
155
  moduleOperators?: ModuleOperator[];
152
156
  /** TLC's trace exploration spec, and the binary trace TLC records for it unless -noTEBin. */
153
157
  traceSpec?: TraceSpecOptions;
@@ -202,7 +206,7 @@ export type CheckProgress =
202
206
  branches: number;
203
207
  /** Whether TLC checks the complete state graph. */
204
208
  isComplete: boolean;
205
- /** How many states of the graph each branch has. */
209
+ /** How many states the graphs of all branches have together. */
206
210
  states: number;
207
211
  statistics: SearchStatistics;
208
212
  }
@@ -411,6 +415,15 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
411
415
  key.startsWith(`${name}${KEY_SEPARATOR}`),
412
416
  ),
413
417
  });
418
+ const getCoverage = () =>
419
+ coverage?.relations.some((relation) => relation.kind === "next")
420
+ ? getCoverageReport(
421
+ coverage,
422
+ environment,
423
+ specification.variableLocations,
424
+ search?.getTlcOrder() ?? [],
425
+ )
426
+ : undefined;
414
427
  const createResult = (
415
428
  status: CheckStatus,
416
429
  violation?: ReportedViolation,
@@ -431,14 +444,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
431
444
  initialStates: computedInitialStates,
432
445
  outDegrees: undefined,
433
446
  fingerprintDistance: undefined,
434
- coverage: coverage?.relations.some((relation) => relation.kind === "next")
435
- ? getCoverageReport(
436
- coverage,
437
- environment,
438
- specification.variableLocations,
439
- search?.getTlcOrder() ?? [],
440
- )
441
- : undefined,
447
+ coverage: getCoverage(),
442
448
  ...(traceSpec !== undefined && { traceSpec }),
443
449
  };
444
450
  };
@@ -457,14 +463,20 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
457
463
  const createSuccess = (): CheckResult => ({
458
464
  ...createResult("success"),
459
465
  outDegrees: [...outDegrees],
460
- fingerprintDistance: getFingerprintDistance(
461
- runtime.distinctStates,
462
- runtime.generatedStates,
463
- () =>
464
- search
465
- ? search.getStoredFingerprints(states, fingerprintStates)
466
- : BigInt64Array.from(states, runtime.getFingerprint),
467
- ),
466
+ fingerprintDistance: options.isFingerprintDistanceSkipped
467
+ ? undefined
468
+ : getFingerprintDistance(runtime.distinctStates, runtime.generatedStates, (visit) =>
469
+ visit(
470
+ search
471
+ ? search.getStoredFingerprints(
472
+ exploredStates.length === 0 ? states : states.concat(exploredStates),
473
+ exploredStates.length === 0
474
+ ? fingerprintStates
475
+ : fingerprintStates.concat(exploredFingerprintStates),
476
+ )
477
+ : BigInt64Array.from(states, runtime.getFingerprint),
478
+ ),
479
+ ),
468
480
  });
469
481
 
470
482
  const search = createSearch(
@@ -474,6 +486,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
474
486
  () => created.order.getDeclarationOrder("variable"),
475
487
  options.onProgress,
476
488
  specification.moduleOperators,
489
+ specification.runtimeInvariants,
477
490
  );
478
491
  const findViolatedAssumption = () =>
479
492
  findAssumptionViolation(specification.assumptions, environment);
@@ -550,12 +563,6 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
550
563
  const getFingerprintState = search.getFingerprintState;
551
564
  // Tool's constructor splits the next-state relation into actions before TLC checks anything.
552
565
  const nextActions = getDescription().actions;
553
- runtime.getSuccessorAction = (state, next) =>
554
- nextActions.find((action) =>
555
- getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
556
- successor.state.every((value, index) => isSameValue(value, next[index])),
557
- ),
558
- );
559
566
  const addCoverageRelations = (kind: "init" | "next", actions: SpecAction[]) =>
560
567
  actions.map((action): CoveredAction => ({
561
568
  ...action,
@@ -605,6 +612,17 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
605
612
  );
606
613
  return successors;
607
614
  };
615
+ // TLC generates the successors of each action again, which its coverage counts.
616
+ const findSuccessorAction = (state: Value[], isMatch: (successor: Successor) => boolean) =>
617
+ coverage
618
+ ? coverageActions.find((item) => getCoveredSuccessors(item, state).some(isMatch))
619
+ : nextActions.find((item) =>
620
+ getSuccessors(item.expression, state, environment, item.scope).some(isMatch),
621
+ );
622
+ runtime.getSuccessorAction = (state, next) =>
623
+ findSuccessorAction(state, (successor) =>
624
+ successor.state.every((value, index) => isSameValue(value, next[index])),
625
+ );
608
626
  const rejectIncompleteInitialState = (partial: (Value | undefined)[]) => {
609
627
  throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
610
628
  };
@@ -623,8 +641,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
623
641
  return (state: Value[], callStack: CallStack | undefined) => {
624
642
  fingerprintReplayed(state, getFingerprintState(state), callStack);
625
643
  const fingerprintState = getFingerprintState(state);
644
+ const hash = getStateHash(fingerprintState);
626
645
  const isSeen =
627
- findStateIndex(seenStates, getStateHash(fingerprintState), fingerprintState) !== -1 ||
646
+ findStateIndex(seenStates, hash, fingerprintState) !== -1 ||
647
+ isExplored(hash, fingerprintState) ||
628
648
  replayed.some((seen) => isSameState(seen, fingerprintState));
629
649
  if (isSeen) return false;
630
650
  replayed.push(fingerprintState);
@@ -711,28 +731,38 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
711
731
  if (spec.next === undefined) return successors;
712
732
  const livenessSource = current.livenessSource;
713
733
  current.livenessSource = source;
734
+ const addSuccessor = (successor: Value[]) => {
735
+ canonicalizeState(successor);
736
+ const isInModel =
737
+ search.satisfiesConstraints(successor, state) &&
738
+ search.satisfiesActionConstraints(state, successor);
739
+ if (!isInModel) return;
740
+ const fingerprintState = getFingerprintState(successor);
741
+ const hash = getStateHash(fingerprintState);
742
+ const index = findStateIndex(seenStates, hash, fingerprintState);
743
+ successors.push({
744
+ index: index === -1 ? getPendingIndex(hash, fingerprintState) : index,
745
+ state: successor,
746
+ });
747
+ };
714
748
  try {
715
- forEachSuccessor(
716
- spec.next,
717
- state,
718
- environment,
719
- (successor) => {
720
- canonicalizeState(successor.state);
721
- const isInModel =
722
- search.satisfiesConstraints(successor.state, state) &&
723
- search.satisfiesActionConstraints(state, successor.state);
724
- if (!isInModel) return false;
725
- const fingerprintState = getFingerprintState(successor.state);
726
- const index = findStateIndex(
727
- seenStates,
728
- getStateHash(fingerprintState),
729
- fingerprintState,
730
- );
731
- successors.push({ index, state: successor.state });
732
- return false;
733
- },
734
- spec.scope,
735
- );
749
+ // TLC's coverage counts the successors of each action the graph generates again.
750
+ if (coverage) {
751
+ coverageActions.forEach((action) =>
752
+ walkCoveredSuccessors(action, state, addSuccessor),
753
+ );
754
+ } else {
755
+ forEachSuccessor(
756
+ spec.next,
757
+ state,
758
+ environment,
759
+ (successor) => {
760
+ addSuccessor(successor.state);
761
+ return false;
762
+ },
763
+ spec.scope,
764
+ );
765
+ }
736
766
  } finally {
737
767
  current.livenessSource = livenessSource;
738
768
  }
@@ -751,6 +781,23 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
751
781
  const actions: (string | undefined)[] = [];
752
782
  const depths: number[] = [];
753
783
  const seenStates = createStateTable(fingerprintStates);
784
+ const exploredStates: Value[][] = [];
785
+ const exploredFingerprintStates: Value[][] = [];
786
+ let exploredTable: StateTable | undefined;
787
+ const isExplored = (hash: number, fingerprintState: Value[]) =>
788
+ exploredTable !== undefined && findStateIndex(exploredTable, hash, fingerprintState) !== -1;
789
+ const pendingFingerprintStates: Value[][] = [];
790
+ let pendingStates: StateTable | undefined;
791
+ const getPendingIndex = (hash: number, fingerprintState: Value[]) => {
792
+ pendingStates ??= createStateTable(pendingFingerprintStates);
793
+ const found = findStateIndex(pendingStates, hash, fingerprintState);
794
+ const position = found === -1 ? pendingFingerprintStates.length : found;
795
+ if (found === -1) {
796
+ markSeenState(pendingStates, hash, position);
797
+ pendingFingerprintStates.push(fingerprintState);
798
+ }
799
+ return -2 - position;
800
+ };
754
801
  const canonicalizeState = createCanonicalizer();
755
802
 
756
803
  const toRecord = search.toRecord;
@@ -851,7 +898,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
851
898
  };
852
899
  let unstoredFingerprint: Value[] | undefined;
853
900
  const countDistinctState = (depth: number) => {
854
- runtime.distinctStates = states.length + 1;
901
+ runtime.distinctStates = states.length + exploredStates.length + 1;
855
902
  searchDepth = Math.max(searchDepth, depth);
856
903
  runtime.diameter = Math.max(runtime.diameter, depth);
857
904
  };
@@ -892,18 +939,27 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
892
939
  tracedSteps,
893
940
  captureOutput,
894
941
  getInitialStates: getSpecInitialStates,
895
- findSuccessorAction: (state, isMatch) =>
896
- coverage
897
- ? coverageActions.find((item) => getCoveredSuccessors(item, state).some(isMatch))
898
- : nextActions.find((item) =>
899
- getSuccessors(item.expression, state, environment, item.scope).some(isMatch),
900
- ),
942
+ findSuccessorAction,
901
943
  });
902
944
  const getPath = (index: number): Value[][] =>
903
945
  index === -1 ? [] : [...getPath(parents[index]), states[index]];
946
+ // TLC adds a successor's fingerprint to its set before it checks the invariants of the successor.
904
947
  runtime.isSeen = (state) => {
905
948
  const fingerprintState = getFingerprintState(state);
906
- return findStateIndex(seenStates, getStateHash(fingerprintState), fingerprintState) !== -1;
949
+ const hash = getStateHash(fingerprintState);
950
+ return (
951
+ findStateIndex(seenStates, hash, fingerprintState) !== -1 ||
952
+ isExplored(hash, fingerprintState) ||
953
+ (unstoredFingerprint !== undefined && isSameState(unstoredFingerprint, fingerprintState))
954
+ );
955
+ };
956
+ runtime.markExplored = (state) => {
957
+ const fingerprintState = getFingerprintState(state);
958
+ exploredTable ??= createStateTable(exploredFingerprintStates);
959
+ markSeenState(exploredTable, getStateHash(fingerprintState), exploredStates.length);
960
+ exploredStates.push(state);
961
+ exploredFingerprintStates.push(fingerprintState);
962
+ runtime.distinctStates++;
907
963
  };
908
964
  runtime.getBehavior = (state) => {
909
965
  const index = state === current.candidate ? -1 : states.indexOf(state);
@@ -994,18 +1050,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
994
1050
  addState(state, fingerprintState, -1, undefined);
995
1051
  return undefined;
996
1052
  };
997
- const visitSuccessor = (
998
- index: number,
999
- successor: Successor,
1000
- liveSuccessors: LiveSuccessor[],
1001
- source: GraphState | undefined,
1002
- action: SpecAction | undefined,
1003
- ) => {
1004
- const state = states[index];
1005
- runtime.generatedStates++;
1006
- current.candidate = successor.state;
1007
- current.candidateLevel = depths[index] + 1;
1008
- if (isCanonicalizedFirst) canonicalizeState(successor.state);
1053
+ // Looks a successor up, where the constraints keep it in the model, as the search does before it
1054
+ // checks the successor.
1055
+ const lookUpSuccessor = (state: Value[], successor: Successor) => {
1009
1056
  const fingerprintState = getFingerprintState(successor.state);
1010
1057
  const hash = getStateHash(fingerprintState);
1011
1058
  const foundIndex = findStateIndex(seenStates, hash, fingerprintState);
@@ -1018,15 +1065,36 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1018
1065
  successor.state.forEach(markFingerprinted);
1019
1066
  }
1020
1067
  const existing = isInModel ? foundIndex : -1;
1021
- if (source && isInModel) {
1068
+ return {
1069
+ fingerprintState,
1070
+ hash,
1071
+ isInModel,
1072
+ existing,
1073
+ isSeen: existing !== -1 || (isInModel && isExplored(hash, fingerprintState)),
1074
+ };
1075
+ };
1076
+ const visitSuccessor = (
1077
+ index: number,
1078
+ successor: Successor,
1079
+ liveSuccessors: LiveSuccessor[],
1080
+ source: GraphState | undefined,
1081
+ action: SpecAction | undefined,
1082
+ ) => {
1083
+ const state = states[index];
1084
+ runtime.generatedStates++;
1085
+ current.candidate = successor.state;
1086
+ current.candidateLevel = depths[index] + 1;
1087
+ if (isCanonicalizedFirst) canonicalizeState(successor.state);
1088
+ const found = lookUpSuccessor(state, successor);
1089
+ if (source && found.isInModel) {
1022
1090
  stateWriter?.writeSuccessor(
1023
1091
  source,
1024
1092
  getGraphState(successor.state, depths[index] + 1),
1025
- existing !== -1,
1093
+ found.isSeen,
1026
1094
  action && getGraphAction(action),
1027
1095
  );
1028
1096
  }
1029
- if (source && !isInModel && options.dump?.constrained) {
1097
+ if (source && !found.isInModel && options.dump?.constrained) {
1030
1098
  const excluded = getGraphState(successor.state, depths[index] + 1);
1031
1099
  search
1032
1100
  .getExcludingConstraints(state, successor.state)
@@ -1039,20 +1107,26 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1039
1107
  ),
1040
1108
  );
1041
1109
  }
1042
- if (existing !== -1 && liveness) {
1043
- const stored = states[existing];
1110
+ if (found.existing !== -1 && liveness) {
1111
+ const stored = states[found.existing];
1044
1112
  const isStored = stored.every((value, position) => value === successor.state[position]);
1045
- liveSuccessors.push({ index: existing, state: isStored ? stored : successor.state });
1113
+ liveSuccessors.push({ index: found.existing, state: isStored ? stored : successor.state });
1114
+ }
1115
+ if (found.isSeen && found.existing === -1 && liveness) {
1116
+ liveSuccessors.push({
1117
+ index: getPendingIndex(found.hash, found.fingerprintState),
1118
+ state: successor.state,
1119
+ });
1046
1120
  }
1047
- const isNew = isInModel && existing === -1;
1121
+ const isNew = found.isInModel && !found.isSeen;
1048
1122
  if (isNew && liveness) liveSuccessors.push({ index: states.length, state: successor.state });
1049
- unstoredFingerprint = isNew ? fingerprintState : undefined;
1123
+ unstoredFingerprint = isNew ? found.fingerprintState : undefined;
1050
1124
  if (isNew) {
1051
1125
  countDistinctState(depths[index] + 1);
1052
1126
  newStateCount++;
1053
1127
  if (coverage) coverage.secondary[coveredNode]++;
1054
1128
  }
1055
- if (existing === -1) {
1129
+ if (!found.isSeen) {
1056
1130
  try {
1057
1131
  const violated = search.findViolatedInvariant(successor.state, state);
1058
1132
  const violation = violated && { name: violated.name, ...traces.getTrace(index, successor) };
@@ -1082,8 +1156,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1082
1156
  if (!isNew) return undefined;
1083
1157
  if (coverage) countCoverageVariables(coverage, successor.state);
1084
1158
  if (!isCanonicalizedFirst) canonicalizeState(successor.state);
1085
- markSeenState(seenStates, hash, states.length);
1086
- addState(successor.state, fingerprintState, index, successor.action);
1159
+ markSeenState(seenStates, found.hash, states.length);
1160
+ if (pendingStates) {
1161
+ const pending = findStateIndex(pendingStates, found.hash, found.fingerprintState);
1162
+ if (pending !== -1) liveness?.storeState(-2 - pending, states.length);
1163
+ }
1164
+ addState(successor.state, found.fingerprintState, index, successor.action);
1087
1165
  runtime.queueSize++;
1088
1166
  return undefined;
1089
1167
  };
@@ -1096,6 +1174,57 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1096
1174
  const assumptionViolation = findViolatedAssumption();
1097
1175
  if (assumptionViolation) return createResult("assumption-violation", assumptionViolation);
1098
1176
  options.onProgress?.({ kind: "initial-states-started" });
1177
+ const typedChecks =
1178
+ !options.isContinued &&
1179
+ options.dump === undefined &&
1180
+ // A set of small integers on the tier is a 31-bit mask, which a lower bound could overflow.
1181
+ options.maxSetSize === undefined &&
1182
+ !hasPostconditions
1183
+ ? search.getTypedChecks(liveness?.solutions)
1184
+ : undefined;
1185
+ const typed =
1186
+ typedChecks &&
1187
+ runTypedSearch(environment, {
1188
+ ...typedChecks,
1189
+ isDeadlockChecked: config.checkDeadlock,
1190
+ isFingerprinted: !options.isFingerprintDistanceSkipped,
1191
+ livenessCheck: options.livenessCheck ?? "default",
1192
+ });
1193
+ if (typed && !typed.deadlock && !typed.violation && !typed.lasso) {
1194
+ for (let count = 2; count < typed.initialStates.generated; count *= 2) {
1195
+ reportInitialStatesProgress(count, options.onProgress);
1196
+ }
1197
+ options.onProgress?.({ kind: "initial-states-computed", initialStates: typed.initialStates });
1198
+ const statistics = {
1199
+ ...createResult("success"),
1200
+ generatedStates: typed.generatedStates,
1201
+ distinctStates: typed.distinctStates,
1202
+ queuedStates: 0,
1203
+ depth: typed.generatedStates === 0 ? 0 : Math.max(typed.depth, 1),
1204
+ initialStates: typed.initialStates,
1205
+ };
1206
+ if (liveness && options.livenessCheck !== "off") {
1207
+ options.onProgress?.({
1208
+ kind: "liveness-started",
1209
+ branches: liveness.branches,
1210
+ isComplete: true,
1211
+ states: liveness.branches * typed.distinctStates,
1212
+ statistics,
1213
+ });
1214
+ options.onProgress?.({ kind: "liveness-finished" });
1215
+ }
1216
+ return {
1217
+ ...statistics,
1218
+ outDegrees: typed.outDegrees,
1219
+ fingerprintDistance: options.isFingerprintDistanceSkipped
1220
+ ? undefined
1221
+ : getFingerprintDistance(
1222
+ typed.distinctStates,
1223
+ typed.generatedStates,
1224
+ typed.forEachFingerprintRun,
1225
+ ),
1226
+ };
1227
+ }
1099
1228
  if (spec.init !== undefined) {
1100
1229
  let overflowState: Value[] | undefined;
1101
1230
  const reportInitialFailure = (error: unknown, state: Value[]) => {
@@ -1336,6 +1465,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1336
1465
  return {
1337
1466
  ...result,
1338
1467
  violation: appendTraceOutput(result.violation, live.lines),
1468
+ // TLC adds the state to the behavior graph before it reports the coverage.
1469
+ coverage: getCoverage(),
1339
1470
  ...(live.result && { liveCallStack: live.result }),
1340
1471
  };
1341
1472
  }
@@ -1467,29 +1598,136 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1467
1598
  const startedAt = performance.now();
1468
1599
  const periodic = {
1469
1600
  at: startedAt + PERIODIC_START,
1470
- size: 1,
1601
+ checkedCounts: liveness?.getStateCounts().map(() => 1) ?? [],
1471
1602
  time: 0,
1472
1603
  coverageCount: Math.trunc(options.coverage ?? 0),
1473
1604
  };
1474
- const findPeriodicViolation = (expanded: number) => {
1605
+ const getGraphStates = (checker: LivenessChecker) =>
1606
+ checker.getStateCounts().reduce((sum, count) => sum + count, 0);
1607
+ const findPeriodicViolation = (checker: LivenessChecker) => {
1475
1608
  const now = performance.now();
1476
- const isGrown = (expanded - periodic.size) / periodic.size > LIVENESS_GROWTH;
1609
+ const counts = checker.getStateCounts();
1610
+ const isGrown = counts.some(
1611
+ (count, branch) =>
1612
+ (count - periodic.checkedCounts[branch]) / periodic.checkedCounts[branch] > LIVENESS_GROWTH,
1613
+ );
1477
1614
  if (!isGrown || periodic.time > (now - startedAt) * LIVENESS_RATIO) return undefined;
1478
- periodic.size = expanded;
1479
- if (!liveness) return undefined;
1615
+ periodic.checkedCounts = counts;
1480
1616
  options.onProgress?.({
1481
1617
  kind: "liveness-started",
1482
- branches: liveness.branches,
1618
+ branches: checker.branches,
1483
1619
  isComplete: false,
1484
- states: expanded,
1620
+ states: getGraphStates(checker),
1485
1621
  statistics: createResult("success"),
1486
1622
  });
1487
- const lasso = liveness.findViolation();
1623
+ const lasso = checker.findViolation();
1488
1624
  if (!lasso) options.onProgress?.({ kind: "liveness-finished" });
1489
1625
  periodic.time += performance.now() - now;
1490
1626
  return lasso;
1491
1627
  };
1492
- for (let index = 0; index < states.length && !runtime.isStopped; index++) {
1628
+ const adoptTypedSearch = (searched: TypedResult) => {
1629
+ runtime.generatedStates = searched.generatedStates;
1630
+ runtime.distinctStates = searched.distinctStates;
1631
+ runtime.queueSize = searched.queuedStates;
1632
+ runtime.diameter = searched.depth;
1633
+ searchDepth = searched.depth;
1634
+ outDegrees.splice(0, outDegrees.length, ...searched.outDegrees);
1635
+ newStateCount = 0;
1636
+ };
1637
+ // The tier found a state without successors, or a successor that violates an invariant or an
1638
+ // action property. The interpreter rebuilds the tier's path to it and reports it, as it would after
1639
+ // its own search.
1640
+ const path = typed?.deadlock ?? typed?.violation;
1641
+ const initialIndex = path ? states.findIndex((state) => path.isPathState(0, state)) : -1;
1642
+ if (typed && path && initialIndex !== -1) {
1643
+ const steps: { successor: Successor; action: SpecAction | undefined }[] = [];
1644
+ const getLastState = () => steps.at(-1)?.successor.state ?? states[initialIndex];
1645
+ for (let position = 1; position === steps.length + 1 && position < path.length; position++) {
1646
+ // The interpreter expands only the states it stores, which it has canonicalized.
1647
+ canonicalizeState(getLastState());
1648
+ forEachActionSuccessor(getLastState(), undefined, (successor, action) => {
1649
+ if (!path.isPathState(position, successor.state)) return false;
1650
+ steps.push({ successor, action });
1651
+ return true;
1652
+ });
1653
+ }
1654
+ const isRebuilt = steps.length === path.length - 1;
1655
+ const violating = typed.violation && isRebuilt ? steps.pop() : undefined;
1656
+ if (violating && isCanonicalizedFirst) canonicalizeState(violating.successor.state);
1657
+ const violatedInvariant =
1658
+ violating && search.findViolatedInvariant(violating.successor.state, getLastState());
1659
+ const violatedProperty =
1660
+ violating &&
1661
+ !violatedInvariant &&
1662
+ search.findViolatedActionProperty(getLastState(), violating.successor.state);
1663
+ const violated = violatedInvariant ?? violatedProperty;
1664
+ const isDeadlocked =
1665
+ typed.deadlock !== undefined &&
1666
+ isRebuilt &&
1667
+ forEachActionSuccessor(getLastState(), undefined, () => true) === 0;
1668
+ if (isDeadlocked || violated) {
1669
+ const parent = { index: initialIndex };
1670
+ for (const step of steps) {
1671
+ visitSuccessor(parent.index, step.successor, [], undefined, step.action);
1672
+ parent.index = states.length - 1;
1673
+ }
1674
+ adoptTypedSearch(typed);
1675
+ Object.assign(current, { index: parent.index, candidate: undefined, isExpanding: true });
1676
+ if (violating && violated) {
1677
+ lookUpSuccessor(states[parent.index], violating.successor);
1678
+ current.candidate = violating.successor.state;
1679
+ current.candidateLevel = depths[parent.index] + 1;
1680
+ return withOutDegrees(
1681
+ reportViolation(violatedInvariant ? "invariant-violation" : "liveness-violation", {
1682
+ name: violated.name,
1683
+ ...traces.getTrace(parent.index, violating.successor),
1684
+ }),
1685
+ );
1686
+ }
1687
+ const result = expandState(parent.index, []);
1688
+ if (result) return result;
1689
+ }
1690
+ }
1691
+ // The tier found a behavior that violates a temporal property after its whole search. The
1692
+ // interpreter stores the paths to the lasso's states and reports it, as it would after its own.
1693
+ const lassoSteps = new Map<number, { successor: Successor; action: SpecAction | undefined }>();
1694
+ for (const entry of typed?.lasso?.states ?? []) {
1695
+ const initial = entry.parent === -1 ? states.find(entry.isState) : undefined;
1696
+ if (initial) {
1697
+ lassoSteps.set(entry.index, {
1698
+ successor: { state: initial, action: undefined },
1699
+ action: undefined,
1700
+ });
1701
+ }
1702
+ const parent = lassoSteps.get(entry.parent)?.successor.state;
1703
+ if (!parent) continue;
1704
+ // The interpreter expands only the states it stores, which it has canonicalized.
1705
+ canonicalizeState(parent);
1706
+ forEachActionSuccessor(parent, undefined, (successor, action) => {
1707
+ if (!entry.isState(successor.state)) return false;
1708
+ lassoSteps.set(entry.index, { successor, action });
1709
+ return true;
1710
+ });
1711
+ }
1712
+ const lassoIndexes = new Map<number, number>();
1713
+ const typedLasso =
1714
+ typed?.lasso && lassoSteps.size === typed.lasso.states.length ? typed.lasso : undefined;
1715
+ typedLasso?.states.forEach((entry) => {
1716
+ const step = lassoSteps.get(entry.index);
1717
+ const parent = lassoIndexes.get(entry.parent);
1718
+ if (step && parent !== undefined)
1719
+ visitSuccessor(parent, step.successor, [], undefined, step.action);
1720
+ lassoIndexes.set(
1721
+ entry.index,
1722
+ parent === undefined ? states.findIndex(entry.isState) : states.length - 1,
1723
+ );
1724
+ });
1725
+ if (typed && typedLasso) adoptTypedSearch(typed);
1726
+ for (
1727
+ let index = typedLasso ? states.length : 0;
1728
+ index < states.length && !runtime.isStopped;
1729
+ index++
1730
+ ) {
1493
1731
  current.index = index;
1494
1732
  current.candidate = undefined;
1495
1733
  runtime.queueSize = states.length - index - 1;
@@ -1508,7 +1746,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1508
1746
  newStateCount = 0;
1509
1747
  if ((isPeriodic || options.onProgress) && performance.now() >= periodic.at) {
1510
1748
  periodic.at = performance.now() + PROGRESS_INTERVAL;
1511
- const lasso = isPeriodic ? findPeriodicViolation(index + 1) : undefined;
1749
+ const lasso = isPeriodic && liveness ? findPeriodicViolation(liveness) : undefined;
1512
1750
  if (liveness && lasso) return reportLasso(liveness, lasso);
1513
1751
  const isCoverageDue = options.coverage !== undefined && periodic.coverageCount === 0;
1514
1752
  periodic.coverageCount = isCoverageDue
@@ -1530,11 +1768,21 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1530
1768
  kind: "liveness-started",
1531
1769
  branches: finalLiveness.branches,
1532
1770
  isComplete: true,
1533
- states: runtime.distinctStates,
1771
+ states: typedLasso
1772
+ ? finalLiveness.branches * runtime.distinctStates
1773
+ : getGraphStates(finalLiveness),
1534
1774
  statistics: createResult("success"),
1535
1775
  });
1536
1776
  }
1537
- const lasso = finalLiveness?.findViolation();
1777
+ const getLassoIndexes = (indexes: number[]) =>
1778
+ indexes.map((index) => lassoIndexes.get(index) ?? -1);
1779
+ const lasso = typedLasso
1780
+ ? {
1781
+ prefix: getLassoIndexes(typedLasso.prefix),
1782
+ cycle: getLassoIndexes(typedLasso.cycle),
1783
+ isCycleConstrained: typedLasso.isCycleConstrained,
1784
+ }
1785
+ : finalLiveness?.findViolation();
1538
1786
  if (finalLiveness && lasso) return reportLasso(finalLiveness, lasso);
1539
1787
 
1540
1788
  if (finalLiveness) options.onProgress?.({ kind: "liveness-finished" });