[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 230 from proof truncate-inv (previous step)

⟨let ino2 = inode.ino, content = files1[inode.ino].content, buf = ? in {ino := inode.size % VFS_PAGE_SIZE, ino0 := min(m0, inode.size); isdir := inode.size ≤ m0 ∧ ino ≠ 0 ∧ (m0 / VFS_PAGE_SIZE ∈ content ∨ buf-opt.some?); if isdir then {pageno := m0 / VFS_PAGE_SIZE; if buf-opt.some? then buf := buf-opt.buf else buf := files1[ino2].content[pageno]; buf := fill(buf, zero, ino, VFS_PAGE_SIZE - ino); content[pageno] := buf; buf-opt := some(buf)}; files1[ino2].content := content upto ino0; let new_inode = inode in {new_inode.size := m0; afs_inode_sync#(new_inode; dirs, files1)}; inode := getinode(inode.ino, dirs, files1); err := ESUCCESS}⟩ (ino = ino1 ∧ ino0 = ino3 ∧ (isdir ↔ isdir0) ∧ pageno = pageno0 ∧ buf-opt = buf-opt1 ∧ files1 = files0 ∧ dirs = dirs0 ∧ inode = inode0 ∧ err = err0), files1[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), buf-opt = none, ino = 0, ino0 = 0, inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), afs-cons(dirs, files1), afs-cons(dirs0, files0), files1 ~ files0, ino4 ∈ files1, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ inode0 = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0)

Heuristic symbolic execution applied rule let left

And obtained the following new goals

Rule argument

Additional information