| # entries0 = m0 + 1, # links(entries0[str], dirs0) = m + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), root0[q] = dnode(md0, sdt), files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs = dirs1, err0 = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), (( ino1 => mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str) * abs|(root0, ROOT_INO, q, ino1) * (⌜str ∈ entries0⌝ ∧ abs(sdt -- str, entries0 -- str) * abs(sdt[str], entries0[str]))) )(dirs1), (root0 -- (q + str ')).dir?, root0.dir?, dom of < ino0, afs-cons(dirs1, files1), afs-cons(dirs0, files0), fids-cons(root0 -- (q + str '), fs0, abs-of(of)), 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), ino1 ∈ dirs0, entries0[str] ∈ files0, q ∈ root0, str ∈ entries0, str ∈ sdt, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ entries0 = ∅, root0[q + str '].dir?, abs(root0 -- (q + str '), ROOT_INO)(dirs1), entries0[str] ∈ dirs1, entries0[str] ∈ dirs0 |
# links(entries0[str], dirs0) = m + 1, # entries0 = m0 + 1, files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), root0[q] = dnode(md0, sdt), dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), sdt[str] = fnode(⌜entries0[str]⌝ ), ((ino1 => mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str) * abs|(root0, ROOT_INO, q, ino1) * abs(sdt -- str, entries0 -- str)) )(dirs1), root0.dir?, (root0 -- (q + str ')).dir?, dom of < ino0, afs-cons(dirs0, files0), afs-cons(dirs1, files1), fids-cons(root0, abs-files(files0), abs-of(of)), fids-cons(root0 -- (q + str '), fs0, 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), str ∈ sdt, str ∈ entries0, q ∈ root0, entries0[str] ∈ files0, ino1 ∈ dirs0, dirs1 ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ entries0 = ∅, root0[q + str '].dir?, abs(root0 -- (q + str '), ROOT_INO)(dirs1), entries0[str] ∈ dirs0, entries0[str] ∈ dirs1
Used simplifier rules: sep-com: ⊦ D * D0 = D0 * D; from specification heap-sep[dir-heap]%sep-ass: ⊦ (D * D0) * D1 = D * D0 * D1; from specification heap-sep[dir-heap]%⊦ ¬ ino ∈ dirs → (((abs(tree, ino) * D))(dirs) ↔ tree = fnode(⌜ino⌝ ) ∧ D(dirs)); (ws)%and-com: ⊦ (D ∧ D0) = (D0 ∧ D); from specification heap-sep[dir-heap]%and-ass: ⊦ ((D ∧ D0) ∧ D1) = (D ∧ D0 ∧ D1); from specification heap-sep[dir-heap]% ⊦ (true ∧ D) = D; (s)% ⊦ ⌜true⌝ = true; (s)