[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 31 from proof initialization (previous step)

isdir ↔ isdir0, ino = LEB_SIZE, ⌊err⌋ ⊦ ⟨ root := dnode(md, ∅), fs := ∅, ofh := ∅, psynced := true, err0 := ESUCCESS or {root := ?, fs := ?, ofh := ?, psynced := ?; choose err with ⌊err⌋ in err0 := err}⟩ (tree = root ∧ fs1 = fs ∧ ofh1 = ofh ∧ (isdir ↔ psynced) ∧ err = err0)

Heuristic symbolic execution applied rule or right

And obtained the following new goals

Proof step 32:
isdir ↔ isdir0, ino = LEB_SIZE, ⌊err⌋ ⊦ ⟨root := ?, fs := ?, ofh := ?, psynced := ?; choose err with ⌊err⌋ in err0 := err⟩ (tree = root ∧ fs1 = fs ∧ ofh1 = ofh ∧ (isdir ↔ psynced) ∧ err = err0), ⟨root := dnode(md, ∅), fs := ∅, ofh := ∅, psynced := true, err0 := ESUCCESS⟩ (tree = root ∧ fs1 = fs ∧ ofh1 = ofh ∧ (isdir ↔ psynced) ∧ err = err0)

Proof step 31 from proof initialization (previous step)

Heuristic symbolic execution applied rule or right

And obtained the following new goals

Rule argument

Additional information