[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 16 from proof inv-truncate (previous step)

jvalid0 ↔ jvalid2, as = as0, as1 = fi1[datakeys(key, n, fi1)], dom gstore = dom gstore4, fi = fi2, fi0 = fi1 \ datakeys(key, n, fi1), gstore0 = gstore1, gstore2 = gstore3, gstore4 = gstore3, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, as ∩ range fi0 = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, p_os < pmaxino, fi1.inos < jmaxino, fi2.inos < pmaxino, gstore =○refsize gstore4, inv(gstore3 \ jro), inv(gstore1), inv-journal(nx, gstore, gstore0, jro), refsize-cons(gstore3, range fi1), refsize-cons(gstore1, range fi2), refsize-cons(gstore, range fi0 ∪ as), ri-inj(fi1 \ datakeys(key, n, fi1)), ri-inj(fi1), ri-inj(fi2), pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore1, as.lebs ⊆ dom gstore, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro), jvalid0 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro) ⊦ ⟪choose n, adr with adr ∈ as in {index_get_gblock_refsize#(adr.lnum, fi0, fi, jro, gstore, gstore0, nx, pmaxino, p_os, jvalid; ; n); index_set_gblock_refsize#(adr.lnum, n - adr.size, fi0, fi, jro, gstore0, nx, pmaxino, p_os, jvalid; gstore); as := as -- adr}⟫ ( ( (jvalid0 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)) ∧ dom gstore = dom gstore4 ∧ as ∩ range fi0 = ∅ ∧ as.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi0 ∪ as) ∧ inv-journal(nx, gstore, gstore0, jro) ∧ gstore =○refsize gstore4) ∧ # as < # as0), as = ∅, pmaxino = 0, dups(nx)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information