[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 7 from proof crash-neutral-seek (previous step)

root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0) ⊦ pre-seek(fd, n, whence, EFAIL, user, root, fs, ofh) ∧ ⟨err0 := EFAIL; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in {if whence = SEEK_CUR then n := fh.pos + n else if whence = SEEK_END then n := # f.content + n; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)}⟩ posix-crash(root, fs, ofh, tree, fs0, ofh0), ∃ err. pre-seek(fd, n, whence, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in {if whence = SEEK_CUR then n := fh.pos + n else if whence = SEEK_END then n := # f.content + n; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)}⟩ posix-crash(root, fs, ofh, tree, fs0, ofh0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 8:
root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0) ⊦ ∃ err. pre-seek(fd, n, whence, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in {if whence = SEEK_CUR then n := fh.pos + n else if whence = SEEK_END then n := # f.content + n; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)}⟩ posix-crash(root, fs, ofh, tree, fs0, ofh0), ⟨err0 := EFAIL; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in {if whence = SEEK_CUR then n := fh.pos + n else if whence = SEEK_END then n := # f.content + n; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)}⟩ posix-crash(root, fs, ofh, tree, fs0, ofh0)

Rule argument

Additional information

Used simplifier rules: ⊦ pre-seek(fd, n, whence, EFAIL, user, root, fs, ofh); (s)