| ⊦ ( ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid) ∧ ( listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs) ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps) ∧ gstepf(gs, ls, D4, a).orl ≠ [] ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl ∧ rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp) ∧ dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp ∧ ( gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs)) ∧ ( gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp ∧ lstepf(gs, ls, D4, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns) |
gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D4, a) = D5, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, ls.rvref ∈ gs.prvHp, gs.phead ∈ gs.orl, ¬ dups(gs.orl + 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), 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 ⊦ gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid) ∧ ( listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs) ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps) ∧ gstepf(gs, ls, D4, a).orl ≠ [] ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl ∧ rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp) ∧ dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp ∧ ( gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs)) ∧ ( gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp ∧ lstepf(gs, ls, D4, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns)
| gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D4, a) = D5, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, ls.rvref ∈ gs.prvHp, gs.phead ∈ gs.orl, ¬ dups(gs.orl + 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), 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 ⊦ gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid) ∧ ( listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs) ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps) ∧ gstepf(gs, ls, D4, a).orl ≠ [] ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl ∧ rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp) ∧ dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp ∧ ( gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs)) ∧ ( gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp ∧ lstepf(gs, ls, D4, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns) |
gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.rvref ∈ gs.prvHp, ls.rvref ∈ gs.vrvHp, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(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), 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.qrl.last].next = null ⊦ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs(ls.tid; ls.rvref)) ∧ rvownerok(gs.pretRefs(ls.tid; ls.rvref), gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs(ls.tid; ls.rvref), gs.prvHp)
Used simplifier rules: ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ gstepf(gs, ls, D4, τ) = gs.pretRefs:= gs.pretRefs(ls.tid; gs.vretRefs(ls.tid)); (s) ⊦ lstepf(gs, ls, D4, τ) = ls; (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) 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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D4, a) = D5; (s)
| gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.rvref ∈ gs.prvHp, ls.rvref ∈ gs.vrvHp, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(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), 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.qrl.last].next = null ⊦ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs(ls.tid; ls.rvref)) ∧ rvownerok(gs.pretRefs(ls.tid; ls.rvref), gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs(ls.tid; ls.rvref), gs.prvHp) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, ls.rvref ∈ vrvHp, ls.rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(ls.tid; ls.rvref)) ∧ rvownerok(pretRefs(ls.tid; ls.rvref), prvHp, rvowns) ∧ allocrv(pretRefs(ls.tid; ls.rvref), prvHp)
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, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, ls.rvref ∈ vrvHp, ls.rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(ls.tid; ls.rvref)) ∧ rvownerok(pretRefs(ls.tid; ls.rvref), prvHp, rvowns) ∧ allocrv(pretRefs(ls.tid; ls.rvref), prvHp) |
dom vrvHp = dom prvHp, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.rvref ∈ prvHp, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(ls.tid; ls.rvref)) ∧ rvownerok(pretRefs(ls.tid; ls.rvref), prvHp, rvowns) ∧ allocrv(pretRefs(ls.tid; ls.rvref), prvHp)
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
| dom vrvHp = dom prvHp, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.rvref ∈ prvHp, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(ls.tid; ls.rvref)) ∧ rvownerok(pretRefs(ls.tid; ls.rvref), prvHp, rvowns) ∧ allocrv(pretRefs(ls.tid; ls.rvref), prvHp) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), rvowns(rvref) = Pending(tid), vretRefs(tid) = rvref, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(tid; rvref)) ∧ rvownerok(pretRefs(tid; rvref), prvHp, rvowns) ∧ allocrv(pretRefs(tid; rvref), prvHp)
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
| dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), rvowns(rvref) = Pending(tid), vretRefs(tid) = rvref, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(tid; rvref)) ∧ rvownerok(pretRefs(tid; rvref), prvHp, rvowns) ∧ allocrv(pretRefs(tid; rvref), prvHp) |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(tid; vretRefs(tid))) ∧ rvownerok(pretRefs(tid; vretRefs(tid)), prvHp, rvowns) ∧ allocrv(pretRefs(tid; vretRefs(tid)), prvHp)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(tid; vretRefs(tid))) ∧ rvownerok(pretRefs(tid; vretRefs(tid)), prvHp, rvowns) ∧ allocrv(pretRefs(tid; vretRefs(tid)), prvHp) |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(tid; vretRefs(tid))), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvownerok(pretRefs(tid; vretRefs(tid)), prvHp, rvowns), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ allocrv(pretRefs(tid; vretRefs(tid)), prvHp), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs(tid; vretRefs(tid))), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
(tid = vs[r].deqID.tid ⊃ vretRefs(vs[r].deqID.tid);pretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, orl ≠ [], pretRefs(vs[r].deqID.tid) ≠ null, r ≠ orl.head, vretRefs(tid) ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)
| (tid = vs[r].deqID.tid ⊃ vretRefs(vs[r].deqID.tid);pretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, orl ≠ [], pretRefs(vs[r].deqID.tid) ≠ null, r ≠ orl.head, vretRefs(tid) ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦ |
(tid = vs[r].deqID.tid ⊃ vretRefs(vs[r].deqID.tid);pretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, orl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, orl ≠ [], pretRefs(vs[r].deqID.tid) ≠ null, r ≠ vtail0, vretRefs(tid) ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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 ∈ orl ∨ r ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| (tid = vs[r].deqID.tid ⊃ vretRefs(vs[r].deqID.tid);pretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, orl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, orl ≠ [], pretRefs(vs[r].deqID.tid) ≠ null, r ≠ vtail0, vretRefs(tid) ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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 ∈ orl ∨ r ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
(tid = vs[r].deqID.tid ⊃ vretRefs(vs[r].deqID.tid);pretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, pretRefs(vs[r].deqID.tid) ≠ null, r ≠ vtail0, vretRefs(tid) ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (vtail0 ' + qrl0) + qrl, vhead, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, 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 = vtail0 ∨ phead ∈ qrl0, (vtail0 ' + qrl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ (vtail0 ' + qrl0.butlast).last = vhead ∧ phead ≠ qrl0.last ∧ unmarkedp(qrl, vs), vtail = ((vtail0 ' + qrl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail0 ' + qrl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ qrl0 ∨ r ∈ qrl ⊦
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] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s)
| (tid = vs[r].deqID.tid ⊃ vretRefs(vs[r].deqID.tid);pretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), vs[r].deqID ≠ None, pretRefs(vs[r].deqID.tid) ≠ null, r ≠ vtail0, vretRefs(tid) ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), noid(tid, (vtail0 ' + qrl0) + qrl, vhead, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, 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 = vtail0 ∨ phead ∈ qrl0, (vtail0 ' + qrl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ (vtail0 ' + qrl0.butlast).last = vhead ∧ phead ≠ qrl0.last ∧ unmarkedp(qrl, vs), vtail = ((vtail0 ' + qrl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail0 ' + qrl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ qrl0 ∨ r ∈ qrl ⊦ |
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvownerok(pretRefs(tid; vretRefs(tid)), prvHp, rvowns), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. (vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid))
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ∃ tid0. ¬ ( (pretRefs(tid0) ≠ null → pretRefs(tid0) ∈ prvHp ∧ rvowns(pretRefs(tid0)).tid = tid0) → pretRefs(tid; vretRefs(tid))(tid0) ≠ null → pretRefs(tid; vretRefs(tid))(tid0) ∈ prvHp ∧ rvowns(pretRefs(tid; vretRefs(tid))(tid0)).tid = tid0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: prvHp, rvowns, pretRefs, rvowns, prvHp, pretRefs(tid; vretRefs(tid))
| ⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. (vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)) |
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ∃ tid0. ¬ ( (pretRefs(tid0) ≠ null → pretRefs(tid0) ∈ prvHp ∧ rvowns(pretRefs(tid0)).tid = tid0) → pretRefs(tid; vretRefs(tid))(tid0) ≠ null → pretRefs(tid; vretRefs(tid))(tid0) ∈ prvHp ∧ rvowns(pretRefs(tid; vretRefs(tid))(tid0)).tid = tid0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pretRefs(tid0) ≠ null → pretRefs(tid0) ∈ prvHp ∧ rvowns(pretRefs(tid0)).tid = tid0, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ∈ prvHp ∧ rvowns((tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0))).tid = tid0
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pretRefs(tid0) ≠ null → pretRefs(tid0) ∈ prvHp ∧ rvowns(pretRefs(tid0)).tid = tid0, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ∈ prvHp ∧ rvowns((tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0))).tid = tid0 |
Used simplifier rules: ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ Pending(tid).tid = tid; (s)
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ allocrv(pretRefs(tid; vretRefs(tid)), prvHp), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null))
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ∃ tid0. ¬ ( pretRefs(tid0) = null ∨ pretRefs(tid0) ∈ prvHp ∧ pretRefs(tid0) ≠ null → pretRefs(tid; vretRefs(tid))(tid0) = null ∨ pretRefs(tid; vretRefs(tid))(tid0) ∈ prvHp ∧ pretRefs(tid; vretRefs(tid))(tid0) ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: pretRefs, prvHp, pretRefs(tid; vretRefs(tid)), prvHp
| ⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null)) |
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ∃ tid0. ¬ ( pretRefs(tid0) = null ∨ pretRefs(tid0) ∈ prvHp ∧ pretRefs(tid0) ≠ null → pretRefs(tid; vretRefs(tid))(tid0) = null ∨ pretRefs(tid; vretRefs(tid))(tid0) ∈ prvHp ∧ pretRefs(tid; vretRefs(tid))(tid0) ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ∈ prvHp, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid0) = null ∨ pretRefs(tid0) ∈ prvHp ⊦
| dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ≠ null, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (tid = tid0 ⊃ vretRefs(tid0);pretRefs(tid0)) ∈ prvHp, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), pretRefs(tid0) = null ∨ pretRefs(tid0) ∈ prvHp ⊦ |
Used simplifier rules: ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss)
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.