[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 16 from proof walk-term (previous step)

err = ESUCCESS, afs-cons(dirs, files), ino ∈ dirs ∨ ino ∈ files, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO, ∀ p0, err, dirs, files, ino, user, asynced. # p0 < # p → err = ESUCCESS ∧ afs-cons(dirs, files) ∧ (ino ∈ dirs ∨ ino ∈ files) ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO) → ⟪while p0 ≠ ε ∧ err = ESUCCESS do {choose inode with true in vfs_may_lookup#(ino, user, dirs, files, asynced; inode, err); if err = ESUCCESS then let dent = negdentry(p0.head) in {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then {ino := dent.ino; p0 := p0.tail}}}⟫ true ⊦ ⟪afs_iget#(ino, dirs, files, asynced; inode, err); if err = ESUCCESS then if ¬ inode.directory then err := ENOENT else if ¬ px(user, inode.meta) then err := EACCESS; if err = ESUCCESS then let dent = negdentry(p.head) in {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then {ino := dent.ino; p := p.tail}}; while p ≠ ε ∧ err = ESUCCESS do {choose inode with true in vfs_may_lookup#(ino, user, dirs, files, asynced; inode, err); if err = ESUCCESS then let dent = negdentry(p.head) in {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then {ino := dent.ino; p := p.tail}}}⟫ true, p = ε

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 17:
err = ESUCCESS, afs-cons(dirs, files), links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO, ino ∈ dirs ∨ ino ∈ files, ∀ p0, err, dirs, files, ino, user, asynced. # p0 < # p → err = ESUCCESS ∧ afs-cons(dirs, files) ∧ (ino ∈ dirs ∨ ino ∈ files) ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO) → ⟪while p0 ≠ ε ∧ err = ESUCCESS do {choose inode with true in vfs_may_lookup#(ino, user, dirs, files, asynced; inode, err); if err = ESUCCESS then let dent = negdentry(p0.head) in {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then {ino := dent.ino; p0 := p0.tail}}}⟫ true ⊦ ⟪if pre-iget(ino, dirs, files) then {{inode := getinode(ino, dirs, files); err := ESUCCESS} or fail#(; ; err)} else abort; if err = ESUCCESS then if ¬ inode.directory then err := ENOENT else if ¬ px(user, inode.meta) then err := EACCESS; if err = ESUCCESS then let dent = negdentry(p.head) in {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then {ino := dent.ino; p := p.tail}}; while p ≠ ε ∧ err = ESUCCESS do {choose inode with true in vfs_may_lookup#(ino, user, dirs, files, asynced; inode, err); if err = ESUCCESS then let dent = negdentry(p.head) in {afs_lookup#(ino, dirs, files, asynced; dent, err); if err = ESUCCESS then {ino := dent.ino; p := p.tail}}}⟫ true, p = ε

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_iget#(INO, DIRS, FILES, ASYNCED; INODE, ERR) {if pre-iget(INO, DIRS, FILES) then { {INODE := getinode(INO, DIRS, FILES); ERR := ESUCCESS} or fail#(; ; ERR)} else abort };