tla-ts 0.0.10-dev.cb7650c54 → 0.0.10-dev.d618a2d79

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 (454) hide show
  1. package/dist/deciders.cjs +29 -29
  2. package/dist/deciders.js +29 -29
  3. package/dist/prove.cjs +17 -17
  4. package/dist/prove.js +57 -57
  5. package/dist/run.cjs +15 -15
  6. package/dist/run.js +38 -38
  7. package/dist/transfer.cjs +12 -12
  8. package/dist/transfer.js +5 -5
  9. package/dist/worker.cjs +1 -1
  10. package/dist/worker.js +1 -1
  11. package/package.json +1 -1
  12. package/src/check-trace.ts +2 -16
  13. package/src/check.ts +23 -6
  14. package/src/cli/tlc-output.ts +3 -3
  15. package/src/cli/tlc-usage.ts +0 -1
  16. package/src/cli/tlc.ts +15 -1
  17. package/src/environment.ts +10 -5
  18. package/src/exit-codes.ts +1 -0
  19. package/src/liveness-checker.ts +27 -4
  20. package/src/obligations/action.ts +0 -2
  21. package/src/obligations/anonymize.ts +0 -2
  22. package/src/obligations/equality.ts +0 -2
  23. package/src/obligations/expression.ts +0 -2
  24. package/src/obligations/format.ts +0 -2
  25. package/src/obligations/generate.ts +0 -2
  26. package/src/obligations/levels.ts +0 -2
  27. package/src/obligations/module.ts +0 -2
  28. package/src/obligations/normalize.ts +0 -2
  29. package/src/obligations/operators.ts +0 -2
  30. package/src/obligations/printer.ts +0 -2
  31. package/src/obligations/proof.ts +0 -2
  32. package/src/obligations/regroup.ts +0 -2
  33. package/src/obligations/simplify.ts +0 -2
  34. package/src/obligations/subexpression.ts +0 -2
  35. package/src/obligations/substitution.ts +0 -2
  36. package/src/obligations/temporal.ts +0 -2
  37. package/src/obligations/tuples.ts +0 -2
  38. package/src/pretty-print.ts +1 -1
  39. package/src/prover/isabelle/encode.ts +0 -2
  40. package/src/prover/isabelle/isar/attrib.ts +0 -4
  41. package/src/prover/isabelle/isar/context.ts +0 -4
  42. package/src/prover/isabelle/isar/induct.ts +0 -4
  43. package/src/prover/isabelle/isar/method.ts +0 -2
  44. package/src/prover/isabelle/isar/proof.ts +0 -2
  45. package/src/prover/isabelle/isar/rule-cases.ts +0 -2
  46. package/src/prover/isabelle/isar/toplevel.ts +0 -4
  47. package/src/prover/isabelle/isar/type-check.ts +0 -2
  48. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  49. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  50. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  51. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  52. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  53. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  54. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  55. package/src/prover/isabelle/provers/classical.ts +0 -2
  56. package/src/prover/isabelle/provers/hypsubst.ts +0 -2
  57. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  58. package/src/prover/isabelle/pure/consts.ts +0 -2
  59. package/src/prover/isabelle/pure/conv.ts +0 -2
  60. package/src/prover/isabelle/pure/drule.ts +0 -2
  61. package/src/prover/isabelle/pure/envir.ts +0 -2
  62. package/src/prover/isabelle/pure/goal.ts +0 -2
  63. package/src/prover/isabelle/pure/logic.ts +0 -2
  64. package/src/prover/isabelle/pure/name.ts +0 -2
  65. package/src/prover/isabelle/pure/net.ts +0 -2
  66. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  67. package/src/prover/isabelle/pure/pattern.ts +0 -2
  68. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  69. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  70. package/src/prover/isabelle/pure/search.ts +0 -2
  71. package/src/prover/isabelle/pure/seq.ts +0 -2
  72. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  73. package/src/prover/isabelle/pure/table.ts +0 -2
  74. package/src/prover/isabelle/pure/tactic.ts +0 -2
  75. package/src/prover/isabelle/pure/tactical.ts +0 -2
  76. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  77. package/src/prover/isabelle/pure/term.ts +0 -2
  78. package/src/prover/isabelle/pure/thm.ts +0 -2
  79. package/src/prover/isabelle/pure/type.ts +0 -2
  80. package/src/prover/isabelle/pure/unify.ts +0 -2
  81. package/src/prover/isabelle/pure/variable.ts +0 -2
  82. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  83. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  84. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  85. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  86. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  87. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  88. package/src/prover/smt/solver/act-cache.ts +0 -1
  89. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  90. package/src/prover/smt/solver/aig-tactic.ts +0 -1
  91. package/src/prover/smt/solver/aig.ts +2 -3
  92. package/src/prover/smt/solver/arith-rewriter.ts +0 -1
  93. package/src/prover/smt/solver/arith-terms.ts +0 -2
  94. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  95. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  96. package/src/prover/smt/solver/asserted-formulas.ts +0 -1
  97. package/src/prover/smt/solver/ast-lt.ts +0 -1
  98. package/src/prover/smt/solver/ast-util.ts +0 -2
  99. package/src/prover/smt/solver/ast.ts +0 -1
  100. package/src/prover/smt/solver/auf-solver.ts +0 -1
  101. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  102. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  103. package/src/prover/smt/solver/bound-manager.ts +0 -1
  104. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  105. package/src/prover/smt/solver/bv-bound-chk.ts +0 -2
  106. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  107. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  108. package/src/prover/smt/solver/bv-rewriter.ts +0 -2
  109. package/src/prover/smt/solver/bv1-blast.ts +0 -2
  110. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  111. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  112. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  113. package/src/prover/smt/solver/card2bv.ts +0 -2
  114. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  115. package/src/prover/smt/solver/cg-table.ts +0 -2
  116. package/src/prover/smt/solver/check-logic.ts +0 -1
  117. package/src/prover/smt/solver/clause.ts +0 -1
  118. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  119. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  120. package/src/prover/smt/solver/context.ts +0 -1
  121. package/src/prover/smt/solver/ctx-simplify.ts +0 -1
  122. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  123. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  124. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  125. package/src/prover/smt/solver/demodulator.ts +0 -3
  126. package/src/prover/smt/solver/dependent-expr-state.ts +0 -3
  127. package/src/prover/smt/solver/der.ts +0 -1
  128. package/src/prover/smt/solver/diff-neq.ts +0 -1
  129. package/src/prover/smt/solver/distribute-forall.ts +0 -1
  130. package/src/prover/smt/solver/dom-simplify.ts +0 -2
  131. package/src/prover/smt/solver/dt2bv-tactic.ts +0 -2
  132. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  133. package/src/prover/smt/solver/e-matching.ts +0 -1
  134. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  135. package/src/prover/smt/solver/elim-uncnstr.ts +0 -2
  136. package/src/prover/smt/solver/enode.ts +0 -1
  137. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  138. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  139. package/src/prover/smt/solver/euf/arith-internalize.ts +0 -2
  140. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  141. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  142. package/src/prover/smt/solver/euf/array-internalize.ts +0 -2
  143. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  144. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  145. package/src/prover/smt/solver/euf/bv-internalize.ts +0 -2
  146. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  147. package/src/prover/smt/solver/euf/dt-solver.ts +0 -2
  148. package/src/prover/smt/solver/euf/egraph.ts +2 -3
  149. package/src/prover/smt/solver/euf/euf-solver.ts +0 -3
  150. package/src/prover/smt/solver/euf/fpa-solver.ts +0 -2
  151. package/src/prover/smt/solver/euf/mam.ts +0 -2
  152. package/src/prover/smt/solver/euf/q-ematch.ts +0 -2
  153. package/src/prover/smt/solver/euf/q-mbi.ts +0 -2
  154. package/src/prover/smt/solver/euf/q-model-fixer.ts +0 -3
  155. package/src/prover/smt/solver/euf/q-solver.ts +0 -2
  156. package/src/prover/smt/solver/euf/th-solver.ts +0 -2
  157. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  158. package/src/prover/smt/solver/expr-ref.ts +0 -1
  159. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  160. package/src/prover/smt/solver/expr2polynomial.ts +0 -1
  161. package/src/prover/smt/solver/factor.ts +0 -1
  162. package/src/prover/smt/solver/fd-solver.ts +0 -3
  163. package/src/prover/smt/solver/fingerprints.ts +0 -1
  164. package/src/prover/smt/solver/fix-dl-var.ts +0 -1
  165. package/src/prover/smt/solver/flat-literals.ts +0 -1
  166. package/src/prover/smt/solver/fm-tactic.ts +0 -1
  167. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  168. package/src/prover/smt/solver/fpa-rewriter.ts +0 -1
  169. package/src/prover/smt/solver/fpa2bv-converter.ts +0 -1
  170. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  171. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  172. package/src/prover/smt/solver/goal.ts +0 -1
  173. package/src/prover/smt/solver/goal2nlsat.ts +0 -2
  174. package/src/prover/smt/solver/guard-set.ts +0 -1
  175. package/src/prover/smt/solver/hash.ts +0 -1
  176. package/src/prover/smt/solver/hashtable.ts +0 -1
  177. package/src/prover/smt/solver/inf-eps.ts +1 -2
  178. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  179. package/src/prover/smt/solver/internalizer.ts +0 -1
  180. package/src/prover/smt/solver/lackr.ts +0 -2
  181. package/src/prover/smt/solver/lbool.ts +0 -1
  182. package/src/prover/smt/solver/lia2card.ts +0 -1
  183. package/src/prover/smt/solver/lia2pb.ts +0 -1
  184. package/src/prover/smt/solver/literal.ts +0 -1
  185. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  186. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  187. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  188. package/src/prover/smt/solver/lp/containers.ts +7 -2
  189. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  190. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  191. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  192. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  193. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  194. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  195. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  196. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  197. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  198. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  199. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  200. package/src/prover/smt/solver/lp/lar-solver.ts +0 -1
  201. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  202. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  203. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  204. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  205. package/src/prover/smt/solver/lp/nex.ts +2 -2
  206. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  207. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  208. package/src/prover/smt/solver/lp/nla-core.ts +25 -6
  209. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  210. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  211. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  212. package/src/prover/smt/solver/lp/nla-grobner.ts +0 -2
  213. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  214. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  215. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  216. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  217. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  218. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  219. package/src/prover/smt/solver/lp/nla-powers.ts +0 -1
  220. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  221. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  222. package/src/prover/smt/solver/lp/nla-transcendentals.ts +0 -2
  223. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  225. package/src/prover/smt/solver/lp/nra-solver.ts +97 -62
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  230. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  231. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  232. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  233. package/src/prover/smt/solver/lp/union-find.ts +0 -1
  234. package/src/prover/smt/solver/macro-finder.ts +0 -3
  235. package/src/prover/smt/solver/mam-compiler.ts +0 -1
  236. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  237. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +0 -2
  238. package/src/prover/smt/solver/max-cliques.ts +0 -2
  239. package/src/prover/smt/solver/maxcore.ts +1 -2
  240. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  241. package/src/prover/smt/solver/maxlex.ts +0 -1
  242. package/src/prover/smt/solver/maxsmt-base.ts +0 -1
  243. package/src/prover/smt/solver/maxsmt.ts +0 -1
  244. package/src/prover/smt/solver/mbp/mbp-arith.ts +0 -1
  245. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  246. package/src/prover/smt/solver/mbp/mbp-plugin.ts +0 -2
  247. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  248. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +0 -1
  249. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  250. package/src/prover/smt/solver/model-based-opt.ts +0 -1
  251. package/src/prover/smt/solver/model-checker.ts +0 -1
  252. package/src/prover/smt/solver/model-evaluator.ts +0 -1
  253. package/src/prover/smt/solver/model-finder.ts +0 -1
  254. package/src/prover/smt/solver/model-generator.ts +0 -1
  255. package/src/prover/smt/solver/model-macro-solver.ts +0 -1
  256. package/src/prover/smt/solver/model-printer.ts +0 -1
  257. package/src/prover/smt/solver/mpf.ts +0 -1
  258. package/src/prover/smt/solver/mus.ts +0 -1
  259. package/src/prover/smt/solver/muz/dl-context.ts +0 -2
  260. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  261. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +0 -2
  262. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +0 -2
  263. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  264. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +0 -1
  265. package/src/prover/smt/solver/muz/dl-mk-slice.ts +0 -1
  266. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +0 -2
  267. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  268. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -2
  269. package/src/prover/smt/solver/muz/dl-rule.ts +0 -2
  270. package/src/prover/smt/solver/muz/hnf.ts +0 -1
  271. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +0 -2
  272. package/src/prover/smt/solver/muz/horn-tactic.ts +0 -2
  273. package/src/prover/smt/solver/muz/rule-properties.ts +0 -1
  274. package/src/prover/smt/solver/muz/spacer-context.ts +0 -1
  275. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +0 -1
  276. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  277. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  278. package/src/prover/smt/solver/muz/spacer-pdr.ts +0 -1
  279. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -2
  280. package/src/prover/smt/solver/muz/spacer-util.ts +0 -1
  281. package/src/prover/smt/solver/muz/substitution.ts +0 -2
  282. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  283. package/src/prover/smt/solver/nlqsat.ts +2 -2
  284. package/src/prover/smt/solver/nlsat/algebraic.ts +0 -2
  285. package/src/prover/smt/solver/nlsat/atoms.ts +0 -2
  286. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  287. package/src/prover/smt/solver/nlsat/explain.ts +0 -1
  288. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  289. package/src/prover/smt/solver/nlsat/levelwise.ts +2 -3
  290. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  291. package/src/prover/smt/solver/nlsat/polynomial.ts +0 -2
  292. package/src/prover/smt/solver/nlsat/solver.ts +5 -13
  293. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  294. package/src/prover/smt/solver/nlsat/transcendentals.ts +0 -2
  295. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  296. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +0 -3
  297. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  298. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  299. package/src/prover/smt/solver/nnf.ts +0 -1
  300. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  301. package/src/prover/smt/solver/occf.ts +0 -1
  302. package/src/prover/smt/solver/opt-context.ts +1 -2
  303. package/src/prover/smt/solver/opt-nlsat.ts +0 -1
  304. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  305. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  306. package/src/prover/smt/solver/opt-solver.ts +0 -1
  307. package/src/prover/smt/solver/opt-value.ts +0 -1
  308. package/src/prover/smt/solver/optsmt.ts +0 -2
  309. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  310. package/src/prover/smt/solver/pattern-inference.ts +0 -1
  311. package/src/prover/smt/solver/pb-rewriter.ts +0 -3
  312. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  313. package/src/prover/smt/solver/poly-rewriter.ts +0 -1
  314. package/src/prover/smt/solver/probes.ts +2 -4
  315. package/src/prover/smt/solver/propagate-values.ts +0 -1
  316. package/src/prover/smt/solver/proto-model.ts +0 -1
  317. package/src/prover/smt/solver/pull-quant.ts +0 -1
  318. package/src/prover/smt/solver/purify-arith.ts +0 -1
  319. package/src/prover/smt/solver/qe-arith-plugin.ts +0 -2
  320. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  321. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  322. package/src/prover/smt/solver/qe-lite.ts +0 -1
  323. package/src/prover/smt/solver/qe-mbp.ts +0 -1
  324. package/src/prover/smt/solver/qe.ts +0 -2
  325. package/src/prover/smt/solver/qel.ts +0 -1
  326. package/src/prover/smt/solver/qi-queue.ts +0 -1
  327. package/src/prover/smt/solver/qsat.ts +0 -1
  328. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  329. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  330. package/src/prover/smt/solver/quantifier-analyzer.ts +0 -1
  331. package/src/prover/smt/solver/quantifier-manager.ts +0 -1
  332. package/src/prover/smt/solver/quasi-macros.ts +0 -2
  333. package/src/prover/smt/solver/random-gen.ts +0 -1
  334. package/src/prover/smt/solver/rational.ts +0 -1
  335. package/src/prover/smt/solver/recfun-decl-plugin.ts +0 -1
  336. package/src/prover/smt/solver/recfun-rewriter.ts +0 -1
  337. package/src/prover/smt/solver/reduce-args.ts +0 -1
  338. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  339. package/src/prover/smt/solver/ref-vector.ts +0 -1
  340. package/src/prover/smt/solver/relevancy.ts +0 -1
  341. package/src/prover/smt/solver/rewriter-tpl.ts +0 -1
  342. package/src/prover/smt/solver/rewriter.ts +0 -1
  343. package/src/prover/smt/solver/rlimit.ts +13 -1
  344. package/src/prover/smt/solver/sat/asymm-branch.ts +0 -2
  345. package/src/prover/smt/solver/sat/big.ts +0 -1
  346. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -2
  347. package/src/prover/smt/solver/sat/clause.ts +0 -3
  348. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  349. package/src/prover/smt/solver/sat/config.ts +0 -3
  350. package/src/prover/smt/solver/sat/consequences.ts +0 -1
  351. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  352. package/src/prover/smt/solver/sat/goal2sat.ts +0 -2
  353. package/src/prover/smt/solver/sat/inc-sat-solver.ts +0 -1
  354. package/src/prover/smt/solver/sat/model-converter.ts +0 -2
  355. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  356. package/src/prover/smt/solver/sat/pb-solver.ts +0 -2
  357. package/src/prover/smt/solver/sat/probing.ts +0 -2
  358. package/src/prover/smt/solver/sat/sat-tactic.ts +0 -1
  359. package/src/prover/smt/solver/sat/sat2goal.ts +0 -2
  360. package/src/prover/smt/solver/sat/scc.ts +0 -1
  361. package/src/prover/smt/solver/sat/simplifier.ts +0 -3
  362. package/src/prover/smt/solver/sat/solver.ts +0 -2
  363. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  364. package/src/prover/smt/solver/sat/watch-list.ts +0 -3
  365. package/src/prover/smt/solver/search-tree.ts +0 -1
  366. package/src/prover/smt/solver/seq-axioms.ts +0 -1
  367. package/src/prover/smt/solver/seq-decl-plugin.ts +0 -1
  368. package/src/prover/smt/solver/seq-derive.ts +3 -8
  369. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  370. package/src/prover/smt/solver/seq-eq-solver.ts +0 -1
  371. package/src/prover/smt/solver/seq-factory.ts +0 -1
  372. package/src/prover/smt/solver/seq-monadic.ts +0 -2
  373. package/src/prover/smt/solver/seq-range-predicate.ts +0 -2
  374. package/src/prover/smt/solver/seq-re-rewriter.ts +0 -1
  375. package/src/prover/smt/solver/seq-re-util.ts +0 -2
  376. package/src/prover/smt/solver/seq-regex-bisim.ts +0 -1
  377. package/src/prover/smt/solver/seq-regex-live.ts +0 -2
  378. package/src/prover/smt/solver/seq-rewriter.ts +0 -2
  379. package/src/prover/smt/solver/seq-skolem.ts +0 -1
  380. package/src/prover/smt/solver/seq-subset.ts +0 -1
  381. package/src/prover/smt/solver/seq-view-witness.ts +0 -2
  382. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  383. package/src/prover/smt/solver/smt-kernel.ts +0 -2
  384. package/src/prover/smt/solver/smt-logics.ts +0 -1
  385. package/src/prover/smt/solver/smt-setup.ts +3 -5
  386. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  387. package/src/prover/smt/solver/smtlib-parser.ts +0 -2
  388. package/src/prover/smt/solver/smtlib-script.ts +0 -2
  389. package/src/prover/smt/solver/solve-eqs.ts +0 -2
  390. package/src/prover/smt/solver/solver.ts +1 -2
  391. package/src/prover/smt/solver/static-features.ts +0 -2
  392. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  393. package/src/prover/smt/solver/tactic.ts +0 -2
  394. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  395. package/src/prover/smt/solver/theory-array.ts +0 -2
  396. package/src/prover/smt/solver/theory-bv.ts +0 -2
  397. package/src/prover/smt/solver/theory-char.ts +0 -1
  398. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  399. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  400. package/src/prover/smt/solver/theory-fpa.ts +0 -1
  401. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  402. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  403. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
  404. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  405. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  406. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -1
  407. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  408. package/src/prover/smt/solver/theory-lra.ts +0 -1
  409. package/src/prover/smt/solver/theory-pb.ts +0 -2
  410. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  411. package/src/prover/smt/solver/theory-recfun.ts +0 -1
  412. package/src/prover/smt/solver/theory-seq-regex.ts +0 -1
  413. package/src/prover/smt/solver/theory-seq-solve.ts +0 -2
  414. package/src/prover/smt/solver/theory-seq-state.ts +0 -2
  415. package/src/prover/smt/solver/theory-seq.ts +0 -1
  416. package/src/prover/smt/solver/theory.ts +0 -1
  417. package/src/prover/smt/solver/tseitin-cnf.ts +0 -2
  418. package/src/prover/smt/solver/var-subst.ts +0 -1
  419. package/src/prover/zenon/decide.ts +0 -2
  420. package/src/prover/zenon/encode.ts +0 -2
  421. package/src/prover/zenon/eqrel.ts +0 -2
  422. package/src/prover/zenon/equality-rules.ts +24 -2
  423. package/src/prover/zenon/expr.ts +21 -2
  424. package/src/prover/zenon/index-table.ts +2 -2
  425. package/src/prover/zenon/isar-case.ts +0 -2
  426. package/src/prover/zenon/isar.ts +0 -2
  427. package/src/prover/zenon/llproof.ts +0 -2
  428. package/src/prover/zenon/mltoll.ts +0 -2
  429. package/src/prover/zenon/node.ts +0 -2
  430. package/src/prover/zenon/parse.ts +0 -2
  431. package/src/prover/zenon/phrase.ts +0 -2
  432. package/src/prover/zenon/proof.ts +0 -2
  433. package/src/prover/zenon/propositional-rules.ts +0 -2
  434. package/src/prover/zenon/rules.ts +2 -3
  435. package/src/prover/zenon/search.ts +0 -2
  436. package/src/prover/zenon/tla/functions.ts +0 -2
  437. package/src/prover/zenon/tla/llproof.ts +0 -2
  438. package/src/prover/zenon/tla/records.ts +0 -2
  439. package/src/prover/zenon/tla/rewrites.ts +0 -2
  440. package/src/prover/zenon/tla/sets.ts +0 -2
  441. package/src/prover/zenon/tla/terms.ts +0 -2
  442. package/src/prover/zenon/tla/tla.ts +0 -2
  443. package/src/resolve.ts +1 -2
  444. package/src/runtime.ts +4 -0
  445. package/src/sany/levels.ts +0 -2
  446. package/src/sany/linter.ts +0 -2
  447. package/src/search.ts +29 -20
  448. package/src/simulate.ts +3 -0
  449. package/src/standard-definitions.ts +4 -0
  450. package/src/state-graph.ts +0 -2
  451. package/src/tlc/tlcext-operators.ts +44 -12
  452. package/src/tlc/trace-spec.ts +2 -3
  453. package/src/prover/smt/solver/z3-license.txt +0 -10
  454. package/src/prover/zenon/LICENSE +0 -32
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/array_solver.h, src/sat/smt/array_solver.cpp,
2
- // src/sat/smt/array_internalize.cpp), MIT license, see z3-license.txt.
3
1
  import { mkArrayDecl } from "../array-decl-plugin";
4
2
  import {
5
3
  FAMILY_ARRAY,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/array_solver.cpp, src/sat/smt/array_model.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { mkArrayApp, mkAsArray } from "../array-decl-plugin";
4
2
  import {
5
3
  type AstManager,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/bv_ackerman.h, src/sat/smt/bv_ackerman.cpp, src/util/dlist.h), MIT
2
- // license, see z3-license.txt.
3
1
  import type { BvInternalize } from "./bv-internalize";
4
2
 
5
3
  const UINT_MAX = 0xffffffff;
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/bv_solver.h, src/sat/smt/bv_internalize.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtUnsupportedError } from "../../../../errors";
4
2
  import {
5
3
  OP_ADD,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/bv_solver.h, src/sat/smt/bv_solver.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { OP_INT2BV, OP_UBV2INT } from "../ast";
4
2
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
5
3
  import type { ProtoModel } from "../proto-model";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/dt_solver.h, src/sat/smt/dt_solver.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtUnsupportedError } from "../../../../errors";
4
2
  import { mkArrayApp } from "../array-decl-plugin";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ast/euf/euf_egraph.h, src/ast/euf/euf_egraph.cpp, src/ast/euf/euf_enode.h,
2
- // src/ast/euf/euf_enode.cpp, src/ast/euf/euf_justification.h), MIT license, see z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  OP_ADD,
@@ -492,7 +490,8 @@ export class Egraph {
492
490
  }
493
491
  const rootVar = root.getThVar(id);
494
492
  node.replaceThVar(thVar, id);
495
- // Deviation from Z3: the undo restores the variable of the node; Z3 records that of the root.
493
+ // Deviation from Z3: the undo gives the node back its own variable. Z3 gives it the root's,
494
+ // which later equates the wrong terms.
496
495
  this.updates.push({
497
496
  tag: U_REPLACE_TH_VAR,
498
497
  r1: node,
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/euf_solver.h, src/sat/smt/euf_solver.cpp,
2
- // src/sat/smt/euf_internalize.cpp, src/sat/smt/euf_model.cpp, src/util/top_sort.h), MIT license,
3
- // see z3-license.txt.
4
1
  import { SmtInvariantError, SmtUnsupportedError } from "../../../../errors";
5
2
  import {
6
3
  type AstManager,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/fpa_solver.h, src/sat/smt/fpa_solver.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  OP_CONCAT,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ast/euf/euf_mam.h, src/ast/euf/euf_mam.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  FAMILY_ARITH,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/q_clause.h, src/sat/smt/q_eval.cpp, src/sat/smt/q_queue.cpp,
2
- // src/sat/smt/q_ematch.cpp, src/util/dlist.h), MIT license, see z3-license.txt.
3
1
  import { KIND_VAR, OP_DISTINCT, OP_EQ, QUANTIFIER_EXISTS, QUANTIFIER_FORALL } from "../ast";
4
2
  import { flattenOrVector, mkNot } from "../ast-util";
5
3
  import { PatternInferenceRw } from "../asserted-formulas";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/q_mbi.h, src/sat/smt/q_mbi.cpp,
2
- // src/ast/for_each_expr.cpp), MIT license, see z3-license.txt.
3
1
  import { SmtInvariantError } from "../../../../errors";
4
2
  import {
5
3
  type AstManager,
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/q_model_fixer.h, src/sat/smt/q_model_fixer.cpp,
2
- // src/model/arith_value_order.h, src/ast/macros/quantifier_macro_info.cpp), MIT license, see
3
- // z3-license.txt.
4
1
  import { SmtInvariantError } from "../../../../errors";
5
2
  import {
6
3
  type AstManager,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/q_solver.h, src/sat/smt/q_solver.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import {
4
2
  KIND_QUANTIFIER,
5
3
  OP_AND,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/sat_th.h, src/sat/smt/sat_th.cpp, src/util/trail.h), MIT license,
2
- // see z3-license.txt.
3
1
  import { SmtCanceledError } from "../../../../errors";
4
2
  import { mkNot } from "../ast-util";
5
3
  import type { ProtoModel } from "../proto-model";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/sat/smt/euf_solver.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../../errors";
3
2
  import {
4
3
  FAMILY_ARITH,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/ast.h), MIT license, see z3-license.txt.
2
1
  import type { AstManager } from "./ast";
3
2
 
4
3
  export const assign = (manager: AstManager, old: number, value: number) => {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/expr_safe_replace.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import { KIND_APP, KIND_VAR, type AstManager } from "./ast";
4
3
  import { RefVector } from "./ref-vector";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/expr2polynomial.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_ARITH,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/simplifiers/factor_simplifier.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_ARITH,
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/tactic/fd_solver/fd_solver.cpp, src/tactic/fd_solver/fd_simplifier.cpp,
2
- // src/solver/simplifier_solver.cpp, src/solver/solver2tactic.cpp), MIT license, see
3
- // z3-license.txt.
4
1
  import { SmtCanceledError } from "../../../errors";
5
2
  import {
6
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/fingerprints.cpp), MIT license, see z3-license.txt.
2
1
  import type { AstManager } from "./ast";
3
2
  import type { Enode } from "./enode";
4
3
  import { getCompositeHash } from "./hash";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/fix_dl_var_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_ARITH,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/bool_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import { shrink } from "./array";
3
2
  import type { AstManager } from "./ast";
4
3
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/fm_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtCanceledError, SmtTacticError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/fpa_decl_plugin.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/fpa_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  OP_EXTRACT,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/fpa/fpa2bv_converter.cpp), MIT license, see z3-license.txt.
2
1
  // A statement that discards its result builds a term that upstream builds and never uses, so the
3
2
  // terms after it get the ids Z3 gives them.
4
3
  import { SmtUnsupportedError } from "../../../errors";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/fpa/fpa2bv_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/tactic/fpa/fpa2bv_tactic.cpp, src/tactic/fpa/fpa2bv_model_converter.cpp,
2
- // src/ast/fpa/bv2fpa_converter.cpp), MIT license, see z3-license.txt.
3
1
  import type { AstManager } from "./ast";
4
2
  import { TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
5
3
  import { convertMinMaxSpecials, convertUf2BvUf } from "./bv2fpa-converter";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/goal.cpp), MIT license, see z3-license.txt.
2
1
  import { OP_AND, OP_NOT, OP_OR, SORT_BOOL, type AstManager } from "./ast";
3
2
  import type { ProtoModel } from "./proto-model";
4
3
  import { RefVector } from "./ref-vector";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/nlsat/tactic/goal2nlsat.cpp, src/ast/expr2polynomial.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtTacticError } from "../../../errors";
4
2
  import {
5
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/guard_set.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  OP_AND,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/hash.h, src/util/hash.cpp), MIT license, see z3-license.txt.
2
1
  const GOLDEN_RATIO = 0x9e3779b9;
3
2
 
4
3
  const mix = (state: Uint32Array) => {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/hashtable.h, src/util/obj_hashtable.h), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
 
4
3
  const INITIAL_CAPACITY = 8;
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/util/inf_eps_rational.h), MIT license, see z3-license.txt. A value
2
- // infinity * oo + value + epsilon * ε, ordered lexicographically.
1
+ // A value infinity * oo + value + epsilon * ε, ordered lexicographically.
3
2
  import { Rational } from "./rational";
4
3
 
5
4
  export class InfEps {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/inj_axiom.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  FAMILY_USER,
4
3
  KIND_APP,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_context.h, src/smt/smt_internalizer.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError, SmtUnsupportedError } from "../../../errors";
3
2
  import {
4
3
  AstManager,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ackermannization/lackr.cpp, src/ackermannization/lackr_model_constructor.cpp),
2
- // MIT license, see z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  KIND_APP,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/lbool.h), MIT license, see z3-license.txt.
2
1
  export const L_TRUE = 1;
3
2
  export const L_FALSE = -1;
4
3
  export const L_UNDEF = 0;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/lia2card_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  KIND_APP,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/lia2pb_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtTacticError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_literal.h, src/smt/smt_types.h), MIT license, see z3-license.txt.
2
1
  declare const boolVarBrand: unique symbol;
3
2
  declare const literalBrand: unique symbol;
4
3
 
@@ -1,7 +1,3 @@
1
- // Ported from Z3 (src/tactic/smtlogics/*.cpp, src/tactic/portfolio/default_tactic.cpp,
2
- // src/tactic/ufbv/ufbv_tactic.cpp, src/nlsat/tactic/qfnra_nlsat_tactic.cpp), MIT license, see
3
- // z3-license.txt.
4
-
5
1
  interface QfnraSolver {
6
2
  simpleCheck: number;
7
3
  heuristic?: number;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/bound_analyzer_on_row.h, src/math/lp/lp_bound_propagator.h, src/math/lp/implied_bound.h, and propagate_bounds_for_touched_rows in src/math/lp/lar_solver.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import { COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
4
3
  import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lar_constraints.h), MIT license, see z3-license.txt.
2
1
  import { type Dependency, mkLeaf } from "./dependency";
3
2
  import { Impq } from "./numeric-pair";
4
3
  import { shrink } from "../array";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/uint_set.h, src/util/heap.h, src/math/lp/stacked_vector.h), MIT license, see z3-license.txt.
2
1
  import { shrink } from "../array";
3
2
 
4
3
  export class IndexedUintSet {
@@ -160,7 +159,7 @@ interface HashLink<V> {
160
159
  }
161
160
 
162
161
  interface HashNode<V> extends HashLink<V> {
163
- readonly value: V;
162
+ value: V;
164
163
  }
165
164
 
166
165
  const constrainHash = (hash: number, count: number) =>
@@ -198,6 +197,12 @@ export class UnorderedUintMap<V> {
198
197
  for (let node = this.anchor.next; node !== null; node = node.next) yield [node.key, node.value];
199
198
  }
200
199
 
200
+ set(key: number, value: V) {
201
+ const node = this.nodes.get(key);
202
+ if (node === undefined) this.insert(key, value);
203
+ else node.value = value;
204
+ }
205
+
201
206
  insert(key: number, value: V) {
202
207
  const node: HashNode<V> = { key, value, next: null };
203
208
  const count = this.buckets.length;
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lar_core_solver.h, src/math/lp/lp_core_solver_base.h,
2
- // src/math/lp/lp_primal_core_solver.h, src/math/lp/lp_primal_core_solver_tableau_def.h), MIT
3
- // license, see z3-license.txt.
4
1
  import { Rational } from "../rational";
5
2
  import { IndexedUintSet, StackedVector, VarHeap } from "./containers";
6
3
  import type { LpSettings } from "./lp-settings";
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/cross_nested.h), MIT license, see z3-license.txt.
2
- // Deviation from Z3: the occurrence map iterates in insertion order where Z3 has an unordered_map,
3
- // so an extracted common factor may list its variables in another order.
4
1
  import { Rational } from "../rational";
5
2
  import {
6
3
  type Nex,
@@ -147,7 +144,7 @@ export class CrossNested {
147
144
  private getVarsFromOccurencesMap() {
148
145
  const occurences = this.nexCreator.occurencesMap;
149
146
  const isRandomBit = this.nextRandom() % 2 === 1;
150
- return [...occurences.keys()].sort((first, second) => {
147
+ return Array.from(occurences, (entry) => entry[0]).sort((first, second) => {
151
148
  const firstOcc = occurences.get(first);
152
149
  const secondOcc = occurences.get(second);
153
150
  if (firstOcc === undefined || secondOcc === undefined) return 0;
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/interval/interval.h, src/math/interval/interval_def.h,
2
- // src/math/interval/dep_intervals.h, src/math/interval/dep_intervals.cpp), MIT license, see
3
- // z3-license.txt.
4
1
  import { Rational } from "../rational";
5
2
  import { type Dependency, linearize, mkJoin } from "./dependency";
6
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/util/dependency.h), MIT license, see z3-license.txt.
2
-
3
1
  export interface DependencyLeaf {
4
2
  readonly isLeaf: true;
5
3
  readonly value: number;
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/dioph_eq.cpp, src/math/lp/var_register.h), MIT license, see
2
- // z3-license.txt.
3
1
  import { SmtInvariantError } from "../../../../errors";
4
2
  import { getGcd, getLcm, Rational } from "../rational";
5
3
  import { IndexedUintSet, UnorderedUintMap } from "./containers";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/explanation.h), MIT license, see z3-license.txt.
2
1
  import { getIdentityHash, ObjMap } from "../hashtable";
3
2
  import { Rational } from "../rational";
4
3
  import { type Dependency, linearize } from "./dependency";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/gomory.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import { KIND_GE, KIND_LE } from "./constraints";
4
3
  import { LP_CANCELLED } from "./core-solver";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/hnf_cutter.cpp, and get_equality_and_right_side_for_term_on_current_x in src/math/lp/lar_solver.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import type { Dependency } from "./dependency";
4
3
  import { GeneralMatrix, getDeterminantOfRectangularMatrix, getHermiteNormalForm } from "./hnf";
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/hnf.h, src/math/lp/general_matrix.h,
2
- // src/math/lp/permutation_matrix.h, and the extended gcd of src/util/mpz.cpp), MIT license, see
3
- // z3-license.txt.
4
1
  import { Rational } from "../rational";
5
2
 
6
3
  export const getRemainder = (first: Rational, second: Rational) =>
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/int_cube.cpp, and tighten_term_bounds_by_delta and round_to_integer_solution in src/math/lp/lar_solver.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
4
3
  import { LP_FEASIBLE, LP_OPTIMAL, LP_UNBOUNDED } from "./core-solver";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/int_solver.cpp, src/math/lp/int_gcd_test.cpp,
2
- // src/math/lp/int_branch.cpp), MIT license, see z3-license.txt.
3
1
  import { getGcd, getLcm, Rational } from "../rational";
4
2
  import { COLUMN_BOXED, COLUMN_FIXED, COLUMN_FREE, COLUMN_LOWER, COLUMN_UPPER } from "./core-solver";
5
3
  import { DiophantineSolver } from "./dioph-eq";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lar_solver.h, src/math/lp/lar_solver.cpp, src/math/lp/column.h, src/math/lp/var_register.h), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../../errors";
3
2
  import { Rational } from "../rational";
4
3
  import { IndexedUintSet, StackedVector } from "./containers";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lar_term.h), MIT license, see z3-license.txt.
2
1
  import { getIdentityHash, ObjMap } from "../hashtable";
3
2
  import { Rational } from "../rational";
4
3
  import { Impq } from "./numeric-pair";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/lp_settings.h, src/math/lp/lp_settings.cpp), MIT license, see z3-license.txt.
2
1
  import { RandomGen } from "../random-gen";
3
2
 
4
3
  export interface LpStats {
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (maximize_term and its helpers in src/math/lp/lar_solver.cpp, and the tableau part
2
- // of src/math/lp/lp_primal_core_solver.h, src/math/lp/lp_primal_core_solver_def.h,
3
- // src/math/lp/lp_primal_core_solver_tableau_def.h), MIT license, see z3-license.txt.
4
1
  import { Rational } from "../rational";
5
2
  import {
6
3
  COLUMN_BOXED,
@@ -1,5 +1,5 @@
1
- // Ported from Z3 (src/math/lp/nex_creator.h, src/math/lp/nex_creator.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
2
+ import { UnorderedUintMap } from "./containers";
3
3
  import {
4
4
  type Nex,
5
5
  type NexMul,
@@ -25,8 +25,8 @@ interface MapEntry<Value> {
25
25
  }
26
26
 
27
27
  export class NexCreator {
28
- readonly occurencesMap = new Map<number, Occ>();
29
- readonly powers = new Map<number, number>();
28
+ readonly occurencesMap = new UnorderedUintMap<Occ>();
29
+ readonly powers = new UnorderedUintMap<number>();
30
30
  private activeVarsWeights: number[] = [];
31
31
 
32
32
  setNumberOfVars(count: number) {
@@ -1,5 +1,5 @@
1
- // Ported from Z3 (src/math/lp/nex.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
2
+ import type { UnorderedUintMap } from "./containers";
3
3
 
4
4
  interface NexScalar {
5
5
  readonly kind: "scalar";
@@ -64,7 +64,7 @@ export const isALinearTerm = (sum: NexSum) => {
64
64
  return numberOfNonScalars > 1;
65
65
  };
66
66
 
67
- export const getPowersFromMul = (mul: NexMul, powers: Map<number, number>) => {
67
+ export const getPowersFromMul = (mul: NexMul, powers: UnorderedUintMap<number>) => {
68
68
  powers.clear();
69
69
  for (const child of mul.children)
70
70
  if (child.expr.kind === "var") powers.set(child.expr.variable, child.power);
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_backoff.h), MIT license, see z3-license.txt.
2
-
3
1
  export class Backoff {
4
2
  private delay = 0;
5
3
 
@@ -1,7 +1,6 @@
1
- // Ported from Z3 (src/math/lp/nla_basics_lemmas.h, src/math/lp/nla_basics_lemmas.cpp), MIT license,
2
- // see z3-license.txt.
3
1
  import { Rational } from "../rational";
4
2
  import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
3
+ import { NULL_LPVAR } from "./lar-solver";
5
4
  import { LarTerm } from "./lar-term";
6
5
  import type { NlaCore } from "./nla-core";
7
6
  import type { Factorization } from "./nla-factorization";
@@ -307,8 +306,52 @@ export class Basics {
307
306
  );
308
307
  }
309
308
 
310
- // Deviation from Z3: the monic-to-factor neutral lemma is left out because it never fires (nla_basics_lemmas.cpp).
309
+ private basicLemmaForMonNeutralMonicToFactorModelBased(
310
+ rooted: Monic,
311
+ factorization: Factorization,
312
+ ) {
313
+ const core = this.core;
314
+ const monicVar = core.emons.get(rooted.variable).variable;
315
+ const absMonicValue = core.val(monicVar).abs();
316
+ if (absMonicValue.isZero()) return;
317
+ let sameAbsVar = NULL_LPVAR;
318
+ let nonUnitVar = NULL_LPVAR;
319
+ let isAllInt = true;
320
+ for (const factor of factorization.factors) {
321
+ const lpVar = factor.variable;
322
+ isAllInt &&= core.varIsInt(lpVar);
323
+ // Z3 tests the factor's variable against null_lpvar, which never holds, so the lemma never fires.
324
+ if (lpVar === NULL_LPVAR && core.valFactor(factor).abs().equals(absMonicValue))
325
+ sameAbsVar = lpVar;
326
+ else if (!core.valFactor(factor).abs().equals(Rational.one)) nonUnitVar = lpVar;
327
+ }
328
+ if (sameAbsVar === NULL_LPVAR || nonUnitVar === NULL_LPVAR) return;
329
+ if (!isAllInt && factorization.factors.length > 2) return;
330
+ const lemma = new LemmaBuilder(core);
331
+ lemma.addIneq(mkIneq(monicVar, KIND_EQ, 0));
332
+ lemma.addIneq(
333
+ mkIneq(
334
+ new LarTerm([
335
+ [sameAbsVar, Rational.one],
336
+ [
337
+ monicVar,
338
+ core.val(sameAbsVar).equals(core.val(monicVar).neg())
339
+ ? Rational.one
340
+ : Rational.minusOne,
341
+ ],
342
+ ]),
343
+ KIND_NE,
344
+ 0,
345
+ ),
346
+ );
347
+ lemma.addIneq(mkIneq(nonUnitVar, KIND_EQ, 1));
348
+ lemma.addIneq(mkIneq(nonUnitVar, KIND_EQ, -1));
349
+ lemma.explainMonic(rooted);
350
+ lemma.explainFactorization(factorization);
351
+ }
352
+
311
353
  private basicLemmaForMonNeutralModelBased(rooted: Monic, factorization: Factorization) {
354
+ this.basicLemmaForMonNeutralMonicToFactorModelBased(rooted, factorization);
312
355
  if (factorization.mon !== null)
313
356
  this.basicLemmaForMonNeutralFromFactorsToMonicModelBasedFm(factorization.mon);
314
357
  else this.basicLemmaForMonNeutralFromFactorsToMonicModelBased(rooted, factorization);