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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 230:

  # buf0 = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, icache[m3, mkientry(false, mkinode(m3, md, false, # links(m3, dirs), 0, m))][ino] = mkientry(boolvar1, mkinode(m0, md0, boolvar0, m4, m5, m6)), files0[m3] = mkfile(m1, md1, # links(m3, dirs), content0), pcache0[datakey(m3, m2 / VFS_PAGE_SIZE)] = mkpentry(boolvar, buf0), afs-cons(dirs, files0), afs-cons(dirs, files0[m3, mkfile(m, md, # links(m3, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)]), icache-cons(icache, dirs, files0), synced(dirs, icache, pcache0), m3 ∈ files0, datakey(m3, m2 / VFS_PAGE_SIZE) ∈ pcache0, ino ∈ icache[m3, mkientry(false, mkinode(m3, md, false, # links(m3, dirs), 0, m))], m2 ≤ m, asynced2 → synced(files0, icache, pcache0), ∀ key. key ∈ pcache0 → key.data? ⊦ m2 % VFS_PAGE_SIZE = 0, m0 = ino ∧ (boolvar1 ⊃ ino ∈ files0 ∧ m4 = (ino = m3 ⊃ mkfile(m, md, # links(m3, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .nlink ∧ m5 = 0 ∧ ¬ boolvar0 ; (ino ∈ dirs ∨ ino ∈ files0) ∧ mkinode(ino, md0, boolvar0, m4, m5, m6) = (ino ∈ dirs ⊃ mkinode(ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, (ino = m3 ⊃ mkfile(m, md, # links(m3, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .meta, false, (ino = m3 ⊃ mkfile(m, md, # links(m3, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .nlink, 0, (ino = m3 ⊃ mkfile(m, md, # links(m3, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf0, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2) ;files0[ino] ) .size) ) )

Rule argument

Additional information