[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 14 from proof eq-io-readdir (previous step)

⟨if pre-readdir(inode.ino, dirs, files) then {{strings0 := dom dirs[inode.ino].entries; err := ESUCCESS} or {choose strings with true in strings0 := strings; fail#(; ; err)}} else abort⟩ (strings0 = strings1 ∧ err = err0), asynced ↔ asynced0, dirs1[m] = mkdir(m3, md0, m4, m5, entries), dirs = dirs1, files = files1, inode = mkinode(m, md, boolvar, m0, m1, m2), strings0 = strings2, m ∈ dirs1 ⊦ ∃ strings. ⟨strings2 := strings; fail#(; ; err)⟩ (strings2 = strings1 ∧ err = err0), dom entries = strings1 ∧ ESUCCESS = err0

Heuristic symbolic execution applied rule if positive left

And obtained the following new goals

Proof step 15:
⟨{strings0 := dom dirs[inode.ino].entries; err := ESUCCESS} or {choose strings with true in strings0 := strings; fail#(; ; err)}⟩ (strings0 = strings1 ∧ err = err0), asynced ↔ asynced0, dirs1[m] = mkdir(m3, md0, m4, m5, entries), dirs = dirs1, files = files1, inode = mkinode(m, md, boolvar, m0, m1, m2), strings0 = strings2, m ∈ dirs1 ⊦ ∃ strings. ⟨strings2 := strings; fail#(; ; err)⟩ (strings2 = strings1 ∧ err = err0), dom entries = strings1 ∧ ESUCCESS = err0

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ pre-readdir(ino, dirs, files) ↔ valid-dir-ino(ino, dirs, files); (s)% ⊦ valid-dir-ino(ino, dirs, files) ↔ ino ∈ dirs; (s)