Proof step 279 from proof inv-truncate-buff-none-cached (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 280:

  # buf0 = VFS_PAGE_SIZE, files0[m] = mkfile(m1, md1, # links(m, dirs), content0), pcache[datakey(m, m2 / VFS_PAGE_SIZE)] = mkpentry(boolvar, buf0), err = ESUCCESS, afs-cons(dirs, files0[m, mkfile(n, md, # links(m, dirs), content0 upto min(n, m2))]), afs-cons(dirs, files0), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache, dirs, files0), synced(dirs, icache, pcache), m ∈ files0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ pcache, asynced2 → synced(files0, icache, pcache) ⊦ ⟪icache_set#(mkinode(m, md, false, # links(m, dirs), 0, n), false; err, icache); pcache_truncate# ((m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, (m ∈ files0 ⊃ mkfile(n, md, # links(m, dirs), content0 upto min(n, m2));files0[m]).meta, false, (m ∈ files0 ⊃ mkfile(n, md, # links(m, dirs), content0 upto min(n, m2));files0[m]).nlink, 0, (m ∈ files0 ⊃ mkfile(n, md, # links(m, dirs), content0 upto min(n, m2));files0[m]).size) ) .ino, m2, n ; err, pcache); inode := mkinode(m, md, false, # links(m, dirs), 0, n); ino := m; files := files0[m, mkfile(m1, md1, # links(m, dirs), content0 upto min(n, m2))]; asynced4 := false; if asynced4 then pcache_set# ((m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, (m = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m]).meta, false, (m = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m]).nlink, 0, (m = ino ∧ ino ∈ files ⊃ (files[ino].size:= inode.size).meta:= inode.meta;files[m]).size) ) .ino, m2 / VFS_PAGE_SIZE, some(buf0).buf, false ; err, pcache); if ¬ asynced4 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ( icache-cons(icache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ dcache-cons(dcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ pcache-cons(pcache, dirs, files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta]) ∧ synced(dirs, icache, pcache) ∧ (asynced2 → synced(files[ino, (ino ∈ files ⊃ files[ino].size:= inode.size;files[ino]).meta:= inode.meta], icache, pcache))), m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0

Rule argument

Additional information

Used simplifier rules: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)% ⊦ mkfile(m, md, m0, content).meta:= md0 = mkfile(m, md0, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkfile(m, md, m0, content).size:= m1 = mkfile(m1, md, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)