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

maxino0 = maxino3, maxino1 = LEB_SIZE, maxino2 = maxino4 ⊦ ⟪if maxino1 = LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then maxino := maxino0, syn := true, ginval0 := ∅, nx := [], gstore0 := ∅, gstore := ∅, ginval := ∅, fi0 := ∅, fi := ∅ else maxino := ?, syn := ?, ginval0 := ?, nx := ?, gstore0 := ?, gstore := ?, ginval := ?, fi0 := ?, fi := ?} else abort⟫ ( err = ESUCCESS → syn ∧ inv(gstore0 \ ginval) ∧ inv(gstore) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ ginval ∧ remove-refsize0(gstore) = gstore ∧ ri-inj(fi0) ∧ ri-inj(fi))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 4:
⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then maxino := maxino0, syn := true, ginval0 := ∅, nx := [], gstore0 := ∅, gstore := ∅, ginval := ∅, fi0 := ∅, fi := ∅ else maxino := ?, syn := ?, ginval0 := ?, nx := ?, gstore0 := ?, gstore := ?, ginval := ?, fi0 := ?, fi := ?⟫ ( err = ESUCCESS → syn ∧ inv(gstore0 \ ginval) ∧ inv(gstore) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ ginval ∧ remove-refsize0(gstore) = gstore ∧ ri-inj(fi0) ∧ ri-inj(fi))

Proof step 3 from proof inv-format (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information