[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-get (previous step)

adr = @(m, m0, m1), fi = fi1, fi0 = fi2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, inv(gstore1), inv(gstore2 \ jro), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range fi2), ri-inj(fi1), ri-inj(fi2), @(m, m0, m1) ∈ gstore2, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪if adr ∈ gstore0 ∧ ¬ adr.lnum ∈ jro then {fail_or_success#(; ; err); if err = ESUCCESS then gnd := gstore0[adr] else gnd := ?} else abort; if err = ESUCCESS then nd := gnd.nd⟫ true, pmaxino = 0, dups(nx), m ∈ jro

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 11:
adr = @(m, m0, m1), fi = fi1, fi0 = fi2, gstore = gstore1, gstore0 = gstore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro), inv(gstore1), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-inj(fi2), ri-inj(fi1), @(m, m0, m1) ∈ gstore2, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then gnd := gstore0[adr] else gnd := ?; if err = ESUCCESS then nd := gnd.nd⟫ true, pmaxino = 0, dups(nx), m ∈ jro

Rule argument

Additional information

Used simplifier rules: ⊦ @(m, m0, m1).lnum = m; (s)