[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 105 from proof replayone-prog (previous step)

boolvar ↔ boolvar0, fs[adr] = datanode(datakey(ino, n), buf), adr ∈ fs, ¬ adr ∈ ri ⊦ ⟪aubifs_core_index_contains#(inodekey(ino), ri, fi, ro, fo, fs, log, boolvar0; boolvar; err); ri0 := ri; nd := fs[adr]; if err = ESUCCESS ∧ boolvar then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri); if nd.trunc? then aubifs_core_index_truncate#(nd.key, nd.size, fi, ro, fo, fs, log, boolvar0; ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0)))

User applied rule call right

And obtained the following new goals

Proof step 106:
boolvar ↔ boolvar0, fs[adr] = datanode(datakey(ino, n), buf), key = inodekey(ino), adr ∈ fs ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then boolvar := key ∈ ri else boolvar := ?; ri0 := ri; nd := fs[adr]; if err = ESUCCESS ∧ boolvar then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri); if nd.trunc? then aubifs_core_index_truncate#(nd.key, nd.size, fi, ro, fo, fs, log, boolvar0; ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0))), adr ∈ ri

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_contains# (KEY, RI, FI, RO, FO, FS, LOG, CSYNCED; EXISTS; ERR) {fail_or_success#(; ; ERR); if ERR = ESUCCESS then EXISTS := KEY ∈ RI else EXISTS := ? };