[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 15 from proof refine-iget (previous step)

orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(ino) ∈ ri, asynced → boolvar1 ⊦ [aubifs_core_index_lookup#(inodekey(ino), ri, fi, orphans(fs, ri), fo, fs, log, boolvar1; boolvar, nd; err); inode := p_inode; if err = ESUCCESS ∧ boolvar then inode := mkinode(ino, nd.meta, nd.directory, nd.nlink, (nd.directory ⊃ nd.nsubdirs;0), nd.size)] ⟨afs_iget#(ino, abs-dirs(fs, ri), abs-files(fs, ri), asynced; p_inode, err0)⟩ ((asynced → boolvar1) ∧ inode = p_inode ∧ err = err0)

User applied rule call right

And obtained the following new goals

Proof step 16:
boolvar0 ↔ boolvar1, key = inodekey(ino), ro = orphans(fs, ri), fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(ino) ∈ ri, asynced → boolvar1 ⊦ [if ri-cons(ri, fs) then {fail_or_success#(; ; err); if err = ESUCCESS then {boolvar := key ∈ ri; if boolvar then nd := fs[ri[key]] else nd := ?} else boolvar := ?, nd := ?} else abort; inode := p_inode; if err = ESUCCESS ∧ boolvar then inode := mkinode(ino, nd.meta, nd.directory, nd.nlink, (nd.directory ⊃ nd.nsubdirs;0), nd.size)] ⟨afs_iget#(ino, abs-dirs(fs, ri), abs-files(fs, ri), asynced; p_inode, err0)⟩ ((asynced → boolvar1) ∧ inode = p_inode ∧ err = err0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_lookup# (KEY, RI, FI, RO, FO, FS, LOG, CSYNCED; EXISTS, ND; ERR) {if ri-cons(RI, FS) then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then {EXISTS := KEY ∈ RI; if EXISTS then ND := FS[RI[KEY]] else ND := ?} else EXISTS := ?, ND := ?} else abort };