[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 357 from proof refine-rename-file-negdentry (previous step)

cache_files[entries0[str]] = mkfile(m1, md3, # links(entries0[str], cache_dirs), content0), cache_dirs[m] = mkdir(m0, md4, # links(m, cache_dirs), m4, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m9, md2, # links(entries0[str], cache_dirs), content), cache_dirs[m3] = mkdir(m2, md5, # links(m3, cache_dirs), m6, entries0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, cache_dirs0 = cache_dirs, dirs = cache_dirs, err = err1, files = afs_files, new_child_inode = new_child_inode0, new_child_inode1 = new_child_inode0, new_dent = new_dent0, new_dent0 = negdentry(str0), new_parent_inode = new_parent_inode0, new_parent_inode0 = mkinode(m, md, true, # links(m, cache_dirs), m4, m0), new_parent_inode1 = mkinode(m, md, true, # links(m, cache_dirs), m4, m0), old_child_inode = old_child_inode0, old_child_inode0 = mkinode(entries0[str], md1, false, # links(entries0[str], cache_dirs), 0, m10), old_dent = old_dent0, old_dent0 = mkdentry(str, entries0[str]), old_parent_inode = old_parent_inode0, old_parent_inode0 = mkinode(m3, md0, true, # links(m3, cache_dirs), m6, m2), old_parent_inode1 = mkinode(m3, md0, true, # links(m3, cache_dirs), m6, m2), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries0, m ∈ cache_dirs, entries0[str] ∈ cache_files, m3 ∈ cache_dirs, ⌊err0⌋ , m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟨ let old_ino = old_parent_inode.ino, new_ino = new_parent_inode.ino, asynced1 = new_dent.dentry? in let asynced0 = old_ino = new_ino ∧ new_dent = old_dent in {dirs[old_ino].entries := dirs[old_ino].entries -- old_dent.name; if ¬ asynced0 then {dirs[old_ino].size := dirs[old_ino].size - 1; if old_dent.ino ∈ dirs then dirs[old_ino].nsubdirs := dirs[old_ino].nsubdirs - 1}; dirs[new_ino].entries[new_dent.name] := old_dent.ino; if asynced1 ∧ ¬ asynced0 then let ino = new_dent.ino in afs_drop_nlink#(ino; dirs, files); if ¬ asynced1 then {dirs[new_ino].size := dirs[new_ino].size + 1; if old_dent.ino ∈ dirs then dirs[new_ino].nsubdirs := dirs[new_ino].nsubdirs + 1}; new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(old_parent_inode; dirs, files); afs_inode_sync#(new_parent_inode; dirs, files); if asynced1 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := getinode(new_child_inode.ino, dirs, files)}; old_parent_inode := getinode(old_parent_inode.ino, dirs, files); new_parent_inode := getinode(new_parent_inode.ino, dirs, files); err := ESUCCESS} or fail#(; ; err); asynced := ?⟩ ( old_parent_inode1 = old_parent_inode ∧ new_parent_inode1 = new_parent_inode ∧ mkinode(entries0[str], md1, false, # links(entries0[str], cache_dirs0), 0, m10) = old_child_inode ∧ new_child_inode1 = new_child_inode ∧ mkdentry(str, entries0[str]) = old_dent ∧ negdentry(str0) = new_dent ∧ err0 = err ∧ dirs = cache_dirs0 ∧ files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (asynced ↔ asynced0)), str0 ∈ entries

Heuristic symbolic execution applied rule or right

And obtained the following new goals

Rule argument

Additional information