[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 111 from proof eq-io-truncate (previous step)

⟨if ino ∈ files then {files[ino].size := inode.size; files[ino].meta := inode.meta} else if ino ∈ dirs then dirs[ino].meta := inode.meta⟩ (dirs = dirs0 ∧ files = files0), VFS_PAGE_SIZE = n1 + m2 % VFS_PAGE_SIZE, files2[m] = mkfile(m3, md1, m4, content), dirs = dirs1, files = files1, files1 = files2[m, mkfile(m3, md1, m4, content[m2 / VFS_PAGE_SIZE, fill(content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n1)] upto m2)], ino = inode.ino, inode = mkinode(m, md, false, m4, 0, n0), inode0 = mkinode(m, md, false, m4, 0, m2), m ∈ files2, m2 / VFS_PAGE_SIZE ∈ content, m2 ≤ n0, VFS_PAGE_SIZE ≤ # content[m2 / VFS_PAGE_SIZE] ⊦ ⟨afs_truncate#(n0, m2 / VFS_PAGE_SIZE; buf-opt, inode0, boolvar1, err, dirs1, files2, boolvar2)⟩ ( buf-opt = some(fill(content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n1)) ∧ inode0 = (m ∈ dirs0 ⊃ mkinode(m, dirs0[m].meta, true, dirs0[m].nlink, dirs0[m].nsubdirs, dirs0[m].size) ;mkinode(m, files0[m].meta, false, files0[m].nlink, 0, files0[m].size) ) ∧ boolvar1 ∧ err = ESUCCESS ∧ dirs1 = dirs0 ∧ files2 = files0), m2 % VFS_PAGE_SIZE = 0, buf-opt.some?

Heuristic conditional left split applied rule if left

And obtained the following new goals

Rule argument

pos: left 1

Additional information