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

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

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information