[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 212 from proof write-term (previous step)

files1[m] = mkfile(m1, md, # links(m, dirs), content), of[fd] = mkfile(m, mode, m0), files0[m] = mkfile(m2, md0, # links(m, dirs), content0), dirs0 = dirs, err = ESUCCESS, files = files1, inode = mkinode(m, md0, false, # links(m, dirs), 0, m0 + ino), m2 < m0 + ino, afs-cons(dirs, files0), afs-cons(dirs, files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)]), of-cons(of, dirs, files0), pre-write-inode(inode, dirs, files), m ∈ files0, fd ∈ of, m ∈ files1, n ≤ # buf0 ⊦ ⟪if ESUCCESS ≠ ESUCCESS then ino := (m0 ≤ m2 ⊃ m2 - m0;0), err := ESUCCESS; of[fd].pos := m0 + ino⟫ (dirs0 = dirs), ino = 0, n = 0, m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0, mode ≠ MODE_W ∧ mode ≠ MODE_RW

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 213:
files0[m] = mkfile(m2, md0, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), files1[m] = mkfile(m1, md, # links(m, dirs), content), dirs0 = dirs, err = ESUCCESS, files = files1, inode = mkinode(m, md0, false, # links(m, dirs), 0, m0 + ino), m2 < m0 + ino, afs-cons(dirs, files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)]), afs-cons(dirs, files0), of-cons(of, dirs, files0), pre-write-inode(inode, dirs, files), m ∈ files1, fd ∈ of, m ∈ files0, n ≤ # buf0 ⊦ ⟪skip; of[fd].pos := m0 + ino⟫ (dirs0 = dirs), ino = 0, n = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW, m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Rule argument

pos: right 1

Proof step 212 from proof write-term (previous step)

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

Additional information