| ⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) |
gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.node ≠ null, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ ls.success, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ gs0.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps)
| gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.node ≠ null, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ ls.success, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ gs0.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) |
gs.orl + rl0 = gs0.orl, gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(gs.qrl, gs.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ gs0.owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ oneowns(tid, r, owns, vs, ps) ∧ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ∧ ownsRely(tid, owns, owns0) → oneowns(tid, r, owns0, vs0, ps0); (ss) ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ∧ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0); (ss) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| gs.orl + rl0 = gs0.orl, gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs0.orl ≠ [], gs.orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(gs.qrl, gs.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, ls.node ∈ gs.vs, ls.node ∈ gs.ps, gs.phead ∈ gs.orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ gs0.owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) |
gs.orl + gs.qrl + rl = orl + qrl, gs.orl + rl0 = orl, gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom vrvHp = dom prvHp, gs0 = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.node ≠ null, gs.orl ≠ [], orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, vs, ps, owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, vs, ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(orl + qrl, vs, ps, owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, vhead, vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, orl + qrl, vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, owns), prvHpRely(gs.vrvHp, gs.prvHp, prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(ls.tid, gs.rvowns, rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, vretRefs, vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(qrl, ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, phead ∈ ps, phead ∈ vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, phead ∈ orl, vtail ∈ orl + qrl from gs.vtail, phead ∈ orl + qrl from gs.phead, vhead ∈ orl + qrl from gs.vhead, dom gs.prvHp ⊆ dom prvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), gs.pretRefs(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid) ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ orl ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, orl + qrl, vhead, vs)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs0, owns, rvowns, orl, prvHp, pretRefs, vs
| gs.orl + gs.qrl + rl = orl + qrl, gs.orl + rl0 = orl, gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom vrvHp = dom prvHp, gs0 = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.node ≠ null, gs.orl ≠ [], orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, vs, ps, owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, vs, ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(orl + qrl, vs, ps, owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, vhead, vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, orl + qrl, vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, owns), prvHpRely(gs.vrvHp, gs.prvHp, prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(ls.tid, gs.rvowns, rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, vretRefs, vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(qrl, ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, phead ∈ ps, phead ∈ vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, phead ∈ orl, vtail ∈ orl + qrl from gs.vtail, phead ∈ orl + qrl from gs.phead, vhead ∈ orl + qrl from gs.vhead, dom gs.prvHp ⊆ dom prvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), gs.pretRefs(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid) ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ orl ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, orl + qrl, vhead, vs) |
gs.qrl + rl = rl0 + qrl, gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom vrvHp = dom prvHp, gs.orl + rl0 ≠ [], ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, vs, ps, owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, vs, ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp((gs.orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(gs.orl, ps), markedp(rl0, vs), markedp(gs.orl, vs), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, vhead, vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, (gs.orl + rl0) + qrl, vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs((gs.orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, owns), prvHpRely(gs.vrvHp, gs.prvHp, prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(ls.tid, gs.rvowns, rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, vretRefs, vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(qrl, ps), gs.phead ∈ ps, gs.phead ∈ vs, gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, phead ∈ ps, phead ∈ vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, vtail ∈ (gs.orl + rl0) + qrl from gs.vtail, vhead ∈ (gs.orl + rl0) + qrl from gs.vhead, dom gs.prvHp ⊆ dom prvHp, ¬ ls.success, ¬ dups(gs.orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups((gs.orl + rl0) + qrl), ¬ dups(rl0), ¬ dups(qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ gs.orl ∨ phead ∈ rl0, phead ∈ gs.orl from gs.phead ∨ phead ∈ rl0 ∨ phead ∈ qrl, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, vtail = ((gs.orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((gs.orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), (gs.orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (gs.orl + rl0).butlast ≠ [] ∧ (gs.orl + rl0).butlast.last = vhead ∧ phead ≠ (gs.orl + rl0).last ∧ unmarkedp(qrl, vs), gs.pretRefs(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid) ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ rl0 ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, (gs.orl + rl0) + qrl, vhead, vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)
| gs.qrl + rl = rl0 + qrl, gs.owns(ls.node) = Some(ls.tid), gs.vretRefs(ls.tid) = vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom vrvHp = dom prvHp, gs.orl + rl0 ≠ [], ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, vs, ps, owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, vs, ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp((gs.orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(gs.orl, ps), markedp(rl0, vs), markedp(gs.orl, vs), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, vhead, vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, (gs.orl + rl0) + qrl, vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs((gs.orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), ownsRely(ls.tid, gs.owns, owns), prvHpRely(gs.vrvHp, gs.prvHp, prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(ls.tid, gs.rvowns, rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, vretRefs, vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(qrl, ps), gs.phead ∈ ps, gs.phead ∈ vs, gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, phead ∈ ps, phead ∈ vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, vtail ∈ (gs.orl + rl0) + qrl from gs.vtail, vhead ∈ (gs.orl + rl0) + qrl from gs.vhead, dom gs.prvHp ⊆ dom prvHp, ¬ ls.success, ¬ dups(gs.orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups((gs.orl + rl0) + qrl), ¬ dups(rl0), ¬ dups(qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ gs.orl ∨ phead ∈ rl0, phead ∈ gs.orl from gs.phead ∨ phead ∈ rl0 ∨ phead ∈ qrl, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, vtail = ((gs.orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((gs.orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), (gs.orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (gs.orl + rl0).butlast ≠ [] ∧ (gs.orl + rl0).butlast.last = vhead ∧ phead ≠ (gs.orl + rl0).last ∧ unmarkedp(qrl, vs), gs.pretRefs(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid) ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ rl0 ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, (gs.orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, gs = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl, owns0, rvowns0), owns0(ls.node) = Some(ls.tid), vretRefs0(ls.tid) = vretRefs(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalowns(vs0, ps0, owns0, ls.tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(ls.tid, vhead0, vs0), nextnottidRely(ls.tid, vhead0, vs0, vhead, vs), noid(ls.tid, orl + qrl0, vhead0, vs0), noidRely(ls.tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(ls.tid, ls.node, owns0, vs0, ps0), ownsRely(ls.tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(ls.tid, rvowns0, rvowns, vrvHp0), rvrely(ls.tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, ls.node ∈ vs0, ls.node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ ls.success, ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(rl0), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), pretRefs0(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0 ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ rl0 ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, (orl + rl0) + qrl, vhead, vs)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs, owns0, rvowns0, orl, prvHp0, pretRefs0, vs0
| qrl0 + rl = rl0 + qrl, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, gs = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl, owns0, rvowns0), owns0(ls.node) = Some(ls.tid), vretRefs0(ls.tid) = vretRefs(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalowns(vs0, ps0, owns0, ls.tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(ls.tid, vhead0, vs0), nextnottidRely(ls.tid, vhead0, vs0, vhead, vs), noid(ls.tid, orl + qrl0, vhead0, vs0), noidRely(ls.tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(ls.tid, ls.node, owns0, vs0, ps0), ownsRely(ls.tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(ls.tid, rvowns0, rvowns, vrvHp0), rvrely(ls.tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, ls.node ∈ vs0, ls.node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ ls.success, ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(rl0), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), pretRefs0(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0 ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ rl0 ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ls.node) = Some(ls.tid), vretRefs0(ls.tid) = vretRefs(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(vs0, ps0, owns0, ls.tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(ls.tid, vhead0, vs0), nextnottidRely(ls.tid, vhead0, vs0, vhead, vs), noid(ls.tid, orl + qrl0, vhead0, vs0), noidRely(ls.tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns0, vs0, ps0), ownsRely(ls.tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(ls.tid, rvowns0, rvowns, vrvHp0), rvrely(ls.tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl, ls.node ∈ ps0, ls.node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ ls.success, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid) ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ rl0 ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, (orl + rl0) + qrl, vhead, vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| qrl0 + rl = rl0 + qrl, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(ls.node) = Some(ls.tid), vretRefs0(ls.tid) = vretRefs(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(vs0, ps0, owns0, ls.tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(ls.tid, vhead0, vs0), nextnottidRely(ls.tid, vhead0, vs0, vhead, vs), noid(ls.tid, orl + qrl0, vhead0, vs0), noidRely(ls.tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns0, vs0, ps0), ownsRely(ls.tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(ls.tid, rvowns0, rvowns, vrvHp0), rvrely(ls.tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl, ls.node ∈ ps0, ls.node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ ls.success, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(ls.tid) = pretRefs(ls.tid) ∨ vretRefs(ls.tid) = pretRefs(ls.tid) ⊦ owns(ls.node) = Some(ls.tid) ∧ ls.node ∈ ps ∧ ls.node ∈ vs ∧ ¬ ls.node ∈ rl0 ∧ ¬ ls.node ∈ qrl ∧ noid(ls.tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns0(node) = Some(tid), ¬ success, vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalowns(vs0, ps0, owns0, tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0 ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| qrl0 + rl = rl0 + qrl, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), owns0(node) = Some(tid), ¬ success, vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalowns(vs0, ps0, owns0, tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0 ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(vs0, ps0, owns0, tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs)
| qrl0 + rl = rl0 + qrl, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalowns(vs0, ps0, owns0, tid, vs, ps, owns), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs) |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
qrl0 + rl = rl0 + qrl, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0 ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs)
Used terms: ps0, ps, tid, owns0, vs, owns, vs0
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| qrl0 + rl = rl0 + qrl, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0 ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node ∈ vs0 ∧ node ∈ ps0 ∧ (owns0(node) = Some(tid) ∨ owns0(node) = Weak(tid) ∧ owns(node) ≠ None) → node ∈ vs ∧ node ∈ ps ∧ vs[node] = vs0[node] ∧ (ps[node].next = ps0[node].next ∨ ps[node].next = vs0[node].next) ∧ (ps[node].val = ps0[node].val ∨ ps[node].val = vs0[node].val) ∧ (ps[node].deqID = ps0[node].deqID ∨ ps[node].deqID = vs0[node].deqID) ∧ owns(node) = owns0(node), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs)
Used terms: node
| qrl0 + rl = rl0 + qrl, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ node ∈ orl, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node ∈ vs0 ∧ node ∈ ps0 ∧ (owns0(node) = Some(tid) ∨ owns0(node) = Weak(tid) ∧ owns(node) ≠ None) → node ∈ vs ∧ node ∈ ps ∧ vs[node] = vs0[node] ∧ (ps[node].next = ps0[node].next ∨ ps[node].next = vs0[node].next) ∧ (ps[node].val = ps0[node].val ∨ ps[node].val = vs0[node].val) ∧ (ps[node].deqID = ps0[node].deqID ∨ ps[node].deqID = vs0[node].deqID) ∧ owns(node) = owns0(node), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ owns(node) = Some(tid) ∧ node ∈ ps ∧ node ∈ vs ∧ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = ps0[node].deqID ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = ps0[node].val ∨ ps[node].val = vs0[node].val, ps[node].next = ps0[node].next ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs)
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = ps0[node].deqID ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = ps0[node].val ∨ ps[node].val = vs0[node].val, ps[node].next = ps0[node].next ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs)
Used simplifier rules: ⊦ (val = nd.val ∧ opttid = nd.deqID) ∧ nxt = nd.next ↔ nd = mk(val, opttid, nxt); (elim) Used terms: ps0[node], val, opttid, nxt
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ ¬ node ∈ rl0 ∧ ¬ node ∈ qrl ∧ noid(tid, (orl + rl0) + qrl, vhead, vs) |
qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦
qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
| qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ |
orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead → noid(tid, orl + rl0 + qrl0, vhead0, vs0)
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ (orl.last = vhead0 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0) ∧ ((orl + rl0).last = vhead ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead) ∧ noidRely(tid, orl + qrl0, vs0, orl + rl0 + qrl, vs) ∧ orl ≠ [] ∧ noid(tid, orl + qrl0, vhead0, vs0) ∧ ¬ dups(orl + qrl0) ∧ ¬ dups(orl + rl0 + qrl) ∧ qrl0 + rl = rl0 + qrl ∧ vhead ∈ (orl + rl0) + qrl from vhead0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl0, rl, vhead0, vhead, tid, qrl, orl, vs, rl0, vs0
| orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead → noid(tid, orl + rl0 + qrl0, vhead0, vs0) |
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ (orl.last = vhead0 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0) ∧ ((orl + rl0).last = vhead ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead) ∧ noidRely(tid, orl + qrl0, vs0, orl + rl0 + qrl, vs) ∧ orl ≠ [] ∧ noid(tid, orl + qrl0, vhead0, vs0) ∧ ¬ dups(orl + qrl0) ∧ ¬ dups(orl + rl0 + qrl) ∧ qrl0 + rl = rl0 + qrl ∧ vhead ∈ (orl + rl0) + qrl from vhead0 |
qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ (orl.last = vhead0 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0) ∧ ((orl + rl0).last = vhead ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ (orl.last = vhead0 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0) ∧ ((orl + rl0).last = vhead ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead) |
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], orl.last ≠ vhead0, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], (orl + rl0).last ≠ vhead, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], orl.last ≠ vhead0, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 |
qrl0 + rl = rl0 + qrl, orl.butlast = [], vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], orl.last ≠ [].last, node ≠ null, orl ≠ orl.head ', orl ≠ [], phead0 ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, [].last, vs0), nextnottidRely(tid, [].last, vs0, vhead, vs), noid(tid, orl + qrl0, [].last, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from [].last, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[[].last].next ≠ null ∧ vs0[vs0[[].last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[[].last].next].deqID.tid)) = Claimed(vs0[vs0[[].last].next].deqID.tid, vs0[vs0[[].last].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| qrl0 + rl = rl0 + qrl, orl.butlast = [], vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], orl.last ≠ [].last, node ≠ null, orl ≠ orl.head ', orl ≠ [], phead0 ≠ orl.last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, [].last, vs0), nextnottidRely(tid, [].last, vs0, vhead, vs), noid(tid, orl + qrl0, [].last, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from [].last, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[[].last].next ≠ null ∧ vs0[vs0[[].last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[[].last].next].deqID.tid)) = Claimed(vs0[vs0[[].last].next].deqID.tid, vs0[vs0[[].last].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs) ⊦ |
Used simplifier rules: ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], (orl + rl0).last ≠ vhead, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ noid(tid, (orl + rl0) + qrl, vhead, vs), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead |
qrl0 + rl = rl0 + qrl, (orl + rl0).butlast = [], vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ orl.head ', orl + rl0 ≠ [], (orl + rl0).last ≠ [].last, node ≠ null, orl ≠ [], phead ≠ (orl + rl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, [].last, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, [].last ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl, [].last, vs), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[[].last].next ≠ null ∧ vs[vs[[].last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[[].last].next].deqID.tid)) = Claimed(vs[vs[[].last].next].deqID.tid, vs[vs[[].last].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)
| qrl0 + rl = rl0 + qrl, (orl + rl0).butlast = [], vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ orl.head ', orl + rl0 ≠ [], (orl + rl0).last ≠ [].last, node ≠ null, orl ≠ [], phead ≠ (orl + rl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, [].last, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, [].last ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(orl + qrl0), ¬ dups((orl + rl0) + qrl), ¬ dups(orl), ¬ dups(rl0 + qrl), ¬ dups(orl + rl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl, [].last, vs), ¬ node ∈ orl, ¬ node ∈ qrl0, vs[[].last].next ≠ null ∧ vs[vs[[].last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[[].last].next].deqID.tid)) = Claimed(vs[vs[[].last].next].deqID.tid, vs[vs[[].last].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ |
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp((orl + rl0) + qrl, vs, ps, owns) ∧ node ∈ (orl + rl0) + qrl → (∃ rl1, rl2. (orl + rl0) + qrl = rl1 + node ' + rl2 ∧ listp(node ' + rl2, vs, ps, owns)), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used terms: ps, (orl + rl0) + qrl, owns, node, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp((orl + rl0) + qrl, vs, ps, owns) ∧ node ∈ (orl + rl0) + qrl → (∃ rl1, rl2. (orl + rl0) + qrl = rl1 + node ' + rl2 ∧ listp(node ' + rl2, vs, ps, owns)), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node ∈ rl0 ∨ node ∈ qrl → (orl + rl0) + qrl = rl1 + node ' + rl2 ∧ listp(node ' + rl2, vs, ps, owns), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| qrl0 + rl = rl0 + qrl, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node ∈ rl0 ∨ node ∈ qrl → (orl + rl0) + qrl = rl1 + node ' + rl2 ∧ listp(node ' + rl2, vs, ps, owns), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, node ∈ rl0 ∨ node ∈ qrl → (orl + rl0) + qrl = rl1 + node ' + rl2 ∧ listp(node ' + rl2, vs, ps, owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used formulas: node ∈ rl0 ∨ node ∈ qrl
| qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp((orl + rl0) + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ (orl + rl0) + qrl from vhead0, vtail ∈ (orl + rl0) + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, node ∈ rl0 ∨ node ∈ qrl → (orl + rl0) + qrl = rl1 + node ' + rl2 ∧ listp(node ' + rl2, vs, ps, owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
qrl0 + rl = rl0 + qrl, (orl + rl0) + qrl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
| qrl0 + rl = rl0 + qrl, (orl + rl0) + qrl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp((orl + rl0) + qrl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, (orl + rl0) + qrl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((orl + rl0) + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ (orl + rl0) + qrl from vtail0, vhead ∈ (orl + rl0) + qrl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((orl + rl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
⊦ (x + y) + z = x + y + z
orl + rl0 + qrl = rl1 + node ' + rl2, qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + rl0 + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + rl0 + qrl, vs), nonullRetRefs(orl + rl0 + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + rl0 + qrl from vhead0, vtail ∈ orl + rl0 + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups(orl + rl0 + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + rl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used terms: orl, rl0, qrl
| ⊦ (x + y) + z = x + y + z |
| orl + rl0 + qrl = rl1 + node ' + rl2, qrl0 + rl = rl0 + qrl, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + rl0 + qrl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + rl0 + qrl, vs), nonullRetRefs(orl + rl0 + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + rl0 + qrl from vhead0, vtail ∈ orl + rl0 + qrl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl), ¬ dups(orl), ¬ dups(orl + rl0 + qrl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + rl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(qrl0 + rl), ¬ dups(orl), ¬ dups(orl + qrl0 + rl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
| orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(qrl0 + rl), ¬ dups(orl), ¬ dups(orl + qrl0 + rl), ¬ dups(orl + qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
orl + qrl0 + rl = rl1 + node ' + rl2, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + qrl0 + rl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + qrl0 + rl from vhead0, vtail ∈ orl + qrl0 + rl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist]
| orl + qrl0 + rl = rl1 + node ' + rl2, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + qrl0 + rl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + qrl0 + rl from vhead0, vtail ∈ orl + qrl0 + rl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, node ∈ orl + qrl0 + rl, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used simplifier rules: ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: node ∈ orl + qrl0 + rl
| orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, node ∈ orl + qrl0 + rl, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y
orl + qrl0 + rl = rl1 + node ' + rl2, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + qrl0 + rl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + qrl0 + rl from vhead0, vtail ∈ orl + qrl0 + rl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl, node ∈ orl ∨ node ∈ qrl0 + rl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used terms: node, orl, qrl0 + rl
| ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y |
| orl + qrl0 + rl = rl1 + node ' + rl2, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + qrl0 + rl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + qrl0 + rl from vhead0, vtail ∈ orl + qrl0 + rl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl, node ∈ orl ∨ node ∈ qrl0 + rl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y
orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ orl ∨ node ∈ qrl0 ∨ node ∈ rl, node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used terms: node, qrl0, rl
| ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y |
| orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ orl ∨ node ∈ qrl0 ∨ node ∈ rl, node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
orl + qrl0 + rl = rl1 + node ' + rl2, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + qrl0 + rl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + qrl0 + rl from vhead0, vtail ∈ orl + qrl0 + rl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, node ∈ rl, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
| orl + qrl0 + rl = rl1 + node ' + rl2, vs[node] = vs0[node], ps0[node] = mk(invENQvalue, opttid, nxt), dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(node ' + rl2, vs, ps, owns), listp(orl + qrl0 + rl, vs, ps, owns), listp(orl + qrl0, vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), markedp(orl, vs), markedp(rl0, vs), markedp(orl, ps), markedp(rl0, ps), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ orl + qrl0 + rl from vhead0, vtail ∈ orl + qrl0 + rl from vtail0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl, phead ∈ vs, phead ∈ ps, node ∈ vs, node ∈ ps, node ∈ rl, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, phead ∈ orl ∨ phead ∈ rl0, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, node ∈ rl0 ∨ node ∈ qrl ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ rl, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ
| orl + qrl0 + rl = rl1 + node ' + rl2, ps0[node] = mk(invENQvalue, opttid, nxt), vs[node] = vs0[node], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(node) = Some(tid), owns0(node) = Some(tid), vretRefs0(tid) = vretRefs(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), equalrl(orl + qrl0, vs0, ps0, vs, ps), listp(orl + qrl0, vs0, ps0, owns0), listp(orl + qrl0 + rl, vs, ps, owns), listp(node ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(orl, ps), markedp(rl0, vs), markedp(orl, vs), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), nextnottidRely(tid, vhead0, vs0, vhead, vs), noid(tid, orl + qrl0, vhead0, vs0), noidRely(tid, orl + qrl0, vs0, orl + qrl0 + rl, vs), nonullRetRefs(orl + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl0 + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns0, vs0, ps0), ownsRely(tid, owns0, owns), prvHpRely(vrvHp0, prvHp0, prvHp), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownsrely(tid, rvowns0, rvowns, vrvHp0), rvrely(tid, rvowns0, vretRefs0, vrvHp0, vretRefs, vrvHp), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), node ∈ rl, phead ∈ ps, phead ∈ vs, phead0 ∈ orl, node ∈ ps0, node ∈ vs0, vtail ∈ orl + qrl0 + rl from vtail0, vhead ∈ orl + qrl0 + rl from vhead0, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, node ∈ vs, node ∈ ps, dom prvHp0 ⊆ dom prvHp, ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + rl0), ¬ dups(orl + qrl0 + rl), ¬ dups(orl), ¬ dups(qrl0 + rl), ¬ dups(orl + qrl0), ¬ dups(rl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ vs0 ∧ r ∈ ps0 ∧ (owns0(r) = Some(tid) ∨ owns0(r) = Weak(tid) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps ∧ vs[r] = vs0[r] ∧ (ps[r].next = ps0[r].next ∨ ps[r].next = vs0[r].next) ∧ (ps[r].val = ps0[r].val ∨ ps[r].val = vs0[r].val) ∧ (ps[r].deqID = ps0[r].deqID ∨ ps[r].deqID = vs0[r].deqID) ∧ owns(r) = owns0(r), node ∈ rl0 ∨ node ∈ qrl, ps[node].deqID = opttid ∨ ps[node].deqID = vs0[node].deqID, ps[node].val = invENQvalue ∨ ps[node].val = vs0[node].val, ps[node].next = nxt ∨ ps[node].next = vs0[node].next, phead ∈ orl ∨ phead ∈ rl0, phead ∈ orl from phead0 ∨ phead ∈ rl0 ∨ phead ∈ qrl, vtail0 = (orl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl0 + rl).last ∨ qrl ≠ [] ∧ vtail = ((orl + rl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ∧ unmarkedp(qrl0, vs0), (orl + rl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead ∧ phead ≠ (orl + rl0).last ∧ unmarkedp(qrl, vs), pretRefs0(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid) ⊦ ¬ node ∈ qrl ∧ ¬ node ∈ rl0 |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist]
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.