| ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( 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)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D16 → ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next ∧ lstepf(gs, ls, D12, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns) |
gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D12, a) = D16, 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, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D12, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next, 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 ⊦ ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next ∧ lstepf(gs, ls, D12, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns)
| gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D12, a) = D16, 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, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D12, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next, 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 ⊦ ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next ∧ lstepf(gs, ls, D12, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns) |
ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.nxt ≠ null, 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, ls.first, 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), ls.rvref ∈ gs.vrvHp, gs.vhead ∈ gs.orl from ls.first, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), 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), ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.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, 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) ⊦
Used simplifier rules: ⊦ gstepf(gs, ls, D12, τ) = gs; (s) ⊦ lstepf(gs, ls, D12, τ) = ls; (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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ D13 ≠ D16; (s) ⊦ pcstepf(gs, ls, D12, a) = (ls.nxt = null ⊃ D13;D16); (s)
| ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.nxt ≠ null, 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, ls.first, 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), ls.rvref ∈ gs.vrvHp, gs.vhead ∈ gs.orl from ls.first, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), 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), ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.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, 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) ⊦ |
ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, 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, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, ls.first ∈ ps, phead ∈ vs, ls.first ∈ vs, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(ls.tid, orl + qrl, vhead, vs), 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, ls.lst ∈ orl ∨ ls.lst ∈ qrl ⊦
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
| ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, 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, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, ls.first ∈ ps, phead ∈ vs, ls.first ∈ vs, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(ls.tid, orl + qrl, vhead, vs), 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, ls.lst ∈ orl ∨ ls.lst ∈ qrl ⊦ |
ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, 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, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(ls.tid, orl + qrl, vhead, vs), 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), ls.lst ∈ orl ∨ ls.lst ∈ 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: 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
| ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, 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, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(ls.tid, orl + qrl, vhead, vs), 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), ls.lst ∈ orl ∨ ls.lst ∈ 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) ⊦ |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = vs[lst].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, nxt ≠ null, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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, lst ∈ orl ∨ lst ∈ qrl ⊦
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), nxt = vs[lst].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, nxt ≠ null, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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, lst ∈ orl ∨ lst ∈ qrl ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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), lst ∈ orl ∨ lst ∈ 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: a: ⊦ (x + y) + z = x + y + z; from specification list[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, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, 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, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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), lst ∈ orl ∨ lst ∈ 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) ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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), ∀ r0. r0 ≠ first ∧ r0 ∈ orl + qrl from first → vs[r0].deqID ≠ Some(tid), 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, lst ∈ orl ∨ lst ∈ qrl ⊦
Used terms: tid, orl + qrl, first, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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), ∀ r0. r0 ≠ first ∧ r0 ∈ orl + qrl from first → vs[r0].deqID ≠ Some(tid), 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, lst ∈ orl ∨ lst ∈ qrl ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), lst ∈ orl ∨ lst ∈ 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: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), 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), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), lst ∈ orl ∨ lst ∈ 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) ⊦ |
⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ 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), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), ∃ r0. ¬(r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid)), 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, lst ∈ orl ∨ lst ∈ qrl ⊦
Used terms: tid, orl + qrl, vhead, vs
| ⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ 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), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), ∃ r0. ¬(r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid)), 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, lst ∈ orl ∨ lst ∈ qrl ⊦ |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), lst ∈ orl ∨ lst ∈ 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) ⊦
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), lst ∈ orl ∨ lst ∈ 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) ⊦ |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, r0 ∈ orl + qrl from vhead, ¬ 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), r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), 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, lst ∈ orl ∨ lst ∈ qrl ⊦
Used terms: r0
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, r0 ∈ orl + qrl from vhead, ¬ 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), r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), 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, lst ∈ orl ∨ lst ∈ qrl ⊦ |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), lst ∈ orl ∨ lst ∈ 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) ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), lst ∈ orl ∨ lst ∈ 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) ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, r0 ∈ (orl from vhead) + qrl, vhead ∈ 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), 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, lst ∈ orl ∨ lst ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl)
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl from r0 → r ∈ rl; (ss) Used terms: orl, qrl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, r0 ∈ (orl from vhead) + qrl, vhead ∈ 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), 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, lst ∈ orl ∨ lst ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ orl, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ vs, vhead ∈ 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), lst ∈ orl ∨ lst ∈ 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), r0 ∈ orl from vhead ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[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)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ orl, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ vs, vhead ∈ 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), lst ∈ orl ∨ lst ∈ 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), r0 ∈ orl from vhead ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ ps, vhead ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, vhead ∈ 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), r0 ∈ orl from vhead ∨ r0 ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, orl ≠ [], r0 ≠ vhead, 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), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ ps, vhead ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, vhead ∈ 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), r0 ∈ orl from vhead ∨ r0 ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + 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) ∈ vrvHp, vhead ∈ qrl0 + vtail0 ' from first, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ vs, vhead ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vhead ∈ qrl0 ∨ vhead = vtail0, first ∈ qrl0 ∨ first = vtail0, phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 + vtail0 ' from first ∨ r0 ∈ 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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + 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) ∈ vrvHp, vhead ∈ qrl0 + vtail0 ' from first, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ vs, vhead ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vhead ∈ qrl0 ∨ vhead = vtail0, first ∈ qrl0 ∨ first = vtail0, phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 + vtail0 ' from first ∨ r0 ∈ qrl) |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), vhead ∈ ps, vhead ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vhead ∈ (qrl0 from first) + vtail0 ', vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ 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), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, first ∈ qrl0 ∨ first = vtail0, vhead ∈ qrl0 ∨ vhead = vtail0, r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 ∈ (qrl0 from first) + vtail0 ' ∨ r0 ∈ qrl)
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: qrl0, vtail0 ', first
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), vhead ∈ ps, vhead ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vhead ∈ (qrl0 from first) + vtail0 ', vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ 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), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, first ∈ qrl0 ∨ first = vtail0, vhead ∈ qrl0 ∨ vhead = vtail0, r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 ∈ (qrl0 from first) + vtail0 ' ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + 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), first ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ vs, vhead ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vhead ∈ qrl0 ∨ vhead = vtail0, phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead ∈ qrl0 from first ∨ vhead = vtail0 ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + 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), first ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ vs, vhead ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vhead ∈ qrl0 ∨ vhead = vtail0, phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead ∈ qrl0 from first ∨ vhead = vtail0 ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), qrl0.last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vhead ∈ ps, vhead ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ 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), vhead ∈ qrl0 from first ∨ vhead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vhead ∈ qrl0 ∨ vhead = vtail0, r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl)
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| vs[r0].deqID = Some(tid), qrl0.last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vhead ∈ ps, vhead ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ 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), vhead ∈ qrl0 from first ∨ vhead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, vhead ∈ qrl0 ∨ vhead = vtail0, r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ qrl0.last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, qrl0.last, vs), nonullRetRefs((qrl0 + vtail0 ') + 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, vs), unmarkedp(qrl, ps), first ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, qrl0.last ∈ vs, qrl0.last ∈ ps, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r0 ∈ qrl0 + vtail0 ' from qrl0.last ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl)
Used simplifier rules: ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ qrl0.last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, qrl0.last, vs), nonullRetRefs((qrl0 + vtail0 ') + 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, vs), unmarkedp(qrl, ps), first ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, qrl0.last ∈ vs, qrl0.last ∈ ps, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r0 ∈ qrl0 + vtail0 ' from qrl0.last ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = qrl1 + first0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ first0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, first0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ qrl0, first0 ∈ ps, first0 ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[first0].next ≠ null ∧ vs[vs[first0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first0].next].deqID.tid)) = Claimed(vs[vs[first0].next].deqID.tid, vs[vs[first0].next].val), r0 ∈ qrl0 + vtail0 ' from first0 ∨ r0 ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, first0, y
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = qrl1 + first0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ first0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, first0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ qrl0, first0 ∈ ps, first0 ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[first0].next ≠ null ∧ vs[vs[first0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first0].next].deqID.tid)) = Claimed(vs[vs[first0].next].deqID.tid, vs[vs[first0].next].val), r0 ∈ qrl0 + vtail0 ' from first0 ∨ r0 ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl) |
vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first0].next ≠ first0, vs[lst].next ≠ null, phead ≠ ps[first0].next, r0 ≠ first0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + first0 ') + ps[first0].next ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, first0, vs), nonullRetRefs(((qrl1 + first0 ') + ps[first0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first0].deqID), some?(vs[first0].deqID), some?(ps[ps[first0].next].deqID), some?(vs[ps[first0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first0 ∈ ps, first0 ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ ps[first0].next ∈ qrl1, ¬ first0 ∈ qrl, ¬ first0 ∈ qrl1, ¬ ps[first0].next ∈ qrl, vs[first0].next ≠ null ∧ vs[vs[first0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first0].next].deqID.tid)) = Claimed(vs[vs[first0].next].deqID.tid, vs[vs[first0].next].val), r0 = ps[first0].next ∨ r0 ∈ qrl, lst ∈ qrl1 ∨ lst = first0 ∨ lst = ps[first0].next ∨ lst ∈ qrl, phead ∈ qrl1 ∨ phead = first0, first ∈ qrl1 ∨ first = first0, vtail = (ps[first0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[first0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 ∈ qrl1 + first0 ' from first ∨ r0 = ps[first0].next ∨ r0 ∈ qrl)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[r0].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[first0].next ≠ first0, vs[lst].next ≠ null, phead ≠ ps[first0].next, r0 ≠ first0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(((qrl1 + first0 ') + ps[first0].next ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, first0, vs), nonullRetRefs(((qrl1 + first0 ') + ps[first0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first0].deqID), some?(vs[first0].deqID), some?(ps[ps[first0].next].deqID), some?(vs[ps[first0].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first0 ∈ ps, first0 ∈ vs, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ ps[first0].next ∈ qrl1, ¬ first0 ∈ qrl, ¬ first0 ∈ qrl1, ¬ ps[first0].next ∈ qrl, vs[first0].next ≠ null ∧ vs[vs[first0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first0].next].deqID.tid)) = Claimed(vs[vs[first0].next].deqID.tid, vs[vs[first0].next].val), r0 = ps[first0].next ∨ r0 ∈ qrl, lst ∈ qrl1 ∨ lst = first0 ∨ lst = ps[first0].next ∨ lst ∈ qrl, phead ∈ qrl1 ∨ phead = first0, first ∈ qrl1 ∨ first = first0, vtail = (ps[first0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[first0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 ∈ qrl1 + first0 ' from first ∨ r0 = ps[first0].next ∨ r0 ∈ qrl) |
Used simplifier rules: ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: r0 ≠ first
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.