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

cache_dirs[entries1[str0]] = mkdir(m6, md6, # links(entries1[str0], cache_dirs), m9, entries), cache_dirs[entries0[str]] = mkdir(m4, md4, # links(entries0[str], cache_dirs), m7, ∅), cache_dirs[m] = mkdir(m0, md5, # links(m, cache_dirs), m2, entries0), cache_dirs[m3] = mkdir(m1, md7, # links(m3, cache_dirs), m5, entries1), cache_dirs0[entries1[str0]] = mkdir(m8, md3, m10, m11, entries2), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, cache_dirs0 = cache_dirs, new_child_inode = mkinode(entries0[str], md1, true, # links(entries0[str], cache_dirs), m7, m4), new_child_inode0 = mkinode(entries0[str], md1, true, # links(entries0[str], cache_dirs), m7, m4), new_dent0 = mkdentry(str, entries0[str]), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m2, m0), new_parent_inode0 = mkinode(m, md, true, # links(m, cache_dirs), m2, m0), old_child_inode0 = mkinode(entries1[str0], md2, true, # links(entries1[str0], cache_dirs), m9, m6), old_dent0 = mkdentry(str0, entries1[str0]), old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1), old_parent_inode0 = mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str0 ∈ entries1, entries0[str] ∈ cache_dirs, entries1[str0] ∈ cache_dirs, m ∈ cache_dirs, m3 ∈ cache_dirs, str ∈ entries0, ⌊err0⌋ , cache_sync → synced(cache_files, cache_icache, cache_pcache), m = m3 → md = md0, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⟨afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err1, cache_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode(entries1[str0], md2, true, # links(entries1[str0], cache_dirs0), m11, m8) = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ mkdentry(str0, entries1[str0]) = old_dent0 ∧ mkdentry(str, entries0[str]) = new_dent0 ∧ err0 = err1 ∧ cache_dirs = cache_dirs0 ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced)), entries0[str] = ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 682:
cache_dirs[m3] = mkdir(m1, md7, # links(m3, cache_dirs), m5, entries1), cache_dirs[m] = mkdir(m0, md5, # links(m, cache_dirs), m2, entries0), cache_dirs[entries0[str]] = mkdir(m4, md4, # links(entries0[str], cache_dirs), m7, ∅), cache_dirs[entries1[str0]] = mkdir(m8, md3, # links(entries1[str0], cache_dirs), m11, entries2), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, cache_dirs0 = cache_dirs, new_child_inode = mkinode(entries0[str], md1, true, # links(entries0[str], cache_dirs), m7, m4), new_child_inode0 = mkinode(entries0[str], md1, true, # links(entries0[str], cache_dirs), m7, m4), new_dent0 = mkdentry(str, entries0[str]), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m2, m0), new_parent_inode0 = mkinode(m, md, true, # links(m, cache_dirs), m2, m0), old_child_inode0 = mkinode(entries1[str0], md2, true, # links(entries1[str0], cache_dirs), m11, m8), old_dent0 = mkdentry(str0, entries1[str0]), old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1), old_parent_inode0 = mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1), entries0[str] ≠ ROOT_INO, 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), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries0, m3 ∈ cache_dirs, m ∈ cache_dirs, entries1[str0] ∈ cache_dirs, entries0[str] ∈ cache_dirs, str0 ∈ entries1, ⌊err0⌋ , m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err1, cache_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode(entries1[str0], md2, true, # links(entries1[str0], cache_dirs0), m11, m8) = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ mkdentry(str0, entries1[str0]) = old_dent0 ∧ mkdentry(str, entries0[str]) = new_dent0 ∧ err0 = err1 ∧ cache_dirs = cache_dirs0 ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))

Rule argument

Additional information

Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)%afs-cons-dir-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) → # links(ino, dirs) = n; (forward) from specification afs-base