[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 257 from proof inv-truncate-buff-none-cached (previous step)

# buf0 = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, pcache[datakey(m, m2 / VFS_PAGE_SIZE)] = mkpentry(boolvar, buf0), files0[m] = mkfile(m1, md1, # links(m, dirs), content0), err = ESUCCESS, files = files0[m, mkfile(m1, md1, # links(m, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)], ino = inode.ino, inode = mkinode(m, md, false, # links(m, dirs), 0, n), afs-cons(dirs, files0), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache, dirs, files0), synced(dirs, icache, pcache), datakey(m, m2 / VFS_PAGE_SIZE) ∈ pcache, m ∈ files0, ino ∈ dirs, m2 ≤ n, asynced2 → synced(files0, icache, pcache) ⊦ [asynced := ?] ( afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files) → ⟪asynced4 := true; if err = ESUCCESS then let asynced = false in {icache_set# ((m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ), asynced ; err, icache); pcache_truncate# ((m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) .ino, m2, n ; err, pcache); if asynced4 then pcache_set# ((m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) .ino, m2 / VFS_PAGE_SIZE, some(fill(some(buf0).buf, zero, m2 % VFS_PAGE_SIZE, n0)).buf, asynced ; err, pcache)}; if ¬ asynced4 ∨ err ≠ ESUCCESS then buf-opt0 := none⟫ ( icache-cons(icache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ dcache-cons(dcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ pcache-cons(pcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ synced(dirs[ino, dirs[ino].meta:= inode.meta], icache, pcache) ∧ (asynced2 → synced(files, icache, pcache)))), m2 % VFS_PAGE_SIZE = 0, ino ∈ files

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)