| ⊦ ls.tid ≠ tid0 ∧ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ 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)) ∧ (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, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, 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, D31, a) = D6, gs.ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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, D31, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.orl, 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, 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, D31, a) = D6, gs.ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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, D31, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.orl, 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 ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, 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, gs.ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.orl + gs.qrl + rl = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ (∃ rl0. gs.orl + rl0 = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl) ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from gs.vtail ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from gs.phead ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ gs.vretRefs(tid0) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0) ∨ gs.vretRefs(tid0) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ dom gs.prvHp ⊆ dom (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ ownsRely(tid0, gs.owns, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns)
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 ⊦ gstepf(gs, ls, D31, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D31, a) = D6; (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, gs.ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.orl + gs.qrl + rl = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ (∃ rl0. gs.orl + rl0 = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl) ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from gs.vtail ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from gs.phead ∧ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∈ (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ gs.vretRefs(tid0) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0) ∨ gs.vretRefs(tid0) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ dom gs.prvHp ⊆ dom (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ ownsRely(tid0, gs.owns, (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) |
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, ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, 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, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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 ⊦ (∃ rl. orl + qrl + rl = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ (∃ rl0. orl + rl0 = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl) ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from vtail ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from phead ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from vhead ∧ equalrl(orl + qrl, vs, ps, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ vretRefs(tid0) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(tid0) ∧ ( pretRefs(tid0) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0) ∨ vretRefs(tid0) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, rvowns, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ dom prvHp ⊆ dom (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ prvHpRely(vrvHp, prvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, vhead, vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ ownsRely(tid0, owns, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns)
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, ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, 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, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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 ⊦ (∃ rl. orl + qrl + rl = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl) ∧ (∃ rl0. orl + rl0 = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl) ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vtail ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from vtail ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).phead ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from phead ∧ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead ∈ (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl from vhead ∧ equalrl(orl + qrl, vs, ps, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).ps, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) ∧ vretRefs(tid0) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs(tid0) ∧ ( pretRefs(tid0) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0) ∨ vretRefs(tid0) = (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, rvowns, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).rvowns, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vretRefs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp) ∧ dom prvHp ⊆ dom (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vrvHp ∧ prvHpRely(vrvHp, prvHp, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).orl + (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).qrl, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, vhead, vs, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vhead, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).vs) ∧ ownsRely(tid0, owns, (vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs).owns) |
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, ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, 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), ls.first ∈ orl, phead ∈ orl, ls.rvref ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead:= phead3 = mkgs (ps, ps0, phead, phead3, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)
| 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, ps[ls.nxt].deqID ≠ None, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, 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), ls.first ∈ orl, phead ∈ orl, ls.rvref ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vhead = ls.first ⊃ mkgs(ps, vs, phead, ls.nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
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[nxt].deqID ≠ None, nxt ≠ null, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, rvref ∈ vrvHp, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
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[nxt].deqID ≠ None, nxt ≠ null, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, rvref ∈ vrvHp, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vhead = first ⊃ mkgs(ps, vs, phead, nxt, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, 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), first ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
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[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, 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), first ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
(vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, (vhead = first ⊃ mkgs (ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| (vhead = first ⊃ mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, 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), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp = dom prvHp, mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead = first, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, 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), first ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ first, 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), first ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
| dom vrvHp = dom prvHp, mkgs(ps, vs, phead, ps[first].next, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead = first, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, 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), first ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ (ps0[first].next ∈ orl0 from first ∨ ps0[first].next ∈ qrl0) ∧ nextnottidRely(tid0, first, vs0, ps0[first].next, vs0)
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (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 ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ (ps0[first].next ∈ orl0 from first ∨ ps0[first].next ∈ qrl0) ∧ nextnottidRely(tid0, first, vs0, ps0[first].next, vs0) |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[first].next ∈ orl0 from first, ¬ ps0[first].next ∈ qrl0, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottidRely(tid0, first, vs0, ps0[first].next, vs0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
⊦ r ∈ rl → r ∈ rl from r
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used terms: (orl0 + (phead ' + orl).butlast).last, orl0 + phead ' + orl
| ⊦ r ∈ rl → r ∈ rl from r |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, (orl0 + phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: phead ', orl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, (orl0 + phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl.butlast).last ≠ orl.last, (phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
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)
| ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl.butlast).last ≠ orl.last, (phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
vs0[first0].deqID = None, ps0[phead].deqID = None, vs0[first0].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + first0 ', pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ first0, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, first0, y
| vs0[first0].deqID = None, ps0[phead].deqID = None, vs0[first0].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + first0 ', pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ first0, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl, first, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[first0].deqID = None, ps0[first0].deqID = None, vs0[first0].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ first0, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], phead ≠ first0, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + first0 ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl1 + first0 ', first, vs0), nonullRetRefs(orl0 + phead ' + orl1 + first0 ', vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ first0 ∈ orl0, ¬ first0 ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦
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)
| ps0[phead].deqID = None, vs0[first0].deqID = None, ps0[first0].deqID = None, vs0[first0].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ first0, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], phead ≠ first0, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + first0 ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + phead ' + orl1 + first0 ', first, vs0), nonullRetRefs(orl0 + phead ' + orl1 + first0 ', vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ first0 ∈ orl0, ¬ first0 ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦ |
⊦ 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: phead ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[first].next ∈ orl0 from first, ¬ ps0[first].next ∈ qrl0, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[first].next ∈ orl0 from first, ¬ ps0[first].next ∈ qrl0, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs0, ps0, owns0)), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used terms: ps0, orl0, owns0, first, qrl0, vs0
| ⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)) |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[first].next ∈ orl0 from first, ¬ ps0[first].next ∈ qrl0, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs0, ps0, owns0)), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ first, ps0[first].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl2, vs0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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 vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ first, ps0[first].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), markedp(rl2, ps0), markedp(rl1, ps0), markedp(rl2, vs0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ first, ps0[first].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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) ⊦ 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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ first, ps0[first].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl2, vs0), markedp(rl1, ps0), markedp(rl2, ps0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ ps0[first].next ∈ rl2, ¬ ps0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ first, ps0[first].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), listp(first ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ ps0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (first ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 ∨ phead0 = first ⊦
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)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ first, ps0[first].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), listp(first ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ ps0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (first ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0), phead0 ∈ rl1 ∨ phead0 = first ⊦ |
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) 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: qrl0, vtail, y
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottidRely(tid0, first, vs0, ps0[first].next, vs0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0)
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid0, first, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, ps0[first].next, vs0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used terms: first, ps0[first].next, tid0, vs0, vs0
| ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ↔ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0) |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid0, first, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, ps0[first].next, vs0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, ps0[first].next, vs0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used terms: tid0, first, vs0
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ nextnottid(tid0, ps0[first].next, vs0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)
vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used terms: tid0, ps0[first].next, vs0
| ⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid) |
| vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))
vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs0, ps0, owns0)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used terms: ps0, orl0, owns0, first, qrl0, vs0
| ⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)) |
| vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, orl0 ≠ [], tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, first, vs0), noid(tid, orl0 + qrl0, first, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ first ∈ orl0 → (∃ rl1, rl2. orl0 = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl0, vs0, ps0, owns0)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = first ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ 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) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (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)
| vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), markedp(rl2, vs0), markedp(rl1, vs0), markedp(rl2, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0), vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2 ⊦ |
vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦
vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: reflist freely generated by [], +;;
| vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = [], rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), listp(first ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0), vtail0 = (first ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦
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) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + qrl0, vs0, ps0, owns0), listp(first ' + qrl0, vs0, ps0, owns0), markedp(rl1, vs0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[first].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl1, vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead0 ≠ rl1.last ∧ unmarkedp(qrl0, vs0), vtail0 = (first ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
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) 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: qrl0, vtail, y
| vs0[vs0[ps0[first].next].next].deqID = Some(tid0), dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rl2 = first0 + rl, rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, vs0[ps0[first].next].next ≠ null, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(first ' + rl2 + qrl0, vs0, ps0, owns0), listp((rl1 + first ' + rl2) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl2, ps0), markedp(rl1, vs0), markedp(rl2, vs0), nextnottid(tid, first, vs0), noid(tid, (rl1 + first ' + rl2) + qrl0, first, vs0), nonullRetRefs((rl1 + first ' + rl2) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[first].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl0), ¬ dups(rl2), ¬ dups(qrl0), ¬ first ∈ qrl0, ¬ first ∈ rl2, ¬ first ∈ rl1, vs0[first].next ≠ null ∧ vs0[vs0[first].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[first].next ≠ null → vs0[vs0[first].next].deqID ≠ Some(tid0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 ∈ rl2, vtail0 = (first ' + rl2 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (first ' + rl2 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (first ' + rl2).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead0 ≠ (first ' + rl2).last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[vs0[first].next].deqID ≠ Some(tid0), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ dups(qrl0), ¬ dups(rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦
Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) 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) ⊦ 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)
| vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(vs0[vs0[first].next].deqID.tid)) = Claimed(vs0[vs0[first].next].deqID.tid, vs0[vs0[first].next].val), vs0[vs0[first].next].deqID ≠ Some(tid0), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(vs0[vs0[first].next].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ dups(qrl0), ¬ dups(rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[vs0[first].next].deqID ≠ Some(tid0), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ dups(qrl0), ¬ dups(rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs0[vs0[first].next].deqID, tid1
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[vs0[first].next].deqID ≠ Some(tid0), ps0[vs0[first].next].deqID ≠ None, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + rl + qrl0), ¬ dups(rl1), ¬ dups(rl + qrl0), ¬ dups(rl1 + rl), ¬ dups(qrl0), ¬ dups(rl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl, ps0), markedp(rl1, vs0), markedp(rl, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl, vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦
vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = first0 + rl0, rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦
Used simplifier rules: reflist freely generated by [], +;;
| vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = [], rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, phead0 ≠ vs0[first].next, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦
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 '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, phead0 ≠ vs0[first].next, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[first].next ' + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl1, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vs0[first].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(rl1 + qrl0), ¬ dups(rl1), ¬ dups(qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, vtail0 = (vs0[first].next ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ some?(Some(tid)); (s) ⊦ ¬ weak?(Some(tid)); (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ unmarkedp([], vs); (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) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)
| vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[first].next = vs0[first].next, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl = first0 + rl0, rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), ps0[vs0[first].next].deqID ≠ None, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ null, first ≠ vs0[first].next, first ≠ null, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, ps0, owns0), listp(vs0[first].next ' + rl + qrl0, vs0, ps0, owns0), markedp(rl, vs0), markedp(rl1, vs0), markedp(rl, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + (vs0[first].next ' + rl) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + (vs0[first].next ' + rl) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[first].next].deqID), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl), ¬ dups(qrl0), ¬ dups(rl1 + rl), ¬ dups(rl + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl0), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl0, ¬ vs0[first].next ∈ qrl0, ¬ vs0[first].next ∈ rl, ¬ vs0[first].next ∈ rl1, ¬ first ∈ rl1, (vs0[first].next ' + rl).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (first ' + (vs0[first].next ' + rl).butlast).last = first ∧ phead0 ≠ (vs0[first].next ' + rl).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[first].next ' + rl + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[first].next ' + rl + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 ∈ rl ⊦ |
ps0[vs0[first].next].deqID = Some(tid1), vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].next = vs0[first].next, ps0[vs0[first].next].val = vs0[vs0[first].next].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(vs0[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[vs0[first].next].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vs0[first].next ∈ ps0, vs0[first].next ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, (vs0[vs0[first].next].next ' + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0).butlast).last = first ∧ phead0 ≠ (vs0[vs0[first].next].next ' + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0 ⊦
Used simplifier rules: ⊦ some?(Some(tid)); (s) 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 ⊦ ¬ weak?(Some(tid)); (s) ⊦ None ≠ Some(tid); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)
| ps0[vs0[first].next].deqID = Some(tid1), vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].next = vs0[first].next, ps0[vs0[first].next].val = vs0[vs0[first].next].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(vs0[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[vs0[first].next].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, ps0), vs0[first].next ∈ ps0, vs0[first].next ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, (vs0[vs0[first].next].next ' + rl0).last = first ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0).butlast).last = first ∧ phead0 ≠ (vs0[vs0[first].next].next ' + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0 ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[vs0[first].next].next ' + rl0).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0, vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0).butlast).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[vs0[first].next].next ' + rl0).last, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0, vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[vs0[first].next].next ' + rl0).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), unmarkedp(qrl0, ps0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0, vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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: vs0[vs0[first].next].next ', rl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0).butlast).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[vs0[first].next].next ' + rl0).last, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0, vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps0[vs0[first].next].deqID = Some(tid1), vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (vs0[first].next ' + vs0[vs0[first].next].next ' + rl0.butlast).last = first, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].next = vs0[first].next, ps0[vs0[first].next].val = vs0[vs0[first].next].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(vs0[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[vs0[first].next].next ' + rl0).last, rl0 ≠ [], tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[vs0[first].next].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vs0[first].next ∈ ps0, vs0[first].next ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0 ⊦
Used simplifier rules: ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs0[vs0[first].next].next ', rl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps0[vs0[first].next].deqID = Some(tid1), vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (vs0[first].next ' + vs0[vs0[first].next].next ' + rl0.butlast).last = first, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].next = vs0[first].next, ps0[vs0[first].next].val = vs0[vs0[first].next].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(vs0[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ (vs0[vs0[first].next].next ' + rl0).last, rl0 ≠ [], tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[vs0[first].next].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vs0[first].next ∈ ps0, vs0[first].next ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vs0[vs0[first].next].next ' + rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0 ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[vs0[first].next].next ' + rl0.butlast).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0, vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[vs0[first].next].next ' + rl0.butlast).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(rl0, ps0), markedp(rl1, vs0), markedp(rl0, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0, vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
ps0[vs0[first].next].deqID = Some(tid1), vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (vs0[vs0[first].next].next ' + qrl).last = first, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].next = vs0[first].next, ps0[vs0[first].next].val = vs0[vs0[first].next].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(vs0[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl0 = qrl + vtail ', rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vtail, rl0 ≠ [], tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[vs0[first].next].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vs0[first].next ∈ ps0, vs0[first].next ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vtail, y
| ps0[vs0[first].next].deqID = Some(tid1), vs0[vs0[first].next].deqID = Some(tid1), vs0[vs0[vs0[first].next].next].deqID = Some(tid0), ps0[first].deqID = vs0[first].deqID, (vs0[vs0[first].next].next ' + qrl).last = first, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].next = vs0[first].next, ps0[vs0[first].next].val = vs0[vs0[first].next].val, ps0[first].val = vs0[first].val, dom vrvHp0 = dom prvHp0, owns0(vs0[first].next) = None, owns0(first) = None, pretRefs0(tid) = vretRefs0(tid), rl0 = qrl + vtail ', rvowns0(vretRefs0(tid)) = Pending(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, phead0 ≠ vtail, rl0 ≠ [], tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, ps0, owns0), listp(vs0[vs0[first].next].next ' + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, vs0), markedp(rl1, vs0), markedp(rl0, ps0), markedp(rl1, ps0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(ps0[vs0[vs0[first].next].next].deqID), some?(vs0[first].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl0, ps0), vs0[first].next ∈ ps0, vs0[first].next ∈ vs0, phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(rl1 + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl1), ¬ dups(rl1 + rl0 + qrl0), ¬ weak?(vs0[first].deqID), ¬ vs0[first].next ∈ rl0, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ rl0, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ rl0, ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ rl0 ⊦ |
ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[vs0[first].next].next ' + qrl).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ vtail, vs0[vs0[first].next].next ≠ vtail, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, phead0 ≠ vtail, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + qrl + vtail ') + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl0, ¬ vs0[first].next ∈ qrl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ qrl, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)
| ps0[first].deqID = vs0[first].deqID, vs0[vs0[vs0[first].next].next].deqID = Some(tid0), vs0[vs0[first].next].deqID = Some(tid1), ps0[vs0[first].next].deqID = Some(tid1), (vs0[vs0[first].next].next ' + qrl).last = first, ps0[first].next = vs0[first].next, ps0[vs0[first].next].next = vs0[vs0[first].next].next, ps0[first].val = vs0[first].val, ps0[vs0[first].next].val = vs0[vs0[first].next].val, dom vrvHp0 = dom prvHp0, owns0(first) = None, owns0(vs0[first].next) = None, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid1)) = Claimed(tid1, vs0[vs0[first].next].val), rvowns0(vretRefs0(tid)) = Pending(tid), vs0[first].next ≠ vs0[vs0[first].next].next, vs0[first].next ≠ null, vs0[vs0[first].next].next ≠ null, vs0[first].next ≠ vtail, vs0[vs0[first].next].next ≠ vtail, first ≠ vs0[vs0[first].next].next, first ≠ null, first ≠ vs0[first].next, first ≠ vtail, phead0 ≠ vtail, tid ≠ tid0, tid1 ≠ tid0, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[vs0[first].next].next ' + (qrl + vtail ') + qrl0, vs0, ps0, owns0), listp(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + qrl + vtail ') + qrl0, vs0, ps0, owns0), markedp(rl1, ps0), markedp(qrl, ps0), markedp(rl1, vs0), markedp(qrl, vs0), nextnottid(tid, first, vs0), noid(tid, rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + qrl + vtail ') + qrl0, first, vs0), nonullRetRefs(rl1 + first ' + vs0[first].next ' + (vs0[vs0[first].next].next ' + qrl + vtail ') + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(vs0[first].deqID), some?(ps0[vs0[vs0[first].next].next].deqID), some?(ps0[vtail].deqID), some?(vs0[vtail].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, vs0[first].next ∈ vs0, vs0[first].next ∈ ps0, ¬ dups((rl1 + qrl) + qrl0), ¬ dups(rl1), ¬ dups(qrl + qrl0), ¬ dups(rl1 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs0[first].deqID), ¬ first ∈ rl1, ¬ vs0[first].next ∈ rl1, ¬ vtail ∈ qrl, ¬ vtail ∈ rl1, ¬ vtail ∈ qrl0, ¬ vs0[first].next ∈ qrl, ¬ vs0[first].next ∈ qrl0, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs0[vs0[first].next].next ∈ qrl0, ¬ vs0[vs0[first].next].next ∈ rl1, ¬ vs0[vs0[first].next].next ∈ qrl, phead0 ∈ rl1 ∨ phead0 = first ∨ phead0 = vs0[first].next ∨ phead0 = vs0[vs0[first].next].next ∨ phead0 ∈ qrl, vtail0 = (vtail ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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: vs0[vs0[first].next].next ', qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ first, 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), first ∈ orl, phead ∈ orl, vretRefs(tid) ∈ vrvHp, 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), 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) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (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 ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), qrl0 = phead + orl, rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + qrl0.butlast).last ≠ qrl0.last, ps0[first].next ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
⊦ r ∈ rl → r ∈ rl from r
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used terms: (orl0 + (phead ' + orl).butlast).last, orl0 + phead ' + orl
| ⊦ r ∈ rl → r ∈ rl from r |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, (orl0 + phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: phead ', orl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[(phead ' + orl).last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, (orl0 + phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl.butlast).last ≠ orl.last, (phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
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)
| ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl.butlast).last ≠ orl.last, (phead ' + orl.butlast).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead, y
| vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦
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)
| ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ phead, ps0[first].next ≠ null, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0, ¬ (phead ' + orl1).last ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦ |
⊦ 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: phead ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
⊦ r ∈ rl → r ∈ rl from r
dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0, ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used terms: vhead0, orl0 + qrl0
| ⊦ r ∈ rl → r ∈ rl from r |
| dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, first ∈ ps0, phead0 ∈ vs0, first ∈ vs0, vretRefs0(tid) ∈ vrvHp0, phead0 ∈ orl0, first ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0, ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
orl0.butlast.last = vhead0, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), orl0.butlast ≠ [], ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], phead0 ≠ orl0.last, tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0, ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| orl0.butlast.last = vhead0, dom vrvHp0 = dom prvHp0, pretRefs0(tid) = vretRefs0(tid), rvowns0(vretRefs0(tid)) = Pending(tid), orl0.butlast ≠ [], ps0[ps0[first].next].deqID ≠ None, ps0[first].next ≠ null, orl0 ≠ [], phead0 ≠ orl0.last, tid ≠ tid0, vhead0 ≠ first, vretRefs0(tid) ≠ null, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), unmarkedp(qrl0, vs0), first ∈ orl0, phead0 ∈ orl0, vretRefs0(tid) ∈ vrvHp0, first ∈ vs0, phead0 ∈ vs0, first ∈ ps0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0, ¬ vhead0 ∈ orl0 + qrl0 from vhead0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vtail, 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.