| # entries0 = m + 1, dirs0[ino1] = mkdir(m + 1, md2, # links(ino1, dirs0), m2, entries0), root[q] = dnode(md2, sdt), dirs1[entries0[str]] = mkdir(m0, md0, m1, m4, entries), dirs0[entries0[str]] = mkdir(0, md, # links(entries0[str], dirs0), m3, ∅), root[q][str '] = dnode(md1, ∅), files[entries0[str]] = mkfile(m9, md4, m10, content), dirs4[entries0[str]] = mkdir(m5, md3, 0, m7, entries2), (( abs(sdt[str], entries0[str]) * abs(sdt -- str, entries0 -- str) * ino1 => mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str) * abs|(root, ROOT_INO, q, ino1)) )(dirs1), root.dir?, dom of < ino0, afs-cons(dirs0, files), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files), of-cons(of, dirs0, files), of-cons(of, dirs, files), pw(user, md2), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), entries0[str] ∈ dirs4, str ∈ sdt, entries0[str] ∈ dirs3, ino1 ∈ dirs2, str ∈ entries0, entries0[str] ∈ dirs0, entries0[str] ∈ dirs1, ino1 ∈ dirs0, q ∈ root, dirs ≡ dirs4 -- entries0[str], dirs2 ≡ dirs1[entries0[str], mkdir(m0, md0, m1 - 1, m4, entries)], dirs1 ≡ dirs0[ino1, mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str)], dirs3 ≡ dirs2[ino1, dirs2[ino1].meta:= md2], dirs4 ≡ dirs3[entries0[str], dirs3[entries0[str]].meta:= md], 1 ≤ m1, 1 ≤ m2, psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ entries0[str] = ROOT_INO, entries0 = ∅, m1 = 0, m2 = 0, abs(root -- (q + str '), ROOT_INO)(dirs) |
# entries0 = m + 1, root[q] = dnode(md2, sdt), dirs0[ino1] = mkdir(m + 1, md2, # links(ino1, dirs0), m2, entries0), dirs4[entries0[str]] = mkdir(0, md, 0, m4, ∅), files[entries0[str]] = mkfile(m9, md4, m10, content), sdt[str] = dnode(md0, ∅), dirs0[entries0[str]] = mkdir(0, md, # links(entries0[str], dirs0), m3, ∅), dirs1[entries0[str]] = mkdir(0, md0, 1, m4, ∅), dirs2[ino1] = mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str), dirs3[entries0[str]] = mkdir(0, md0, 0, m4, ∅), ((ino1 => mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str) * abs(sdt -- str, entries0 -- str) * abs|(root, ROOT_INO, q, ino1)) )(dirs), root.dir?, dom of < ino0, afs-cons(dirs, files), afs-cons(dirs0, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files), of-cons(of, dirs, files), of-cons(of, dirs0, files), pw(user, md2), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), q ∈ root, ino1 ∈ dirs0, entries0[str] ∈ dirs0, str ∈ entries0, str ∈ sdt, entries0[str] ∈ dirs4, entries0[str] ∈ dirs3, ino1 ∈ dirs2, entries0[str] ∈ dirs1, dirs ≡ dirs4 -- entries0[str], dirs4 ≡ dirs3[entries0[str], mkdir(0, md, 0, m4, ∅)], dirs3 ≡ dirs2, dirs1 ≡ dirs0[ino1, mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str)], dirs2 ≡ dirs1[entries0[str], mkdir(0, md0, 0, m4, ∅)], 1 ≤ m2, psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ entries0[str] = ROOT_INO, entries0 = ∅, m2 = 0, abs(root -- (q + str '), ROOT_INO)(dirs)
Used simplifier rules: ino ∈ dirs ⊦ dirs[ino] = ad → dirs[ino, ad] = dirs; (s)% ⊦ m ≤ n → (n - m = 0 ↔ n = m); (s)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)%⊦ dirs ≡ dirs0 -- ino → ( ((ino => ad * D))(dirs0) ↔ D(dirs) ∧ dirs0[ino] = ad ∧ ino ∈ dirs0); (ws)%⊦ dirs ≡ dirs0[ino, ad] → ( ((ino => ad0 * D))(dirs0) ↔ ((ino => ad * D))(dirs) ∧ dirs0[ino] = ad0 ∧ ino ∈ dirs0); (ws)% ⊦ ((ino => ad * D))(dirs) → ino ∈ dirs; (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)% ⊦ ((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]% ⊦ ((_∃ nnD * D))(dirs) ↔ (∃ ino, ino0. ((nnD(ino, ino0) * D))(dirs)); (s)% ⊦ abs(dnode(md, ∅), ino) = _∃(λ m, m0. ino => mkdir(0, md, m, m0, ∅)); (s)%str ∈ sdt ⊦ dnode(md, sdt)[str '] = sdt[str]; (s)