| dirs0[ino2] = mkdir(# entries1, md, # links(ino2, dirs0), m3, entries1), files0[entries[str]] = mkfile(m0, md2, # links(entries[str], dirs0), content0), entries0[str] = entries[str], dirs0[ino3] = mkdir(# entries, md1, # links(ino3, dirs0), m4, entries), root[q] = dnode(md0, sdt), root[q + str '] = fnode(fid), dirs0[ino1] = mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0), ((abs|(root, ROOT_INO, q, ino1) * ino1 => mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) * abs(sdt, entries0)))(dirs0), root.dir?, root[q0].dir?, dom of < ino0, afs-cons(dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), afs-cons(dirs0, files0), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q0, ROOT_INO, ino2, dirs0, files0), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), of-cons(of, dirs0, files0), pw(user, md), px(user, md0), px(user, md), px-parent(user, q0, ROOT_INO, dirs0, files0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, entries[str] ∈ files0, ino3 ∈ dirs0, str ∈ entries, ino2 ∈ dirs0, q ∈ root, str ∈ sdt, ino1 ∈ dirs0, dirs ≡ dirs0[ino2, mkdir(# entries1 + 1, md, # links(ino2, dirs0), m3, entries1[str0, entries[str]])], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino2, dirs0) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino3, dirs0) ≠ ∅ ∨ ino3 = ROOT_INO ⊦ abs(root[q0 + str0 ', fnode(fid)], ROOT_INO)(dirs), abs(root, ROOT_INO)(dirs0), str0 ∈ entries1, entries[str] ∈ dirs0, ∃ sdt. ((abs|(root, ROOT_INO, q, ino1) * ino1 => mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) * abs(sdt, entries0)))(dirs0) ∧ q ∈ root ∧ root[q] = dnode(md0, sdt) |
root[q + str '] = fnode(fid), root[q] = dnode(md0, sdt), dirs0[ino3] = mkdir(# entries, md1, # links(ino3, dirs0), m4, entries), entries0[str] = entries[str], files0[entries[str]] = mkfile(m0, md2, # links(entries[str], dirs0), content0), dirs0[ino2] = mkdir(# entries1, md, # links(ino2, dirs0), m3, entries1), ((abs|(root, ROOT_INO, q, ino1) * ino1 => mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) * abs(sdt, entries0)))(dirs0), root[q0].dir?, root.dir?, dom of < ino0, afs-cons(dirs0, files0), afs-cons(dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), ispath(q0, ROOT_INO, ino2, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), pw(user, md), px(user, md), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), px-parent(user, q0, ROOT_INO, dirs0, files0), str ∈ sdt, q ∈ root, ino2 ∈ dirs0, str ∈ entries, ino3 ∈ dirs0, entries[str] ∈ files0, str ∈ entries0, dirs ≡ dirs0[ino2, mkdir(# entries1 + 1, md, # links(ino2, dirs0), m3, entries1[str0, entries[str]])], psynced0 → asynced0, links(ino3, dirs0) ≠ ∅ ∨ ino3 = ROOT_INO, links(ino2, dirs0) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ abs(root, ROOT_INO)(dirs0), abs(root[q0 + str0 ', fnode(fid)], ROOT_INO)(dirs), entries[str] ∈ dirs0, str0 ∈ entries1, ∃ sdt0. ((abs|(root, ROOT_INO, q, ino1) * ino1 => mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) * abs(sdt0, entries0)))(dirs0) ∧ dnode(md0, sdt) = dnode(md0, sdt0)
Used simplifier rules: ⊦ ((ino => ad * D))(dirs) → ino ∈ dirs; (s)% ⊦ ((ino => ad * D))(dirs) → (dirs[ino] = ad0 ↔ ad = ad0); (s)%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]