[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 20 from proof fsync-pages-keep-abs (previous step)

err = ESUCCESS, ino = m, key = datakey(ino, pageno), pageno = n, (files ⊕ pcache) ⊕ icache = (files1 ⊕ pcache0) ⊕ icache, n * VFS_PAGE_SIZE < m2, pcache-cons(pcache0, dirs, files1), key ∈ pcache ⊦ [files0 := (files1 ⊕ pcache0) ⊕ icache; if true ∧ pcache[key].dirty then let buf = ? in {asynced0 := true; pcache_get#(m, n, pcache; asynced0, buf, err); if err = ESUCCESS then afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), 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] (files0 = (files ⊕ pcache) ⊕ icache)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 21:
err = ESUCCESS, ino = m, key = datakey(ino, pageno), pageno = n, (files ⊕ pcache) ⊕ icache = (files1 ⊕ pcache0) ⊕ icache, n * VFS_PAGE_SIZE < m2, pcache-cons(pcache0, dirs, files1), key ∈ pcache ⊦ [if true ∧ pcache[key].dirty then let buf = ? in {asynced0 := true; pcache_get#(m, n, pcache; asynced0, buf, err); if err = ESUCCESS then afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), 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] ((files1 ⊕ pcache0) ⊕ icache = (files ⊕ pcache) ⊕ icache)

Proof step 20 from proof fsync-pages-keep-abs (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information