tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7714e32

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (378) hide show
  1. package/README.md +37 -126
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +44 -12
  8. package/dist/index.d.ts +44 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +76 -92
  23. package/dist/transfer.js +76 -92
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/bags.ts +22 -23
  29. package/src/builtins.ts +16 -8
  30. package/src/check.ts +131 -1154
  31. package/src/{cli-options.ts → cli/options.ts} +54 -9
  32. package/src/cli/run.ts +63 -0
  33. package/src/cli/shared.ts +106 -0
  34. package/src/cli/tlapm.ts +374 -0
  35. package/src/{run-cli.ts → cli/tlc.ts} +112 -718
  36. package/src/cli/xml-exporter.ts +221 -0
  37. package/src/cli.ts +1 -1
  38. package/src/codegen.ts +17 -15
  39. package/src/config.ts +5 -5
  40. package/src/dependencies.ts +4 -6
  41. package/src/environment.ts +55 -60
  42. package/src/errors.ts +97 -35
  43. package/src/evaluate.ts +109 -108
  44. package/src/exit-codes.ts +1 -1
  45. package/src/fingerprints.ts +3 -3
  46. package/src/index.ts +10 -0
  47. package/src/instances.ts +56 -46
  48. package/src/java-overrides.ts +79 -41
  49. package/src/json.ts +31 -36
  50. package/src/levels.ts +10 -13
  51. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  52. package/src/liveness.ts +38 -34
  53. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  54. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  55. package/src/obligations/equality.ts +260 -0
  56. package/src/obligations/expression.ts +618 -0
  57. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  58. package/src/obligations/generate.ts +457 -0
  59. package/src/{obligations.ts → obligations/index.ts} +46 -32
  60. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  61. package/src/obligations/module.ts +445 -0
  62. package/src/obligations/normalize.ts +554 -0
  63. package/src/obligations/operators.ts +176 -0
  64. package/src/obligations/pragma.ts +195 -0
  65. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  66. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  67. package/src/obligations/regroup.ts +100 -0
  68. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  69. package/src/{obligation-source.ts → obligations/source.ts} +172 -216
  70. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  71. package/src/obligations/substitution.ts +261 -0
  72. package/src/obligations/temporal.ts +321 -0
  73. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  74. package/src/parallel-worker.ts +39 -51
  75. package/src/parallel.ts +39 -66
  76. package/src/parser.ts +67 -74
  77. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  78. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  79. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  80. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  81. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  82. package/src/prover/decide-pool.ts +95 -0
  83. package/src/prover/deciders.ts +33 -0
  84. package/src/prover/first-order.ts +175 -0
  85. package/src/prover/isabelle/LICENSE +36 -0
  86. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  87. package/src/prover/isabelle/decide.ts +44 -0
  88. package/src/prover/isabelle/encode.ts +445 -0
  89. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  90. package/src/prover/isabelle/isar/method.ts +367 -0
  91. package/src/prover/isabelle/isar/proof.ts +28 -0
  92. package/src/prover/isabelle/isar/statement.ts +57 -0
  93. package/src/prover/isabelle/isar/theory.ts +192 -0
  94. package/src/prover/isabelle/isar/type-check.ts +278 -0
  95. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  96. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  97. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  98. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  99. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  100. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  101. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  102. package/src/prover/isabelle/provers/classical.ts +389 -0
  103. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  104. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  105. package/src/prover/isabelle/pure/consts.ts +32 -0
  106. package/src/prover/isabelle/pure/conv.ts +79 -0
  107. package/src/prover/isabelle/pure/drule.ts +264 -0
  108. package/src/prover/isabelle/pure/envir.ts +331 -0
  109. package/src/prover/isabelle/pure/goal.ts +53 -0
  110. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  111. package/src/prover/isabelle/pure/list.ts +12 -0
  112. package/src/prover/isabelle/pure/logic.ts +330 -0
  113. package/src/prover/isabelle/pure/name.ts +98 -0
  114. package/src/prover/isabelle/pure/net.ts +215 -0
  115. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  116. package/src/prover/isabelle/pure/pattern.ts +631 -0
  117. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  118. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  119. package/src/prover/isabelle/pure/search.ts +68 -0
  120. package/src/prover/isabelle/pure/seq.ts +133 -0
  121. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  122. package/src/prover/isabelle/pure/table.ts +201 -0
  123. package/src/prover/isabelle/pure/tactic.ts +168 -0
  124. package/src/prover/isabelle/pure/tactical.ts +264 -0
  125. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  126. package/src/prover/isabelle/pure/term.ts +688 -0
  127. package/src/prover/isabelle/pure/thm.ts +783 -0
  128. package/src/prover/isabelle/pure/type.ts +121 -0
  129. package/src/prover/isabelle/pure/unify.ts +753 -0
  130. package/src/prover/isabelle/pure/variable.ts +25 -0
  131. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  132. package/src/prover/isabelle/tla/context.ts +74 -0
  133. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  134. package/src/prover/isabelle/tla/logic.ts +215 -0
  135. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  136. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  137. package/src/prover/ocaml.ts +22 -0
  138. package/src/prover/prep/action.ts +508 -0
  139. package/src/prover/prep/enabled-axioms.ts +189 -0
  140. package/src/prover/prep/fingerprint.ts +388 -0
  141. package/src/prover/prep/level-comparison.ts +529 -0
  142. package/src/prover/prep/md5.ts +60 -0
  143. package/src/prover/prep/methods.ts +221 -0
  144. package/src/prover/prep/normalize.ts +309 -0
  145. package/src/prover/prove-worker.ts +22 -0
  146. package/src/prover/prove.ts +492 -0
  147. package/src/prover/ptl/decide.ts +68 -0
  148. package/src/prover/ptl/encode.ts +244 -0
  149. package/src/prover/ptl/sat.ts +151 -0
  150. package/src/prover/ptl/tableau.ts +276 -0
  151. package/src/prover/smt/axioms.ts +209 -0
  152. package/src/prover/smt/context.ts +108 -0
  153. package/src/prover/smt/data.ts +636 -0
  154. package/src/prover/smt/encode.ts +275 -0
  155. package/src/prover/smt/extensionality.ts +65 -0
  156. package/src/prover/smt/flatten.ts +112 -0
  157. package/src/prover/smt/format.ts +154 -0
  158. package/src/prover/smt/instances.ts +181 -0
  159. package/src/prover/smt/rewrite.ts +766 -0
  160. package/src/prover/smt/solver/act-cache.ts +265 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prover/smt/solver/array.ts +22 -0
  163. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prover/smt/solver/ast-lt.ts +157 -0
  165. package/src/prover/smt/solver/ast-util.ts +91 -0
  166. package/src/prover/smt/solver/ast.ts +1315 -0
  167. package/src/prover/smt/solver/auf-solver.ts +572 -0
  168. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prover/smt/solver/cg-table.ts +175 -0
  170. package/src/prover/smt/solver/clause.ts +276 -0
  171. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prover/smt/solver/context.ts +1292 -0
  173. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prover/smt/solver/der.ts +224 -0
  175. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prover/smt/solver/e-matching.ts +659 -0
  177. package/src/prover/smt/solver/enode.ts +259 -0
  178. package/src/prover/smt/solver/expr-ref.ts +21 -0
  179. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prover/smt/solver/fingerprints.ts +92 -0
  181. package/src/prover/smt/solver/flat-literals.ts +51 -0
  182. package/src/prover/smt/solver/goal.ts +138 -0
  183. package/src/prover/smt/solver/hash.ts +173 -0
  184. package/src/prover/smt/solver/hashtable.ts +166 -0
  185. package/src/prover/smt/solver/internalizer.ts +1381 -0
  186. package/src/prover/smt/solver/lbool.ts +5 -0
  187. package/src/prover/smt/solver/literal.ts +24 -0
  188. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prover/smt/solver/lp/containers.ts +296 -0
  191. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prover/smt/solver/lp/nex.ts +120 -0
  208. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prover/smt/solver/model-checker.ts +347 -0
  238. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prover/smt/solver/model-finder.ts +155 -0
  240. package/src/prover/smt/solver/model-generator.ts +97 -0
  241. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prover/smt/solver/nnf.ts +469 -0
  255. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prover/smt/solver/propagate-values.ts +83 -0
  258. package/src/prover/smt/solver/proto-model.ts +551 -0
  259. package/src/prover/smt/solver/pull-quant.ts +139 -0
  260. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prover/smt/solver/qe-lite.ts +381 -0
  263. package/src/prover/smt/solver/qi-queue.ts +362 -0
  264. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prover/smt/solver/random-gen.ts +10 -0
  268. package/src/prover/smt/solver/rational.ts +165 -0
  269. package/src/prover/smt/solver/ref-vector.ts +62 -0
  270. package/src/prover/smt/solver/relevancy.ts +247 -0
  271. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prover/smt/solver/rewriter.ts +843 -0
  273. package/src/prover/smt/solver/rlimit.ts +79 -0
  274. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prover/smt/solver/solver.ts +71 -0
  276. package/src/prover/smt/solver/sort.ts +35 -0
  277. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prover/smt/solver/theory-lra.ts +56 -0
  286. package/src/prover/smt/solver/var-subst.ts +258 -0
  287. package/src/prover/smt/solver/z3-license.txt +10 -0
  288. package/src/prover/smt/table.ts +170 -0
  289. package/src/prover/tlapm/cache.ts +236 -0
  290. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  291. package/src/prover/tlapm/tlapm.ts +96 -0
  292. package/src/prover/tlaps-module.ts +510 -0
  293. package/src/prover/verdict.ts +13 -0
  294. package/src/prover/zenon/LICENSE +32 -0
  295. package/src/prover/zenon/check/check.ts +105 -0
  296. package/src/prover/zenon/check/definitions.ts +144 -0
  297. package/src/prover/zenon/check/equality.ts +182 -0
  298. package/src/prover/zenon/check/functions.ts +62 -0
  299. package/src/prover/zenon/check/keys.ts +125 -0
  300. package/src/prover/zenon/check/propositional.ts +104 -0
  301. package/src/prover/zenon/check/records.ts +188 -0
  302. package/src/prover/zenon/check/relations.ts +121 -0
  303. package/src/prover/zenon/check/rewrites.ts +224 -0
  304. package/src/prover/zenon/check/sets.ts +302 -0
  305. package/src/prover/zenon/check/terms.ts +127 -0
  306. package/src/prover/zenon/check/tla.ts +126 -0
  307. package/src/prover/zenon/decide.ts +107 -0
  308. package/src/prover/zenon/encode.ts +378 -0
  309. package/src/prover/zenon/eqrel.ts +300 -0
  310. package/src/prover/zenon/equality-rules.ts +435 -0
  311. package/src/prover/zenon/expr.ts +551 -0
  312. package/src/prover/zenon/index-table.ts +350 -0
  313. package/src/prover/zenon/isar-case.ts +513 -0
  314. package/src/prover/zenon/isar.ts +1249 -0
  315. package/src/prover/zenon/limits.ts +15 -0
  316. package/src/prover/zenon/llproof.ts +173 -0
  317. package/src/prover/zenon/mltoll.ts +1566 -0
  318. package/src/prover/zenon/node.ts +297 -0
  319. package/src/prover/zenon/ocaml.ts +169 -0
  320. package/src/prover/zenon/parse.ts +247 -0
  321. package/src/prover/zenon/phrase.ts +191 -0
  322. package/src/prover/zenon/proof.ts +198 -0
  323. package/src/prover/zenon/propositional-rules.ts +387 -0
  324. package/src/prover/zenon/rules.ts +94 -0
  325. package/src/prover/zenon/search.ts +288 -0
  326. package/src/prover/zenon/tla/functions.ts +151 -0
  327. package/src/prover/zenon/tla/llproof.ts +480 -0
  328. package/src/prover/zenon/tla/records.ts +225 -0
  329. package/src/prover/zenon/tla/rewrites.ts +447 -0
  330. package/src/prover/zenon/tla/sets.ts +304 -0
  331. package/src/prover/zenon/tla/terms.ts +162 -0
  332. package/src/prover/zenon/tla/tla.ts +506 -0
  333. package/src/randomization.ts +19 -24
  334. package/src/resolve.ts +15 -22
  335. package/src/runtime.ts +8 -8
  336. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  337. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  338. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  339. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  340. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  341. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  342. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  343. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  344. package/src/{sany-report.ts → sany/report.ts} +16 -17
  345. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  346. package/src/{sany-source.ts → sany/source.ts} +6 -7
  347. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  348. package/src/search.ts +969 -0
  349. package/src/spec-description.ts +26 -20
  350. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  351. package/src/standard-modules.ts +16 -20
  352. package/src/state-graph.ts +9 -8
  353. package/src/substitution-levels.ts +2 -2
  354. package/src/successors.ts +16 -19
  355. package/src/symmetry.ts +1 -1
  356. package/src/tableau.ts +6 -7
  357. package/src/tlc/fingerprint.ts +214 -0
  358. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  359. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  360. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  361. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  362. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  363. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  364. package/src/transfer.ts +32 -32
  365. package/src/values.ts +80 -70
  366. package/src/worker.ts +62 -0
  367. package/dist/parallel.cjs +0 -12
  368. package/dist/parallel.js +0 -12
  369. package/dist/run-cli.cjs +0 -55
  370. package/dist/run-cli.js +0 -55
  371. package/src/canonical.ts +0 -40
  372. package/src/obligation-expression.ts +0 -1060
  373. package/src/obligation-module.ts +0 -1042
  374. package/src/standard-ranges.ts +0 -116
  375. package/src/value-sources.ts +0 -29
  376. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  377. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  378. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -0,0 +1,238 @@
1
+ // Ported from Z3 (src/nlsat/nlsat_solver.cpp, src/nlsat/nlsat_scoped_literal_vector.h,
2
+ // src/util/id_gen.h), MIT license, see z3-license.txt. The atoms of nlsat, hash-consed, with
3
+ // reference counts. An atom whose count drops to zero is deleted and its Boolean variable reused,
4
+ // last freed first, so literals are numbered as in Z3. Boolean variable 0 is true and has no atom.
5
+ import {
6
+ NULL_VAR,
7
+ type Polynomial,
8
+ type PolynomialCache,
9
+ type PolynomialManager,
10
+ } from "./polynomial";
11
+ import type { Atom, IneqAtom, IneqKind, RootAtom, RootKind } from "./types";
12
+
13
+ export const TRUE_BOOL_VAR = 0;
14
+ export const TRUE_LITERAL = 0;
15
+ export const FALSE_LITERAL = 1;
16
+
17
+ const FLIPPED_KIND: Record<IneqKind, IneqKind> = { EQ: "EQ", LT: "GT", GT: "LT" };
18
+
19
+ export const flipKind = (kind: IneqKind) => FLIPPED_KIND[kind];
20
+
21
+ // What the solver keeps per Boolean variable, reset when a variable is made or deleted.
22
+ interface BoolVarHooks {
23
+ onMk: (boolVar: number) => void;
24
+ onDelete: (boolVar: number) => void;
25
+ }
26
+
27
+ export class AtomTable {
28
+ readonly atoms: (Atom | null)[] = [];
29
+ private refCounts: number[] = [];
30
+ private nextBoolVar = 0;
31
+ private freeBoolVars: number[] = [];
32
+ private ineqAtoms = new Map<string, IneqAtom>();
33
+ // Keyed by the variable at creation: like Z3's root atom table, renaming the variables leaves the
34
+ // key alone.
35
+ private rootAtoms = new Map<string, RootAtom>();
36
+ private rootKeys = new Map<number, string>();
37
+
38
+ constructor(
39
+ private pm: PolynomialManager,
40
+ private cache: PolynomialCache,
41
+ private hooks: BoolVarHooks | null = null,
42
+ ) {
43
+ this.mkBoolVar();
44
+ }
45
+
46
+ // mk_bool_var_core with id_gen: the last freed variable first.
47
+ mkBoolVar() {
48
+ const boolVar = this.freeBoolVars.pop() ?? this.nextBoolVar++;
49
+ this.atoms[boolVar] = null;
50
+ this.refCounts[boolVar] = 0;
51
+ this.hooks?.onMk(boolVar);
52
+ return boolVar;
53
+ }
54
+
55
+ // degree: the degree of the atom's maximal variable.
56
+ getDegree(atom: Atom) {
57
+ if (!("polynomials" in atom)) return this.pm.degree(atom.polynomial, atom.maxVar);
58
+ let max = 0;
59
+ for (const polynomial of atom.polynomials)
60
+ max = Math.max(max, this.pm.degree(polynomial, atom.maxVar));
61
+ return max;
62
+ }
63
+
64
+ // reinit_cache: each polynomial back in the cache after a reset, and the maximal variables after
65
+ // a renaming.
66
+ reinitCache() {
67
+ for (const atom of this.atoms) {
68
+ if (atom === null || atom === undefined) continue;
69
+ if ("polynomials" in atom) {
70
+ let max = 0;
71
+ for (const polynomial of atom.polynomials) {
72
+ this.cache.mkUnique(polynomial);
73
+ max = Math.max(max, this.pm.maxVar(polynomial));
74
+ }
75
+ atom.maxVar = max;
76
+ continue;
77
+ }
78
+ this.cache.mkUnique(atom.polynomial);
79
+ atom.maxVar = this.pm.maxVar(atom.polynomial);
80
+ }
81
+ }
82
+
83
+ getAtom(literal: number) {
84
+ return this.atoms[literal >> 1] ?? null;
85
+ }
86
+
87
+ getMaxVar(literal: number) {
88
+ return this.getAtom(literal)?.maxVar ?? NULL_VAR;
89
+ }
90
+
91
+ incRef(literal: number) {
92
+ const boolVar = literal >> 1;
93
+ if (this.atoms[boolVar] === null || this.atoms[boolVar] === undefined) return;
94
+ this.refCounts[boolVar]++;
95
+ }
96
+
97
+ decRef(literal: number) {
98
+ const boolVar = literal >> 1;
99
+ const atom = this.atoms[boolVar];
100
+ if (atom === null || atom === undefined) return;
101
+ if (--this.refCounts[boolVar] > 0) return;
102
+ if ("polynomials" in atom) this.ineqAtoms.delete(this.getIneqKey(atom));
103
+ else {
104
+ this.rootAtoms.delete(this.rootKeys.get(boolVar)!);
105
+ this.rootKeys.delete(boolVar);
106
+ }
107
+ this.atoms[boolVar] = null;
108
+ this.hooks?.onDelete(boolVar);
109
+ this.freeBoolVars.push(boolVar);
110
+ }
111
+
112
+ private getIneqKey(atom: Pick<IneqAtom, "kind" | "polynomials" | "isEven">) {
113
+ return `${atom.kind},${atom.polynomials.map((polynomial, index) => `${polynomial.id}${atom.isEven[index] ? "e" : "o"}`).join(",")}`;
114
+ }
115
+
116
+ private getRootKey(atom: Pick<RootAtom, "kind" | "maxVar" | "index" | "polynomial">) {
117
+ return `${atom.kind},${atom.maxVar},${atom.index},${atom.polynomial.id}`;
118
+ }
119
+
120
+ // mk_ineq_atom: each factor sign-normalized and hash-consed, the kind flipped when an odd
121
+ // factor changed sign.
122
+ mkIneqAtom(kind: IneqKind, polynomials: readonly Polynomial[], isEven: readonly boolean[]) {
123
+ let sign = 1;
124
+ let maxVar = NULL_VAR;
125
+ const unique = polynomials.map((polynomial, index) => {
126
+ const normalized = this.pm.flipSignIfLmNeg(polynomial);
127
+ if (normalized !== polynomial && !isEven[index]) sign = -sign;
128
+ const variable = this.pm.maxVar(normalized);
129
+ if (variable > maxVar || maxVar === NULL_VAR) maxVar = variable;
130
+ return this.cache.mkUnique(normalized);
131
+ });
132
+ const atom: IneqAtom = {
133
+ kind: sign < 0 ? flipKind(kind) : kind,
134
+ boolVar: 0,
135
+ maxVar,
136
+ polynomials: unique,
137
+ isEven: [...isEven],
138
+ };
139
+ const key = this.getIneqKey(atom);
140
+ const existing = this.ineqAtoms.get(key);
141
+ if (existing !== undefined) return existing.boolVar;
142
+ atom.boolVar = this.mkBoolVar();
143
+ this.atoms[atom.boolVar] = atom;
144
+ this.ineqAtoms.set(key, atom);
145
+ return atom.boolVar;
146
+ }
147
+
148
+ // mk_ineq_literal: true or false for a product of constants.
149
+ mkIneqLiteral(kind: IneqKind, polynomials: readonly Polynomial[], isEven: readonly boolean[]) {
150
+ let constant = 1n;
151
+ let isConst = true;
152
+ for (const [index, polynomial] of polynomials.entries()) {
153
+ if (!this.pm.isConst(polynomial)) {
154
+ isConst = false;
155
+ continue;
156
+ }
157
+ if (this.pm.isZero(polynomial)) {
158
+ constant = 0n;
159
+ isConst = true;
160
+ break;
161
+ }
162
+ const coeff = polynomial.as[0];
163
+ constant *= coeff;
164
+ if (isEven[index] && coeff < 0n) constant = -constant;
165
+ }
166
+ if (isConst) {
167
+ const isTrue =
168
+ (constant > 0n && kind === "GT") ||
169
+ (constant < 0n && kind === "LT") ||
170
+ (constant === 0n && kind === "EQ");
171
+ return isTrue ? TRUE_LITERAL : FALSE_LITERAL;
172
+ }
173
+ return 2 * this.mkIneqAtom(kind, polynomials, isEven);
174
+ }
175
+
176
+ // mk_root_atom: p sign-normalized, which keeps its roots, and hash-consed.
177
+ mkRootAtom(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
178
+ const atom: RootAtom = {
179
+ kind,
180
+ boolVar: 0,
181
+ maxVar: variable,
182
+ index,
183
+ polynomial: this.cache.mkUnique(this.pm.flipSignIfLmNeg(polynomial)),
184
+ };
185
+ const key = this.getRootKey(atom);
186
+ const existing = this.rootAtoms.get(key);
187
+ if (existing !== undefined) return existing.boolVar;
188
+ atom.boolVar = this.mkBoolVar();
189
+ this.atoms[atom.boolVar] = atom;
190
+ this.rootAtoms.set(key, atom);
191
+ this.rootKeys.set(atom.boolVar, key);
192
+ return atom.boolVar;
193
+ }
194
+ }
195
+
196
+ // scoped_literal_vector: literals that hold a reference to their atoms.
197
+ export class ScopedLiterals {
198
+ literals: number[] = [];
199
+
200
+ constructor(private table: AtomTable) {}
201
+
202
+ get size() {
203
+ return this.literals.length;
204
+ }
205
+
206
+ push(literal: number) {
207
+ this.table.incRef(literal);
208
+ this.literals.push(literal);
209
+ }
210
+
211
+ set(index: number, literal: number) {
212
+ this.table.incRef(literal);
213
+ this.table.decRef(this.literals[index]);
214
+ this.literals[index] = literal;
215
+ }
216
+
217
+ shrink(size: number) {
218
+ for (const literal of this.literals.slice(size)) this.table.decRef(literal);
219
+ this.literals.length = size;
220
+ }
221
+
222
+ reset() {
223
+ this.shrink(0);
224
+ }
225
+ }
226
+
227
+ // scoped_literal: a literal that holds a reference to its atom.
228
+ export class ScopedLiteral {
229
+ literal = TRUE_LITERAL;
230
+
231
+ constructor(private table: AtomTable) {}
232
+
233
+ set(literal: number) {
234
+ this.table.incRef(literal);
235
+ this.table.decRef(this.literal);
236
+ this.literal = literal;
237
+ }
238
+ }
@@ -0,0 +1,303 @@
1
+ // Ported from Z3 (src/nlsat/nlsat_evaluator.cpp), MIT license, see z3-license.txt. Evaluates atoms
2
+ // at the assignment, and computes the intervals of the maximal variable of an atom that falsify a
3
+ // literal at the values of the variables below it. The assignment is the solver's, shared and
4
+ // refined in place.
5
+ import type { Anum, AlgebraicManager } from "./algebraic";
6
+ import { type IntervalSet, IntervalSetManager } from "./interval-set";
7
+ import type { Polynomial, PolynomialManager } from "./polynomial";
8
+ import { type Atom, type Clause, type IneqAtom, type RootAtom, isIneqAtom } from "./types";
9
+
10
+ // Z3's LINEAR_SEARCH_THRESHOLD.
11
+ const LINEAR_SEARCH_THRESHOLD = 8;
12
+
13
+ interface Section {
14
+ root: Anum;
15
+ position: number;
16
+ }
17
+
18
+ interface PolynomialInfo {
19
+ rootCount: number;
20
+ firstSection: number;
21
+ firstSign: number;
22
+ }
23
+
24
+ // sign_table: the roots of the factors of an atom merged into one sorted list of sections. Cell 2i
25
+ // is the sector below sorted section i, cell 2i + 1 the section itself.
26
+ class SignTable {
27
+ private sections: Section[] = [];
28
+ private sortedSections: number[] = [];
29
+ private polynomialSections: number[] = [];
30
+ private polynomialSigns: number[] = [];
31
+ private infos: PolynomialInfo[] = [];
32
+
33
+ constructor(private am: AlgebraicManager) {}
34
+
35
+ private mkSection(root: Anum, position: number) {
36
+ this.sections.push({ root: this.am.copy(root), position });
37
+ return this.sections.length - 1;
38
+ }
39
+
40
+ private merge(roots: Anum[]) {
41
+ const sectionIds: number[] = [];
42
+ const sorted: number[] = [];
43
+ let sortedIndex = 0;
44
+ let rootIndex = 0;
45
+ while (sortedIndex < this.sortedSections.length && rootIndex < roots.length) {
46
+ const sectionId = this.sortedSections[sortedIndex];
47
+ const section = this.sections[sectionId];
48
+ const sign = this.am.compare(section.root, roots[rootIndex]);
49
+ if (sign <= 0) {
50
+ sorted.push(sectionId);
51
+ if (sign === 0) {
52
+ sectionIds.push(sectionId);
53
+ rootIndex++;
54
+ }
55
+ section.position = sorted.length - 1;
56
+ sortedIndex++;
57
+ } else {
58
+ const id = this.mkSection(roots[rootIndex], sorted.length);
59
+ sorted.push(id);
60
+ sectionIds.push(id);
61
+ rootIndex++;
62
+ }
63
+ }
64
+ for (; sortedIndex < this.sortedSections.length; sortedIndex++) {
65
+ this.sections[this.sortedSections[sortedIndex]].position = sorted.length;
66
+ sorted.push(this.sortedSections[sortedIndex]);
67
+ }
68
+ for (; rootIndex < roots.length; rootIndex++) {
69
+ const id = this.mkSection(roots[rootIndex], sorted.length);
70
+ sorted.push(id);
71
+ sectionIds.push(id);
72
+ }
73
+ this.sortedSections = sorted;
74
+ return sectionIds;
75
+ }
76
+
77
+ add(roots: Anum[], signs: number[]) {
78
+ const sectionIds = roots.length === 0 ? [] : this.merge(roots);
79
+ this.infos.push({
80
+ rootCount: roots.length,
81
+ firstSection: this.polynomialSections.length,
82
+ firstSign: this.polynomialSigns.length,
83
+ });
84
+ this.polynomialSigns.push(...signs);
85
+ this.polynomialSections.push(...sectionIds);
86
+ }
87
+
88
+ addConst(sign: number) {
89
+ this.infos.push({
90
+ rootCount: 0,
91
+ firstSection: this.polynomialSections.length,
92
+ firstSign: this.polynomialSigns.length,
93
+ });
94
+ this.polynomialSigns.push(sign);
95
+ }
96
+
97
+ get cellCount() {
98
+ return this.sections.length * 2 + 1;
99
+ }
100
+
101
+ isSection(cell: number) {
102
+ return cell % 2 === 1;
103
+ }
104
+
105
+ getRoot(cell: number) {
106
+ return this.sections[this.sortedSections[Math.floor(cell / 2)]].root;
107
+ }
108
+
109
+ private getCellId(info: PolynomialInfo, index: number) {
110
+ return this.sections[this.polynomialSections[info.firstSection + index]].position * 2 + 1;
111
+ }
112
+
113
+ private getSign(info: PolynomialInfo, index: number) {
114
+ return this.polynomialSigns[info.firstSign + index];
115
+ }
116
+
117
+ // sign_at: the sign of the infoId-th polynomial in the cell.
118
+ signAt(infoId: number, cell: number) {
119
+ const info = this.infos[infoId];
120
+ const rootCount = info.rootCount;
121
+ if (rootCount < LINEAR_SEARCH_THRESHOLD) {
122
+ let index = 0;
123
+ for (; index < rootCount; index++) {
124
+ const sectionCell = this.getCellId(info, index);
125
+ if (sectionCell === cell) return 0;
126
+ if (sectionCell > cell) break;
127
+ }
128
+ return this.getSign(info, index);
129
+ }
130
+ const firstCell = this.getCellId(info, 0);
131
+ const lastCell = this.getCellId(info, rootCount - 1);
132
+ if (cell < firstCell) return this.getSign(info, 0);
133
+ if (cell === firstCell || cell === lastCell) return 0;
134
+ if (cell > lastCell) return this.getSign(info, rootCount);
135
+ let low = 0;
136
+ let high = rootCount - 1;
137
+ while (high !== low + 1) {
138
+ const middle = low + Math.floor((high - low) / 2);
139
+ const middleCell = this.getCellId(info, middle);
140
+ if (middleCell === cell) return 0;
141
+ if (cell < middleCell) high = middle;
142
+ else low = middle;
143
+ }
144
+ return this.getSign(info, low + 1);
145
+ }
146
+ }
147
+
148
+ const isSatisfied = (sign: number, kind: Atom["kind"], isNeg: boolean) => {
149
+ const isTrue =
150
+ (sign === 0 &&
151
+ (kind === "EQ" || kind === "ROOT_EQ" || kind === "ROOT_LE" || kind === "ROOT_GE")) ||
152
+ (sign < 0 && (kind === "LT" || kind === "ROOT_LT" || kind === "ROOT_LE")) ||
153
+ (sign > 0 && (kind === "GT" || kind === "ROOT_GT" || kind === "ROOT_GE"));
154
+ return isNeg ? !isTrue : isTrue;
155
+ };
156
+
157
+ const getLiteral = (atom: Atom, isNeg: boolean) => 2 * atom.boolVar + (isNeg ? 1 : 0);
158
+
159
+ export class Evaluator {
160
+ readonly ism: IntervalSetManager;
161
+
162
+ constructor(
163
+ private pm: PolynomialManager,
164
+ private am: AlgebraicManager,
165
+ private assignment: (Anum | undefined)[],
166
+ ) {
167
+ this.ism = new IntervalSetManager(am);
168
+ }
169
+
170
+ private getValuesWithout(variable: number) {
171
+ return this.assignment.map((value, index) => (index === variable ? undefined : value));
172
+ }
173
+
174
+ eval(atom: Atom, isNeg: boolean) {
175
+ return isIneqAtom(atom) ? this.evalIneq(atom, isNeg) : this.evalRoot(atom, isNeg);
176
+ }
177
+
178
+ private evalIneq(atom: IneqAtom, isNeg: boolean) {
179
+ let sign = 1;
180
+ for (const [index, polynomial] of atom.polynomials.entries()) {
181
+ const currentSign = this.am.evalSignAt(this.pm, polynomial, this.assignment);
182
+ sign *= atom.isEven[index] && currentSign < 0 ? 1 : currentSign;
183
+ if (sign === 0) break;
184
+ }
185
+ return isSatisfied(sign, atom.kind, isNeg);
186
+ }
187
+
188
+ private evalRoot(atom: RootAtom, isNeg: boolean) {
189
+ const roots = this.am.isolateRoots(
190
+ this.pm,
191
+ atom.polynomial,
192
+ this.getValuesWithout(atom.maxVar),
193
+ );
194
+ if (atom.index > roots.length) return isNeg;
195
+ const sign = this.am.compare(this.assignment[atom.maxVar]!, roots[atom.index - 1]);
196
+ return isSatisfied(sign, atom.kind, isNeg);
197
+ }
198
+
199
+ infeasibleIntervals(atom: Atom, isNeg: boolean, clause: Clause | null) {
200
+ return isIneqAtom(atom)
201
+ ? this.getIneqInfeasibleIntervals(atom, isNeg, clause)
202
+ : this.getRootInfeasibleIntervals(atom, isNeg, clause);
203
+ }
204
+
205
+ private addToTable(polynomial: Polynomial, variable: number, table: SignTable) {
206
+ if (this.pm.maxVar(polynomial) < variable) {
207
+ table.addConst(this.am.evalSignAt(this.pm, polynomial, this.assignment));
208
+ return;
209
+ }
210
+ const signed = this.am.isolateRootsWithSigns(
211
+ this.pm,
212
+ polynomial,
213
+ this.getValuesWithout(variable),
214
+ );
215
+ table.add(signed.roots, signed.signs);
216
+ }
217
+
218
+ // The maximal runs of cells where the literal is false, as a union of intervals.
219
+ private getIneqInfeasibleIntervals(atom: IneqAtom, isNeg: boolean, clause: Clause | null) {
220
+ const table = new SignTable(this.am);
221
+ for (const polynomial of atom.polynomials) this.addToTable(polynomial, atom.maxVar, table);
222
+ const justification = getLiteral(atom, isNeg);
223
+ const getSign = (cell: number) => {
224
+ let sign = 1;
225
+ for (let index = 0; index < atom.polynomials.length; index++) {
226
+ const currentSign = table.signAt(index, cell);
227
+ sign *= atom.isEven[index] && currentSign < 0 ? 1 : currentSign;
228
+ if (sign === 0) break;
229
+ }
230
+ return sign;
231
+ };
232
+ let result: IntervalSet | null = null;
233
+ let isPreviousSat = true;
234
+ let isPreviousOpen = true;
235
+ let previousRoot: Anum | null = null;
236
+ const cellCount = table.cellCount;
237
+ for (let cell = 0; cell < cellCount; cell++) {
238
+ if (isSatisfied(getSign(cell), atom.kind, isNeg)) {
239
+ if (!isPreviousSat) {
240
+ const set = this.ism.mk(
241
+ isPreviousOpen,
242
+ previousRoot,
243
+ table.isSection(cell),
244
+ table.getRoot(table.isSection(cell) ? cell : cell - 1),
245
+ justification,
246
+ clause,
247
+ );
248
+ result = this.ism.mkUnion(result, set);
249
+ isPreviousSat = true;
250
+ }
251
+ continue;
252
+ }
253
+ if (isPreviousSat) {
254
+ if (cell === 0) {
255
+ if (cellCount === 1) result = this.ism.mk(true, null, true, null, justification, clause);
256
+ isPreviousOpen = true;
257
+ previousRoot = null;
258
+ } else {
259
+ isPreviousOpen = !table.isSection(cell);
260
+ previousRoot = table.getRoot(table.isSection(cell) ? cell : cell - 1);
261
+ }
262
+ isPreviousSat = false;
263
+ }
264
+ if (cell === cellCount - 1) {
265
+ const set = this.ism.mk(isPreviousOpen, previousRoot, true, null, justification, clause);
266
+ result = this.ism.mkUnion(result, set);
267
+ }
268
+ }
269
+ return result;
270
+ }
271
+
272
+ private getRootInfeasibleIntervals(atom: RootAtom, isNeg: boolean, clause: Clause | null) {
273
+ const justification = getLiteral(atom, isNeg);
274
+ const roots = this.am.isolateRoots(
275
+ this.pm,
276
+ atom.polynomial,
277
+ this.getValuesWithout(atom.maxVar),
278
+ );
279
+ if (atom.index > roots.length)
280
+ return isNeg ? null : this.ism.mk(true, null, true, null, justification, clause);
281
+ const root = roots[atom.index - 1];
282
+ const mk = (
283
+ isLowerOpen: boolean,
284
+ lower: Anum | null,
285
+ isUpperOpen: boolean,
286
+ upper: Anum | null,
287
+ ) => this.ism.mk(isLowerOpen, lower, isUpperOpen, upper, justification, clause);
288
+ switch (atom.kind) {
289
+ case "ROOT_EQ":
290
+ return isNeg
291
+ ? mk(false, root, false, root)
292
+ : this.ism.mkUnion(mk(true, null, true, root), mk(true, root, true, null));
293
+ case "ROOT_LT":
294
+ return isNeg ? mk(true, null, true, root) : mk(false, root, true, null);
295
+ case "ROOT_GT":
296
+ return isNeg ? mk(true, root, true, null) : mk(true, null, false, root);
297
+ case "ROOT_LE":
298
+ return isNeg ? mk(true, null, false, root) : mk(true, root, true, null);
299
+ case "ROOT_GE":
300
+ return isNeg ? mk(false, root, true, null) : mk(true, null, true, root);
301
+ }
302
+ }
303
+ }