[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 338 from proof fsync-pages-inv (previous step)

files[m] = mkfile(m0, md1, # links(m, dirs), content0), files0[m] = mkfile(m1, md0, # links(m, dirs), content), err = ESUCCESS, ino = m, inode = mkinode(m, md, false, # links(m, dirs), 0, m2), key = datakey(ino, pageno), n = n0, pageno = n0, n0 * VFS_PAGE_SIZE < m2, afs-cons(dirs, files0), afs-cons(dirs, files), dcache-cons(dcache, dirs, files0), dcache-cons(dcache, dirs, files), icache-cons(icache, dirs, files0), icache-cons(icache, dirs, files), pcache-cons(pcache0, dirs, files0), pcache-cons(pcache, dirs, files), synced(dirs, icache, pcache0), synced(dirs, icache, pcache), m ∈ files0, m ∈ files ⊦ ⟪if false ∧ asynced then let buf = ? in {asynced0 := false; pcache_get#(m, n, pcache; asynced0, buf, err); if err = ESUCCESS then afs_writepage#(inode, n, buf, dirs; err, files; asynced1); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced1); if err = ESUCCESS then {asynced := false; pcache_set_status#(m, n, asynced; err, pcache)}}; n := n + 1⟫ ( icache-cons(icache, dirs, files) ∧ dcache-cons(dcache, dirs, files) ∧ pcache-cons(pcache, dirs, files) ∧ synced(dirs, icache, pcache) ∧ afs-cons(dirs, files) ∧ m ∈ files ∧ # links(m, dirs) = files[m].nlink ∧ inode.size + VFS_PAGE_SIZE - n * VFS_PAGE_SIZE < inode.size + VFS_PAGE_SIZE - n0 * VFS_PAGE_SIZE), key ∈ pcache

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information