[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 229 from proof refine-link (previous step)

cache_dirs[ino0] = mkdir(m4, md2, # links(ino0, cache_dirs), m10, entries), cache_dirs[ino1] = mkdir(m0, md3, # links(ino1, cache_dirs), m2, entries0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str]] = mkfile(m5, md1, # links(entries1[str], cache_dirs), content), cache_dirs[m9] = mkdir(m1, md4, # links(m9, cache_dirs), m8, entries2), entries0[str] = entries1[str], cache_files[entries1[str]] = mkfile(m3, md6, # links(entries1[str], cache_dirs), content1), entries[str] = entries1[str], cache_dirs[ino2] = mkdir(m7, md5, # links(ino2, cache_dirs), m11, entries1), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, c_inode = p_inode1, cache_dirs0 = cache_dirs, dirs = cache_dirs, err = err0, files = afs_files, new_dent = old_dent0, old_dent = mkdentry(str, entries0[str]), old_dent0 = negdentry(str0), p_inode = p_inode0, p_inode0 = mkinode(m9, md0, true, # links(m9, cache_dirs), m8, m1), p_inode1 = mkinode(entries1[str], md, false, # links(entries1[str], cache_dirs), 0, m14), 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), str ∈ entries, str ∈ entries0, ino1 ∈ cache_dirs, ino0 ∈ cache_dirs, ino2 ∈ cache_dirs, str ∈ entries1, m9 ∈ cache_dirs, entries1[str] ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m9, cache_dirs) ≠ ∅ ∨ m9 = ROOT_INO, links(ino1, cache_dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, cache_dirs) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino2, cache_dirs) ≠ ∅ ∨ ino2 = ROOT_INO ⊦ ⟨abort⟩ ( dirs = cache_dirs0[m9, mkdir(m1 + 1, md0, # links(m9, cache_dirs0), m8, entries2[str0, entries1[str]])] ∧ files = ( cache_files[entries1[str], mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1)] [entries[str], mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ] ⊕ cache_pcache) ⊕ cache_icache[m9, mkientry(false, mkinode(m9, md0, true, # links(m9, cache_dirs0), m8, m1 + 1))] [entries1[str], mkientry (false, (entries0[str] ∈ cache_dirs0 ⊃ mkinode (entries0[str], (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .meta, true, (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .nlink, (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .nsubdirs, (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .size) ;mkinode (entries0[str], (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1) ) .meta, false, (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1) ) .nlink, 0, (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1) ) .size) )) ] ∧ (asynced ↔ asynced0) ∧ (m9 ∈ cache_dirs0 ⊃ mkinode(m9, md0, true, # links(m9, cache_dirs0), m8, m1 + 1) ;mkinode (m9, (m9 = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1);cache_files[m9]).meta, false, (m9 = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1);cache_files[m9]).nlink, 0, (m9 = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1);cache_files[m9]).size) ) = p_inode ∧ (entries0[str] ∈ cache_dirs0 ⊃ mkinode (entries0[str], (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .meta, true, (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .nlink, (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .nsubdirs, (entries0[str] = m9 ⊃ mkdir(m1 + 1, md0, # links(entries0[str], cache_dirs0), m8, entries2[str0, entries1[str]]) ;cache_dirs0[entries0[str]] ) .size) ;mkinode (entries0[str], (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1) ) .meta, false, (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1) ) .nlink, 0, (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs0) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs0) + 1, content1) ) .size) ) = c_inode ∧ mkdentry(str0, entries0[str]) = new_dent ∧ ESUCCESS = err), pre-link(p_inode, c_inode, old_dent, new_dent, dirs, files), str0 ∈ entries2

Heuristic symbolic execution applied rule abort right

And obtained the following new goals

Rule argument

Additional information