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

⟨files[ino].size := inode.size; files[ino].meta := inode.meta⟩ (dirs = dirs0 ∧ files = files0), files0[ino4] = mkfile(m, md0, m1, content1), files2[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), files = files1, files1 = files2[ino4, mkfile(m0, md, # links(ino4, dirs), content0 upto m0)], ino = inode.ino, inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), afs-cons(dirs, files2), afs-cons(dirs0, files0), files2 ~ files0, ino4 ∈ files2, ino ∈ files, n0 ≤ # buf0 ⊦ m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0, ino4 ∈ files0 ∧ m = m0

Heuristic symbolic execution applied rule assign left

And obtained the following new goals

Proof step 175:
⟨files := files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]⟩ (dirs = dirs0 ∧ files = files0), files2[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), files0[ino4] = mkfile(m, md0, m1, content1), files = files1, files1 = files2[ino4, mkfile(m0, md, # links(ino4, dirs), content0 upto m0)], ino = inode.ino, inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), afs-cons(dirs0, files0), afs-cons(dirs, files2), files2 ~ files0, ino ∈ files, ino4 ∈ files2, n0 ≤ # buf0 ⊦ ino4 ∈ files0 ∧ m = m0, m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0

Proof step 174 from proof truncate-inv (previous step)

Heuristic symbolic execution applied rule assign left

And obtained the following new goals

Rule argument

Additional information