[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 504 from proof refine-unlink (previous step)

⟨afs_evict#(getinode(entries0[str], dirs1, files), asynced; err, dirs, files)⟩ (err = ESUCCESS ∧ dirs = dirs1 ∧ files = files1), ⟨if ¬ ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids then fs := fs -- ⌜entries0[str]⌝ ⟩ (fs = fs0), # links(entries0[str], dirs0) = m + 1, # entries0 = m0 + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs = dirs1, err = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), # links(ino1, dirs0) ≠ 0, entries0 ≠ ∅, ino1 ≠ ROOT_INO, links(ino1, dirs0) ≠ ∅, root0.dir?, root0[q].dir?, dom of < ino0, abs(root0, ROOT_INO)(dirs0), abs(root0 -- (q + str '), ROOT_INO)(dirs1), afs-cons(dirs1, files1), afs-cons(dirs0, files0), fids-cons(root0, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs1, files1), of-cons(of, dirs0, files0), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), entries0[str] ∈ files0, ino1 ∈ dirs0, str ∈ entries0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], ¬ root0[q + str '].dir?, ¬ is-open(entries0[str], of), ¬ entries0[str] ∈ dirs0, ¬ ino1 ∈ dirs1, ¬ entries0[str] ∈ dirs1, psynced → asynced0 ⊦ ⟨psynced := ?⟩ ((root0 -- (q + str ')).dir? ∧ fids-cons(root0 -- (q + str '), fs0, abs-of(of)) → fs0 = abs-files(files1) ∧ (psynced → asynced))

User applied rule call left

And obtained the following new goals

Proof step 505:
⟨if pre-evict(inode, dirs, files) then {err := ESUCCESS; let ino = inode.ino in if ino ∈ dirs then if dirs[ino].nlink = 0 then dirs := dirs -- ino else if files[ino].nlink = 0 then files := files -- ino} else abort⟩ (err = ESUCCESS ∧ dirs = dirs1 ∧ files = files1), ⟨if ¬ ⌜entries0[str]⌝ ∈ (root0 -- (q + str ')).fids then fs := fs -- ⌜entries0[str]⌝ ⟩ (fs = fs0), # entries0 = m0 + 1, # links(entries0[str], dirs0) = m + 1, files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), dirs = dirs1, err = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), inode = getinode(entries0[str], dirs1, files), root0[q].dir?, root0.dir?, dom of < ino0, abs(root0 -- (q + str '), ROOT_INO)(dirs1), abs(root0, ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files1), fids-cons(root0, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs1, files1), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), ino1 ∈ dirs0, entries0[str] ∈ files0, str ∈ entries0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced → asynced0 ⊦ ⟨psynced := ?⟩ ((root0 -- (q + str ')).dir? ∧ fids-cons(root0 -- (q + str '), fs0, abs-of(of)) → fs0 = abs-files(files1) ∧ (psynced → asynced)), # links(ino1, dirs0) = 0, entries0 = ∅, ino1 = ROOT_INO, links(ino1, dirs0) = ∅, root0[q + str '].dir?, is-open(entries0[str], of), entries0[str] ∈ dirs0, ino1 ∈ dirs1, entries0[str] ∈ dirs1

Rule argument

pos: left 1

Additional information

Used simplifier rules: afs_evict#(INODE, ASYNCED; ERR, DIRS, FILES) {if pre-evict(INODE, DIRS, FILES) then {ERR := ESUCCESS; let INO = INODE.ino in if INO ∈ DIRS then if DIRS[INO].nlink = 0 then DIRS := DIRS -- INO else if FILES[INO].nlink = 0 then FILES := FILES -- INO} else abort };