[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 213 from proof refine-rename-dir-dentry (previous step)

# links(entries[str], cache_dirs) = cache_dirs[entries[str]].nlink, # links(m14, cache_dirs) = cache_dirs[m14].nlink, # links(m3, cache_dirs) = cache_dirs[m3].nlink, # links(entries0[str0], cache_dirs) = cache_dirs[entries0[str0]].nlink, m0 + 1 = cache_dirs[m14].size, m1 + 1 = cache_dirs[m14].nsubdirs, cache_dirs[entries[str]].entries = ∅, (m3 = entries[str] ⊃ (entries[str] = m14 ⊃ mkdir(m13, md0, m12, m15, entries4);mkdir(m13, md8, m12, m15, entries4)).meta:= md.meta:= md1 ;(m3 = m14 ⊃ mkdir(m8, md0, m10, m11, entries2[str, entries0[str0]]);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md ) = mkdir(m18, md10, m19, m20, entries1), (entries[str] = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]) ;(entries[str] = m14 ⊃ mkdir(m0, md5, cache_dirs[entries[str]].nlink, m1, entries0 -- str0);cache_dirs[entries[str]]) ) = mkdir(m13, md8, m12 + 1, m15, entries4), (m3 = m14 ⊃ mkdir(m0, md5, cache_dirs[m14].nlink, m1, entries0 -- str0);cache_dirs[m3]) = mkdir(m8, md3, m10, m11, entries2), (m14 = entries[str] ⊃ (entries[str] = m3 ⊃ mkdir(m13, md, m12, m15, entries4);mkdir(m13, md0, m12, m15, entries4)).meta:= md1 ;(m14 = m3 ⊃ mkdir(m8, md, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md0, cache_dirs[m14].nlink, m1, entries0 -- str0)) ) = mkdir(m, md9, m16, m17, entries5), (entries[str] = m3 ⊃ (entries[str] = m14 ⊃ mkdir(m13, md0, m12, m15, entries4);mkdir(m13, md8, m12, m15, entries4)).meta:= md ;(entries[str] = m14 ⊃ mkdir(m13, md0, m12, m15, entries4);mkdir(m13, md8, m12, m15, entries4)) ) = mkdir(m4, md7, m7, m22, entries6), cache_dirs[m14] = mkdir(m0 + 1, md5, cache_dirs[m14].nlink, m1 + 1, entries0), cache_dirs[m3] = mkdir(cache_dirs[m3].size, md4, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, entries), cache_dirs[entries[str]] = mkdir(cache_dirs[entries[str]].size, md11, cache_dirs[entries[str]].nlink, cache_dirs[entries[str]].nsubdirs, ∅), cache_dirs[entries0[str0]] = mkdir(cache_dirs[entries0[str0]].size, md12, cache_dirs[entries0[str0]].nlink, cache_dirs[entries0[str0]].nsubdirs, entries7), entries[str] = cache_dirs[m3].entries[str], entries0[str0] = cache_dirs[m14].entries[str0], afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m14, ((cache_dirs[m14].entries:= (cache_dirs[m14].entries -- str0)).size:= m0).nsubdirs:= m1] [m3, (m3 = m14 ⊃ ((cache_dirs[m14].entries:= (cache_dirs[m14].entries -- str0)).size:= m0).nsubdirs:= m1;cache_dirs[m3]) .entries:= (m3 = m14 ⊃ ((cache_dirs[m14].entries:= (cache_dirs[m14].entries -- str0)).size:= m0).nsubdirs:= m1;cache_dirs[m3]).entries [str, entries0[str0] ] ], entries[str] ≠ ROOT_INO, afs-cons (cache_dirs [m14, (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4) ;(m14 = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md5, cache_dirs[m14].nlink, m1, entries0 -- str0)) ) .meta:= md0 ] [m3, (m3 = m14 ⊃ (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md0 ;(m3 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])) ) .meta:= md ] [entries[str], mkdir(m4, md1, m7, m22, entries6) ], cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons ((cache_dcache -- dentrykey(m14, str0))[dentrykey(m3, str), mkdentry(str, entries0[str0])], cache_dirs [m14, (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4) ;(m14 = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md5, cache_dirs[m14].nlink, m1, entries0 -- str0)) ) .meta:= md0 ] [m3, (m3 = m14 ⊃ (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md0 ;(m3 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])) ) .meta:= md ] [entries[str], mkdir(m4, md1, m7, m22, entries6) ], cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[m14, mkientry(false, mkinode(m14, md9, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m19, m20, m18))] [entries[str], mkientry(false, mkinode(entries[str], md1, true, m7, m22, m4)) ], cache_dirs [m14, (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4) ;(m14 = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md5, cache_dirs[m14].nlink, m1, entries0 -- str0)) ) .meta:= md0 ] [m3, (m3 = m14 ⊃ (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md0 ;(m3 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])) ) .meta:= md ] [entries[str], mkdir(m4, md1, m7, m22, entries6) ], cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs [m14, (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4) ;(m14 = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md5, cache_dirs[m14].nlink, m1, entries0 -- str0)) ) .meta:= md0 ] [m3, (m3 = m14 ⊃ (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md0 ;(m3 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])) ) .meta:= md ] [entries[str], mkdir(m4, md1, m7, m22, entries6) ], cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs [m14, (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4) ;(m14 = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md5, cache_dirs[m14].nlink, m1, entries0 -- str0)) ) .meta:= md0 ] [m3, (m3 = m14 ⊃ (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md0 ;(m3 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])) ) .meta:= md ] [entries[str], mkdir(m4, md1, m7, m22, entries6) ], cache_icache[m14, mkientry(false, mkinode(m14, md9, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m19, m20, m18))] [entries[str], mkientry(false, mkinode(entries[str], md1, true, m7, m22, m4)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), str0 ∈ entries0, m14 ∈ cache_dirs, entries0[str0] ∈ cache_dirs, m3 ∈ cache_dirs, entries[str] ∈ cache_dirs, str ∈ cache_dirs[m3].entries, str0 ∈ cache_dirs[m14].entries, str ∈ entries, cache_sync → synced (cache_files, cache_icache[m14, mkientry(false, mkinode(m14, md9, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m19, m20, m18))] [entries[str], mkientry(false, mkinode(entries[str], md1, true, m7, m22, m4)) ], cache_pcache), m3 = m14 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m14, cache_dirs) ≠ ∅ ∨ m14 = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟨afs_drop_nlink#(mkdentry(str, entries[str]).ino; dirs, afs_files); old_dent := mkdentry(str0, entries0[str0]); asynced1 := true; if ¬ asynced1 then {dirs[m3].size := dirs[m3].size + 1; if old_dent.ino ∈ dirs then dirs[m3].nsubdirs := dirs[m3].nsubdirs + 1}; new_dent := mkdentry(mkdentry(str, entries[str]).name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(mkinode(m14, md0, true, cache_dirs[m14].nlink, m1 + 1, m0 + 1); dirs, afs_files); afs_inode_sync#(mkinode(m3, md, true, # links(m3, cache_dirs), cache_dirs[m3].nsubdirs, cache_dirs[m3].size); dirs, afs_files); new_child_inode := mkinode(entries[str], md1, true, # links(entries[str], cache_dirs), cache_dirs[entries[str]].nsubdirs, cache_dirs[entries[str]].size); if asynced1 then {afs_inode_sync#(new_child_inode; dirs, afs_files); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, afs_files[new_child_inode.ino].meta, false, afs_files[new_child_inode.ino].nlink, 0, afs_files[new_child_inode.ino].size) )}; old_parent_inode := (m14 ∈ dirs ⊃ mkinode(m14, dirs[m14].meta, true, dirs[m14].nlink, dirs[m14].nsubdirs, dirs[m14].size) ;mkinode(m14, afs_files[m14].meta, false, afs_files[m14].nlink, 0, afs_files[m14].size) ); new_parent_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, afs_files[m3].meta, false, afs_files[m3].nlink, 0, afs_files[m3].size) ); err := ESUCCESS; asynced := ?⟩ ( mkinode (m14, (m14 = entries[str] ⊃ (entries[str] = m3 ⊃ mkdir(m13, md, m12, m15, entries4);mkdir(m13, md0, m12, m15, entries4)).meta:= md1 ;(m14 = m3 ⊃ mkdir(m8, md, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md0, # links(m14, cache_dirs), m1, entries0 -- str0)) ) .meta, true, (m14 = entries[str] ⊃ (entries[str] = m3 ⊃ mkdir(m13, md, m12, m15, entries4);mkdir(m13, md0, m12, m15, entries4)).meta:= md1 ;(m14 = m3 ⊃ mkdir(m8, md, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md0, # links(m14, cache_dirs), m1, entries0 -- str0)) ) .nlink, (m14 = entries[str] ⊃ (entries[str] = m3 ⊃ mkdir(m13, md, m12, m15, entries4);mkdir(m13, md0, m12, m15, entries4)).meta:= md1 ;(m14 = m3 ⊃ mkdir(m8, md, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md0, # links(m14, cache_dirs), m1, entries0 -- str0)) ) .nsubdirs, (m14 = entries[str] ⊃ (entries[str] = m3 ⊃ mkdir(m13, md, m12, m15, entries4);mkdir(m13, md0, m12, m15, entries4)).meta:= md1 ;(m14 = m3 ⊃ mkdir(m8, md, m10, m11, entries2[str, entries0[str0]]);mkdir(m0, md0, # links(m14, cache_dirs), m1, entries0 -- str0)) ) .size) = old_parent_inode ∧ mkinode(m3, md10, true, m19, m20, m18) = new_parent_inode ∧ mkinode(entries[str], md1, true, m7, m22, m4) = new_child_inode ∧ negdentry(str0) = old_dent ∧ mkdentry(str, entries0[str0]) = new_dent ∧ ESUCCESS = err ∧ dirs = cache_dirs [m14, (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4) ;(m14 = m3 ⊃ mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]]) ;mkdir(m0, md5, # links(m14, cache_dirs), m1, entries0 -- str0) ) ) .meta:= md0 ] [m3, (m3 = m14 ⊃ (m14 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])).meta:= md0 ;(m3 = entries[str] ⊃ mkdir(m13, md8, m12, m15, entries4);mkdir(m8, md3, m10, m11, entries2[str, entries0[str0]])) ) .meta:= md ] [entries[str], (entries[str] = m3 ⊃ (entries[str] = m14 ⊃ mkdir(m13, md0, m12, m15, entries4);mkdir(m13, md8, m12, m15, entries4)).meta:= md ;(entries[str] = m14 ⊃ mkdir(m13, md0, m12, m15, entries4);mkdir(m13, md8, m12, m15, entries4)) ) .meta:= md1 ] ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m14, mkientry(false, mkinode(m14, md9, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m19, m20, m18))] [entries[str], mkientry(false, mkinode(entries[str], md1, true, m7, m22, m4)) ] ∧ (asynced ↔ asynced2)), m14 = m3 ∧ mkdentry(str, entries[str]) = mkdentry(str0, entries0[str0])

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: abstract-dir name: elim seq: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries) subst: [ad, m, md, m0, m1, entries] → [cache_dirs[m14], m2, md2, m5, m6, entries3]

Additional information

Used simplifier rules: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries); (elim) Used terms: cache_dirs[m14], m2, md2, m5, m6, entries3