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