tla-ts 0.0.10-dev.d166e0ae9 → 0.0.10-dev.e3e5dd576
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.
- package/dist/deciders.cjs +29 -29
- package/dist/deciders.js +30 -30
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -0
- package/dist/index.d.ts +4 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +42 -42
- package/dist/prove.js +46 -46
- package/dist/run.cjs +40 -42
- package/dist/run.js +41 -43
- package/dist/transfer.cjs +45 -42
- package/dist/transfer.js +39 -36
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +3 -1
- package/src/check-failure.ts +5 -6
- package/src/check-trace.ts +4 -4
- package/src/check.ts +78 -90
- package/src/cli/tlc-output.ts +16 -2
- package/src/cli/tlc.ts +2 -2
- package/src/codegen.ts +7 -15
- package/src/coverage.ts +187 -1
- package/src/dependencies.ts +7 -2
- package/src/dfid.ts +80 -27
- package/src/environment.ts +38 -7
- package/src/evaluate.ts +221 -47
- package/src/exit-codes.ts +3 -4
- package/src/instances.ts +119 -5
- package/src/levels.ts +541 -191
- package/src/lexer.ts +12 -2
- package/src/liveness-checker.ts +123 -70
- package/src/liveness.ts +1 -1
- package/src/parser.ts +66 -5
- package/src/prover/smt/solver/asserted-formulas.ts +2 -0
- package/src/prover/smt/solver/ast.ts +3 -0
- package/src/prover/smt/solver/bit-blast-tactic.ts +1 -1
- package/src/prover/smt/solver/context.ts +21 -6
- package/src/prover/smt/solver/dependent-expr-state.ts +2 -1
- package/src/prover/smt/solver/dt2bv-tactic.ts +21 -1
- package/src/prover/smt/solver/fd-solver.ts +568 -208
- package/src/prover/smt/solver/logic-tactics.ts +6 -3
- package/src/prover/smt/solver/lp/core-solver.ts +12 -8
- package/src/prover/smt/solver/lp/lar-solver.ts +1 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -1
- package/src/prover/smt/solver/rlimit.ts +3 -3
- package/src/prover/smt/solver/sat/goal2sat.ts +65 -11
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +51 -18
- package/src/prover/smt/solver/sat/pb-constraint.ts +7 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +25 -6
- package/src/prover/smt/solver/sat/sat2goal.ts +66 -45
- package/src/prover/smt/solver/sat/solver.ts +2 -0
- package/src/prover/smt/solver/smt-setup.ts +10 -3
- package/src/prover/smt/solver/smtlib-script.ts +53 -29
- package/src/prover/smt/solver/tactic.ts +18 -6
- package/src/prover/smt/solver/theory-lra-state.ts +1 -1
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/resolve.ts +242 -45
- package/src/sany/generation.ts +3 -2
- package/src/sany/generator-def-entries.ts +123 -36
- package/src/sany/generator-definitions.ts +2 -2
- package/src/sany/generator-expressions.ts +22 -7
- package/src/sany/generator-proofs.ts +12 -9
- package/src/sany/generator.ts +10 -5
- package/src/sany/lexer.ts +12 -4
- package/src/search.ts +84 -9
- package/src/simulate.ts +114 -124
- package/src/standard-definitions.ts +1 -0
- package/src/subexpressions.ts +58 -27
- package/src/successors.ts +27 -10
- package/src/tlc/replay.ts +40 -29
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +8 -4
- package/src/values.ts +15 -1
package/dist/index.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.v,exports.TlaError=e.b,exports.TlaEvaluationError=e.x,exports.TlaSyntaxError=e.I,exports.TlaUnsupportedError=e.V,exports.check=n.S,exports.formatValue=t.
|
|
9
|
+
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.v,exports.TlaError=e.b,exports.TlaEvaluationError=e.x,exports.TlaSyntaxError=e.I,exports.TlaUnsupportedError=e.V,exports.check=n.S,exports.formatValue=t.wn,exports.parseConfig=t.tr,exports.parseModule=t.Pt,exports.prove=n.o;
|
package/dist/index.d.cts
CHANGED
|
@@ -204,10 +204,12 @@ type ExceptPathStep = {
|
|
|
204
204
|
} | {
|
|
205
205
|
kind: "Index";
|
|
206
206
|
args: Expression[];
|
|
207
|
+
tupleRange: SourceRange;
|
|
207
208
|
};
|
|
208
209
|
interface ExceptUpdate {
|
|
209
210
|
path: ExceptPathStep[];
|
|
210
211
|
value: Expression;
|
|
212
|
+
range: SourceRange;
|
|
211
213
|
}
|
|
212
214
|
interface ExceptExpression {
|
|
213
215
|
kind: "Except";
|
|
@@ -483,6 +485,7 @@ interface Module {
|
|
|
483
485
|
theorems: Theorem[];
|
|
484
486
|
uses: UseOrHide[];
|
|
485
487
|
units: ModuleUnit[];
|
|
488
|
+
hasRecursiveLet: boolean;
|
|
486
489
|
}
|
|
487
490
|
type TlcVersion = "1.7.4" | "master";
|
|
488
491
|
type ConfigValue = {
|
|
@@ -656,6 +659,7 @@ interface FilteredSetValue extends LazySet {
|
|
|
656
659
|
kind: "FilteredSet";
|
|
657
660
|
base: Value;
|
|
658
661
|
test: (element: Value, isMember: boolean) => boolean;
|
|
662
|
+
startPass?: (isMaterialized: boolean) => (element: Value) => boolean;
|
|
659
663
|
source?: FilteredSetSource;
|
|
660
664
|
}
|
|
661
665
|
interface UnionValue extends LazySet {
|
package/dist/index.d.ts
CHANGED
|
@@ -204,10 +204,12 @@ type ExceptPathStep = {
|
|
|
204
204
|
} | {
|
|
205
205
|
kind: "Index";
|
|
206
206
|
args: Expression[];
|
|
207
|
+
tupleRange: SourceRange;
|
|
207
208
|
};
|
|
208
209
|
interface ExceptUpdate {
|
|
209
210
|
path: ExceptPathStep[];
|
|
210
211
|
value: Expression;
|
|
212
|
+
range: SourceRange;
|
|
211
213
|
}
|
|
212
214
|
interface ExceptExpression {
|
|
213
215
|
kind: "Except";
|
|
@@ -483,6 +485,7 @@ interface Module {
|
|
|
483
485
|
theorems: Theorem[];
|
|
484
486
|
uses: UseOrHide[];
|
|
485
487
|
units: ModuleUnit[];
|
|
488
|
+
hasRecursiveLet: boolean;
|
|
486
489
|
}
|
|
487
490
|
type TlcVersion = "1.7.4" | "master";
|
|
488
491
|
type ConfigValue = {
|
|
@@ -656,6 +659,7 @@ interface FilteredSetValue extends LazySet {
|
|
|
656
659
|
kind: "FilteredSet";
|
|
657
660
|
base: Value;
|
|
658
661
|
test: (element: Value, isMember: boolean) => boolean;
|
|
662
|
+
startPass?: (isMaterialized: boolean) => (element: Value) => boolean;
|
|
659
663
|
source?: FilteredSetSource;
|
|
660
664
|
}
|
|
661
665
|
interface UnionValue extends LazySet {
|
package/dist/index.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{I as e,V as t,b as n,v as r,x as i}from"./worker.js";import{
|
|
9
|
+
import{I as e,V as t,b as n,v as r,x as i}from"./worker.js";import{Pt as a,tr as o,wn as s}from"./transfer.js";import{S as c,o as l}from"./prove.js";export{r as TlaConfigError,n as TlaError,i as TlaEvaluationError,e as TlaSyntaxError,t as TlaUnsupportedError,c as check,s as formatValue,o as parseConfig,a as parseModule,l as prove};
|
package/dist/parallel-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.u(n.config,{...n,loadModule:a,loadClass:e=>o.get(e),seed:void 0},()=>{},!0),c=s.specification,l=c.environment,u=t.f(n.config,l,c.variableLocations,()=>s.order.getDeclarationOrder(`variable`),void 0,[],c.runtimeInvariants),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.mn(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.N():void 0,y=/* @__PURE__ */ new Int32Array(2),b=()=>{},x=e=>{};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>x(e.data)),e?.start?.()});let S=m(n.seed).map(p),C=e.t(),w=(e,r)=>{let i=Atomics.load(g,f)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(g,f,r),Atomics.notify(g,f)},T=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&w(e,-1)},E=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},D=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(g,f)>0&&w(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.nt(d,r,l,u.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.V(h))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.U(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.U(a,y),t.z(h,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},O=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>x=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,E(e),!0}},k=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),A=async()=>{let e={states:S,origin:0,end:S.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=D(e);if(t===void 0)return;if(t===`break`)await C(),e.breakAt=performance.now()+100;else if(T(e),t===`paused`){let t=new Promise(e=>b=e);k({type:`paused`}),await t,E(e)}else if(!await O(e))break}let n=t.jn();return n===void 0?(S=e.next,Atomics.store(_,f,S.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:n}},j=()=>{A().then(e=>k(e??{type:`abort`}),()=>k({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&j(),t.type===`resize`&&(h=t.fingerprints,b())}),Atomics.store(_,f,S.length),k({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/parallel-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{n as e,t}from"./worker.js";import{
|
|
9
|
+
import{n as e,t}from"./worker.js";import{N as n,U as r,V as i,f as a,jn as o,mn as s,n as c,nt as l,t as u,u as d,z as f}from"./transfer.js";const p=(e,p)=>{let m=new Map(e.modules),h=e=>m.get(e),g=new Map(e.classes),_=d(e.config,{...e,loadModule:h,loadClass:e=>g.get(e),seed:void 0},()=>{},!0),v=_.specification,y=v.environment,b=a(e.config,y,v.variableLocations,()=>_.order.getDeclarationOrder(`variable`),void 0,[],v.runtimeInvariants),x=b?.spec.next;if(!b||x===void 0)return p.postMessage({type:`abort`});let S=e.index,C=s(),w=u(y.variables.length),T=e.fingerprints,E=e.requests,D=e.remaining,O=b.isSymmetric?n():void 0,k=/* @__PURE__ */ new Int32Array(2),A=()=>{},j=e=>{};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>j(e.data)),e?.start?.()});let M=w(e.seed).map(C),N=t(),P=(t,n)=>{let r=Atomics.load(E,S)-1,i=Math.floor((t.end-t.origin-1)/2),a=c(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let l=s?a.finish():c().finish();e.ports[r]?.postMessage(l,[l.words.buffer]),Atomics.store(E,S,n),Atomics.notify(E,S)},F=e=>{Atomics.store(D,S,0),Atomics.compareExchange(E,S,0,-1)!==0&&P(e,-1)},I=e=>{Atomics.store(D,S,e.end-e.origin),Atomics.store(E,S,0)},L=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(E,S)>0&&P(t,0),Atomics.store(D,S,t.end-t.origin-1),t.successors=l(x,n,y,b.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let a=t.successors;for(;t.index<a.length;t.index++){if(i(T))return`paused`;let e=a[t.index];if(b.findViolatedActionProperty(n,e.state))return;if(!b.satisfiesActionConstraints(n,e.state)){if(b.findViolatedInvariant(e.state,n))return;continue}if(O&&(r(e.state,k),!O.insert(k[0],k[1])))continue;C(e.state);let o=b.getFingerprintState(e.state);if(r(o,k),f(T,k[0],k[1])){if(b.findViolatedInvariant(e.state,n))return;b.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(o),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},R=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(D,r)<2?e:e===void 0||Atomics.load(D,r)>Atomics.load(D,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(E,r,0,S+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(E,r,i),i!==0)continue;let a=await new Promise(e=>j=e);if(a.count===0)n.add(r);else return t.states=w(a).map(C),t.origin=0,t.end=t.states.length,I(t),!0}},z=e=>p.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),B=async()=>{let e={states:M,origin:0,end:M.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=L(e);if(t===void 0)return;if(t===`break`)await N(),e.breakAt=performance.now()+100;else if(F(e),t===`paused`){let t=new Promise(e=>A=e);z({type:`paused`}),await t,I(e)}else if(!await R(e))break}let t=o();return t===void 0?(M=e.next,Atomics.store(D,S,M.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:b.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t}},V=()=>{B().then(e=>z(e??{type:`abort`}),()=>z({type:`abort`}))};p.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&V(),t.type===`resize`&&(T=t.fingerprints,A())}),Atomics.store(D,S,M.length),z({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{p(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|