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

VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs0[ri[inodekey(m)]] = inodenode(key, md0, false, m3, 0, m5), fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(key0, buf), dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n)] [adr3, fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(buf, zero, m2 % VFS_PAGE_SIZE, n0) ], nd2 = fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]], ro = orphans(fs0, ri), fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, orphans(fs0, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), node-cons ((fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)).key, fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs0, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, m2 ≤ n, asynced → boolvar0 ⊦ [aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr3, fi, orphans(fs0, ri), fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar4; ri); buf-opt := buf-opt0; boolvar1 := boolvar2; nd2.data := fill(nd2.data, zero, m2 % VFS_PAGE_SIZE, n0); inode := mkinode(m, md, false, m3, 0, m2); log := ((log0 + adr1 ') + adr2 ') + adr3 '; err := ESUCCESS; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr2, fi, ro, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro, fo, fs, log, boolvar4; ri); boolvar1 := true; inode := mkinode (inode.ino, inodenode(inodekey(m), md, false, m3, 0, n).meta, inodenode(inodekey(m), md, false, m3, 0, n).directory, inodenode(inodekey(m), md, false, m3, 0, n).nlink, inodenode(inodekey(m), md, false, m3, 0, n).nsubdirs, inodenode(inodekey(m), md, false, m3, 0, n).size); if boolvar1 then buf-opt := some(nd2.data)}] ( ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨p_inode := mkinode(m, md, false, m3, 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ err = err1)), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, buf-opt0.some?, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 469:
VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs0[ri[inodekey(m)]] = inodenode(key, md0, false, m3, 0, m5), fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(key0, buf), dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), ro = orphans(fs0, ri), m2 % VFS_PAGE_SIZE ≠ 0, adr1 ≠ adr2, adr1 ≠ adr3, adr2 ≠ adr3, m ≠ 0, key0.data?, orphans(fs0, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs0, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, m2 ≤ n, ¬ buf-opt0.some?, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, asynced → boolvar0 ⊦ [aubifs_core_index_store# (datakey(m, m2 / VFS_PAGE_SIZE), adr3, fi, orphans(fs0, ri), fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n)] [adr3, datanode(key0, buf).data:= fill(buf, zero, m2 % VFS_PAGE_SIZE, n0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar4 ; ri); buf-opt := buf-opt0; boolvar1 := boolvar2; nd2 := datanode(key0, fill(datanode(key0, buf).data, zero, m2 % VFS_PAGE_SIZE, n0)); inode := mkinode(m, md, false, m3, 0, m2); log := ((log0 + adr1 ') + adr2 ') + adr3 '; err := ESUCCESS; fs := fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n)] [adr3, datanode(key0, buf).data:= fill(buf, zero, m2 % VFS_PAGE_SIZE, n0) ]; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr2, fi, ro, fo, fs, log, boolvar4; ri); aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro, fo, fs, log, boolvar4; ri); boolvar1 := true; inode := mkinode (inode.ino, inodenode(inodekey(m), md, false, m3, 0, n).meta, inodenode(inodekey(m), md, false, m3, 0, n).directory, inodenode(inodekey(m), md, false, m3, 0, n).nlink, inodenode(inodekey(m), md, false, m3, 0, n).nsubdirs, inodenode(inodekey(m), md, false, m3, 0, n).size); if boolvar1 then buf-opt := some(nd2.data)}] ( ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨p_inode := mkinode(m, md, false, m3, 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ err = err1))

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ node-cons(key0, datanode(key1, buf)) ↔ key0.data?; (s)% ⊦ datanode(key, buf).key = key; (s)% ⊦ datanode(key, buf).data:= buf0 = datanode(key, buf0); (s)% ⊦ datanode(key, buf).data?; (s)