[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 223 from proof fsync-pages-inv (previous step)

# buf = VFS_PAGE_SIZE, (key.ino = m ⊃ mkfile(m3, md, # links(key.ino, dirs), content1[n0, buf]);files1[key.ino]) = mkfile(m0, md1, m4, content0), pcache[key] = mkpentry(boolvar, buf0), files1[m] = mkfile(m3, md, # links(m, dirs), content1), files0[m] = mkfile(m1, md0, # links(m, dirs), content), pcache[datakey(m, n0)] = mkpentry(true, buf), n0 * VFS_PAGE_SIZE < m2, afs-cons(dirs, files1[m, mkfile(m3, md, # links(m, dirs), content1[n0, buf])]), afs-cons(dirs, files1), afs-cons(dirs, files0), synced(dirs, icache, pcache0), synced(dirs, icache, pcache), key ∈ pcache, m ∈ files0, m ∈ files1, datakey(m, n0) ∈ pcache, ⌊err0⌋ , ∀ key0. key0 ∈ pcache → key0.data? ∧ # pcache[key0].page = VFS_PAGE_SIZE ∧ key0.ino ∈ files1 ∧ (¬ pcache[key0].dirty → key0.part ∈ files1[key0.ino].content ∧ pcache[key0].page = files1[key0.ino].content[key0.part]), ∀ key0. key0 ∈ pcache0 → key0.data? ∧ # pcache0[key0].page = VFS_PAGE_SIZE ∧ key0.ino ∈ files0 ∧ (¬ pcache0[key0].dirty → key0.part ∈ files0[key0.ino].content ∧ pcache0[key0].page = files0[key0.ino].content[key0.part]) ⊦ key.data? ∧ # buf0 = VFS_PAGE_SIZE ∧ key.ino ∈ files1 ∧ (¬ boolvar → key.part ∈ content0 ∧ buf0 = content0[key.part])

Heuristic use patterns applied rule all left

And obtained the following new goals

Proof step 224:
# buf = VFS_PAGE_SIZE, (key.ino = m ⊃ mkfile(m3, md, # links(key.ino, dirs), content1[n0, buf]);files1[key.ino]) = mkfile(m0, md1, m4, content0), pcache[datakey(m, n0)] = mkpentry(true, buf), files0[m] = mkfile(m1, md0, # links(m, dirs), content), files1[m] = mkfile(m3, md, # links(m, dirs), content1), pcache[key] = mkpentry(boolvar, buf0), n0 * VFS_PAGE_SIZE < m2, afs-cons(dirs, files0), afs-cons(dirs, files1), afs-cons(dirs, files1[m, mkfile(m3, md, # links(m, dirs), content1[n0, buf])]), synced(dirs, icache, pcache), synced(dirs, icache, pcache0), datakey(m, n0) ∈ pcache, m ∈ files1, m ∈ files0, key ∈ pcache, ⌊err0⌋ , key ∈ pcache → key.data? ∧ # pcache[key].page = VFS_PAGE_SIZE ∧ key.ino ∈ files1 ∧ (¬ pcache[key].dirty → key.part ∈ files1[key.ino].content ∧ pcache[key].page = files1[key.ino].content[key.part]), ∀ key0. key0 ∈ pcache0 → key0.data? ∧ # pcache0[key0].page = VFS_PAGE_SIZE ∧ key0.ino ∈ files0 ∧ (¬ pcache0[key0].dirty → key0.part ∈ files0[key0.ino].content ∧ pcache0[key0].page = files0[key0.ino].content[key0.part]), ∀ key0. key0 ∈ pcache → key0.data? ∧ # pcache[key0].page = VFS_PAGE_SIZE ∧ key0.ino ∈ files1 ∧ (¬ pcache[key0].dirty → key0.part ∈ files1[key0.ino].content ∧ pcache[key0].page = files1[key0.ino].content[key0.part]) ⊦ key.data? ∧ # buf0 = VFS_PAGE_SIZE ∧ key.ino ∈ files1 ∧ (¬ boolvar → key.part ∈ content0 ∧ buf0 = content0[key.part])

Rule argument

pos: left 18 terms: key abort: T discard: F computed: F

Additional information

Used terms: key