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

cache_dirs[ino3] = mkdir(m1, md4, # links(ino3, cache_dirs), m12, entries2), 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)[entries2[str]] = mkfile(m5, md1, # links(entries2[str], cache_dirs), content), cache_dirs[m9] = mkdir(m, md7, # links(m9, cache_dirs), m6, entries3), entries0[str] = entries2[str], cache_files[entries2[str]] = mkfile(m3, md6, # links(entries2[str], cache_dirs), content1), entries[str] = entries2[str], cache_dirs[ino2] = mkdir(m7, md5, # links(ino2, cache_dirs), m11, entries1), entries1[str] = entries2[str], dirs = cache_dirs[m9, mkdir(m + 1, md0, # links(m9, cache_dirs), m6, entries3[str0, entries2[str]])], files = ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries2[str], mkfile(m5, md1, # links(entries2[str], cache_dirs) + 1, content)], ino = inode.ino, inode = 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), m9 ∈ cache_dirs, str ∈ entries0, str ∈ entries, ino1 ∈ cache_dirs, ino0 ∈ cache_dirs, ino2 ∈ cache_dirs, str ∈ entries1, entries2[str] ∈ cache_files, ino3 ∈ cache_dirs, str ∈ entries2, 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, links(ino3, cache_dirs) ≠ ∅ ∨ ino3 = ROOT_INO ⊦ ⟨p_inode := (m9 ∈ dirs ⊃ mkinode(m9, dirs[m9].meta, true, dirs[m9].nlink, dirs[m9].nsubdirs, dirs[m9].size) ;mkinode(m9, files[m9].meta, false, files[m9].nlink, 0, files[m9].size) ); c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs[m9, mkdir(m + 1, md0, # links(m9, cache_dirs), m6, entries3[str0, entries1[str]])] ∧ files = ( cache_files[entries1[str], mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1)] [entries[str], mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ] ⊕ cache_pcache) ⊕ cache_icache[m9, mkientry(false, mkinode(m9, md0, true, # links(m9, cache_dirs), m6, m + 1))] [entries1[str], mkientry (false, (entries0[str] ∈ cache_dirs ⊃ mkinode (entries0[str], (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .meta, true, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nlink, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nsubdirs, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .size) ;mkinode (entries0[str], (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .meta, false, (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .nlink, 0, (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .size) )) ] ∧ (asynced ↔ asynced0) ∧ mkinode(m9, md0, true, # links(m9, cache_dirs), m6, m + 1) = p_inode ∧ (entries0[str] ∈ cache_dirs ⊃ mkinode (entries0[str], (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .meta, true, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nlink, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nsubdirs, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .size) ;mkinode (entries0[str], (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .meta, false, (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .nlink, 0, (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .size) ) = c_inode ∧ ESUCCESS = err), ino ∈ dirs, str0 ∈ entries3, ino ∈ files

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information