[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 126 from proof inv-rename-file-dentry (previous step)

# links(entries1[str], dirs0) = m11 + 1, (m = m0 ⊃ mkdir(m1, md6, # links(m0, dirs0), m7, entries -- str0);mkdir(m4, md4, # links(m, dirs0), m8, entries1)) = mkdir(m6, md3, m9, m10, entries0), dirs0[m0] = mkdir(m1 + 1, md6, # links(m0, dirs0), m7, entries), files0[entries[str0]] = mkfile(m3, md0, # links(entries[str0], dirs0), content), files0[entries1[str]] = mkfile(m5, md5, m11 + 1, content1), dirs0[m] = mkdir(m4, md4, # links(m, dirs0), m8, entries1), dirs = dirs0[m0, (m0 = m ⊃ mkdir(m6, md3, m9, m10, entries0[str, entries[str0]]);mkdir(m1, md6, # links(m0, dirs0), m7, entries -- str0)).meta:= md2] [m, (m = m0 ⊃ mkdir(m6, md2, m9, m10, entries0[str, entries[str0]]);mkdir(m6, md3, m9, m10, entries0[str, entries[str0]])).meta:= md1 ], files = files0[entries1[str], mkfile(m5, md5, m11, content1)], ino = inode.ino, inode = mkinode(entries1[str], md, false, # links(entries1[str], dirs0), 0, m2), afs-cons(dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]), afs-cons(dirs0, files0), dcache-cons(dcache, dirs0, files0), icache-cons(icache, dirs0, files0), pcache-cons(pcache, dirs0, files0), synced(dirs0, icache, pcache), str0 ∈ entries, entries[str0] ∈ files0, entries1[str] ∈ files0, m0 ∈ dirs0, str ∈ entries1, m ∈ dirs0, ino ∈ files, m = m0 → md1 = md2, asynced2 → synced(files0, icache, pcache), (entries1[str] ∈ dirs ⊃ str ∈ entries1 ∧ str ∈ entries1 ∧ str ∈ entries1 ∧ str ∈ entries1 ∧ str ∈ entries1 ;str ∈ entries1 ∧ str ∈ entries1 ∧ str ∈ entries1 ∧ str ∈ entries1 ), links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪if ESUCCESS = ESUCCESS then let asynced = false in {err := ESUCCESS; icache_set# ((m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode (m0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m0].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m0].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m0].size) ), asynced ; err, icache); icache_set# ((m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].size) ), asynced ; err, icache); if true then icache_set# ((entries1[str] ∈ dirs ⊃ mkinode (entries1[str], dirs[entries1[str]].meta, true, dirs[entries1[str]].nlink, dirs[entries1[str]].nsubdirs, dirs[entries1[str]].size) ;mkinode (entries1[str], files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries1[str]].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries1[str]] .nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries1[str]].size) ), asynced ; err, icache); dcache_delete# ((m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode (m0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m0].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m0].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m0].size) ) .ino, mkdentry(str0, entries[str0]).name ; err, dcache); dcache_set# ((m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].size) ) .ino, mkdentry(mkdentry(str, entries1[str]).name, mkdentry(str0, entries[str0]).ino).name, mkdentry(mkdentry(str, entries1[str]).name, mkdentry(str0, entries[str0]).ino) ; err, dcache)}⟫ ( icache-cons(icache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ dcache-cons(dcache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ pcache-cons(pcache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ synced(dirs, icache, pcache) ∧ ( asynced2 → synced(files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta], icache, pcache))), entries[str0] ∈ dirs0, entries1[str] ∈ dirs0, m0 = m ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0])

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information