tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,1019 @@
1
+ import {
2
+ isLocallyResolved,
3
+ type Bound,
4
+ type Definition,
5
+ type Expression,
6
+ type SourceLocation,
7
+ type SourceRange,
8
+ } from "./ast";
9
+ import { formatRange } from "./errors";
10
+ import type { Environment, Scope } from "./evaluate";
11
+ import { getJavaHashCode } from "./java-hash";
12
+ import { getTlcFingerprint } from "./tlc/fingerprint";
13
+ import {
14
+ getCardinality,
15
+ isEmptySet,
16
+ isReducibleSet,
17
+ type IntervalValue,
18
+ type Value,
19
+ } from "./values";
20
+
21
+ export type CoverageKind = "init" | "next" | "invariant" | "constraint" | "implied";
22
+
23
+ interface CoverageRelation {
24
+ kind: CoverageKind;
25
+ label: string;
26
+ expression: Expression;
27
+ scope: Scope | undefined;
28
+ node: number;
29
+ }
30
+
31
+ export interface Coverage {
32
+ current: number;
33
+ expressions: (Expression | undefined)[];
34
+ ranges: (SourceRange | undefined)[];
35
+ firstChild: number[];
36
+ lastChild: number[];
37
+ nextSibling: number[];
38
+ prefixes: number[];
39
+ isPart: boolean[];
40
+ isPrimed: boolean[];
41
+ isUnchanged: boolean[];
42
+ recursive: number[];
43
+ lets: (number[] | undefined)[];
44
+ roots: number[];
45
+ primary: number[];
46
+ secondary: number[];
47
+ covered: WeakSet<Expression>;
48
+ values: WeakMap<object, number>;
49
+ registers: Uint8Array;
50
+ relations: CoverageRelation[];
51
+ }
52
+
53
+ export interface CoverageReport {
54
+ variables: CoverageVariable[];
55
+ relations: CoverageRelationReport[];
56
+ }
57
+
58
+ export interface CoverageOutput {
59
+ kind: "coverage";
60
+ coverage: CoverageReport;
61
+ }
62
+
63
+ interface CoverageVariable {
64
+ label: string;
65
+ distinct: number;
66
+ }
67
+
68
+ interface CoverageRelationReport {
69
+ kind: CoverageKind;
70
+ label: string;
71
+ distinct: number;
72
+ generated: number;
73
+ expressions: CoverageExpression[];
74
+ }
75
+
76
+ interface CoverageExpression {
77
+ location: string;
78
+ depth: number;
79
+ count: number;
80
+ cost: number;
81
+ }
82
+
83
+ interface Local {
84
+ name: string;
85
+ definition: Definition | undefined;
86
+ scope: Local | undefined;
87
+ parent: Local | undefined;
88
+ }
89
+
90
+ interface Resolved {
91
+ definition: Definition;
92
+ scope: Local | undefined;
93
+ }
94
+
95
+ const STANDARD_MODULES = new Set([
96
+ "FiniteSets",
97
+ "Sequences",
98
+ "Bags",
99
+ "Naturals",
100
+ "Integers",
101
+ "Reals",
102
+ "RealTime",
103
+ "Randomization",
104
+ "TLC",
105
+ ]);
106
+
107
+ const REGISTER_BITS = 10;
108
+ const REGISTERS = 1 << REGISTER_BITS;
109
+
110
+ export const createCoverage = (variableCount: number): Coverage => ({
111
+ current: -1,
112
+ expressions: [],
113
+ ranges: [],
114
+ firstChild: [],
115
+ lastChild: [],
116
+ nextSibling: [],
117
+ prefixes: [],
118
+ isPart: [],
119
+ isPrimed: [],
120
+ isUnchanged: [],
121
+ recursive: [],
122
+ lets: [],
123
+ roots: [],
124
+ primary: [],
125
+ secondary: [],
126
+ covered: new WeakSet(),
127
+ values: new WeakMap(),
128
+ registers: new Uint8Array(variableCount * REGISTERS),
129
+ relations: [],
130
+ });
131
+
132
+ export const createCoverageEnvironment = (
133
+ environment: Environment,
134
+ coverage: Coverage,
135
+ ): Environment => ({
136
+ ...environment,
137
+ evaluators: new WeakMap(),
138
+ entryEvaluators: new WeakMap(),
139
+ definitionEvaluators: new WeakMap(),
140
+ coverage,
141
+ });
142
+
143
+ const addNode = (
144
+ coverage: Coverage,
145
+ expression: Expression | undefined,
146
+ range: SourceRange | undefined,
147
+ parent: number,
148
+ isPart: boolean,
149
+ ) => {
150
+ const node = coverage.expressions.length;
151
+ coverage.expressions.push(expression);
152
+ coverage.ranges.push(range);
153
+ coverage.firstChild.push(-1);
154
+ coverage.lastChild.push(-1);
155
+ coverage.nextSibling.push(-1);
156
+ coverage.prefixes.push(-1);
157
+ coverage.isPart.push(isPart);
158
+ coverage.isPrimed.push(false);
159
+ coverage.isUnchanged.push(expression?.kind === "Unchanged");
160
+ coverage.recursive.push(-1);
161
+ coverage.lets.push(undefined);
162
+ coverage.roots.push(parent === -1 ? node : coverage.roots[parent]);
163
+ coverage.primary.push(0);
164
+ coverage.secondary.push(0);
165
+ if (expression) coverage.covered.add(expression);
166
+ if (parent === -1) return node;
167
+ const last = coverage.lastChild[parent];
168
+ if (last === -1) coverage.firstChild[parent] = node;
169
+ if (last !== -1) coverage.nextSibling[last] = node;
170
+ coverage.lastChild[parent] = node;
171
+ return node;
172
+ };
173
+
174
+ const findCoverageRelation = (coverage: Coverage, kind: CoverageKind, expression: Expression) =>
175
+ coverage.relations.find(
176
+ (relation) => relation.kind === kind && relation.expression === expression,
177
+ )?.node;
178
+
179
+ export const addCoverageRelation = (
180
+ coverage: Coverage,
181
+ kind: CoverageKind,
182
+ label: string,
183
+ expression: Expression,
184
+ scope?: Scope,
185
+ ) => {
186
+ const shared = kind === "next" ? findCoverageRelation(coverage, kind, expression) : undefined;
187
+ if (shared !== undefined) return shared;
188
+ const node = addNode(coverage, undefined, expression.location.range, -1, false);
189
+ coverage.relations.push({ kind, label, expression, scope, node });
190
+ return node;
191
+ };
192
+
193
+ const isSameRange = (left: SourceRange | undefined, right: SourceRange | undefined) =>
194
+ left !== undefined &&
195
+ right !== undefined &&
196
+ left.module === right.module &&
197
+ left.start.line === right.start.line &&
198
+ left.start.column === right.start.column &&
199
+ left.end.line === right.end.line &&
200
+ left.end.column === right.end.column;
201
+
202
+ export const getCoverageLabel = (
203
+ name: string | undefined,
204
+ expression: Expression,
205
+ environment: Environment,
206
+ ) => {
207
+ const definition = name === undefined ? undefined : environment.definitions.get(name);
208
+ const head = definition?.kind === "Operator" ? definition.head : undefined;
209
+ const range = expression.location.range;
210
+ if (!definition || !head) return `Action ${range ? formatRange(range) : "Unknown location"}`;
211
+ if (isSameRange(definition.body.location.range, range) || !range) {
212
+ return `${definition.name} ${formatRange(head)}`;
213
+ }
214
+ return `${definition.name} ${formatRange(head)} (${range.start.line} ${range.start.column} ${range.end.line} ${range.end.column})`;
215
+ };
216
+
217
+ const getRangeKey = (range: SourceRange) =>
218
+ `${range.module}:${range.start.line}:${range.start.column}:${range.end.line}:${range.end.column}`;
219
+
220
+ const spanRanges = (first: SourceRange | undefined, last: SourceRange | undefined) =>
221
+ first && last ? { module: first.module, start: first.start, end: last.end } : undefined;
222
+
223
+ const getStartRange = (location: SourceLocation, last: SourceRange | undefined) =>
224
+ last && {
225
+ module: last.module,
226
+ start: location.range?.start ?? { line: location.line, column: location.column },
227
+ end: last.end,
228
+ };
229
+
230
+ const getHashtableOrder = (definitions: Definition[]) => {
231
+ let buckets = Array.from({ length: 11 }, (): Definition[] => []);
232
+ definitions.forEach((definition, count) => {
233
+ if (count >= Math.floor(buckets.length * 0.75)) {
234
+ const grown = Array.from({ length: buckets.length * 2 + 1 }, (): Definition[] => []);
235
+ for (let index = buckets.length - 1; index >= 0; index--) {
236
+ buckets[index].forEach((entry) =>
237
+ grown[(getJavaHashCode(entry.name) & 0x7fffffff) % grown.length].unshift(entry),
238
+ );
239
+ }
240
+ buckets = grown;
241
+ }
242
+ buckets[(getJavaHashCode(definition.name) & 0x7fffffff) % buckets.length].unshift(definition);
243
+ });
244
+ return buckets.toReversed().flat();
245
+ };
246
+
247
+ const getBoundSets = (bounds: Bound[]) =>
248
+ bounds.flatMap((bound, index) =>
249
+ index > 0 && bounds[index - 1].set === bound.set ? [] : [bound.set],
250
+ );
251
+
252
+ const bindNames = (names: string[], locals: Local | undefined) =>
253
+ names.reduce<Local | undefined>(
254
+ (parent, name) => ({ name, definition: undefined, scope: undefined, parent }),
255
+ locals,
256
+ );
257
+
258
+ const getBoundNames = (bounds: Bound[]) =>
259
+ bounds.flatMap((bound) =>
260
+ bound.pattern.kind === "Name" ? [bound.pattern.name] : bound.pattern.names,
261
+ );
262
+
263
+ export const buildCoverage = (
264
+ coverage: Coverage,
265
+ environment: Environment,
266
+ primedRanges: SourceRange[],
267
+ ) => {
268
+ const primed = new Set(primedRanges.map(getRangeKey));
269
+ const stack: number[] = [];
270
+ const definitions: (Definition | undefined)[] = [];
271
+ const walking: Definition[] = [];
272
+ const letBodies = new Map<Expression, Expression>();
273
+
274
+ const resolve = (expression: Expression, name: string, locals: Local | undefined) => {
275
+ if (isLocallyResolved(expression)) {
276
+ for (let local = locals; local; local = local.parent) {
277
+ if (local.name !== name) continue;
278
+ return local.definition && { definition: local.definition, scope: local.scope };
279
+ }
280
+ return undefined;
281
+ }
282
+ const target = environment.substitutions.get(name) ?? name;
283
+ if (environment.variableIndex.has(target) || environment.constants.has(target)) {
284
+ return undefined;
285
+ }
286
+ const definition = environment.definitions.get(target);
287
+ const module = definition?.location.range?.module ?? definition?.body.location.range?.module;
288
+ return definition && !STANDARD_MODULES.has(module ?? "")
289
+ ? { definition, scope: undefined }
290
+ : undefined;
291
+ };
292
+
293
+ const enter = (
294
+ expression: Expression | undefined,
295
+ range: SourceRange | undefined,
296
+ walkChildren: () => void,
297
+ isPart = false,
298
+ definition?: Definition,
299
+ ) => {
300
+ const node = addNode(coverage, expression, range, stack.at(-1) ?? -1, isPart);
301
+ coverage.isPrimed[node] = range !== undefined && primed.has(getRangeKey(range));
302
+ const body = expression && letBodies.get(expression);
303
+ if (body) {
304
+ stack.forEach((outer) => {
305
+ if (coverage.expressions[outer] === body) (coverage.lets[outer] ??= []).push(node);
306
+ });
307
+ }
308
+ if (definition?.kind === "Operator" && definition.isRecursive) {
309
+ const outer = stack.findLast((item) => definitions[item] === definition);
310
+ if (outer !== undefined) coverage.recursive[node] = outer;
311
+ }
312
+ definitions[node] = definition;
313
+ stack.push(node);
314
+ walkChildren();
315
+ stack.pop();
316
+ return node;
317
+ };
318
+
319
+ const walkDefinition = (resolved: Resolved) => {
320
+ const definition = resolved.definition;
321
+ if (walking.includes(definition)) return;
322
+ walking.push(definition);
323
+ const names =
324
+ definition.kind === "Function"
325
+ ? getBoundNames(definition.bounds)
326
+ : definition.params.map((param) => param.name);
327
+ walk(definition.body, bindNames(names, resolved.scope));
328
+ if (definition.kind === "Function") {
329
+ getBoundSets(definition.bounds).forEach((set) => walk(set, resolved.scope));
330
+ }
331
+ walking.pop();
332
+ };
333
+
334
+ const hasParams = (resolved: Resolved | undefined) =>
335
+ resolved?.definition.kind === "Operator" && resolved.definition.params.length > 0;
336
+
337
+ const walkArgument = (
338
+ argument: Expression,
339
+ index: number,
340
+ callee: Definition | undefined,
341
+ locals: Local | undefined,
342
+ ) => {
343
+ if (argument.kind === "Lambda") {
344
+ walk(argument.body, bindNames(argument.params, locals));
345
+ return;
346
+ }
347
+ if (argument.kind === "Identifier") {
348
+ const resolved = resolve(argument, argument.name, locals);
349
+ const isOperator =
350
+ (callee?.kind === "Operator" && (callee.params[index]?.arity ?? 0) > 0) ||
351
+ hasParams(resolved);
352
+ if (isOperator) {
353
+ if (resolved) walkDefinition(resolved);
354
+ return;
355
+ }
356
+ }
357
+ walk(argument, locals);
358
+ };
359
+
360
+ const walkJunction = (
361
+ expression: Expression & { kind: "And" | "Or" },
362
+ count: number,
363
+ range: SourceRange | undefined,
364
+ locals: Local | undefined,
365
+ ): number =>
366
+ enter(
367
+ count === expression.operands.length ? expression : undefined,
368
+ range,
369
+ () => {
370
+ const operands = expression.operands;
371
+ if (count > 2 && !expression.isBulleted) {
372
+ const end = expression.prefixEnds?.[count - 3];
373
+ const prefix = walkJunction(
374
+ expression,
375
+ count - 1,
376
+ range && end ? { ...range, end } : range,
377
+ locals,
378
+ );
379
+ coverage.prefixes[stack.at(-1) ?? -1] = prefix;
380
+ walk(operands[count - 1], locals);
381
+ return;
382
+ }
383
+ operands.slice(0, count).forEach((operand) => walk(operand, locals));
384
+ },
385
+ count < expression.operands.length,
386
+ );
387
+
388
+ const walk = (expression: Expression, locals: Local | undefined): void => {
389
+ const range = expression.location.range;
390
+ const walkAll = (expressions: Expression[]) =>
391
+ expressions.forEach((item) => walk(item, locals));
392
+ switch (expression.kind) {
393
+ case "Number":
394
+ case "Decimal":
395
+ case "String":
396
+ case "ExceptAt":
397
+ case "Bracket":
398
+ case "Subexpression":
399
+ case "OperatorReference":
400
+ return;
401
+ case "Label":
402
+ case "Lambda":
403
+ walk(expression.body, bindNames(expression.params, locals));
404
+ return;
405
+ case "Selection":
406
+ walk(expression.expression, locals);
407
+ return;
408
+ case "Let": {
409
+ const inner = expression.definitions.reduce<Local | undefined>(
410
+ (parent, definition) => ({ name: definition.name, definition, scope: undefined, parent }),
411
+ locals,
412
+ );
413
+ for (let local = inner; local !== locals && local; local = local.parent) {
414
+ local.scope = inner;
415
+ }
416
+ expression.definitions.forEach((definition) => {
417
+ if (definition.kind === "Operator") letBodies.set(definition.body, expression.body);
418
+ });
419
+ getHashtableOrder(expression.definitions).forEach((definition) =>
420
+ walkDefinition({ definition, scope: inner }),
421
+ );
422
+ walk(expression.body, inner);
423
+ return;
424
+ }
425
+ case "Identifier": {
426
+ const resolved = resolve(expression, expression.name, locals);
427
+ enter(
428
+ expression,
429
+ range,
430
+ () => {
431
+ if (resolved) walkDefinition(resolved);
432
+ },
433
+ false,
434
+ resolved?.definition,
435
+ );
436
+ return;
437
+ }
438
+ case "Apply": {
439
+ const resolved = resolve(expression, expression.operator, locals);
440
+ enter(
441
+ expression,
442
+ range,
443
+ () => {
444
+ if (resolved) walkDefinition(resolved);
445
+ expression.args.forEach((argument, index) =>
446
+ walkArgument(argument, index, resolved?.definition, locals),
447
+ );
448
+ },
449
+ false,
450
+ resolved?.definition,
451
+ );
452
+ return;
453
+ }
454
+ case "And":
455
+ case "Or":
456
+ walkJunction(expression, expression.operands.length, range, locals);
457
+ return;
458
+ case "Case":
459
+ enter(expression, range, () => {
460
+ expression.arms.forEach((arm) =>
461
+ enter(
462
+ undefined,
463
+ spanRanges(arm.condition.location.range, arm.body.location.range),
464
+ () => walkAll([arm.condition, arm.body]),
465
+ true,
466
+ ),
467
+ );
468
+ const other = expression.other;
469
+ if (other) enter(undefined, expression.otherRange, () => walk(other, locals), true);
470
+ });
471
+ return;
472
+ case "Record":
473
+ case "RecordSet":
474
+ enter(expression, range, () =>
475
+ expression.fields.forEach((field) =>
476
+ enter(
477
+ undefined,
478
+ getStartRange(field.location, field.value.location.range),
479
+ () => walk(field.value, locals),
480
+ true,
481
+ ),
482
+ ),
483
+ );
484
+ return;
485
+ case "FunctionApplication":
486
+ enter(expression, range, () => {
487
+ walk(expression.function, locals);
488
+ const args = expression.args;
489
+ if (args.length === 1) walk(args[0], locals);
490
+ else {
491
+ enter(
492
+ undefined,
493
+ spanRanges(args[0]?.location.range, args.at(-1)?.location.range),
494
+ () => walkAll(args),
495
+ true,
496
+ );
497
+ }
498
+ });
499
+ return;
500
+ case "Forall":
501
+ case "Exists":
502
+ case "FunctionConstruction":
503
+ enter(expression, range, () => {
504
+ walk(expression.body, bindNames(getBoundNames(expression.bounds), locals));
505
+ walkAll(getBoundSets(expression.bounds));
506
+ });
507
+ return;
508
+ case "SetMap":
509
+ enter(expression, range, () => {
510
+ walk(expression.expression, bindNames(getBoundNames(expression.bounds), locals));
511
+ walkAll(getBoundSets(expression.bounds));
512
+ });
513
+ return;
514
+ case "SetFilter":
515
+ enter(expression, range, () => {
516
+ walk(expression.predicate, bindNames(getBoundNames([expression.bound]), locals));
517
+ walk(expression.bound.set, locals);
518
+ });
519
+ return;
520
+ case "Choose":
521
+ enter(expression, range, () => {
522
+ const pattern = expression.pattern;
523
+ walk(
524
+ expression.body,
525
+ bindNames(pattern.kind === "Name" ? [pattern.name] : pattern.names, locals),
526
+ );
527
+ if (expression.set) walk(expression.set, locals);
528
+ });
529
+ return;
530
+ case "UnboundedQuantifier":
531
+ enter(expression, range, () => walk(expression.body, bindNames(expression.names, locals)));
532
+ return;
533
+ case "Except":
534
+ enter(expression, range, () => {
535
+ walk(expression.function, locals);
536
+ expression.updates.forEach((update) => {
537
+ update.path.forEach((step) => {
538
+ if (step.kind === "Index") walkAll(step.args);
539
+ });
540
+ walk(update.value, locals);
541
+ });
542
+ });
543
+ return;
544
+ case "Prime":
545
+ case "Unchanged":
546
+ case "Enabled":
547
+ case "Always":
548
+ case "Eventually":
549
+ enter(expression, range, () => walk(expression.expression, locals));
550
+ return;
551
+ case "If":
552
+ enter(expression, range, () =>
553
+ walkAll([expression.condition, expression.consequent, expression.alternative]),
554
+ );
555
+ return;
556
+ case "SetEnumeration":
557
+ case "Tuple":
558
+ enter(expression, range, () => walkAll(expression.elements));
559
+ return;
560
+ case "Product":
561
+ enter(expression, range, () => walkAll(expression.factors));
562
+ return;
563
+ case "FunctionSet":
564
+ enter(expression, range, () => walkAll([expression.domain, expression.range]));
565
+ return;
566
+ case "FieldAccess":
567
+ enter(expression, range, () => walk(expression.record, locals));
568
+ return;
569
+ case "BoxAction":
570
+ case "AngleAction":
571
+ enter(expression, range, () => walkAll([expression.action, expression.subscript]));
572
+ return;
573
+ case "WeakFairness":
574
+ case "StrongFairness":
575
+ enter(expression, range, () => walkAll([expression.subscript, expression.action]));
576
+ }
577
+ };
578
+
579
+ coverage.relations.forEach((relation) => {
580
+ stack.push(relation.node);
581
+ walk(relation.expression, undefined);
582
+ stack.pop();
583
+ });
584
+ };
585
+
586
+ const findChild = (coverage: Coverage, node: number, expression: Expression): number => {
587
+ for (let child = coverage.firstChild[node]; child !== -1; child = coverage.nextSibling[child]) {
588
+ if (coverage.expressions[child] === expression) return child;
589
+ if (coverage.isPart[child]) {
590
+ const found = findChild(coverage, child, expression);
591
+ if (found !== -1) return found;
592
+ }
593
+ }
594
+ return -1;
595
+ };
596
+
597
+ export const getCoverageNode = (coverage: Coverage, node: number, expression: Expression) => {
598
+ if (coverage.expressions[node] === expression) return node;
599
+ const child = findChild(coverage, node, expression);
600
+ if (child !== -1) return child;
601
+ const recursive = coverage.recursive[node];
602
+ const inner = recursive === -1 ? -1 : findChild(coverage, recursive, expression);
603
+ if (inner !== -1) return inner;
604
+ return coverage.lets[node]?.find((item) => coverage.expressions[item] === expression) ?? node;
605
+ };
606
+
607
+ export const countCoverage = (coverage: Coverage, node: number) => {
608
+ for (let item = node; item !== -1; item = coverage.prefixes[item]) coverage.primary[item]++;
609
+ };
610
+
611
+ export const runAtCoverageNode = <Result>(
612
+ coverage: Coverage,
613
+ node: number,
614
+ run: () => Result,
615
+ ): Result => {
616
+ const outer = coverage.current;
617
+ coverage.current = node;
618
+ try {
619
+ return run();
620
+ } finally {
621
+ coverage.current = outer;
622
+ }
623
+ };
624
+
625
+ export const costCoverage = (coverage: Coverage, value: Value, cost: number) => {
626
+ const node = typeof value === "object" ? coverage.values.get(value) : undefined;
627
+ if (node !== undefined) coverage.secondary[node] += cost;
628
+ };
629
+
630
+ export const chargeSetOperation = (
631
+ coverage: Coverage,
632
+ operator: string,
633
+ left: Value,
634
+ right: Value,
635
+ result: Value,
636
+ ): Value => {
637
+ const receiver = isReducibleSet(left)
638
+ ? left
639
+ : operator !== "\\" && isReducibleSet(right)
640
+ ? right
641
+ : undefined;
642
+ if (receiver === undefined || typeof result !== "object") return result;
643
+ const other = receiver === left ? right : left;
644
+ if (operator === "\\cup") {
645
+ if (isEmptySet(receiver) || !isReducibleSet(other)) return result;
646
+ const otherNode = coverage.values.get(other);
647
+ if (otherNode !== undefined) coverage.secondary[otherNode] += getCardinality(other) + 1;
648
+ }
649
+ const node = operator === "\\cup" ? undefined : coverage.values.get(receiver);
650
+ if (coverage.values.get(result) === node) return result;
651
+ const isShared = result === left || result === right || coverage.values.has(result);
652
+ const charged = isShared ? { ...result } : result;
653
+ if (node !== undefined) coverage.values.set(charged, node);
654
+ return charged;
655
+ };
656
+
657
+ interface ChargedEnumerator {
658
+ next: () => boolean;
659
+ reset: () => void;
660
+ }
661
+
662
+ const createListEnumerator = (coverage: Coverage, node: number | undefined, size: number) => {
663
+ let position = 0;
664
+ return {
665
+ next: () => {
666
+ if (node !== undefined) coverage.secondary[node]++;
667
+ return position++ < size;
668
+ },
669
+ reset: () => {
670
+ position = 0;
671
+ },
672
+ };
673
+ };
674
+
675
+ const createProductEnumerator = (
676
+ coverage: Coverage,
677
+ node: number,
678
+ sets: Value[],
679
+ ): ChargedEnumerator => {
680
+ if (sets.some((set) => isEmptySet(set))) return { next: () => false, reset: () => undefined };
681
+ const enumerators = sets.map((set) =>
682
+ createEnumerator(coverage, set, getCardinality(set), false),
683
+ );
684
+ const advance = () => {
685
+ for (let index = enumerators.length - 1; index > 0; index--) {
686
+ if (enumerators[index].next()) return true;
687
+ enumerators[index].reset();
688
+ enumerators[index].next();
689
+ }
690
+ return enumerators.length > 0 && enumerators[0].next();
691
+ };
692
+ let isDone = !enumerators.every((enumerator) => enumerator.next());
693
+ return {
694
+ next: () => {
695
+ if (isDone) return false;
696
+ coverage.secondary[node] += Math.max(enumerators.length, 1);
697
+ isDone = !advance();
698
+ return true;
699
+ },
700
+ reset: () => {
701
+ enumerators.forEach((enumerator) => {
702
+ enumerator.reset();
703
+ enumerator.next();
704
+ });
705
+ isDone = false;
706
+ },
707
+ };
708
+ };
709
+
710
+ export const createProductSetEnumerator = (coverage: Coverage, set: Value) => {
711
+ const node = typeof set === "object" ? coverage.values.get(set) : undefined;
712
+ if (node === undefined || typeof set !== "object") return undefined;
713
+ if (set.kind === "RecordSet") return createProductEnumerator(coverage, node, set.sets);
714
+ if (set.kind !== "FunctionSet") return undefined;
715
+ return createProductEnumerator(
716
+ coverage,
717
+ node,
718
+ Array.from({ length: getCardinality(set.domain) }, () => set.range),
719
+ );
720
+ };
721
+
722
+ const createEnumerator = (
723
+ coverage: Coverage,
724
+ set: Value,
725
+ size: number,
726
+ isNormalized: boolean,
727
+ ): ChargedEnumerator => {
728
+ const node = typeof set === "object" ? coverage.values.get(set) : undefined;
729
+ if (
730
+ typeof set === "object" &&
731
+ (set.kind === "Subset" || (!isNormalized && set.kind === "FilteredSet"))
732
+ ) {
733
+ return createListEnumerator(coverage, undefined, size);
734
+ }
735
+ const elements = createProductSetEnumerator(coverage, set);
736
+ if (!elements || node === undefined) return createListEnumerator(coverage, node, size);
737
+ if (!isNormalized) return elements;
738
+ let count = 0;
739
+ while (elements.next()) count++;
740
+ coverage.secondary[node] += count;
741
+ return createListEnumerator(coverage, node, count);
742
+ };
743
+
744
+ export const tagSubset = (coverage: Coverage, set: Value, subset: Value) => {
745
+ const node =
746
+ typeof set === "object" && set.kind === "Subset" ? coverage.values.get(set) : undefined;
747
+ if (node !== undefined && typeof subset === "object") coverage.values.set(subset, node);
748
+ };
749
+
750
+ export const createChargedEnumerator = (
751
+ coverage: Coverage,
752
+ set: Value,
753
+ list: Value[] | IntervalValue,
754
+ isNormalized: boolean,
755
+ ) => {
756
+ const size = Array.isArray(list) ? list.length : list.high - list.low + 1;
757
+ if (typeof set !== "object" || set.kind !== "Subset" || !Array.isArray(list)) {
758
+ return createEnumerator(coverage, set, size, isNormalized);
759
+ }
760
+ list.forEach((subset) => tagSubset(coverage, set, subset));
761
+ return createListEnumerator(coverage, undefined, size);
762
+ };
763
+
764
+ const chargeBindings = (enumerators: ChargedEnumerator[]) => {
765
+ enumerators.every((enumerator) => enumerator.next());
766
+ return () => {
767
+ for (let index = 0; index < enumerators.length; index++) {
768
+ if (enumerators[index].next() || index === enumerators.length - 1) return;
769
+ enumerators[index].reset();
770
+ enumerators[index].next();
771
+ }
772
+ };
773
+ };
774
+
775
+ export const chargeContexts = (
776
+ coverage: Coverage,
777
+ sets: Value[],
778
+ lists: (Value[] | IntervalValue)[],
779
+ ) =>
780
+ chargeBindings(
781
+ sets.map((set, index) => createChargedEnumerator(coverage, set, lists[index], true)),
782
+ );
783
+
784
+ export const chargeFunctionConstruction = (coverage: Coverage, node: number, sets: Value[]) => {
785
+ const sizes = sets.map((set) => getCardinality(set));
786
+ const advance = chargeBindings(
787
+ sets.map((set, index) => createEnumerator(coverage, set, sizes[index], false)),
788
+ );
789
+ const size = sizes.reduce((product, setSize) => product * setSize, 1);
790
+ for (let index = 0; index < size; index++) advance();
791
+ coverage.secondary[node] += size;
792
+ };
793
+
794
+ const getLeadingZeros = (value: bigint) => {
795
+ const high = Number(value >> 32n);
796
+ return high === 0 ? 32 + Math.clz32(Number(value & 0xffffffffn)) : Math.clz32(high);
797
+ };
798
+
799
+ export const countCoverageVariables = (coverage: Coverage, state: Value[]) =>
800
+ state.forEach((value, variable) => {
801
+ const fingerprint = getTlcFingerprint([value]);
802
+ const register = Number(fingerprint >> BigInt(64 - REGISTER_BITS));
803
+ const rest = BigInt.asUintN(64, (fingerprint << BigInt(REGISTER_BITS)) | (1n << 9n));
804
+ const index = variable * REGISTERS + register;
805
+ coverage.registers[index] = Math.max(coverage.registers[index], getLeadingZeros(rest) + 1);
806
+ });
807
+
808
+ export const getDistinctCount = (coverage: Coverage, variable: number) => {
809
+ const registers = coverage.registers.subarray(variable * REGISTERS, (variable + 1) * REGISTERS);
810
+ const alpha = 0.7213 / (1 + 1.079 / REGISTERS);
811
+ const sum = registers.reduce((total, register) => total + 2 ** -register, 0);
812
+ const estimate = (alpha * REGISTERS * REGISTERS) / sum;
813
+ const zeros = registers.filter((register) => register === 0).length;
814
+ if (estimate <= 2.5 * REGISTERS) {
815
+ return Math.trunc(zeros === 0 ? estimate : REGISTERS * Math.log(REGISTERS / zeros));
816
+ }
817
+ return Math.trunc(
818
+ estimate > 2 ** 64 / 30 ? -(2 ** 64) * Math.log(1 - estimate / 2 ** 64) : estimate,
819
+ );
820
+ };
821
+
822
+ interface Pair {
823
+ primary: number;
824
+ secondary: number;
825
+ }
826
+
827
+ const getPairHash = (pair: Pair) => {
828
+ const hash = (Math.imul(31, 31 + pair.primary) + pair.secondary) | 0;
829
+ return hash ^ (hash >>> 16);
830
+ };
831
+
832
+ const getFirstPair = (pairs: Pair[]) => {
833
+ let capacity = 16;
834
+ while (pairs.length > capacity * 0.75) capacity *= 2;
835
+ const getBucket = (pair: Pair) => getPairHash(pair) & (capacity - 1);
836
+ return pairs.reduce((first, pair) => (getBucket(pair) < getBucket(first) ? pair : first));
837
+ };
838
+
839
+ const addPair = (pairs: Pair[], pair: Pair) => {
840
+ if (!pairs.some((item) => item.primary === pair.primary && item.secondary === pair.secondary)) {
841
+ pairs.push(pair);
842
+ }
843
+ };
844
+
845
+ const isNodePrimed = (coverage: Coverage, node: number) =>
846
+ coverage.isPrimed[node] || coverage.isUnchanged[node];
847
+
848
+ const getChildren = (coverage: Coverage, node: number) => {
849
+ const children: number[] = [];
850
+ for (let child = coverage.firstChild[node]; child !== -1; child = coverage.nextSibling[child]) {
851
+ children.push(child);
852
+ }
853
+ return children;
854
+ };
855
+
856
+ const getRelationCounts = (coverage: Coverage, relation: CoverageRelation) => {
857
+ const primary = coverage.primary[relation.node];
858
+ const secondary = coverage.secondary[relation.node];
859
+ if (relation.kind === "init") return { distinct: primary, generated: primary + secondary };
860
+ if (relation.kind === "next") return { distinct: secondary, generated: primary };
861
+ if (relation.kind === "constraint") {
862
+ return { distinct: secondary, generated: primary + secondary };
863
+ }
864
+ return { distinct: 0, generated: 0 };
865
+ };
866
+
867
+ const getExpressions = (coverage: Coverage, root: number) => {
868
+ const expressions: CoverageExpression[] = [];
869
+ const subtrees = new Map<number, Pair[]>();
870
+ const collect = (node: number): Pair[] => {
871
+ const pairs: Pair[] = [];
872
+ const own = { primary: coverage.primary[node], secondary: coverage.secondary[node] };
873
+ if (own.primary > 0 || own.secondary > 0 || isNodePrimed(coverage, node)) addPair(pairs, own);
874
+ getChildren(coverage, node).forEach((child) =>
875
+ collect(child).forEach((pair) => addPair(pairs, pair)),
876
+ );
877
+ subtrees.set(node, pairs);
878
+ return pairs;
879
+ };
880
+ const add = (node: number, depth: number, count: number, cost: number) => {
881
+ const range = coverage.ranges[node];
882
+ expressions.push({
883
+ location: range ? formatRange(range) : "Unknown location",
884
+ depth,
885
+ count,
886
+ cost,
887
+ });
888
+ };
889
+ const addSelf = (node: number, depth: number) =>
890
+ add(node, depth, coverage.primary[node], coverage.secondary[node]);
891
+ const print = (node: number, depth: number) => {
892
+ const children = getChildren(coverage, node);
893
+ const collected: Pair[] = [];
894
+ children.forEach((child) =>
895
+ (subtrees.get(child) ?? collect(child)).forEach((pair) => addPair(collected, pair)),
896
+ );
897
+ const own = { primary: coverage.primary[node], secondary: coverage.secondary[node] };
898
+ const isPrimed = isNodePrimed(coverage, node);
899
+ const printChildren = (level: number) => children.forEach((child) => print(child, level));
900
+ if (coverage.isUnchanged[node]) {
901
+ const changed = collected.filter((pair) => pair.primary !== 0 || pair.secondary !== 0);
902
+ if (changed.length === 0) addSelf(node, depth);
903
+ else add(node, depth, Math.max(own.primary, getFirstPair(changed).primary), 0);
904
+ return;
905
+ }
906
+ if (collected.length === 0) {
907
+ if (own.primary !== 0 || isPrimed) addSelf(node, depth);
908
+ return;
909
+ }
910
+ const isZero = own.primary === 0 && own.secondary === 0;
911
+ if (collected.length === 1) {
912
+ const consistent = collected[0];
913
+ const isConsistentZero = consistent.primary === 0 && consistent.secondary === 0;
914
+ if (consistent.primary < own.primary) {
915
+ addSelf(node, depth);
916
+ printChildren(depth + 1);
917
+ return;
918
+ }
919
+ if (!isPrimed && isZero && !isConsistentZero) {
920
+ add(node, depth, consistent.primary, consistent.secondary);
921
+ return;
922
+ }
923
+ if (isZero && isConsistentZero) {
924
+ if (isPrimed) addSelf(node, depth);
925
+ printChildren(isPrimed ? depth + 1 : depth);
926
+ return;
927
+ }
928
+ if (own.primary === consistent.primary && own.secondary === consistent.secondary) {
929
+ addSelf(node, depth);
930
+ return;
931
+ }
932
+ }
933
+ const isPrinted = !isZero || isPrimed;
934
+ if (isPrinted) addSelf(node, depth);
935
+ printChildren(isPrinted ? depth + 1 : depth);
936
+ };
937
+ getChildren(coverage, root).forEach((child) => {
938
+ collect(child);
939
+ print(child, 0);
940
+ });
941
+ return expressions;
942
+ };
943
+
944
+ const KIND_ORDER: CoverageKind[] = ["init", "next", "invariant", "constraint", "implied"];
945
+
946
+ const compareRanges = (left: SourceRange | undefined, right: SourceRange | undefined) => {
947
+ if (!left || !right) return left ? 1 : right ? -1 : 0;
948
+ if (left.module !== right.module) return left.module < right.module ? -1 : 1;
949
+ return (
950
+ left.start.line - right.start.line ||
951
+ left.start.column - right.start.column ||
952
+ left.end.line - right.end.line ||
953
+ left.end.column - right.end.column
954
+ );
955
+ };
956
+
957
+ const getReportedRelations = (coverage: Coverage) =>
958
+ KIND_ORDER.flatMap((kind) => {
959
+ const relations = coverage.relations.filter((relation) => relation.kind === kind);
960
+ if (kind !== "next") return relations;
961
+ return relations
962
+ .toSorted((left, right) =>
963
+ compareRanges(left.expression.location.range, right.expression.location.range),
964
+ )
965
+ .filter(
966
+ (relation, index, sorted) =>
967
+ index === 0 ||
968
+ compareRanges(
969
+ sorted[index - 1].expression.location.range,
970
+ relation.expression.location.range,
971
+ ) !== 0,
972
+ );
973
+ });
974
+
975
+ export const getCoverageReport = (
976
+ coverage: Coverage,
977
+ environment: Environment,
978
+ variableLocations: SourceLocation[],
979
+ variableOrder: number[],
980
+ ): CoverageReport => ({
981
+ variables: variableOrder.map((index) => {
982
+ const range = variableLocations[index]?.range;
983
+ return {
984
+ label: `${environment.variables[index]} ${range ? formatRange(range) : "Unknown location"}`,
985
+ distinct: getDistinctCount(coverage, index),
986
+ };
987
+ }),
988
+ relations: getReportedRelations(coverage).map((relation) => ({
989
+ kind: relation.kind,
990
+ label: relation.label,
991
+ ...getRelationCounts(coverage, relation),
992
+ expressions: getExpressions(coverage, relation.node),
993
+ })),
994
+ });
995
+
996
+ export const getCoverageCounts = (
997
+ coverage: Coverage,
998
+ kind: CoverageKind,
999
+ expression: Expression,
1000
+ ): [string, number][] | undefined => {
1001
+ const node = findCoverageRelation(coverage, kind, expression);
1002
+ if (node === undefined) return undefined;
1003
+ const primary = coverage.primary[node];
1004
+ const secondary = coverage.secondary[node];
1005
+ if (kind === "init") {
1006
+ return [
1007
+ ["generated", primary + secondary],
1008
+ ["distinct", primary],
1009
+ ];
1010
+ }
1011
+ if (kind === "next") {
1012
+ return [
1013
+ ["generated", primary],
1014
+ ["distinct", secondary],
1015
+ ];
1016
+ }
1017
+ const child = coverage.firstChild[node];
1018
+ return [["count", child === -1 ? primary : coverage.primary[child]]];
1019
+ };