[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 14 from proof writepage-prepost (previous step)

err = ESUCCESS, ⌜buf0⌝ = (σ from n3 * VFS_PAGE_SIZE) to VFS_PAGE_SIZE, ((m0 =>mkfile(n2, md, m1, σ) * F))(files), afs-cons(dirs, files), m0 ∈ files, m + n1 ≤ # buf1, n0 + n1 ≤ VFS_PAGE_SIZE ⊦ [afs_check_commit#(dirs, files; err; asynced); files0 := files; if err = ESUCCESS then {buf0 := copy(buf1, m, buf0, n0, n1); afs_writepage#(mkinode(m0, md0, boolvar, m2, m3, m4), n3, buf0, dirs; err, files; asynced)}] ( err = ESUCCESS ∧ ((m0 =>mkfile(n2, md, m1, (σ to n3 * VFS_PAGE_SIZE + n0) + ((⌜buf1⌝ from m) to n1) + (σ from n3 * VFS_PAGE_SIZE + n0 + n1)) * F))(files) ∨ ⌊err⌋ ∧ files0 = files)

User applied rule call right

And obtained the following new goals

Proof step 15:
err = ESUCCESS, ⌜buf0⌝ = (σ from n3 * VFS_PAGE_SIZE) to VFS_PAGE_SIZE, ((m0 =>mkfile(n2, md, m1, σ) * F))(files), afs-cons(dirs, files), m0 ∈ files, n0 + n1 ≤ VFS_PAGE_SIZE, m + n1 ≤ # buf1 ⊦ [fail_or_success#(; ; err); choose bv with true in asynced := bv; files0 := files; if err = ESUCCESS then {buf0 := copy(buf1, m, buf0, n0, n1); afs_writepage#(mkinode(m0, md0, boolvar, m2, m3, m4), n3, buf0, dirs; err, files; asynced)}] ( err = ESUCCESS ∧ ((m0 =>mkfile(n2, md, m1, (σ to n3 * VFS_PAGE_SIZE + n0) + ((⌜buf1⌝ from m) to n1) + (σ from n3 * VFS_PAGE_SIZE + n0 + n1)) * F))(files) ∨ ⌊err⌋ ∧ files0 = files)

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_check_commit#(DIRS, FILES; ERR; ASYNCED) {fail_or_success#(; ; ERR); choose bv with true in ASYNCED := bv};