[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 56 from proof inv-gc-copy (previous step)

# ax = # ndx1, abs-log(nx, gstore3 ↓) = abs-log(nx1, gstore2 ↓) + ax, nodes(gstore3 ↓, jro) = nodes(gstore2 ↓, jro0)[ax, ndx1], remove-refsize0(gstore1) = gstore1, elems nx0 ∩ jro3 = ∅, (nx0.toSet \ nx.toSet) ∩ dom gstore3 = ∅, elems nx ∩ jro = ∅, (nx.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx1 ∩ jro0 = ∅, dom gstore1 ∪ elems nx0 = dom gstore ∪ jro3, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, dom gstore1 ∪ elems nx1 = dom gstore2 ∪ jro0, jmaxino3 ≠ 0, nx ≠ [], pmaxino ≠ 0, fi1.inos < pmaxino, fi2[ndx1.keys, ax].inos < jmaxino0, p_os < pmaxino, n0 < nd0.flashsize, fi2.inos < jmaxino3, jro2 < jmaxino3, inv(gstore \ jro3), inv(gstore3 \ jro), inv(gstore1), inv(gstore2 \ jro0), inv(gstore3[nx.last]), key-cons(ndx3), key-cons(ndx), key-cons(ndx1), key-cons(nd0.key, nd0), new(ax, nodes(gstore2 ↓, jro0)), refsize-cons(gstore, range fi2[ndx1.keys, ax]), refsize-cons(gstore1, range fi1), refsize-cons(gstore3, range fi2[ndx1.keys, ax]), refsize-cons(gstore2, range fi2), ri-inj(fi1), ri-inj(fi2[ndx1.keys, ax]), ri-inj(fi2), nd0.key ∈ fi2, nx.last ∈ gstore3, pmaxino ≤ jmaxino0, nd0.flashsize + ndx.flashsize ≤ LEB_SIZE, n0 ≤ LEB_SIZE, pmaxino ≤ jmaxino3, jmaxino3 ≤ jmaxino0, dom gstore3 ⊆ dom gstore, fi1.lebs ⊆ dom gstore1, fi2[ndx1.keys, ax].lebs ⊆ dom gstore3, dom gstore2 ⊆ dom gstore3, range fi2[ndx1.keys, ax] ⊆ dom nodes(gstore3 ↓, jro), range fi2 ⊆ dom nodes(gstore2 ↓, jro0), ndx3.keys.toSet ⊆ dom fi2, ndx.keys.toSet ⊆ dom fi2, ndx1.keys.toSet ⊆ dom fi2, fi2.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore3, fi2[ndx1.keys, ax].lebs ⊆ dom gstore, dom gstore2 ⊆ dom gstore, fi2.lebs ⊆ dom gstore, ¬ dups(ndx3.keys), ¬ dups(ndx1.keys + ndx.keys), ¬ dups(ndx.keys + ndx3.keys), ¬ dups(ax), ¬ dups(nx), ¬ dups(nx1), ¬ dups(ndx1.keys + ndx.keys + ndx3.keys), ¬ dups(ndx1.keys), ¬ dups(ndx.keys), ¬ dups(nx0), ¬ nd0.key ∈ ndx3.keys, ¬ nd0.key ∈ ndx.keys, ¬ nd0.key ∈ ndx1.keys, jvalid0 ∧ nx0 ≠ [] → valid-journal-head(nx0, gstore, jro3), err = ESUCCESS → # ax1 = # ndx + 1 ∧ ¬ dups(ax1) ∧ nodes-cons(ax1, nd0 ' + ndx, gstore, jro3) ∧ abs-log(nx0, gstore ↓) = abs-log(nx, gstore3 ↓) + ax1 ∧ nodes(gstore ↓, jro3) = nodes(gstore3 ↓, jro)[ax1, nd0 ' + ndx] ∧ new(ax1, nodes(gstore3 ↓, jro)), err ≠ ESUCCESS → abs-log(nx0, gstore ↓) = abs-log(nx, gstore3 ↓) ∧ nodes(gstore ↓, jro3) = nodes(gstore3 ↓, jro), jvalid7 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro0), jvalid1 → valid-journal-head(nx, gstore3, jro), err = ESUCCESS ∨ ⌊err⌋ , ndx3 = [] ∨ LEB_SIZE < (nd0.flashsize + ndx.flashsize) + ndx3.head.flashsize ⊦ ⟪fi := fi2[ndx1.keys, ax]; if err = ESUCCESS then {ndx0 := nd0 ' + ndx; gjournal_gc_update_index#(jvalid0, fi1, jro3, gstore1, nx0, pmaxino, p_os, jvalid; ax1, ndx0, jmaxino0, fi, gstore)}⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ jmaxino3 ≤ jmaxino0 ∧ (jvalid0 ∧ nx0 ≠ [] → valid-journal-head(nx0, gstore, jro3)) ∧ fi.inos < jmaxino0 ∧ fi.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi) ∧ inv(gstore \ jro3) ∧ dom gstore1 ∪ elems nx0 = dom gstore ∪ jro3 ∧ ri-inj(fi) ∧ ndx3.keys.toSet ⊆ dom fi ∧ range fi ⊆ dom nodes(gstore ↓, jro3) ∧ dom gstore2 ⊆ dom gstore ∧ (nx0.toSet \ nx1.toSet) ∩ dom gstore2 = ∅ ∧ (∃ ax, ndx0, ndx4. ndx1 + nd0 ' + ndx + ndx3 = ndx0 + ndx4 ∧ (err = ESUCCESS → ndx4 = ndx3) ∧ new(ax, nodes(gstore2 ↓, jro0)) ∧ ¬ dups(ax) ∧ # ax = # ndx0 ∧ fi = fi2[ndx0.keys, ax] ∧ nodes(gstore ↓, jro3) = nodes(gstore2 ↓, jro0)[ax, ndx0] ∧ abs-log(nx0, gstore ↓) = abs-log(nx1, gstore2 ↓) + ax) ∧ ¬ # ndx + # ndx3 < (err = ESUCCESS ⊃ # ndx3;0))

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information