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