| ⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ 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, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns) |
ls.nxt = gs.vs[ls.lst].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, D16, a) = D17, 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, D16, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.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, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns)
| ls.nxt = gs.vs[ls.lst].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, D16, a) = D17, 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, D16, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.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, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns) |
ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, 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), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, 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, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, 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.qrl + rl = (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ gs.vtail ∈ gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) from gs.vtail ∧ gs.vhead ∈ gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt], (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs) ∧ ownsRely(tid0, gs.owns, (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);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 ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, D16, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt;gs.qrl)) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.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) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, D16, a) = D17; (s)
| ls.nxt = gs.vs[ls.lst].next, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, 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), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, 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, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, 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.qrl + rl = (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ gs.vtail ∈ gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) from gs.vtail ∧ gs.vhead ∈ gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt], (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs) ∧ ownsRely(tid0, gs.owns, (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) |
ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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, phead ∈ vs, phead ∈ 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), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ vtail ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vtail ∧ vhead ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs) ∧ ownsRely(tid0, owns, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);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 = vs[ls.lst].next, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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, phead ∈ vs, phead ∈ 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), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ vtail ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vtail ∧ vhead ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs) ∧ ownsRely(tid0, owns, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) |
ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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), phead ∈ orl, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ vtail ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vtail ∧ vhead ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs) ∧ ownsRely(tid0, owns, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);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
| ls.nxt = vs[ls.lst].next, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.nxt ≠ null, ls.rvref ≠ null, 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), phead ∈ orl, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ vtail ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vtail ∧ vhead ∈ orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs) ∧ ownsRely(tid0, owns, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) |
dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = vs[lst].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, nxt ≠ null, orl ≠ [], rvref ≠ null, 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, phead ∈ vs, rvref ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= nxt]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= nxt], (lst = (orl + qrl).last ⊃ owns(nxt; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(nxt; None);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 = vs[lst].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, 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, phead ∈ vs, rvref ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= nxt]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= nxt], (lst = (orl + qrl).last ⊃ owns(nxt; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + nxt ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(nxt; None);owns)) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].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), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns))
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].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), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
dom vrvHp = dom prvHp, lst = (orl + qrl).last, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns))
Used formulas: lst = (orl + qrl).last
| dom vrvHp = dom prvHp, lst = (orl + qrl).last, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail ∧ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None))
Used simplifier rules: listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail ∧ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None)) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None)), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl + vs[(orl + qrl).last].next ', vtail
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ orl + qrl + vs[(orl + qrl).last].next ' from vtail, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl + vs[(orl + qrl).last].next ' from vtail, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl + vs[(orl + qrl).last].next ' from vtail, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ qrl, ¬ vtail ∈ orl, ¬ vtail ∈ qrl + vs[(orl + qrl).last].next ' from vtail, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, vs[(orl + qrl).last].next ', vtail
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ qrl, ¬ vtail ∈ orl, ¬ vtail ∈ qrl + vs[(orl + qrl).last].next ' from vtail, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ qrl, ¬ vtail ∈ orl, ¬ vtail ∈ (vs[(orl + qrl).last].next = vtail ⊃ vs[(orl + qrl).last].next ';[]), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ qrl, ¬ vtail ∈ orl, ¬ vtail ∈ (vs[(orl + qrl).last].next = vtail ⊃ vs[(orl + qrl).last].next ';[]), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vtail, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ [], ¬ vtail ∈ qrl, ¬ vtail ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vtail, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ [], ¬ vtail ∈ qrl, ¬ vtail ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vtail, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ qrl, ¬ vtail ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vtail, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ qrl, ¬ vtail ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl + vs[(orl + qrl).last].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + qrl + vs[(orl + qrl).last].next ' from vhead, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, vs[(orl + qrl).last].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[(orl + qrl).last].next ' from vhead, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[(orl + qrl).last].next = vhead ⊃ vs[(orl + qrl).last].next ';[]), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[(orl + qrl).last].next = vhead ⊃ vs[(orl + qrl).last].next ';[]), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vhead, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ [], ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vhead, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ [], ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vhead, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vhead, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vhead, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ vhead, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), qrl.last ∈ orl ∨ qrl.last ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ vhead, vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[orl.last].next ≠ orl.butlast.last, vs[orl.last].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl, orl.butlast.last, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[orl.last].next ≠ orl.butlast.last, vs[orl.last].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl, orl.butlast.last, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[orl.last].next ≠ orl.butlast.last, vs[orl.last].next ≠ null, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl, orl.butlast.last, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), vs[orl.last].next ∈ vs, vs[orl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[orl.last].next ≠ orl.butlast.last, vs[orl.last].next ≠ null, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl, orl.butlast.last, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), vs[orl.last].next ∈ vs, vs[orl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ phead0, vs[orl0.last].next ≠ (phead0 ' + orl0.butlast).last, vs[orl0.last].next ≠ null, orl0 ≠ [], phead ≠ orl0.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead0 ' + orl0.butlast).last, vs), noid(tid, phead0 ' + orl0, (phead0 ' + orl0.butlast).last, vs), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[orl0.last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ phead0, vs[orl0.last].next ≠ (phead0 ' + orl0.butlast).last, vs[orl0.last].next ≠ null, orl0 ≠ [], phead ≠ orl0.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead0 ' + orl0.butlast).last, vs), noid(tid, phead0 ' + orl0, (phead0 ' + orl0.butlast).last, vs), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[orl0.last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ (phead0 ' + orl).last, vs[phead1].next ≠ null, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, phead0 ' + orl0, (phead0 ' + orl).last, vs), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[phead1].next)), vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y
| vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, orl0 = orl + phead1 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ (phead0 ' + orl).last, vs[phead1].next ≠ null, orl0 ≠ [], phead ≠ phead1, phead1 ≠ (phead0 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + orl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, phead0 ' + orl0, (phead0 ' + orl).last, vs), nonullRetRefs(phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[phead1].next)), vs[phead1].next ∈ vs, vs[phead1].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl0 ⊦ |
vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ (phead0 ' + orl).last, vs[phead1].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + orl + phead1 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, phead0 ' + orl + phead1 ', (phead0 ' + orl).last, vs), nonullRetRefs(phead0 ' + orl + phead1 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), weak?(owns(vs[phead1].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, ¬ dups(orl), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[vs[phead1].next].deqID = None, vs[vs[phead1].next].next = null, ps[vs[phead1].next] = vs[vs[phead1].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[phead1].next ≠ (phead0 ' + orl).last, vs[phead1].next ≠ null, phead ≠ phead1, phead0 ≠ phead1, phead1 ≠ (phead0 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(phead0 ' + orl + phead1 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, phead0 ' + orl + phead1 ', (phead0 ' + orl).last, vs), nonullRetRefs(phead0 ' + orl + phead1 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[phead1].deqID), some?(vs[phead1].deqID), weak?(owns(vs[phead1].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead1].next ∈ ps, vs[phead1].next ∈ vs, ¬ dups(orl), ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), phead = phead0 ∨ phead ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: phead0 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ vhead, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), qrl.last ∈ orl ∨ qrl.last ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[qrl.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[qrl.last].next ≠ null, vs[qrl.last].next ≠ vhead, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[qrl.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(phead0 ' + orl0).last].next].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].next = null, ps[vs[(phead0 ' + orl0).last].next] = vs[vs[(phead0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(phead0 ' + orl0).last].next ≠ null, vs[(phead0 ' + orl0).last].next ≠ vhead, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(phead0 ' + orl0).last].next)), vs[(phead0 ' + orl0).last].next ∈ vs, vs[(phead0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[vs[(phead0 ' + orl0).last].next].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].next = null, ps[vs[(phead0 ' + orl0).last].next] = vs[vs[(phead0 ' + orl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(phead0 ' + orl0).last].next ≠ null, vs[(phead0 ' + orl0).last].next ≠ vhead, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(phead0 ' + orl0).last].next)), vs[(phead0 ' + orl0).last].next ∈ vs, vs[(phead0 ' + orl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].deqID = None, vs[vs[(phead0 ' + orl0).last].next].next = null, ps[vs[(phead0 ' + orl0).last].next] = vs[vs[(phead0 ' + orl0).last].next], dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(phead0 ' + orl0).last].next ≠ null, vs[(phead0 ' + orl0).last].next ≠ vhead, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(phead0 ' + orl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(phead0 ' + orl0).last].next ∈ ps, vs[(phead0 ' + orl0).last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[phead0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl0.last].next ≠ null, vs[orl0.last].next ≠ vhead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].deqID = None, vs[vs[(phead0 ' + orl0).last].next].next = null, ps[vs[(phead0 ' + orl0).last].next] = vs[vs[(phead0 ' + orl0).last].next], dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(phead0 ' + orl0).last].next ≠ null, vs[(phead0 ' + orl0).last].next ≠ vhead, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(phead0 ' + orl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(phead0 ' + orl0).last].next ∈ ps, vs[(phead0 ' + orl0).last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, orl.butlast.last ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ orl.butlast.last, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + phead0 ', orl.butlast.last, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)
| vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, orl.butlast.last ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ orl.butlast.last, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + phead0 ', orl.butlast.last, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = phead1 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, orl.butlast.last ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ orl.butlast.last, orl ≠ phead1 ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + phead0 ', orl.butlast.last, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = phead1 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, orl.butlast.last ≠ phead0, vs[phead0].next ≠ null, vs[phead0].next ≠ orl.butlast.last, orl ≠ phead1 ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + phead0 ', orl.butlast.last, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.butlast.last ∈ orl, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val) ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead1 ' + orl0.butlast).last, (phead1 ' + orl0.butlast).last ≠ phead0, (phead1 ' + orl0.butlast).last ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ (phead1 ' + orl0.butlast).last, orl0 ≠ [], phead ≠ orl0.last, phead0 ≠ phead1, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead1 ' + orl0.butlast).last, vs), noid(tid, (phead1 ' + orl0) + phead0 ', (phead1 ' + orl0.butlast).last, vs), nonullRetRefs((phead1 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ (phead1 ' + orl0.butlast).last ∈ orl0, vs[(phead1 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl0.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead1 ' + orl0.butlast).last, (phead1 ' + orl0.butlast).last ≠ phead0, (phead1 ' + orl0.butlast).last ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ (phead1 ' + orl0.butlast).last, orl0 ≠ [], phead ≠ orl0.last, phead0 ≠ phead1, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead1 ' + orl0.butlast).last, vs), noid(tid, (phead1 ' + orl0) + phead0 ', (phead1 ' + orl0.butlast).last, vs), nonullRetRefs((phead1 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ (phead1 ' + orl0.butlast).last ∈ orl0, vs[(phead1 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead1 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead1 ' + orl0.butlast).last].next].val), phead = phead1 ∨ phead ∈ orl0 ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl + phead2 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead1 ' + orl).last ≠ phead0, (phead1 ' + orl).last ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ (phead1 ' + orl).last, orl0 ≠ [], phead ≠ phead2, phead0 ≠ phead1, phead2 ≠ (phead1 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead1 ' + orl).last, vs), noid(tid, (phead1 ' + orl0) + phead0 ', (phead1 ' + orl).last, vs), nonullRetRefs((phead1 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), weak?(owns(vs[phead0].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0), ¬ phead1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ (phead1 ' + orl).last ∈ orl0, vs[(phead1 ' + orl).last].next ≠ null ∧ vs[vs[(phead1 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl).last].next].deqID.tid, vs[vs[(phead1 ' + orl).last].next].val), phead = phead1 ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead2, y
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl + phead2 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead1 ' + orl).last ≠ phead0, (phead1 ' + orl).last ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ (phead1 ' + orl).last, orl0 ≠ [], phead ≠ phead2, phead0 ≠ phead1, phead2 ≠ (phead1 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead1 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead1 ' + orl).last, vs), noid(tid, (phead1 ' + orl0) + phead0 ', (phead1 ' + orl).last, vs), nonullRetRefs((phead1 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead1].deqID), some?(vs[phead1].deqID), weak?(owns(vs[phead0].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0), ¬ phead1 ∈ orl0, ¬ phead0 ∈ orl0, ¬ (phead1 ' + orl).last ∈ orl0, vs[(phead1 ' + orl).last].next ≠ null ∧ vs[vs[(phead1 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl).last].next].deqID.tid, vs[vs[(phead1 ' + orl).last].next].val), phead = phead1 ∨ phead ∈ orl0 ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead1 ' + orl).last ≠ phead0, (phead1 ' + orl).last ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ (phead1 ' + orl).last, phead ≠ phead2, phead0 ≠ phead1, phead0 ≠ phead2, phead1 ≠ phead2, phead2 ≠ (phead1 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl + phead2 ') + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, (phead1 ' + orl).last, vs), noid(tid, (phead1 ' + orl + phead2 ') + phead0 ', (phead1 ' + orl).last, vs), nonullRetRefs((phead1 ' + orl + phead2 ') + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead2].deqID), some?(ps[phead2].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl), ¬ phead2 ∈ orl, ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead1 ' + orl).last ∈ orl, vs[(phead1 ' + orl).last].next ≠ null ∧ vs[vs[(phead1 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl).last].next].deqID.tid, vs[vs[(phead1 ' + orl).last].next].val), phead = phead1 ∨ phead ∈ orl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead1 ' + orl).last ≠ phead0, (phead1 ' + orl).last ≠ phead1, vs[phead0].next ≠ null, vs[phead0].next ≠ (phead1 ' + orl).last, phead ≠ phead2, phead0 ≠ phead1, phead0 ≠ phead2, phead1 ≠ phead2, phead2 ≠ (phead1 ' + orl).last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead1 ' + orl + phead2 ') + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, (phead1 ' + orl).last, vs), noid(tid, (phead1 ' + orl + phead2 ') + phead0 ', (phead1 ' + orl).last, vs), nonullRetRefs((phead1 ' + orl + phead2 ') + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead1].deqID), some?(ps[phead1].deqID), some?(vs[phead2].deqID), some?(ps[phead2].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl), ¬ phead2 ∈ orl, ¬ phead1 ∈ orl, ¬ phead0 ∈ orl, ¬ (phead1 ' + orl).last ∈ orl, vs[(phead1 ' + orl).last].next ≠ null ∧ vs[vs[(phead1 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead1 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead1 ' + orl).last].next].deqID.tid, vs[vs[(phead1 ' + orl).last].next].val), phead = phead1 ∨ phead ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: phead1 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl0.last].next ≠ null, vs[orl0.last].next ≠ vhead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[orl0.last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl0.last].next ∈ ps, vs[orl0.last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ vhead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ vhead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead ≠ phead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ vhead, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ vhead, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[vhead0].deqID = None ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead1, y
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: ps, orl + qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) |
⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b]
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next), r ∈ ps ∧ ¬ (orl + qrl).last ∈ ps
Used terms: ps, (orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next, r
| ⊦ b ∈ st ∧ ¬ a ∈ st → st[a, d][b] = st[b] |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next), r ∈ ps ∧ ¬ (orl + qrl).last ∈ ps |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = (orl + qrl).last, rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ r ∈ ps ∧ ¬ (orl + qrl).last ∈ ps, ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next)
Used terms: ps, (orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = (orl + qrl).last, rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ r ∈ ps ∧ ¬ (orl + qrl).last ∈ ps, ps[r].val = ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val ∧ (ps[r].deqID ≠ None → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next) |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail0, y
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + qrl0, rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, vs[(orl + qrl).last].next ≠ ps[(orl + qrl).last].next, ps[(orl + qrl).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s)
| ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ ps, vs[(vtail0 ' + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), vs[(vtail0 ' + qrl0).last].next ∈ vs, vs[(vtail0 ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| vs[vs[(vtail0 ' + qrl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + qrl0).last].next].next = null, ps[vs[(vtail0 ' + qrl0).last].next] = vs[vs[(vtail0 ' + qrl0).last].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[(vtail0 ' + qrl0).last].next ≠ null, vs[(vtail0 ' + qrl0).last].next ≠ ps[(vtail0 ' + qrl0).last].next, vs[(vtail0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + qrl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), weak?(owns(vs[(vtail0 ' + qrl0).last].next)), vs[(vtail0 ' + qrl0).last].next ∈ vs, vs[(vtail0 ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ qrl0, 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), phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, ps[(ps[phead0].next ' + qrl0).last].next ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ 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)
| vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, ps[(ps[phead0].next ' + qrl0).last].next ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next))
ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, ps[(ps[phead0].next ' + qrl0).last].next ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns) ∧ vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next ≠ null → vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next ∈ vs ∧ vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next ∈ ps ∧ ps[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next] = vs[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next] ∧ ps[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next].deqID = None ∧ ps[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next].next = null ∧ weak?(owns(vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next)), phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs), phead ∈ orl0 ∨ phead = phead0 ⊦
Used terms: (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns
| ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)) |
| ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, ps[(ps[phead0].next ' + qrl0).last].next ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns) ∧ vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next ≠ null → vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next ∈ vs ∧ vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next ∈ ps ∧ ps[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next] = vs[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next] ∧ ps[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next].deqID = None ∧ ps[vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next].next = null ∧ weak?(owns(vs[((orl0 + phead0 ') + ps[phead0].next ' + qrl0).last].next)), phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs), phead ∈ orl0 ∨ phead = phead0 ⊦ |
ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, ps[phead0].next ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs), phead ∈ orl0 ∨ phead = phead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, ps[phead0].next ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs), phead ∈ orl0 ∨ phead = phead0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), ps[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, ps[phead0].next ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
vs[vs[qrl0.last].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[qrl0.last].next ≠ null, vs[qrl0.last].next ≠ ps[qrl0.last].next, vs[qrl0.last].next ≠ null, ps[phead0].next ≠ phead0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used terms: ps[phead0].next ', qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(ps[phead0].next ' + qrl0).last].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[vs[(ps[phead0].next ' + qrl0).last].next].next = null, ps[vs[(ps[phead0].next ' + qrl0).last].next] = vs[vs[(ps[phead0].next ' + qrl0).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), ps[(ps[phead0].next ' + qrl0).last].next ≠ null, vs[(ps[phead0].next ' + qrl0).last].next ≠ ps[(ps[phead0].next ' + qrl0).last].next, vs[(ps[phead0].next ' + qrl0).last].next ≠ null, ps[phead0].next ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[(ps[phead0].next ' + qrl0).last].next)), vs[(ps[phead0].next ' + qrl0).last].next ∈ vs, vs[(ps[phead0].next ' + qrl0).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[ps[phead0].next].deqID = None, vs[vs[ps[phead0].next].next].deqID = None, vs[vs[ps[phead0].next].next].next = null, ps[vs[ps[phead0].next].next] = vs[vs[ps[phead0].next].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, ps[ps[phead0].next].next ≠ null, vs[ps[phead0].next].next ≠ ps[ps[phead0].next].next, vs[ps[phead0].next].next ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ' + ps[phead0].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ' + ps[phead0].next ', vhead, vs), nonullRetRefs(orl0 + phead0 ' + ps[phead0].next ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[ps[phead0].next].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[ps[phead0].next].next ∈ ps, vs[ps[phead0].next].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)
| ps[ps[phead0].next].deqID = None, vs[vs[ps[phead0].next].next].deqID = None, vs[vs[ps[phead0].next].next].next = null, ps[vs[ps[phead0].next].next] = vs[vs[ps[phead0].next].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, ps[ps[phead0].next].next ≠ null, vs[ps[phead0].next].next ≠ ps[ps[phead0].next].next, vs[ps[phead0].next].next ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ' + ps[phead0].next ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ' + ps[phead0].next ', vhead, vs), nonullRetRefs(orl0 + phead0 ' + ps[phead0].next ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[ps[phead0].next].next)), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[ps[phead0].next].next ∈ ps, vs[ps[phead0].next].next ∈ vs, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' ≠ []; (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) Used terms: ps, orl0 + phead0 ', owns, ps[phead0].next ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[qrl0.last].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[vs[qrl0.last].next].next = null, ps[vs[qrl0.last].next] = vs[vs[qrl0.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[qrl0.last].next ≠ null, vs[qrl0.last].next ≠ ps[qrl0.last].next, vs[qrl0.last].next ≠ null, ps[phead0].next ≠ phead0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + ps[phead0].next ' + qrl0, vhead, vs), nonullRetRefs((orl0 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, ps), weak?(owns(vs[qrl0.last].next)), vs[qrl0.last].next ∈ vs, vs[qrl0.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ qrl0, ¬ ps[phead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(qrl0, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ listp([], vs, ps, owns); (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) Used terms: ps, orl0 + phead0 ' + ps[phead0].next ', owns, qrl0, vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[(orl + qrl).last].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next] ∧ vs[r] = vs[r] ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ owns(vs[(orl + qrl).last].next; None)(r) = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: ps, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], tid0, owns, vs, owns(vs[(orl + qrl).last].next; None), vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[(orl + qrl).last].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next] ∧ vs[r] = vs[r] ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ owns(vs[(orl + qrl).last].next; None)(r) = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ (orl + qrl).last ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + (orl + qrl).last ' + rl2 ∧ listp((orl + qrl).last ' + rl2, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
Used terms: ps, orl + qrl, owns, (orl + qrl).last, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ (orl + qrl).last ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + (orl + qrl).last ' + rl2 ∧ listp((orl + qrl).last ' + rl2, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
orl + qrl = rl1 + (orl + qrl).last ' + rl2, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl2, 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s)
| orl + qrl = rl1 + (orl + qrl).last ' + rl2, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl2, 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), weak?(owns(vs[(orl + qrl).last].next)), r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
⊦ y ≠ [] → (x + y).last = y.last
orl + qrl = rl1 + (orl + qrl).last ' + rl2, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl2, vs, ps, owns), 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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl.last ' + rl2, vs, ps, owns), 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[qrl.last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), qrl.last ∈ orl ∨ qrl.last ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs[qrl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = ps[r].deqID ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = vs[r].deqID) ∧ (ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = ps[r].val ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = vs[r].val) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = ps[r].next ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = vs[r].next)
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl + qrl = rl1 + (orl + qrl).last ' + rl2, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl2, vs, ps, owns), 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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl.last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(orl.last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), r ∈ ps[orl.last, ps[orl.last].next:= vs[orl.last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[orl.last].next ≠ r → None = owns(r)) ⊦ (vs[orl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].deqID = ps[r].deqID ∨ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].deqID = vs[r].deqID) ∧ (ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].val = ps[r].val ∨ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].val = vs[r].val) ∧ ( ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].next = ps[r].next ∨ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].next = vs[r].next)
Used simplifier rules: listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ ¬ dups([]); (s)
| vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[orl.last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(orl.last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), r ∈ ps[orl.last, ps[orl.last].next:= vs[orl.last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[orl.last].next ≠ r → None = owns(r)) ⊦ (vs[orl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].deqID = ps[r].deqID ∨ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].deqID = vs[r].deqID) ∧ (ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].val = ps[r].val ∨ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].val = vs[r].val) ∧ ( ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].next = ps[r].next ∨ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][r].next = vs[r].next) |
vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next) |
ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, phead0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead ∈ rl ∨ phead = phead0 ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next)
Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, phead0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead ∈ rl ∨ phead = phead0 ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, phead0 ≠ null, r ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, phead0, ps[phead0].next:= vs[phead0].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, phead0 ≠ null, r ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) |
ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), phead0 ≠ null, r ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, phead0 ∈ ps, phead0 ∈ vs, r ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead ∈ rl ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), phead0 ≠ null, r ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, phead0 ∈ ps, phead0 ∈ vs, r ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead ∈ rl ∨ phead = phead0 ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl.last ' + rl2, vs, ps, owns), 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[qrl.last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), qrl.last ∈ orl ∨ qrl.last ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (vs[qrl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = ps[r].deqID ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = vs[r].deqID) ∧ (ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = ps[r].val ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = vs[r].val) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = ps[r].next ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = vs[r].next) |
orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl.last ' + rl2, vs, ps, owns), 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ 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 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[qrl.last].next ≠ r → None = owns(r)) ⊦ (vs[qrl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = ps[r].deqID ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = vs[r].deqID) ∧ (ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = ps[r].val ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = vs[r].val) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = ps[r].next ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)
| orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl.last ' + rl2, vs, ps, owns), 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), weak?(owns(vs[qrl.last].next)), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], ¬ 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 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[qrl.last].next ≠ r → None = owns(r)) ⊦ (vs[qrl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = ps[r].deqID ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = vs[r].deqID) ∧ (ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = ps[r].val ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = vs[r].val) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = ps[r].next ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = vs[r].next) |
orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = r0 + rl, rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, 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), weak?(owns(vs[qrl.last].next)), r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[qrl.last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[qrl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = ps[r].deqID ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = vs[r].deqID) ∧ (ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = ps[r].val ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = vs[r].val) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = ps[r].next ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = r0 + rl, rvowns(vretRefs(tid)) = Pending(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, 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), weak?(owns(vs[qrl.last].next)), r ∈ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[qrl.last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[qrl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = ps[r].deqID ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].deqID = vs[r].deqID) ∧ (ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = ps[r].val ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].val = vs[r].val) ∧ ( ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = ps[r].next ∨ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][r].next = vs[r].next) |
orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, vs[vs[(r0 ' + rl).last].next].deqID = None, ps[r0].deqID = None, vs[vs[(r0 ' + rl).last].next].next = null, ps[vs[(r0 ' + rl).last].next] = vs[vs[(r0 ' + rl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(r0 ' + rl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(r0 ' + rl).last].next)), vs[(r0 ' + rl).last].next ∈ vs, vs[(r0 ' + rl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next], ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + rl).last].next ≠ r → None = owns(r)) ⊦ (vs[(r0 ' + rl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = ps[r].val ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = ps[r].next ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = vs[r].next)
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 + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s) ⊦ x + a ' + y ≠ []; (s)
| orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, vs[vs[(r0 ' + rl).last].next].deqID = None, ps[r0].deqID = None, vs[vs[(r0 ' + rl).last].next].next = null, ps[vs[(r0 ' + rl).last].next] = vs[vs[(r0 ' + rl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(r0 ' + rl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(r0 ' + rl).last].next)), vs[(r0 ' + rl).last].next ∈ vs, vs[(r0 ' + rl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next], ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + rl).last].next ≠ r → None = owns(r)) ⊦ (vs[(r0 ' + rl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = ps[r].val ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = ps[r].next ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = vs[r].next) |
⊦ y ≠ [] → (x + y).last = y.last
orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, ps[r0].deqID = None, vs[vs[(r0 ' + rl).last].next].deqID = None, vs[vs[(r0 ' + rl).last].next].next = null, ps[vs[(r0 ' + rl).last].next] = vs[vs[(r0 ' + rl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[(r0 ' + rl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(r0 ' + rl).last].next)), r ∈ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(r0 ' + rl).last].next ∈ ps, vs[(r0 ' + rl).last].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + rl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (vs[(r0 ' + rl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = ps[r].val ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = ps[r].next ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = vs[r].next)
orl + r0 ' + rl = rl1 + rl.last ' + rl2, ps[r0].deqID = None, vs[vs[rl.last].next].deqID = None, vs[vs[rl.last].next].next = null, ps[vs[rl.last].next] = vs[vs[rl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[rl.last].next ≠ null, orl ≠ [], rl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp(rl.last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[rl.last].next)), r ∈ ps[rl.last, ps[rl.last].next:= vs[rl.last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[rl.last].next ∈ ps, vs[rl.last].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[rl.last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (vs[rl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].deqID = ps[r].deqID ∨ ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].deqID = vs[r].deqID) ∧ (ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].val = ps[r].val ∨ ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].val = vs[r].val) ∧ (ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].next = ps[r].next ∨ ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].next = vs[r].next)
Used terms: r0 ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl + r0 ' + rl = rl1 + (r0 ' + rl).last ' + rl2, ps[r0].deqID = None, vs[vs[(r0 ' + rl).last].next].deqID = None, vs[vs[(r0 ' + rl).last].next].next = null, ps[vs[(r0 ' + rl).last].next] = vs[vs[(r0 ' + rl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[(r0 ' + rl).last].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp((r0 ' + rl).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(r0 ' + rl).last].next)), r ∈ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(r0 ' + rl).last].next ∈ ps, vs[(r0 ' + rl).last].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + rl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (vs[(r0 ' + rl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = ps[r].val ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = ps[r].next ∨ ps[(r0 ' + rl).last, ps[(r0 ' + rl).last].next:= vs[(r0 ' + rl).last].next][r].next = vs[r].next) |
vs[vs[r0].next].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vs[r0].next].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r0].next ≠ null, orl ≠ [], r0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[r0].next)), r0 ∈ ps, r0 ∈ vs, vs[r0].next ∈ vs, vs[r0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[r0, ps[r0].next:= vs[r0].next], ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[r0].next ≠ r → None = owns(r)) ⊦ (vs[r0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r0, ps[r0].next:= vs[r0].next][r].deqID = ps[r].deqID ∨ ps[r0, ps[r0].next:= vs[r0].next][r].deqID = vs[r].deqID) ∧ (ps[r0, ps[r0].next:= vs[r0].next][r].val = ps[r].val ∨ ps[r0, ps[r0].next:= vs[r0].next][r].val = vs[r].val) ∧ (ps[r0, ps[r0].next:= vs[r0].next][r].next = ps[r].next ∨ ps[r0, ps[r0].next:= vs[r0].next][r].next = vs[r].next)
Used simplifier rules: ⊦ 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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws)
| vs[vs[r0].next].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vs[r0].next].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r0].next ≠ null, orl ≠ [], r0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[r0].next)), r0 ∈ ps, r0 ∈ vs, vs[r0].next ∈ vs, vs[r0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[r0, ps[r0].next:= vs[r0].next], ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[r0].next ≠ r → None = owns(r)) ⊦ (vs[r0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r0, ps[r0].next:= vs[r0].next][r].deqID = ps[r].deqID ∨ ps[r0, ps[r0].next:= vs[r0].next][r].deqID = vs[r].deqID) ∧ (ps[r0, ps[r0].next:= vs[r0].next][r].val = ps[r].val ∨ ps[r0, ps[r0].next:= vs[r0].next][r].val = vs[r].val) ∧ (ps[r0, ps[r0].next:= vs[r0].next][r].next = ps[r].next ∨ ps[r0, ps[r0].next:= vs[r0].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[r0].deqID = None, vs[vs[r0].next].deqID = None, vs[vs[r0].next].next = null, ps[r0].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r0].next ≠ null, orl ≠ [], r ≠ r0, r0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[r0].next)), r ∈ ps[r0, ps[r0].next:= vs[r0].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[r0].next ∈ ps, vs[r0].next ∈ vs, r0 ∈ vs, r0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[r0].next ≠ r → None = owns(r)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ⊦ (vs[r0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, r0, ps[r0].next:= vs[r0].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[r0].deqID = None, vs[vs[r0].next].deqID = None, vs[vs[r0].next].next = null, ps[r0].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r0].next ≠ null, orl ≠ [], r ≠ r0, r0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[r0].next)), r ∈ ps[r0, ps[r0].next:= vs[r0].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[r0].next ∈ ps, vs[r0].next ∈ vs, r0 ∈ vs, r0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[r0].next ≠ r → None = owns(r)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ⊦ (vs[r0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) |
vs[vs[r0].next].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vs[r0].next].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r0].next ≠ null, (vs[r0].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ r0, r0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[r0].next)), r0 ∈ ps, r0 ∈ vs, vs[r0].next ∈ vs, vs[r0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[r0].next ≠ r → None = owns(r)) ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| vs[vs[r0].next].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vs[r0].next].next = null, ps[r0].val = vs[r0].val, ps[vs[r0].next] = vs[vs[r0].next], dom vrvHp = dom prvHp, owns(r0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[r0].next ≠ null, (vs[r0].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ r0, r0 ≠ null, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ', vhead, vs), nonullRetRefs(orl + r0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[r0].next)), r0 ∈ ps, r0 ∈ vs, vs[r0].next ∈ vs, vs[r0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ weak?(vs[r0].deqID), ¬ r0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[r0].next ≠ r → None = owns(r)) ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| orl + r0 ' + rl = rl1 + rl.last ' + rl2, ps[r0].deqID = None, vs[vs[rl.last].next].deqID = None, vs[vs[rl.last].next].next = null, ps[vs[rl.last].next] = vs[vs[rl.last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[rl.last].next ≠ null, orl ≠ [], rl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + rl, vs, ps, owns), listp(rl.last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[rl.last].next)), r ∈ ps[rl.last, ps[rl.last].next:= vs[rl.last].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[rl.last].next ∈ ps, vs[rl.last].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[rl.last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (vs[rl.last].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].deqID = ps[r].deqID ∨ ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].deqID = vs[r].deqID) ∧ (ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].val = ps[r].val ∨ ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].val = vs[r].val) ∧ (ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].next = ps[r].next ∨ ps[rl.last, ps[rl.last].next:= vs[rl.last].next][r].next = vs[r].next) |
orl + r0 ' + rl = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl = rl0 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], rl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)) ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead0, y
| orl + r0 ' + rl = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl = rl0 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], rl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl + r0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + rl, vhead, vs), nonullRetRefs(orl + r0 ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ r0 ∈ orl, ¬ r0 ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)) ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next) |
orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)) ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)) ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[r0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = phead0, rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next)
orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[r0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], r ≠ phead0, r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next)
Used terms: ps, phead0, ps[phead0].next:= vs[phead0].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[r0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = phead0, rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = ps[r].val ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].val = vs[r].val) ∧ (ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = vs[r].next) |
orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, (vs[phead0].next = phead0 ⊃ None;owns(phead0)) ≠ owns(phead0), orl ≠ [], r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ ps, phead0 ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, owns(phead0) = Some(tid0) ∨ owns(phead0) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ phead0 → None = owns(phead0)) ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a ∈ st[a, d]; (s)
| orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, (vs[phead0].next = phead0 ⊃ None;owns(phead0)) ≠ owns(phead0), orl ≠ [], r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, phead0 ∈ ps, phead0 ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, owns(phead0) = Some(tid0) ∨ owns(phead0) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ phead0 → None = owns(phead0)) ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s)
| orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[r0].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, orl ≠ [], r ≠ phead0, r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦ (vs[phead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) |
orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ phead0, r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)) ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| orl + r0 ' + rl0 + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[r0].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ phead0, r0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ r0 ∈ rl0, ¬ r0 ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)) ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[(orl + qrl).last].next ', vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl + vs[(orl + qrl).last].next ', r, vs)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: orl + qrl, tid0, vs, orl + qrl + vs[(orl + qrl).last].next ', vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ 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), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl + vs[(orl + qrl).last].next ', r, vs)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from r, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from r, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next))
vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next ∈ vs ∧ vs[(orl + qrl).last].next ∈ ps ∧ ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps[vs[(orl + qrl).last].next].deqID = None ∧ ps[vs[(orl + qrl).last].next].next = null ∧ weak?(owns(vs[(orl + qrl).last].next)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used terms: orl + qrl, vs, ps, owns
| ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)) |
| vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ r0 ∈ orl + qrl from r, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next ∈ vs ∧ vs[(orl + qrl).last].next ∈ ps ∧ ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps[vs[(orl + qrl).last].next].deqID = None ∧ ps[vs[(orl + qrl).last].next].next = null ∧ weak?(owns(vs[(orl + qrl).last].next)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r0 ∈ orl + qrl from r, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r0 ∈ orl + qrl from r, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ orl + qrl from r, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: orl, qrl + vs[(orl + qrl).last].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, 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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, r0 ∈ orl + qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ orl + qrl from r, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, 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), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: qrl, vs[(orl + qrl).last].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, 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), weak?(owns(vs[(orl + qrl).last].next)), r0 ∈ qrl + vs[(orl + qrl).last].next ' from r, phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r0 ∈ (vs[(orl + qrl).last].next = r ⊃ vs[(orl + qrl).last].next ';[]), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[r0].deqID = Some(tid0), vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, r0 ∈ (vs[(orl + qrl).last].next = r ⊃ vs[(orl + qrl).last].next ';[]), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[(orl + qrl).last].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), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ownsRely(tid0, owns, owns(vs[(orl + qrl).last].next; None)), 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 + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid)
Used terms: tid0, owns, owns(vs[(orl + qrl).last].next; None)
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ vtail ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vtail ∧ vhead ∈ orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ noidRely(tid0, orl + qrl, vs, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs) ∧ ownsRely(tid0, owns, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, 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), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x = x + y ↔ y = []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, 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), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
⊦ y ≠ [] → (x + y).last = y.last
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ qrl.last, orl ≠ [], qrl ≠ [], 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ orl.last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ vhead ∈ orl from vhead ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) list-elem-in1: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ vs; (forward) from specification DMSQ list-elem-in2: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ ps; (forward) from specification DMSQ ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (equalrl(rl, vs, ps, vs, ps[r, ps[r].next:= vs[r].next]) ↔ true); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ orl.last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ vhead ∈ orl from vhead ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦ vhead ∈ orl from vhead ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| dom vrvHp = dom prvHp, orl = orl0 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦ vhead ∈ orl from vhead ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦ vhead ∈ orl0 + phead0 ' from vhead ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦ vhead ∈ orl0 + phead0 ' from vhead ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl0, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0 + phead0 ' from vhead, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl0, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl0, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0 + phead0 ' from vhead, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl0 ≠ [], phead ≠ phead0, phead0 ≠ orl0.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, orl0.last, vs), noid(tid, orl0 + phead0 ', orl0.last, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), phead ∈ orl0, lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ orl0.last ∈ orl0 + phead0 ' from orl0.last, ¬ phead0 ∈ orl0, vs[orl0.last].next ≠ null ∧ vs[vs[orl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl0.last].next].deqID.tid)) = Claimed(vs[vs[orl0.last].next].deqID.tid, vs[vs[orl0.last].next].val) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl0 ≠ [], phead ≠ phead0, phead0 ≠ orl0.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, orl0.last, vs), noid(tid, orl0 + phead0 ', orl0.last, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), phead ∈ orl0, lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ orl0.last ∈ orl0 + phead0 ' from orl0.last, ¬ phead0 ∈ orl0, vs[orl0.last].next ≠ null ∧ vs[vs[orl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl0.last].next].deqID.tid)) = Claimed(vs[vs[orl0.last].next].deqID.tid, vs[vs[orl0.last].next].val) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) 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, phead1, y
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl0, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦
Used terms: ps, ps[lst, ps[lst].next:= vs[lst].next], tid0, owns, vs, owns, vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0 ⊦ |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl0), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl0 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, orl0 + phead0 ', vhead, vs), nonullRetRefs(orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, lst ∈ orl0, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl0), ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0, phead ∈ orl0 ∨ phead = phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ qrl.last, orl ≠ [], qrl ≠ [], 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ qrl.last, orl ≠ [], qrl ≠ [], 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), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ qrl.last, orl ≠ [], qrl ≠ [], 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), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst ∈ qrl, vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ qrl.last, orl ≠ [], qrl ≠ [], 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ qrl.last, orl ≠ [], qrl ≠ [], 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), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0, vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], 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] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0, vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
⊦ y ≠ [] → (x + y).last = y.last
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0 ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ orl0.last, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), vtail = orl0.last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0 ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used terms: vtail0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0 ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ vtail ∈ orl + vtail0 ' from vtail ∧ vhead ∈ orl + vtail0 ' from vhead ∧ equalrl(orl + vtail0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], 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 ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ vtail ∈ orl + vtail0 ' from vtail ∧ vhead ∈ orl + vtail0 ' from vhead ∧ equalrl(orl + vtail0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail ∈ orl + vtail0 ' from vtail, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ equalrl(orl + vtail0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail ∈ orl + vtail0 ' from vtail, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, vs[vtail0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ vtail0, vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ orl.last ∈ orl + vtail0 ' from orl.last, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vtail0].deqID = None, ps[vtail0].deqID = None, vs[vtail0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ vtail0, vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ orl.last ∈ orl + vtail0 ' from orl.last, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, vtail0 ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].next = null ⊦
Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[vtail0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].next = null ⊦ |
ps[vtail0].deqID = None, vs[vtail0].deqID = None, dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].next = null ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail
| ps[vtail0].deqID = None, vs[vtail0].deqID = None, dom vrvHp = dom prvHp, orl = phead0 + orl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl.last ≠ orl.butlast.last, vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ phead0 ', orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + vtail0 ', orl.butlast.last, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ (vtail0 = orl.butlast.last ⊃ orl.butlast.last ';[]), vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].next = null ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ phead0, vs[lst].next ≠ null, lst ≠ vtail0, orl0 ≠ [], phead ≠ orl0.last, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead0 ' + orl0.butlast).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl0.butlast).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ vtail0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (vtail0 = (phead0 ' + orl0.butlast).last ⊃ (phead0 ' + orl0.butlast).last ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), lst = phead0 ∨ lst ∈ orl0, phead = phead0 ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = orl0.last ∧ vs[vtail0].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs[vtail0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl0.last ≠ (phead0 ' + orl0.butlast).last, (phead0 ' + orl0.butlast).last ≠ phead0, vs[lst].next ≠ null, lst ≠ vtail0, orl0 ≠ [], phead ≠ orl0.last, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (phead0 ' + orl0.butlast).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl0.butlast).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), lst ∈ ps, lst ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ vtail0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (vtail0 = (phead0 ' + orl0.butlast).last ⊃ (phead0 ' + orl0.butlast).last ';[]), vs[(phead0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(phead0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(phead0 ' + orl0.butlast).last].next].val), lst = phead0 ∨ lst ∈ orl0, phead = phead0 ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = orl0.last ∧ vs[vtail0].next = null ⊦ |
ps[vtail0].deqID = None, vs[vtail0].deqID = None, dom vrvHp = dom prvHp, orl0 = orl + lst0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[lst].next ≠ null, lst ≠ vtail0, lst0 ≠ (phead0 ' + orl).last, orl0 ≠ [], phead ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ vtail0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ (phead0 ' + orl).last ∈ (vtail0 = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), vtail = vtail0 ∨ vtail = lst0 ∧ vs[vtail0].next = null, phead = phead0 ∨ phead ∈ orl0, lst = phead0 ∨ lst ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, lst0, y
| ps[vtail0].deqID = None, vs[vtail0].deqID = None, dom vrvHp = dom prvHp, orl0 = orl + lst0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[lst].next ≠ null, lst ≠ vtail0, lst0 ≠ (phead0 ' + orl).last, orl0 ≠ [], phead ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((phead0 ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl0) + vtail0 ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ vtail0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ orl0, ¬ (phead0 ' + orl).last ∈ (vtail0 = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), vtail = vtail0 ∨ vtail = lst0 ∧ vs[vtail0].next = null, phead = phead0 ∨ phead ∈ orl0, lst = phead0 ∨ lst ∈ orl0 ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[lst].next ≠ null, lst ≠ vtail0, lst0 ≠ (phead0 ' + orl).last, phead ≠ lst0, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl + lst0 ') + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl + lst0 ') + vtail0 ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl + lst0 ') + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[lst0].deqID), some?(ps[lst0].deqID), lst ∈ ps, lst ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl), ¬ (phead0 ' + orl).last ∈ (vtail0 = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), ¬ lst0 ∈ orl, ¬ phead0 ∈ orl, ¬ vtail0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), vtail = vtail0 ∨ vtail = lst0 ∧ vs[vtail0].next = null, lst = phead0 ∨ lst ∈ orl ∨ lst = lst0, phead = phead0 ∨ phead ∈ orl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[vtail0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl).last ≠ phead0, vs[lst].next ≠ null, lst ≠ vtail0, lst0 ≠ (phead0 ' + orl).last, phead ≠ lst0, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + orl + lst0 ') + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, (phead0 ' + orl).last, vs), noid(tid, (phead0 ' + orl + lst0 ') + vtail0 ', (phead0 ' + orl).last, vs), nonullRetRefs((phead0 ' + orl + lst0 ') + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[lst0].deqID), some?(ps[lst0].deqID), lst ∈ ps, lst ∈ vs, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl), ¬ (phead0 ' + orl).last ∈ (vtail0 = (phead0 ' + orl).last ⊃ (phead0 ' + orl).last ';[]), ¬ lst0 ∈ orl, ¬ phead0 ∈ orl, ¬ vtail0 ∈ orl, ¬ (phead0 ' + orl).last ∈ orl, vs[(phead0 ' + orl).last].next ≠ null ∧ vs[vs[(phead0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(phead0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(phead0 ' + orl).last].next].deqID.tid, vs[vs[(phead0 ' + orl).last].next].val), vtail = vtail0 ∨ vtail = lst0 ∧ vs[vtail0].next = null, lst = phead0 ∨ lst ∈ orl ∨ lst = lst0, phead = phead0 ∨ phead ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: phead0 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ equalrl(orl + vtail0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + vtail0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) ∧ ( vs[(orl + vtail0 ').last].next ≠ null → vs[(orl + vtail0 ').last].next = vs[(orl + vtail0 ').last].next ∧ vs[vs[(orl + vtail0 ').last].next].val = vs[vs[(orl + vtail0 ').last].next].val)), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦
Used terms: ps, orl + vtail0 ', ps[lst, ps[lst].next:= vs[lst].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + vtail0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) ∧ ( vs[(orl + vtail0 ').last].next ≠ null → vs[(orl + vtail0 ').last].next = vs[(orl + vtail0 ').last].next ∧ vs[vs[(orl + vtail0 ').last].next].val = vs[vs[(orl + vtail0 ').last].next].val)), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, r ∈ orl ∨ r = vtail0 ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, r ∈ orl ∨ r = vtail0 ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = lst, rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = vtail0, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next)
Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = lst, rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r = vtail0, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl ∧ r ≠ rl.last → vs[r].next = ps[r].next ∧ vs[r].next ≠ null
Used simplifier rules: ⊦ a ∈ x → a ∈ x + y; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + vtail0 ', owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl ∧ r ≠ rl.last → vs[r].next = ps[r].next ∧ vs[r].next ≠ null |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦
Used terms: ps, ps[lst, ps[lst].next:= vs[lst].next], tid0, owns, vs, owns, vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl ∧ r ≠ rl.last → vs[r].next = ps[r].next ∧ vs[r].next ≠ null
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps[lst, ps[lst].next:= vs[lst].next], r ∈ vs, r ∈ ps, lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + vtail0 ', vs, ps, owns) ∧ lst ∈ orl + vtail0 ' ∧ lst ≠ (orl + vtail0 ').last → vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next)
Used terms: ps, orl + vtail0 ', owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl ∧ r ≠ rl.last → vs[r].next = ps[r].next ∧ vs[r].next ≠ null |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps[lst, ps[lst].next:= vs[lst].next], r ∈ vs, r ∈ ps, lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + vtail0 ', vs, ps, owns) ∧ lst ∈ orl + vtail0 ' ∧ lst ≠ (orl + vtail0 ').last → vs[lst].next = ps[lst].next ∧ vs[lst].next ≠ null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) |
ps[vtail0].deqID = None, vs[lst].next = ps[lst].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= ps[lst].next], ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= ps[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= ps[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= ps[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= ps[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= ps[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= ps[lst].next][r].next = vs[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ a ∈ x → a ∈ x + y; (s)
| ps[vtail0].deqID = None, vs[lst].next = ps[lst].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[lst].next ≠ null, lst ≠ vtail0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= ps[lst].next], ¬ dups(orl), ¬ vtail0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = vtail0 ∨ vtail = orl.last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= ps[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= ps[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= ps[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= ps[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= ps[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= ps[lst].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, lst, ps[lst].next:= ps[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ orl0.last, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), vtail = orl0.last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0 ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ orl0.last, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), vtail = orl0.last ∨ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
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).butlast = a ' + x.butlast; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ orl0.last, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), vtail = orl0.last ∨ vtail = (vtail0 ' + orl0.butlast).last ∧ vs[orl0.last].deqID = None ∧ vs[orl0.last].next = null ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0 ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl0, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl0 ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ vhead ∈ orl + vtail0 ' + orl0 from vhead ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[vtail0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ vtail ∈ orl + vtail0 ' + orl1 + phead0 ' from vtail ∧ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead ∧ equalrl(orl + vtail0 ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], 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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[vtail0].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ⊦ vtail ∈ orl + vtail0 ' + orl1 + phead0 ' from vtail ∧ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead ∧ equalrl(orl + vtail0 ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[phead0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ vtail ∈ orl + vtail0 ' + orl1 + phead0 ' from vtail ∧ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead ∧ equalrl(orl + vtail0 ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| ps[phead0].deqID = None, ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, lst ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + vtail0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ vtail ∈ orl + vtail0 ' + orl1 + phead0 ' from vtail ∧ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead ∧ equalrl(orl + vtail0 ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ vtail ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vtail ∧ vhead ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vhead ∧ equalrl((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ vtail ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vtail ∧ vhead ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vhead ∧ equalrl((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ vtail ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vtail, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ vhead ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vhead, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ equalrl((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ vtail ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vtail, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl1).last ≠ phead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ (ps[vhead0].next ' + orl1).last ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from (ps[vhead0].next ' + orl1).last, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)
| vs[phead0].deqID = None, ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (ps[vhead0].next ' + orl1).last ≠ phead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ (ps[vhead0].next ' + orl1).last ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from (ps[vhead0].next ' + orl1).last, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl1.last ≠ phead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ orl1.last ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from orl1.last, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[vhead0].next ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl1.last ≠ phead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ orl1.last ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from orl1.last, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (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: orl1, lst0, y
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ vhead ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' from vhead, ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: orl0 + vhead0 ', ps[vhead0].next ' + orl1 + phead0 ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ equalrl((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) ∧ ( vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next ≠ null → vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next = vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next ∧ vs[vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next].val = vs[vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next].val)), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦
Used terms: ps, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', ps[lst, ps[lst].next:= vs[lst].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) ∧ ( vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next ≠ null → vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next = vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next ∧ vs[vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next].val = vs[vs[((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ').last].next].val)), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ |
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, r ∈ orl0 ∨ r = vhead0 ∨ r = ps[vhead0].next ∨ r ∈ orl1 ∨ r = phead0 ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, r ∈ orl0 ∨ r = vhead0 ∨ r = ps[vhead0].next ∨ r ∈ orl1 ∨ r = phead0 ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = lst, rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl0 ∨ r = vhead0 ∨ r = ps[vhead0].next ∨ r ∈ orl1 ∨ r = phead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next)
Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = lst, rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl0 ∨ r = vhead0 ∨ r = ps[vhead0].next ∨ r ∈ orl1 ∨ r = phead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) |
ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s)
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl ∧ r ≠ rl.last → vs[r].next = ps[r].next ∧ vs[r].next ≠ null
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl ∧ r ≠ rl.last → vs[r].next = ps[r].next ∧ vs[r].next ≠ null |
| ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, phead ∈ orl0 ∨ phead = vhead0, lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1 ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦
Used terms: ps, ps[lst, ps[lst].next:= vs[lst].next], tid0, owns, vs, owns, vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ ps[vhead0].next ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ vhead0 ∈ orl0, ¬ ps[vhead0].next ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ |
ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, ps[vhead0].next ≠ phead0, ps[vhead0].next ≠ vhead0, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ ps[vhead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[lst].next ≠ null, ps[vhead0].next ≠ phead0, ps[vhead0].next ≠ vhead0, lst ≠ phead0, phead0 ≠ vhead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + ps[vhead0].next ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, vretRefs(tid) ∈ vrvHp, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ ps[vhead0].next ∈ orl1, ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ ps[vhead0].next ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl0 ∨ lst = vhead0 ∨ lst = ps[vhead0].next ∨ lst ∈ orl1, phead ∈ orl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = (ps[vhead0].next ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
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.