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

node-cons(fs[adr].key, fs[adr]), adr ∈ fs ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; ri0 := ri; if err = ESUCCESS then {if nd.inode? then if nd.nlink ≠ 0 ∨ nd.key.ino = ROOT_INO then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri) else {if ¬ nd.directory then aubifs_core_index_truncate#(nd.key, 0, fi, ro, fo, fs, log, boolvar0; ri); if err = ESUCCESS then aubifs_core_index_remove#(nd.key, fi, ro, fo, fs, log, boolvar0; ri)}; if nd.dentry? then if nd.ino ≠ 0 then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri) else aubifs_core_index_remove#(nd.key, fi, ro, fo, fs, log, boolvar0; ri); boolvar := boolvar0; if nd.data? then {let key = inodekey(nd.key.ino) in aubifs_core_index_contains#(key, ri, fi, ro, fo, fs, log, boolvar0; boolvar; err); 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

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information