| # links(entries2[str], dirs0) = m22 + 1, (entries2[str0] = m0 ⊃ (links(entries2[str0], dirs0) -- mklink(entries2[str0], str0)) ++ mklink(entries2[str0], str);links(m0, dirs0)) = ∅, dirs0[entries2[str0]] = mkdir(m3, md4, # links(entries2[str0], dirs0), m5, entries), dirs0[entries2[str]] = mkdir(m21, md5, m22 + 1, m23, ∅), dirs0[m0] = mkdir(m + 1, md12, # links(m0, dirs0), m20 + 1, entries2), afs-cons(dirs0, files), afs-cons (dirs0[m0, mkdir(m, md9, # links(m0, dirs0), m20, (entries2 -- str0)[str, entries2[str0]])][entries2[str], mkdir(m21, md, m22, m23, ∅)], files), synced(dirs0, icache0, pcache), str ∈ entries2, m0 ∈ dirs0, str0 ∈ entries2, entries2[str0] ∈ dirs0, entries2[str] ∈ dirs0, dentrykey(m0, str) ∈ dcache0 → str = dcache0[dentrykey(m0, str)].name ∧ (dcache0[dentrykey(m0, str)].ino ∈ dirs0 ∨ dcache0[dentrykey(m0, str)].ino ∈ files) ∧ dcache0[dentrykey(m0, str)].name ∈ entries2 ∧ dcache0[dentrykey(m0, str)].ino = entries2[dcache0[dentrykey(m0, str)].name] ∧ dcache0[dentrykey(m0, str)].dentry?, asynced2 → synced(files, icache0, pcache), ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry? ⊦ # links(m0, dirs0) = 0, entries2[str] = ROOT_INO, links(m0, dirs0) = ∅, m0 = entries2[str], m0 = ROOT_INO, mkdentry(str, entries2[str]) = mkdentry(str0, entries2[str0]) |
Used simplifier rules: ⊦ afs-cons(dirs, files) → ( links(ino, dirs) = ∅ ↔ (ino ∈ dirs → dirs[ino].nlink = 0) ∧ (ino ∈ files → files[ino].nlink = 0)); (ws)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ ∅ ≠ ls ++ alink; (s) Used formulas: entries2[str0] = m0