[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 71 from proof inv-truncate-buff-some (previous step)

# buf-opt.buf = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, files0[m0] = mkfile(m1, md1, # links(m0, dirs), content0), err = ESUCCESS, ino = m0, n = m, pcache = truncate(ino, min(n, size), pcache0), size = m2, buf-opt.some?, afs-cons (dirs, files0[m0, mkfile(m, md, # links(m0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)]), afs-cons(dirs, files0), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache0, dirs, files0), synced(dirs, icache, pcache0), m0 ∈ files0, m2 ≤ m, asynced1 → synced(files0, icache, pcache0), ∀ key. key ∈ pcache0 → key.data? ⊦ ⟪ino := m0; files := files0[m0, mkfile(m1, md1, # links(m0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)]; pcache_set# ((m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode (m0, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size).meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ;files[m0] ) .meta, false, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size).meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ;files[m0] ) .nlink, 0, (m0 = ino ∧ ino ∈ files ⊃ (files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size).meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ;files[m0] ) .size) ) .ino, m2 / VFS_PAGE_SIZE, some(fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n0)).buf, false ; err, pcache); skip⟫ ( icache-cons (icache[m0, mkientry(false, mkinode(m0, md, false, # links(m0, dirs), 0, m))], dirs, files [ino, (ino ∈ files ⊃ files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[ino]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ]) ∧ dcache-cons (dcache, dirs, files [ino, (ino ∈ files ⊃ files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[ino]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ]) ∧ pcache-cons (pcache, dirs, files [ino, (ino ∈ files ⊃ files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[ino]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ]) ∧ synced(dirs, icache[m0, mkientry(false, mkinode(m0, md, false, # links(m0, dirs), 0, m))], pcache) ∧ ( asynced1 → synced (files [ino, (ino ∈ files ⊃ files[ino].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[ino]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ], icache[m0, mkientry(false, mkinode(m0, md, false, # links(m0, dirs), 0, m))], pcache))), m2 % VFS_PAGE_SIZE = 0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 72:
# buf-opt.buf = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, files0[m0] = mkfile(m1, md1, # links(m0, dirs), content0), err = ESUCCESS, ino = m0, n = m, pcache = truncate(ino, min(n, size), pcache0), size = m2, buf-opt.some?, afs-cons(dirs, files0), afs-cons (dirs, files0[m0, mkfile(m, md, # links(m0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)]), dcache-cons(dcache, dirs, files0), icache-cons(icache, dirs, files0), pcache-cons(pcache0, dirs, files0), synced(dirs, icache, pcache0), m0 ∈ files0, m2 ≤ m, asynced1 → synced(files0, icache, pcache0), ∀ key. key ∈ pcache0 → key.data? ⊦ ⟪files := files0[m0, mkfile(m1, md1, # links(m0, dirs), content0[m2 / VFS_PAGE_SIZE, fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)]; pcache_set# ((m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode (m0, (m0 = m0 ∧ m0 ∈ files ⊃ (files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size).meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ;files[m0] ) .meta, false, (m0 = m0 ∧ m0 ∈ files ⊃ (files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size).meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ;files[m0] ) .nlink, 0, (m0 = m0 ∧ m0 ∈ files ⊃ (files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size).meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ;files[m0] ) .size) ) .ino, m2 / VFS_PAGE_SIZE, some(fill(buf-opt.buf, zero, m2 % VFS_PAGE_SIZE, n0)).buf, false ; err, pcache); skip⟫ ( icache-cons (icache[m0, mkientry(false, mkinode(m0, md, false, # links(m0, dirs), 0, m))], dirs, files [m0, (m0 ∈ files ⊃ files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[m0]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ]) ∧ dcache-cons (dcache, dirs, files [m0, (m0 ∈ files ⊃ files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[m0]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ]) ∧ pcache-cons (pcache, dirs, files [m0, (m0 ∈ files ⊃ files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[m0]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ]) ∧ synced(dirs, icache[m0, mkientry(false, mkinode(m0, md, false, # links(m0, dirs), 0, m))], pcache) ∧ ( asynced1 → synced (files [m0, (m0 ∈ files ⊃ files[m0].size:= mkinode(m0, md, false, # links(m0, dirs), 0, m).size;files[m0]) .meta:= mkinode(m0, md, false, # links(m0, dirs), 0, m).meta ], icache[m0, mkientry(false, mkinode(m0, md, false, # links(m0, dirs), 0, m))], pcache))), m2 % VFS_PAGE_SIZE = 0

Proof step 71 from proof inv-truncate-buff-some (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information