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

gstore = gstore1, gstore0 = gstore3, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, p_os < pmaxino, fi.inos < jmaxino, fi0.inos < pmaxino, inv(gstore3 \ jro), inv(gstore1), refsize-cons(gstore3, range fi), refsize-cons(gstore1, range fi0), ri-inj(fi), ri-inj(fi0), pmaxino ≤ jmaxino, fi.lebs ⊆ dom gstore3, fi0.lebs ⊆ dom gstore1, jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro) ⊦ [let ks = datakeys(key, n, fi) in fi := fi \ ks, as := fi[ks]] ( ri-inj(fi) → ⟪gstore2 := gstore3; gjournal_remove_addresses#(jvalid2, fi, fi0, jro, gstore1, nx, pmaxino, p_os, jvalid; as, gstore3)⟫ ( fi.inos < jmaxino ∧ (jvalid2 ∧ nx ≠ [] → valid-journal-head(nx, gstore3, jro)) ∧ fi.lebs ⊆ dom gstore3 ∧ refsize-cons(gstore3, range fi) ∧ inv(gstore3 \ jro) ∧ dom gstore1 ∪ elems nx = dom gstore3 ∪ jro ∧ gstore3 =○refsize gstore2)), pmaxino = 0, dups(nx)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information