[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 25 from proof inv-check-commit (previous step)

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

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information