[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 52 from proof inv-addn (previous step)

jvalid0 ↔ true, err0 = ESUCCESS ↔ # lax = # gndx, abs-log(nx0, gstore3 ↓) = abs-log(nx1, gstore2 ↓), ax = lax.to-adr(nx.last), err = ESUCCESS, err = err0, fi = fi1, fi0 = fi2, gstore = gstore3, gstore1 = gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))] [nx.last, gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))][nx.last] .ladrlist:= (gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))][nx.last].ladrlist + lax) ], jro = jro0, nodes(gstore3 ↓, jro0) = nodes(gstore2 ↓, jro1), nx = nx0, remove-refsize0(gstore0) = gstore0, elems nx1 ∩ jro1 = ∅, (nx0.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx0 ∩ jro0 = ∅, dom gstore0 ∪ elems nx0 = dom gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))] [nx.last, gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))][nx.last] .ladrlist:= (gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))][nx.last].ladrlist + lax) ] ∪ jro0, dom gstore0 ∪ elems nx1 = dom gstore2 ∪ jro1, dom gstore0 ∪ elems nx0 = dom gstore3 ∪ jro0, p_os < pmaxino, fi2.inos < jmaxino1, fi1.inos < pmaxino, inv ( gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))] [nx.last, gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))][nx.last] .ladrlist:= (gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))][nx.last].ladrlist + lax) ] \ jro0), inv(gstore0), inv(gstore2 \ jro1), inv(gstore3 \ jro0), inv(gstore3[nx0.last]), inv-flashsize(prefixn(# lax, gndx), lax), refsize-cons(gstore2, range fi2), refsize-cons(gstore0, range fi1), refsize-cons(gstore3, range fi2), ri-inj(fi2), ri-inj(fi1), transaction(ndx, gndx), valid-journal-head(nx0, gstore3, jro0), nx0.last ∈ gstore3, nx.last ∈ gstore[nx.last, gstore[nx.last].gndlist:= (gstore[nx.last].gndlist + prefixn(# lax, gndx))], nx.last ∈ gstore, # lax ≤ # gndx, pmaxino ≤ jmaxino1, fi2.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore0, dom gstore2 ⊆ dom gstore3, ⌊err0⌋ ∨ err0 = ESUCCESS → nx.last ∈ gstore ∧ nx ≠ [], jvalid4 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro1), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then {jmaxino0 := jmaxino0 + # ndx; if jvalid1 then let err0 = ? in index_sync#(fi2, fi1, jro0, gstore1, gstore0, nx0, pmaxino, p_os; ; jvalid, err0)} else jvalid0 := false⟫ ( (jvalid0 → valid-journal-head(nx0, gstore1, jro0)) ∧ fi2.lebs ⊆ dom gstore1 ∧ refsize-cons(gstore1, range fi2) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ dom gstore2 ⊆ dom gstore1 ∧ ( err = ESUCCESS → # ax = # ndx ∧ ¬ dups(ax) ∧ nodes-cons(ax, ndx, gstore1, jro0) ∧ abs-log(nx0, gstore1 ↓) = abs-log(nx1, gstore2 ↓) + ax ∧ nodes(gstore1 ↓, jro0) = nodes(gstore2 ↓, jro1)[ax, ndx] ∧ new(ax, nodes(gstore2 ↓, jro1))) ∧ (err ≠ ESUCCESS → abs-log(nx0, gstore1 ↓) = abs-log(nx1, gstore2 ↓) ∧ nodes(gstore1 ↓, jro0) = nodes(gstore2 ↓, jro1))), nx = [], nx0 = [], pmaxino = 0, dups(nx1), dups(nx0), dups(gstore[nx.last].ladrlist + lax)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information