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

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

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

Additional information