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

⟨afs_readdir#(mkinode(m, md, boolvar, m0, m1, m2), dirs1, files1, asynced0; strings2, err)⟩ (strings2 = strings1 ∧ err = err0), dirs1[m] = mkdir(m3, md0, m4, m5, entries), m ∈ dirs1 ⊦ ∃ strings. ⟨strings2 := strings; fail#(; ; err)⟩ (strings2 = strings1 ∧ err = err0), dom entries = strings1 ∧ ESUCCESS = err0

Heuristic unfold applied rule call left

And obtained the following new goals

Proof step 14:
⟨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

Rule argument

pos: left 1

Additional information

Used simplifier rules: afs_readdir#(INODE, DIRS, FILES, ASYNCED; NAMES, ERR) {if pre-readdir(INODE.ino, DIRS, FILES) then { {NAMES := dom DIRS[INODE.ino].entries; ERR := ESUCCESS} or {choose NAMES0 with true in NAMES := NAMES0; fail#(; ; ERR)}} else abort };