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

jmaxino = ROOT_INO + 1, jmaxino0 = LEB_SIZE, jmaxino1 = jmaxino2 ⊦ ⟪if jmaxino0 = LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then pmaxino := jmaxino, jvalid := true, p_os := ∅, nx := [], gstore0 := ∅, gstore := ∅, jro := ∅, fi0 := ∅, fi := ∅ else pmaxino := ?, jvalid := ?, p_os := ?, nx := ?, gstore0 := ?, gstore := ?, jro := ?, fi0 := ?, fi := ?} else abort; if err ≠ ESUCCESS then debug#("gjournal: persistence format failed"); jro1 := ∅⟫ ( err = ESUCCESS → jvalid ∧ jro1 < ROOT_INO + 1 ∧ p_os < pmaxino ∧ pmaxino ≤ ROOT_INO + 1 ∧ fi0.inos < ROOT_INO + 1 ∧ fi.inos < pmaxino ∧ ROOT_INO + 1 ≠ 0 ∧ pmaxino ≠ 0 ∧ (true ∧ nx ≠ [] → valid-journal-head(nx, gstore0, jro)) ∧ fi0.lebs ⊆ dom gstore0 ∧ fi.lebs ⊆ dom gstore ∧ refsize-cons(gstore0, range fi0) ∧ 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(fi0) ∧ ri-inj(fi))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 10:
⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then pmaxino := ROOT_INO + 1, jvalid := true, p_os := ∅, nx := [], gstore0 := ∅, gstore := ∅, jro := ∅, fi0 := ∅, fi := ∅ else pmaxino := ?, jvalid := ?, p_os := ?, nx := ?, gstore0 := ?, gstore := ?, jro := ?, fi0 := ?, fi := ?; if err ≠ ESUCCESS then debug#("gjournal: persistence format failed"); jro1 := ∅⟫ ( err = ESUCCESS → jvalid ∧ jro1 < ROOT_INO + 1 ∧ p_os < pmaxino ∧ pmaxino ≤ ROOT_INO + 1 ∧ fi0.inos < ROOT_INO + 1 ∧ fi.inos < pmaxino ∧ pmaxino ≠ 0 ∧ (nx ≠ [] → valid-journal-head(nx, gstore0, jro)) ∧ fi0.lebs ⊆ dom gstore0 ∧ fi.lebs ⊆ dom gstore ∧ refsize-cons(gstore0, range fi0) ∧ 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(fi0) ∧ ri-inj(fi))

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m + 1 ≠ 0; (s)