| ⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ 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.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns) |
ls.nxt = gs.vs[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E14, a) = E15, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], 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), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E14, 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.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns)
| ls.nxt = gs.vs[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E14, a) = E15, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], 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), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E14, 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.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, 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, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns) |
ls.nxt = gs.vs[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], 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), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), 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.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ 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] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ 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, E14, 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 + gs.vs[ls.lst].next ;gs.qrl )) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(gs.vs[ls.lst].next; 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, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, E14, a) = E15; (s)
| ls.nxt = gs.vs[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], 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), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), 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.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ 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, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ 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), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ 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), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ 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), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ 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), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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)) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = vs[lst].next, owns(node) = Some(tid), ¬ success, node ≠ null, nxt ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = vs[lst].next, owns(node) = Some(tid), ¬ success, node ≠ null, nxt ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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)) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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))
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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)) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, lst = (orl + qrl).last, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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))
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, lst = (orl + qrl).last, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(orl + qrl).last].next ≠ null, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ 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 ⊦ 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(orl + qrl).last].next ≠ null, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ 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 ⊦ 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)) |
⊦ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(orl + qrl).last].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ 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 + 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) ⊦ 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 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(orl + qrl).last].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ 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 + 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) ⊦ 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)) |
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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)) |
⊦ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ 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))
orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, node ≠ null, node ≠ qrl.last, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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 = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, qrl.last ∈ orl ∨ qrl.last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl + vs[qrl.last].next ' from vtail ∧ vhead ∈ orl + qrl + vs[qrl.last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[qrl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[qrl.last].next; None))
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], orl + qrl ≠ [], vs[(orl + qrl).last].next ≠ null, node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ 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.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, owns(node) = Some(tid), vs[orl.last].next ≠ null, node ≠ null, node ≠ orl.last, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl.last ' + 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ orl.last ∈ orl + vs[orl.last].next ' from orl.last ∧ vhead ∈ orl + vs[orl.last].next ' from vhead ∧ equalrl(orl, vs, ps, vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None)) ∧ noidRely(tid0, orl, vs, orl + vs[orl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[orl.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 + [] = x; (s) ⊦ [] + x = x; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp([], vs); (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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, owns(node) = Some(tid), vs[orl.last].next ≠ null, node ≠ null, node ≠ orl.last, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl.last ' + 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[orl.last].next)), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ orl.last ∈ orl + vs[orl.last].next ' from orl.last ∧ vhead ∈ orl + vs[orl.last].next ' from vhead ∧ equalrl(orl, vs, ps, vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None)) ∧ noidRely(tid0, orl, vs, orl + vs[orl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[orl.last].next; None)) |
vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ phead0 ∈ orl + vs[phead0].next ' from phead0 ∧ vhead ∈ orl + vs[phead0].next ' from vhead ∧ equalrl(orl, vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ noidRely(tid0, orl, vs, orl + vs[phead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[phead0].next; None))
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ phead0 ∈ orl + vs[phead0].next ' from phead0 ∧ vhead ∈ orl + vs[phead0].next ' from vhead ∧ equalrl(orl, vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ noidRely(tid0, orl, vs, orl + vs[phead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[phead0].next; None)) |
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead ∈ rl ∨ phead = phead0 ⊦ vhead ∈ (rl + phead0 ') + vs[phead0].next ' from vhead ∧ equalrl(rl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ noidRely(tid0, rl + phead0 ', vs, (rl + phead0 ') + vs[phead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[phead0].next; None))
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead ∈ rl ∨ phead = phead0 ⊦ vhead ∈ (rl + phead0 ') + vs[phead0].next ' from vhead ∧ equalrl(rl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ noidRely(tid0, rl + phead0 ', vs, (rl + phead0 ') + vs[phead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[phead0].next; None)) |
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ vhead ∈ (rl + phead0 ') + vs[phead0].next ' from vhead, ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ equalrl(rl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ noidRely(tid0, rl + phead0 ', vs, (rl + phead0 ') + vs[phead0].next ', vs), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ ownsRely(tid0, owns, owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
| 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ vhead ∈ (rl + phead0 ') + vs[phead0].next ' from vhead, ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead ≠ phead0, phead0 ≠ rl.last, phead0 ≠ null, rl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, rl.last, vs), noid(tid, rl + phead0 ', rl.last, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead ∈ rl, phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ rl.last ∈ (rl + phead0 ') + vs[phead0].next ' from rl.last, ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[rl.last].next ≠ null ∧ vs[vs[rl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl.last].next].deqID.tid)) = Claimed(vs[vs[rl.last].next].deqID.tid, vs[vs[rl.last].next].val) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead ≠ phead0, phead0 ≠ rl.last, phead0 ≠ null, rl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, rl.last, vs), noid(tid, rl + phead0 ', rl.last, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead ∈ rl, phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ rl.last ∈ (rl + phead0 ') + vs[phead0].next ' from rl.last, ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[rl.last].next ≠ null ∧ vs[vs[rl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl.last].next].deqID.tid)) = Claimed(vs[vs[rl.last].next].deqID.tid, vs[vs[rl.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: rl, node0, y
| 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ equalrl(rl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
⊦ 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 = 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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), ∃ r. ¬ ( r ∈ rl + phead0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next) ∧ ( vs[(rl + phead0 ').last].next ≠ null → vs[(rl + phead0 ').last].next = vs[(rl + phead0 ').last].next ∧ vs[vs[(rl + phead0 ').last].next].val = vs[vs[(rl + phead0 ').last].next].val)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦
Used terms: ps, rl + phead0 ', ps[phead0, ps[phead0].next:= vs[phead0].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 = 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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), ∃ r. ¬ ( r ∈ rl + phead0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next) ∧ ( vs[(rl + phead0 ').last].next ≠ null → vs[(rl + phead0 ').last].next = vs[(rl + phead0 ').last].next ∧ vs[vs[(rl + phead0 ').last].next].val = vs[vs[(rl + phead0 ').last].next].val)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦ |
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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, r ∈ rl ∨ r = phead0 ⊦ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].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)
| 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, r ∈ rl ∨ r = phead0 ⊦ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.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))
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[phead0].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next] ∧ vs[r] = vs[r] ∧ (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, 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].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ owns(vs[phead0].next; None)(r) = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦
Used terms: ps, ps[phead0, ps[phead0].next:= vs[phead0].next], tid0, owns, vs, owns(vs[phead0].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)) |
| 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[phead0].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next] ∧ vs[r] = vs[r] ∧ (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, 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].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ owns(vs[phead0].next; None)(r) = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦ |
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl, ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, 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: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl, ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, phead0 ≠ null, r ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl, ¬ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, 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[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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, phead0 ≠ null, r ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl, ¬ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, 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[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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), node ≠ phead0, node ≠ null, phead0 ≠ null, r ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl, ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), node ≠ phead0, node ≠ null, phead0 ≠ null, r ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl, ¬ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[phead0].next ≠ r → None = owns(r)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ noidRely(tid0, rl + phead0 ', vs, (rl + phead0 ') + vs[phead0].next ', vs), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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), ∃ r. ¬(noid(tid0, rl + phead0 ', r, vs) → noid(tid0, (rl + phead0 ') + vs[phead0].next ', r, vs)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦
Used terms: rl + phead0 ', tid0, vs, (rl + phead0 ') + vs[phead0].next ', vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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), ∃ r. ¬(noid(tid0, rl + phead0 ', r, vs) → noid(tid0, (rl + phead0 ') + vs[phead0].next ', r, vs)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid0, rl + phead0 ', r, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ (rl + phead0 ') + vs[phead0].next ' from r, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r0 ∈ rl + phead0 ' 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), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
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[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid0, rl + phead0 ', r, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ (rl + phead0 ') + vs[phead0].next ' from r, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r0 ∈ rl + phead0 ' 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), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ r, tid ≠ tid0, 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), noid(tid0, rl + phead0 ', r, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r0 ∈ (rl + phead0 ') + vs[phead0].next ' from r, phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ rl + phead0 ', ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r0 ∈ rl + phead0 ' 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), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) Used terms: rl + phead0 ', vs[phead0].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ r, tid ≠ tid0, 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), noid(tid0, rl + phead0 ', r, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r0 ∈ (rl + phead0 ') + vs[phead0].next ' from r, phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ rl + phead0 ', ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r0 ∈ rl + phead0 ' 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), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r ≠ phead0, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid0, rl + phead0 ', r, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ (vs[phead0].next = r ⊃ vs[phead0].next ';[]), ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r ≠ phead0, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid0, rl + phead0 ', r, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ (vs[phead0].next = r ⊃ vs[phead0].next ';[]), ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ ownsRely(tid0, owns, owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ 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, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ |
⊦ 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[phead0].next; None)
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
| orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, node ≠ null, node ≠ qrl.last, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[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 = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, qrl.last ∈ orl ∨ qrl.last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl + vs[qrl.last].next ' from vtail ∧ vhead ∈ orl + qrl + vs[qrl.last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[qrl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[qrl.last].next; None)) |
orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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) ⊦ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.last ∧ vhead ∈ orl + qrl + vs[qrl.last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[qrl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[qrl.last].next; None))
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), orl + qrl ≠ [], vs[qrl.last].next ≠ null, node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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) ⊦ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.last ∧ vhead ∈ orl + qrl + vs[qrl.last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[qrl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[qrl.last].next; None)) |
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + rl, orl + qrl ≠ [], vs[qrl.last].next ≠ null, node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.last ∧ vhead ∈ orl + qrl + vs[qrl.last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[qrl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[qrl.last].next; None))
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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + rl, orl + qrl ≠ [], vs[qrl.last].next ≠ null, node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.last ∧ vhead ∈ orl + qrl + vs[qrl.last].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[qrl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[qrl.last].next; None)) |
orl + phead0 ' + rl = rl1 + (phead0 ' + rl).last ' + rl2, vs[vs[(phead0 ' + rl).last].next].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + rl).last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[(phead0 ' + rl).last].next] = vs[vs[(phead0 ' + rl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(phead0 ' + rl).last].next ≠ null, node ≠ null, node ≠ (phead0 ' + rl).last, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + rl, vs, ps, owns), listp((phead0 ' + rl).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(phead0 ' + rl).last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[(phead0 ' + rl).last].next ∈ ps, vs[(phead0 ' + rl).last].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (phead0 ' + rl).last ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from (phead0 ' + rl).last ∧ vhead ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next], owns(vs[(phead0 ' + rl).last].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(phead0 ' + rl).last].next; 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] ⊦ 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); (ss) ⊦ 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 + phead0 ' + rl = rl1 + (phead0 ' + rl).last ' + rl2, vs[vs[(phead0 ' + rl).last].next].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + rl).last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[(phead0 ' + rl).last].next] = vs[vs[(phead0 ' + rl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(phead0 ' + rl).last].next ≠ null, node ≠ null, node ≠ (phead0 ' + rl).last, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + rl, vs, ps, owns), listp((phead0 ' + rl).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(phead0 ' + rl).last].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[(phead0 ' + rl).last].next ∈ ps, vs[(phead0 ' + rl).last].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (phead0 ' + rl).last ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from (phead0 ' + rl).last ∧ vhead ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next], owns(vs[(phead0 ' + rl).last].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(phead0 ' + rl).last].next; None)) |
⊦ y ≠ [] → (x + y).last = y.last
orl + phead0 ' + rl = rl1 + (phead0 ' + rl).last ' + rl2, ps[phead0].deqID = None, vs[vs[(phead0 ' + rl).last].next].deqID = None, vs[vs[(phead0 ' + rl).last].next].next = null, ps[vs[(phead0 ' + rl).last].next] = vs[vs[(phead0 ' + rl).last].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = [], vs[(phead0 ' + rl).last].next ≠ null, node ≠ null, node ≠ (phead0 ' + rl).last, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + rl).last ' + rl2, vs, ps, owns), listp(orl + phead0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(phead0 ' + rl).last].next)), vs[(phead0 ' + rl).last].next ∈ vs, vs[(phead0 ' + rl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (phead0 ' + rl).last ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from (phead0 ' + rl).last ∧ vhead ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next], owns(vs[(phead0 ' + rl).last].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(phead0 ' + rl).last].next; None))
orl + phead0 ' + rl = rl1 + rl.last ' + rl2, ps[phead0].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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[rl.last].next ≠ null, node ≠ null, node ≠ rl.last, node ≠ phead0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl.last ' + rl2, vs, ps, owns), listp(orl + phead0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[rl.last].next)), vs[rl.last].next ∈ vs, vs[rl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ rl.last ∈ orl + (phead0 ' + rl) + vs[rl.last].next ' from rl.last ∧ vhead ∈ orl + (phead0 ' + rl) + vs[rl.last].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[rl.last, ps[rl.last].next:= vs[rl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[rl.last, ps[rl.last].next:= vs[rl.last].next], owns(vs[rl.last].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[rl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[rl.last].next; None))
Used terms: phead0 ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl + phead0 ' + rl = rl1 + (phead0 ' + rl).last ' + rl2, ps[phead0].deqID = None, vs[vs[(phead0 ' + rl).last].next].deqID = None, vs[vs[(phead0 ' + rl).last].next].next = null, ps[vs[(phead0 ' + rl).last].next] = vs[vs[(phead0 ' + rl).last].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = [], vs[(phead0 ' + rl).last].next ≠ null, node ≠ null, node ≠ (phead0 ' + rl).last, node ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((phead0 ' + rl).last ' + rl2, vs, ps, owns), listp(orl + phead0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[(phead0 ' + rl).last].next)), vs[(phead0 ' + rl).last].next ∈ vs, vs[(phead0 ' + rl).last].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ (phead0 ' + rl).last ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from (phead0 ' + rl).last ∧ vhead ∈ orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next]) ∧ equalowns (vs, ps, owns, tid0, vs, ps[(phead0 ' + rl).last, ps[(phead0 ' + rl).last].next:= vs[(phead0 ' + rl).last].next], owns(vs[(phead0 ' + rl).last].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[(phead0 ' + rl).last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[(phead0 ' + rl).last].next; None)) |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ vhead ∈ orl + phead0 ' + vs[phead0].next ' from vhead ∧ equalrl(orl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ noidRely(tid0, orl + phead0 ', vs, orl + phead0 ' + vs[phead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[phead0].next; None))
Used simplifier rules: ⊦ ¬ 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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws)
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ vhead ∈ orl + phead0 ' + vs[phead0].next ' from vhead ∧ equalrl(orl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ noidRely(tid0, orl + phead0 ', vs, orl + phead0 ' + vs[phead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[phead0].next; None)) |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ vhead ∈ orl + phead0 ' + vs[phead0].next ' from vhead, ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ equalrl(orl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ noidRely(tid0, orl + phead0 ', vs, orl + phead0 ' + vs[phead0].next ', vs), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ ownsRely(tid0, owns, owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ vhead ∈ orl + phead0 ' + vs[phead0].next ' from vhead, ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ vhead ∈ orl, ¬ vhead ∈ orl + phead0 ' + vs[phead0].next ' from vhead, ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].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, phead0 ' + vs[phead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ vhead ∈ orl, ¬ vhead ∈ orl + phead0 ' + vs[phead0].next ' from vhead, ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, orl.last ≠ orl.butlast.last, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ phead0 ' + vs[phead0].next ' from 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) ⊦
Used simplifier rules: ⊦ ¬ weak?(None); (s) ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, orl.last ≠ orl.butlast.last, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ phead0 ' + vs[phead0].next ' from 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) ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = node0 + orl0, owns(phead0) = None, owns(node) = Some(tid), orl.last ≠ orl.butlast.last, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ node0 ', orl ≠ [], phead ≠ orl.last, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ phead0 ' + vs[phead0].next ' from 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) ⊦
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, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = node0 + orl0, owns(phead0) = None, owns(node) = Some(tid), orl.last ≠ orl.butlast.last, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ node0 ', orl ≠ [], phead ≠ orl.last, phead0 ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ orl.butlast.last ∈ orl, ¬ orl.butlast.last ∈ phead0 ' + vs[phead0].next ' from 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) ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, orl0.last ≠ (node0 ' + orl0.butlast).last, (node0 ' + orl0.butlast).last ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ node0, orl0 ≠ [], phead ≠ orl0.last, phead0 ≠ null, phead0 ≠ node0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((node0 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (node0 ' + orl0.butlast).last, vs), noid(tid, (node0 ' + orl0) + phead0 ', (node0 ' + orl0.butlast).last, vs), nonullRetRefs((node0 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ node0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, ¬ (node0 ' + orl0.butlast).last ∈ orl0, ¬ (node0 ' + orl0.butlast).last ∈ phead0 ' + vs[phead0].next ' from (node0 ' + orl0.butlast).last, vs[(node0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(node0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(node0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(node0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(node0 ' + orl0.butlast).last].next].val), phead = node0 ∨ 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[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, orl0.last ≠ (node0 ' + orl0.butlast).last, (node0 ' + orl0.butlast).last ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ node0, orl0 ≠ [], phead ≠ orl0.last, phead0 ≠ null, phead0 ≠ node0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((node0 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, (node0 ' + orl0.butlast).last, vs), noid(tid, (node0 ' + orl0) + phead0 ', (node0 ' + orl0.butlast).last, vs), nonullRetRefs((node0 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ node0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, ¬ (node0 ' + orl0.butlast).last ∈ orl0, ¬ (node0 ' + orl0.butlast).last ∈ phead0 ' + vs[phead0].next ' from (node0 ' + orl0.butlast).last, vs[(node0 ' + orl0.butlast).last].next ≠ null ∧ vs[vs[(node0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(node0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(node0 ' + orl0.butlast).last].next].deqID.tid, vs[vs[(node0 ' + orl0.butlast).last].next].val), phead = node0 ∨ phead ∈ orl0 ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl + node1 ', owns(phead0) = None, owns(node) = Some(tid), (node0 ' + orl).last ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ node0, node1 ≠ (node0 ' + orl).last, orl0 ≠ [], phead ≠ node1, phead0 ≠ null, phead0 ≠ node0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (node0 ' + orl).last, vs), noid(tid, (node0 ' + orl0) + phead0 ', (node0 ' + orl).last, vs), nonullRetRefs((node0 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0), ¬ node0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, ¬ (node0 ' + orl).last ∈ orl0, ¬ (node0 ' + orl).last ∈ phead0 ' + vs[phead0].next ' from (node0 ' + orl).last, vs[(node0 ' + orl).last].next ≠ null ∧ vs[vs[(node0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(node0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(node0 ' + orl).last].next].deqID.tid, vs[vs[(node0 ' + orl).last].next].val), phead = node0 ∨ phead ∈ orl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, node1, y
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl0 = orl + node1 ', owns(phead0) = None, owns(node) = Some(tid), (node0 ' + orl).last ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ node0, node1 ≠ (node0 ' + orl).last, orl0 ≠ [], phead ≠ node1, phead0 ≠ null, phead0 ≠ node0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + orl0) + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, (node0 ' + orl).last, vs), noid(tid, (node0 ' + orl0) + phead0 ', (node0 ' + orl).last, vs), nonullRetRefs((node0 ' + orl0) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl0), ¬ node0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ node ∈ orl0, ¬ (node0 ' + orl).last ∈ orl0, ¬ (node0 ' + orl).last ∈ phead0 ' + vs[phead0].next ' from (node0 ' + orl).last, vs[(node0 ' + orl).last].next ≠ null ∧ vs[vs[(node0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(node0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(node0 ' + orl).last].next].deqID.tid, vs[vs[(node0 ' + orl).last].next].val), phead = node0 ∨ phead ∈ orl0 ⊦ |
vs[phead0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, (node0 ' + orl).last ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ node0, node ≠ node1, node0 ≠ node1, node1 ≠ (node0 ' + orl).last, phead ≠ node1, phead0 ≠ null, phead0 ≠ node0, phead0 ≠ node1, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((node0 ' + orl + node1 ') + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, (node0 ' + orl).last, vs), noid(tid, (node0 ' + orl + node1 ') + phead0 ', (node0 ' + orl).last, vs), nonullRetRefs((node0 ' + orl + node1 ') + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), some?(vs[node1].deqID), some?(ps[node1].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ (node0 ' + orl).last ∈ phead0 ' + vs[phead0].next ' from (node0 ' + orl).last, ¬ node1 ∈ orl, ¬ node0 ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ (node0 ' + orl).last ∈ orl, vs[(node0 ' + orl).last].next ≠ null ∧ vs[vs[(node0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(node0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(node0 ' + orl).last].next].deqID.tid, vs[vs[(node0 ' + orl).last].next].val), phead = node0 ∨ 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[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, (node0 ' + orl).last ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ node0, node ≠ node1, node0 ≠ node1, node1 ≠ (node0 ' + orl).last, phead ≠ node1, phead0 ≠ null, phead0 ≠ node0, phead0 ≠ node1, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((node0 ' + orl + node1 ') + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, (node0 ' + orl).last, vs), noid(tid, (node0 ' + orl + node1 ') + phead0 ', (node0 ' + orl).last, vs), nonullRetRefs((node0 ' + orl + node1 ') + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), some?(vs[node1].deqID), some?(ps[node1].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ (node0 ' + orl).last ∈ phead0 ' + vs[phead0].next ' from (node0 ' + orl).last, ¬ node1 ∈ orl, ¬ node0 ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ (node0 ' + orl).last ∈ orl, vs[(node0 ' + orl).last].next ≠ null ∧ vs[vs[(node0 ' + orl).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(node0 ' + orl).last].next].deqID.tid)) = Claimed(vs[vs[(node0 ' + orl).last].next].deqID.tid, vs[vs[(node0 ' + orl).last].next].val), phead = node0 ∨ 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: node0 ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ equalrl(orl + phead0 ', vs, ps, vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
⊦ 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[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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 + phead0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next) ∧ ( vs[(orl + phead0 ').last].next ≠ null → vs[(orl + phead0 ').last].next = vs[(orl + phead0 ').last].next ∧ vs[vs[(orl + phead0 ').last].next].val = vs[vs[(orl + phead0 ').last].next].val)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used terms: ps, orl + phead0 ', ps[phead0, ps[phead0].next:= vs[phead0].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[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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 + phead0 ' → vs[r].val = vs[r].val ∧ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next) ∧ ( vs[(orl + phead0 ').last].next ≠ null → vs[(orl + phead0 ').last].next = vs[(orl + phead0 ').last].next ∧ vs[vs[(orl + phead0 ').last].next].val = vs[vs[(orl + phead0 ').last].next].val)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None, r ∈ orl ∨ r = phead0 ⊦ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].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[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None, r ∈ orl ∨ r = phead0 ⊦ ps[r].val = ps[phead0, ps[phead0].next:= vs[phead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[phead0, ps[phead0].next:= vs[phead0].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) Used terms: ps, phead0, ps[phead0].next:= vs[phead0].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
⊦ 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[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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(vs[phead0].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next] ∧ vs[r] = vs[r] ∧ (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, 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].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ owns(vs[phead0].next; None)(r) = owns(r)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used terms: ps, ps[phead0, ps[phead0].next:= vs[phead0].next], tid0, owns, vs, owns(vs[phead0].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[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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(vs[phead0].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next] ∧ vs[r] = vs[r] ∧ (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, 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].deqID = ps[r].deqID ∨ ps[phead0, ps[phead0].next:= vs[phead0].next][r].deqID = vs[r].deqID) ∧ owns(vs[phead0].next; None)(r) = owns(r)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ orl, ¬ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ ps, r ∈ vs, r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ orl, ¬ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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) |
⊦ a ≠ b → st[b, d][a] = st[a]
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, orl ≠ [], phead0 ≠ null, r ≠ phead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ orl, ¬ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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[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] |
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ phead0, node ≠ null, orl ≠ [], phead0 ≠ null, r ≠ phead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), r ∈ ps[phead0, ps[phead0].next:= vs[phead0].next], r ∈ vs, r ∈ ps, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ orl, ¬ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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[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[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), node ≠ phead0, node ≠ null, orl ≠ [], phead0 ≠ null, r ≠ phead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ orl, ¬ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, (vs[phead0].next = r ⊃ None;owns(r)) ≠ owns(r), node ≠ phead0, node ≠ null, orl ≠ [], phead0 ≠ null, r ≠ phead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ orl, ¬ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ noidRely(tid0, orl + phead0 ', vs, orl + phead0 ' + vs[phead0].next ', vs), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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. ¬(noid(tid0, orl + phead0 ', r, vs) → noid(tid0, orl + phead0 ' + vs[phead0].next ', r, vs)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used terms: orl + phead0 ', tid0, vs, orl + phead0 ' + vs[phead0].next ', vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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. ¬(noid(tid0, orl + phead0 ', r, vs) → noid(tid0, orl + phead0 ' + vs[phead0].next ', r, vs)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ orl + phead0 ' + vs[phead0].next ' from r, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ orl + phead0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
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)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ orl + phead0 ' + vs[phead0].next ' from r, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ orl + phead0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', r, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), r0 ∈ orl + phead0 ' + vs[phead0].next ' from r, phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ orl + phead0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
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) ⊦ a ∈ b ' ↔ a = b; (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, phead0 ' + vs[phead0].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', r, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), r0 ∈ orl + phead0 ' + vs[phead0].next ' from r, phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ orl + phead0 ' 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ phead0 ' + vs[phead0].next ' from r, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ (phead0 = r ⊃ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
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)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ phead0 ' + vs[phead0].next ' from r, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ (phead0 = r ⊃ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', r, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), r0 ∈ phead0 ' + vs[phead0].next ' from r, phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ phead0 ', ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ (phead0 = r ⊃ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ None ≠ Some(tid); (s) Used terms: phead0 ', vs[phead0].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', r, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[phead0].next)), r0 ∈ phead0 ' + vs[phead0].next ' from r, phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ phead0 ', ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ orl, ¬ r0 ∈ (phead0 = r ⊃ 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r ≠ phead0, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ (vs[phead0].next = r ⊃ vs[phead0].next ';[]), ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ 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)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, r ≠ phead0, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, r0 ∈ (vs[phead0].next = r ⊃ vs[phead0].next ';[]), ¬ dups(orl), ¬ weak?(vs[phead0].deqID), ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], phead0 ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ ownsRely(tid0, owns, owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ orl, ¬ node ∈ 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[phead0].deqID = None ⊦ |
⊦ 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[phead0].next; None)
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
| orl + phead0 ' + rl = rl1 + rl.last ' + rl2, ps[phead0].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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[rl.last].next ≠ null, node ≠ null, node ≠ rl.last, node ≠ phead0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl.last ' + rl2, vs, ps, owns), listp(orl + phead0 ' + rl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[rl.last].next)), vs[rl.last].next ∈ vs, vs[rl.last].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ rl.last ∈ orl + (phead0 ' + rl) + vs[rl.last].next ' from rl.last ∧ vhead ∈ orl + (phead0 ' + rl) + vs[rl.last].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[rl.last, ps[rl.last].next:= vs[rl.last].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[rl.last, ps[rl.last].next:= vs[rl.last].next], owns(vs[rl.last].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[rl.last].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[rl.last].next; None)) |
orl + phead0 ' + rl = rl1 + vhead0 ' + rl2, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = rl0 + vhead0 ', vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + rl, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vhead0 ∈ orl + (phead0 ' + rl) + vs[vhead0].next ' from vhead0 ∧ vhead ∈ orl + (phead0 ' + rl) + vs[vhead0].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], owns(vs[vhead0].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[vhead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[vhead0].next; None))
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead0, y
| orl + phead0 ' + rl = rl1 + vhead0 ' + rl2, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = rl0 + vhead0 ', vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + rl, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + rl, vhead, vs), nonullRetRefs(orl + phead0 ' + rl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∧ unmarkedp(rl, vs) ⊦ vhead0 ∈ orl + (phead0 ' + rl) + vs[vhead0].next ' from vhead0 ∧ vhead ∈ orl + (phead0 ' + rl) + vs[vhead0].next ' from vhead ∧ equalrl(orl + phead0 ' + rl, vs, ps, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], owns(vs[vhead0].next; None)) ∧ noidRely(tid0, orl + phead0 ' + rl, vs, orl + (phead0 ' + rl) + vs[vhead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[vhead0].next; None)) |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ vhead ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from vhead ∧ equalrl(rl1 + vhead0 ' + rl2, vs, ps, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], owns(vs[vhead0].next; None)) ∧ noidRely(tid0, rl1 + vhead0 ' + rl2, vs, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[vhead0].next; None))
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] ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ 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 + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ vhead ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from vhead ∧ equalrl(rl1 + vhead0 ' + rl2, vs, ps, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], owns(vs[vhead0].next; None)) ∧ noidRely(tid0, rl1 + vhead0 ' + rl2, vs, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[vhead0].next; None)) |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from vhead, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ equalrl(rl1 + vhead0 ' + rl2, vs, ps, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next]), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], owns(vs[vhead0].next; None)), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ noidRely(tid0, rl1 + vhead0 ' + rl2, vs, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', vs), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ ownsRely(tid0, owns, owns(vs[vhead0].next; None)), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from vhead, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ orl, ¬ vhead ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from vhead, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].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, (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ orl, ¬ vhead ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from vhead, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ phead0 ' + rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ phead0 ' + rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ phead0 ', ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ phead0 ' + rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead0 ', rl0 + vhead0 ' + vs[vhead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ phead0 ', ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ phead0 ' + rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].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: rl0, vhead0 ' + vs[vhead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ rl0 + vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ vhead0 ', ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0 ', vs[vhead0].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ vhead0 ', ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ vhead0 ' + vs[vhead0].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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[vhead0].next = vhead ⊃ vs[vhead0].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), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[vhead0].next = vhead ⊃ vs[vhead0].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), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ vhead, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ [], ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ vhead, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ [], ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ vhead, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ vhead, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, vhead ≠ phead0, vhead ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ vhead ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, 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 ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ 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, node0, y
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ equalrl(rl1 + vhead0 ' + rl2, vs, ps, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next]), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ 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))
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 ∈ rl1 + vhead0 ' + rl2 → vs[r].val = vs[r].val ∧ ps[r].val = ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next) ∧ ( vs[(rl1 + vhead0 ' + rl2).last].next ≠ null → vs[(rl1 + vhead0 ' + rl2).last].next = vs[(rl1 + vhead0 ' + rl2).last].next ∧ vs[vs[(rl1 + vhead0 ' + rl2).last].next].val = vs[vs[(rl1 + vhead0 ' + rl2).last].next].val)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used terms: ps, rl1 + vhead0 ' + rl2, ps[vhead0, ps[vhead0].next:= vs[vhead0].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)) |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 ∈ rl1 + vhead0 ' + rl2 → vs[r].val = vs[r].val ∧ ps[r].val = ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next) ∧ ( vs[(rl1 + vhead0 ' + rl2).last].next ≠ null → vs[(rl1 + vhead0 ' + rl2).last].next = vs[(rl1 + vhead0 ' + rl2).last].next ∧ vs[vs[(rl1 + vhead0 ' + rl2).last].next].val = vs[vs[(rl1 + vhead0 ' + rl2).last].next].val)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, r ∈ rl1 ∨ r = vhead0 ∨ r ∈ rl2 ⊦ ps[r].val = ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, r ∈ rl1 ∨ r = vhead0 ∨ r ∈ rl2 ⊦ ps[r].val = ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), r = vhead0, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 ∈ rl1 ∨ r = vhead0 ∨ r ∈ rl2, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ ps[r].val = ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next)
Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), r = vhead0, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 ∈ rl1 ∨ r = vhead0 ∨ r ∈ rl2, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ ps[r].val = ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val ∧ (ps[r].deqID ≠ None → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next) |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).val = nd.val; (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl = rl + node0 ', owns(node) = Some(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, node0, y
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, orl = rl + node0 ', owns(node) = Some(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
(rl + node0 ') + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, tid ≠ tid0, vhead0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, phead ∈ rl ∨ phead = node0 ⊦
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 ∈ 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)
| (rl + node0 ') + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, tid ≠ tid0, vhead0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, phead ∈ rl ∨ phead = node0 ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
rl + node0 ' + phead0 ' + rl0 = (rl1 + vhead0 ' + rl2).butlast, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (rl1 + vhead0 ' + rl2).last, rl1 + vhead0 ' + rl2 ≠ [], vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, tid ≠ tid0, vhead0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl + node0 ' + phead0 ' + rl0, vhead0, rl1 + vhead0 ' + rl2
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| rl + node0 ' + phead0 ' + rl0 = (rl1 + vhead0 ' + rl2).butlast, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (rl1 + vhead0 ' + rl2).last, rl1 + vhead0 ' + rl2 ≠ [], vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, tid ≠ tid0, vhead0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
rl + node0 ' + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, tid ≠ tid0, vhead0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, phead ∈ rl ∨ phead = node0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| rl + node0 ' + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, tid ≠ tid0, vhead0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, phead ∈ rl ∨ phead = node0 ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
rl + node0 ' + phead0 ' + rl0 = rl1 + vhead0 ' + rl2.butlast, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, rl2 ≠ [], tid ≠ tid0, vhead0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ 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: vhead0 ', rl2
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| rl + node0 ' + phead0 ' + rl0 = rl1 + vhead0 ' + rl2.butlast, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, ps[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, rl2 ≠ [], tid ≠ tid0, vhead0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
rl + node0 ' + phead0 ' + rl0 = rl1 + rl2.last ' + rl2.butlast, ps[rl2.last].deqID = None, vs[vs[rl2.last].next].deqID = None, ps[phead0].deqID = None, vs[vs[rl2.last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2.last ≠ node0, ps[rl2.last].next ≠ null, vs[rl2.last].next ≠ ps[rl2.last].next, vs[rl2.last].next ≠ null, node ≠ node0, node ≠ null, node ≠ rl2.last, node ≠ phead0, phead0 ≠ node0, phead0 ≠ rl2.last, rl2 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + rl2.last ' + rl2, vs, ps, owns), listp(rl2.last ' + rl2, vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl2.last ' + rl2, vhead, vs), nonullRetRefs(rl1 + rl2.last ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[rl2.last].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[rl2.last].next ∈ ps, vs[rl2.last].next ∈ vs, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ rl2.last ∈ rl, ¬ rl2.last ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ 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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[rl2.last].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[rl2.last].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| rl + node0 ' + phead0 ' + rl0 = rl1 + rl2.last ' + rl2.butlast, ps[rl2.last].deqID = None, vs[vs[rl2.last].next].deqID = None, ps[phead0].deqID = None, vs[vs[rl2.last].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2.last ≠ node0, ps[rl2.last].next ≠ null, vs[rl2.last].next ≠ ps[rl2.last].next, vs[rl2.last].next ≠ null, node ≠ node0, node ≠ null, node ≠ rl2.last, node ≠ phead0, phead0 ≠ node0, phead0 ≠ rl2.last, rl2 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + rl2.last ' + rl2, vs, ps, owns), listp(rl2.last ' + rl2, vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl2.last ' + rl2, vhead, vs), nonullRetRefs(rl1 + rl2.last ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[rl2.last].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[rl2.last].next ∈ ps, vs[rl2.last].next ∈ vs, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ rl2.last ∈ rl, ¬ rl2.last ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ 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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[rl2.last].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[rl2.last].deqID = None ⊦ |
rl + node0 ' + phead0 ' + rl0 = rl1 + vhead0 ' + rl3, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl3 + vhead0 ', ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ vhead0, node ≠ phead0, phead0 ≠ node0, phead0 ≠ vhead0, rl2 ≠ [], tid ≠ tid0, vhead0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, phead ∈ rl ∨ phead = node0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, vhead0, y
| rl + node0 ' + phead0 ' + rl0 = rl1 + vhead0 ' + rl3, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl3 + vhead0 ', ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ vhead0, node ≠ phead0, phead0 ≠ node0, phead0 ≠ vhead0, rl2 ≠ [], tid ≠ tid0, vhead0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ 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), node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, phead ∈ rl ∨ phead = node0 ⊦ |
rl + node0 ' + phead0 ' + rl0 = rl1 + vhead0 ' + rl3, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ vhead0, node ≠ phead0, phead0 ≠ node0, phead0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl3 + vhead0 ', vs, ps, owns), listp(vhead0 ' + rl3 + vhead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl3 + vhead0 ', vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl3 + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
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) ⊦ x + a ' ≠ []; (s)
| rl + node0 ' + phead0 ' + rl0 = rl1 + vhead0 ' + rl3, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[vhead0].next ≠ null, vs[vhead0].next ≠ ps[vhead0].next, vs[vhead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ vhead0, node ≠ phead0, phead0 ≠ node0, phead0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl3 + vhead0 ', vs, ps, owns), listp(vhead0 ' + rl3 + vhead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl3 + vhead0 ', vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl3 + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[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 = node0, node0 = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ node0 ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ listp(rl, vs, ps, owns) → ¬ dups(rl)
Used simplifier rules: ⊦ dups(a ' + x) ↔ a ∈ x ∨ 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] Used terms: owns, vhead0 ' + rl3 + vhead0 ', vs, ps
| ⊦ listp(rl, vs, ps, owns) → ¬ dups(rl) |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], owns(vs[vhead0].next; None)), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ 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))
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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(vs[vhead0].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next] ∧ vs[r] = vs[r] ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = vs[r].next) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = ps[r].val ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = vs[r].val) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = vs[r].deqID) ∧ owns(vs[vhead0].next; None)(r) = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used terms: ps, ps[vhead0, ps[vhead0].next:= vs[vhead0].next], tid0, owns, vs, owns(vs[vhead0].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)) |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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(vs[vhead0].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next] ∧ vs[r] = vs[r] ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = vs[r].next) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = ps[r].val ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = vs[r].val) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = vs[r].deqID) ∧ owns(vs[vhead0].next; None)(r) = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, r ∈ ps, r ∈ vs, r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next], ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ (vs[vhead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = vs[r].deqID) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = ps[r].val ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = vs[r].val) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, r ∈ ps, r ∈ vs, r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next], ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ (vs[vhead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = vs[r].deqID) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = ps[r].val ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = vs[r].val) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = vhead0, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next], r ∈ vs, r ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ r → None = owns(r)) ⊦ (vs[vhead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = vs[r].deqID) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = ps[r].val ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = vs[r].val) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = vs[r].next)
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next], r ∈ vs, r ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ r → None = owns(r)) ⊦ (vs[vhead0].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, vhead0, ps[vhead0].next:= vs[vhead0].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = vhead0, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next], r ∈ vs, r ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ r → None = owns(r)) ⊦ (vs[vhead0].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = ps[r].deqID ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].deqID = vs[r].deqID) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = ps[r].val ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].val = vs[r].val) ∧ (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = ps[r].next ∨ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][r].next = vs[r].next) |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, (vs[vhead0].next = vhead0 ⊃ None;owns(vhead0)) ≠ owns(vhead0), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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(vhead0) = Some(tid0) ∨ owns(vhead0) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ vhead0 → None = owns(vhead0)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
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 + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, (vs[vhead0].next = vhead0 ⊃ None;owns(vhead0)) ≠ owns(vhead0), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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(vhead0) = Some(tid0) ∨ owns(vhead0) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ vhead0 → None = owns(vhead0)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
orl + phead0 ' + rl0 = (rl1 + vhead0 ' + rl2).butlast, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (rl1 + vhead0 ' + rl2).last, rl1 + vhead0 ' + rl2 ≠ [], vs[vhead0].next ≠ null, (vs[vhead0].next = vhead0 ⊃ None;owns(vhead0)) ≠ owns(vhead0), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ vs, vhead0 ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, owns(vhead0) = Some(tid0) ∨ owns(vhead0) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ vhead0 → None = owns(vhead0)) ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl + phead0 ' + rl0, vhead0, rl1 + vhead0 ' + rl2
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| orl + phead0 ' + rl0 = (rl1 + vhead0 ' + rl2).butlast, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (rl1 + vhead0 ' + rl2).last, rl1 + vhead0 ' + rl2 ≠ [], vs[vhead0].next ≠ null, (vs[vhead0].next = vhead0 ⊃ None;owns(vhead0)) ≠ owns(vhead0), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ vs, vhead0 ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, owns(vhead0) = Some(tid0) ∨ owns(vhead0) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ vhead0 → None = owns(vhead0)) ⊦ |
orl + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, (vs[vhead0].next = vhead0 ⊃ None;owns(vhead0)) ≠ owns(vhead0), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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(vhead0) = Some(tid0) ∨ owns(vhead0) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ vhead0 → None = owns(vhead0)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| orl + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, (vs[vhead0].next = vhead0 ⊃ None;owns(vhead0)) ≠ owns(vhead0), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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(vhead0) = Some(tid0) ∨ owns(vhead0) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ vhead0 → None = owns(vhead0)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ a ∈ []; (s) ⊦ None ≠ Some(tid); (s) Used terms: vhead0 ', rl2
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r ∈ ps[vhead0, ps[vhead0].next:= vs[vhead0].next], r ∈ vs, r ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vhead0].next ≠ r → None = owns(r)) ⊦ (vs[vhead0].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 + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, (vs[vhead0].next = r ⊃ None;owns(r)) ≠ owns(r), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, (vs[vhead0].next = r ⊃ None;owns(r)) ≠ owns(r), node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, r ∈ vs, r ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ ¬ weak?(Some(tid)); (s)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ noidRely(tid0, rl1 + vhead0 ' + rl2, vs, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', vs), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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. ¬(noid(tid0, rl1 + vhead0 ' + rl2, r, vs) → noid(tid0, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', r, vs)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used terms: rl1 + vhead0 ' + rl2, tid0, vs, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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. ¬(noid(tid0, rl1 + vhead0 ' + rl2, r, vs) → noid(tid0, orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ', r, vs)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
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)
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
orl + phead0 ' + rl0 = (rl1 + vhead0 ' + rl2).butlast, vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (rl1 + vhead0 ' + rl2).last, rl1 + vhead0 ' + rl2 ≠ [], vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl + phead0 ' + rl0, vhead0, rl1 + vhead0 ' + rl2
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| orl + phead0 ' + rl0 = (rl1 + vhead0 ' + rl2).butlast, vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (rl1 + vhead0 ' + rl2).last, rl1 + vhead0 ' + rl2 ≠ [], vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
orl + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)
| orl + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
orl + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = [], vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead0 ', rl2
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| orl + phead0 ' + rl0 = rl1 + (vhead0 ' + rl2).butlast, vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[vhead0].next].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = [], vhead0 = (vhead0 ' + rl2).last, vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), listp(vhead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), noid(tid0, rl1 + vhead0 ' + rl2, r, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ orl, ¬ r0 ∈ rl1 + vhead0 ' + rl2 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r0 ∈ (orl + phead0 ' + rl0) + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + [] = x; (s) ⊦ ¬ 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) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)
| vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r0 ∈ (orl + phead0 ' + rl0) + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ orl + phead0 ' + rl0, ¬ r0 ∈ (orl + phead0 ' + rl0) + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, r ∈ orl + phead0 ' + rl0, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r0 ∈ (orl + phead0 ' + rl0 from r) + vhead0 ', ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used terms: orl + phead0 ' + rl0, vhead0 ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ orl + phead0 ' + rl0, ¬ r0 ∈ (orl + phead0 ' + rl0) + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ phead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ vhead0 ' + vs[vhead0].next ' from r, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r ∈ orl, ¬ r ∈ rl0, ¬ r0 ∈ (vhead0 = r ⊃ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
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) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ phead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ vhead0 ' + vs[vhead0].next ' from r, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r ∈ orl, ¬ r ∈ rl0, ¬ r0 ∈ (vhead0 = r ⊃ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ phead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r0 ∈ vhead0 ' + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ vhead0 ', ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r ∈ orl, ¬ r ∈ rl0, ¬ r0 ∈ (vhead0 = r ⊃ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ None ≠ Some(tid); (s) Used terms: vhead0 ', vs[vhead0].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ phead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), r0 ∈ vhead0 ' + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ vhead0 ', ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r ∈ orl, ¬ r ∈ rl0, ¬ r0 ∈ (vhead0 = r ⊃ 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ phead0, r ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ (vs[vhead0].next = r ⊃ vs[vhead0].next ';[]), ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r ∈ orl, ¬ r ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ 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[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r ≠ phead0, r ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ (vs[vhead0].next = r ⊃ vs[vhead0].next ';[]), ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r ∈ orl, ¬ r ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, r ∈ orl + phead0 ' + rl0, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r0 ∈ (orl + phead0 ' + rl0 from r) + vhead0 ', ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, r0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r0 ∈ orl + phead0 ' + rl0 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, r ∈ orl ∨ r = phead0 ∨ r ∈ rl0 ⊦
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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, r0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r0 ∈ orl + phead0 ' + rl0 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, r ∈ orl ∨ r = phead0 ∨ r ∈ rl0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, r0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r0 ∈ orl + phead0 ' + rl0 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), r ∈ orl ∨ r = phead0 ∨ r ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦
Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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, phead0 ' + rl0, r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[vhead0].deqID = None, vs[r0].deqID = Some(tid0), vs[vs[vhead0].next].next = null, ps[vhead0].next = null, ps[vhead0].val = vs[vhead0].val, ps[vs[vhead0].next] = vs[vs[vhead0].next], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vhead0) = None, vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, r0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, r0 ∈ orl + (phead0 ' + rl0 + vhead0 ') + vs[vhead0].next ' from r, vhead0 ∈ vs, vhead0 ∈ ps, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r0 ∈ orl + phead0 ' + rl0 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), r ∈ orl ∨ r = phead0 ∨ r ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
vs[r0].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, r0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ phead0 ' + rl0 + vhead0 ' + vs[vhead0].next ' from r, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r0 ∈ phead0 ' + rl0 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, r = phead0 ∨ r ∈ rl0 ⊦
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), ps[vhead0].deqID = None, vs[vs[vhead0].next].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[vs[vhead0].next].next = null, ps[vhead0].val = vs[vhead0].val, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), ps[vs[vhead0].next] = vs[vs[vhead0].next], dom vrvHp = dom prvHp, owns(vhead0) = None, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ null, node ≠ vhead0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead0, r0 ≠ r, r0 ≠ vhead0, tid ≠ tid0, vhead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + phead0 ' + rl0) + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, (orl + phead0 ' + rl0) + vhead0 ', vhead, vs), noid(tid0, (orl + phead0 ' + rl0) + vhead0 ', r, vs), nonullRetRefs((orl + phead0 ' + rl0) + vhead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, vhead0 ∈ ps, vhead0 ∈ vs, r0 ∈ phead0 ' + rl0 + vhead0 ' + vs[vhead0].next ' from r, ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0), ¬ weak?(vs[vhead0].deqID), ¬ r ∈ orl, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl0, ¬ r0 ∈ phead0 ' + rl0 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 ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None, r = phead0 ∨ r ∈ rl0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) Used terms: phead0 ', rl0 + vhead0 ' + vs[vhead0].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| orl + phead0 ' + rl0 + vhead0 ' = rl1 + vhead0 ' + rl2, 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], ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[vhead0].next ≠ null, node ≠ phead0, node ≠ vhead0, node ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead0 ' + rl2, vs, ps, owns), listp(rl1 + vhead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + vhead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + vhead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[vhead0].next)), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ ownsRely(tid0, owns, owns(vs[vhead0].next; None)), ¬ node ∈ rl0, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ 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[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[vhead0].deqID = None ⊦ |
⊦ 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[vhead0].next; None)
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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)
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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)
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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 |
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, orl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ orl.last, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ node ∈ 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)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ orl.last, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ node ∈ 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) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = orl0 + phead0 ', owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ node ∈ 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
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = orl0 + phead0 ', owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ node ∈ 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) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ node ∈ 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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ node ∈ 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) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl0, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0 + phead0 ' from vhead, ¬ phead0 ∈ orl0, ¬ node ∈ 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[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, node ∈ vs, 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, ¬ node ∈ 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[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl0, lst ∈ vs, lst ∈ ps, ¬ dups(orl0), ¬ vhead ∈ orl0 + phead0 ' from vhead, ¬ phead0 ∈ orl0, ¬ node ∈ 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 ⊦ |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, orl0 ≠ [], phead ≠ phead0, phead0 ≠ orl0.last, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ orl0.last ∈ orl0 + phead0 ' from orl0.last, ¬ phead0 ∈ orl0, ¬ node ∈ 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)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, orl0 ≠ [], phead ≠ phead0, phead0 ≠ orl0.last, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ orl0.last ∈ orl0 + phead0 ' from orl0.last, ¬ phead0 ∈ orl0, ¬ node ∈ 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
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, node ∈ vs, 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, ¬ node ∈ 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))
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ node ∈ 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)) |
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ phead0, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ node ∈ 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 ⊦ |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ phead0, node ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl0), ¬ node ∈ 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)
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ phead0, node ≠ null, tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), 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, node ∈ vs, node ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl0), ¬ node ∈ 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] |
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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) |
vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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)
| vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = vtail0 + orl0, vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = vtail0 + orl0, vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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) ⊦ 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)
| ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl0 = [], owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ orl0.last, node ≠ null, node ≠ vtail0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl0 = [], owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + orl0).last, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vtail ∈ orl + vtail0 ' from vtail, ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ equalrl(orl + vtail0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vtail ∈ orl + vtail0 ' from vtail, ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), orl.last ≠ vtail0, vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ orl.last ∈ orl + vtail0 ' from orl.last, ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), orl.last ≠ vtail0, vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ orl.last ∈ orl + vtail0 ' from orl.last, ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = orl0 + phead0 ', owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, ¬ node ∈ 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 = phead0 ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = orl0 + phead0 ', owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vhead ∈ orl + vtail0 ' from vhead, ¬ vtail0 ∈ orl, ¬ node ∈ 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 = phead0 ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦ |
vs[vtail0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl0 ≠ [], phead ≠ phead0, phead0 ≠ orl0.last, tid ≠ tid0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, orl0.last, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', orl0.last, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), phead ∈ orl0, lst ∈ ps, lst ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ orl0.last ∈ (orl0 + phead0 ') + vtail0 ' from orl0.last, ¬ vtail0 ∈ orl0, ¬ node ∈ 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), vtail = vtail0 ∨ vtail = phead0 ∧ vs[vtail0].next = null, lst ∈ orl0 ∨ lst = phead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl0 ≠ [], phead ≠ phead0, phead0 ≠ orl0.last, tid ≠ tid0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, orl0.last, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', orl0.last, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), phead ∈ orl0, lst ∈ ps, lst ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ orl0.last ∈ (orl0 + phead0 ') + vtail0 ' from orl0.last, ¬ vtail0 ∈ orl0, ¬ node ∈ 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), vtail = vtail0 ∨ vtail = phead0 ∧ vs[vtail0].next = null, lst ∈ orl0 ∨ lst = phead0 ⊦ |
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 ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ 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
| ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ equalrl(orl + vtail0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = lst, vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = lst, vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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 → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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 ' → (∃ rl1, rl2. orl + vtail0 ' = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), 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 ', owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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 ' → (∃ rl1, rl2. orl + vtail0 ' = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, node ≠ lst, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), markedp(rl1, ps), markedp(orl0, ps), markedp(rl1, vs), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ vs, lst ∈ ps, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ 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 ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ y → a ∈ x + y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ a ∈ x → a ∈ x + y; (s)
| ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, node ≠ lst, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), markedp(rl1, ps), markedp(orl0, ps), markedp(rl1, vs), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ vs, lst ∈ ps, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ 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 ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s)
| ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ vtail0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, 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), ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, 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), ¬ node ∈ 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) |
ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[lst], nxt0 = vs[lst].next, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps[lst, mk(val, opttid, nxt0)], r ∈ vs, r ∈ ps, lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ node ∈ 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), 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, mk(val, opttid, nxt0)][r].deqID = ps[r].deqID ∨ ps[lst, mk(val, opttid, nxt0)][r].deqID = vs[r].deqID) ∧ (ps[lst, mk(val, opttid, nxt0)][r].val = ps[r].val ∨ ps[lst, mk(val, opttid, nxt0)][r].val = vs[r].val) ∧ (ps[lst, mk(val, opttid, nxt0)][r].next = ps[r].next ∨ ps[lst, mk(val, opttid, nxt0)][r].next = vs[r].next)
| ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[lst], nxt0 = vs[lst].next, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ ps[lst, mk(val, opttid, nxt0)], r ∈ vs, r ∈ ps, lst ∈ ps, lst ∈ vs, lst ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl), ¬ node ∈ 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), 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, mk(val, opttid, nxt0)][r].deqID = ps[r].deqID ∨ ps[lst, mk(val, opttid, nxt0)][r].deqID = vs[r].deqID) ∧ (ps[lst, mk(val, opttid, nxt0)][r].val = ps[r].val ∨ ps[lst, mk(val, opttid, nxt0)][r].val = vs[r].val) ∧ (ps[lst, mk(val, opttid, nxt0)][r].next = ps[r].next ∨ ps[lst, mk(val, opttid, nxt0)][r].next = vs[r].next) |
ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[lst], owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, opttid ≠ None, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, mk(val, opttid, vs[lst].next)], ¬ dups(orl), ¬ node ∈ 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, mk(val, opttid, vs[lst].next)][r].deqID = ps[r].deqID ∨ ps[lst, mk(val, opttid, vs[lst].next)][r].deqID = vs[r].deqID) ∧ (ps[lst, mk(val, opttid, vs[lst].next)][r].val = ps[r].val ∨ ps[lst, mk(val, opttid, vs[lst].next)][r].val = vs[r].val) ∧ (ps[lst, mk(val, opttid, vs[lst].next)][r].next = ps[r].next ∨ ps[lst, mk(val, opttid, vs[lst].next)][r].next = vs[r].next)
Used simplifier rules: marked-elem-f: ⊦ markedp(rl, vs) ∧ r ∈ rl ∧ vs[r] = mk(val, opttid, nxt) → opttid ≠ None; (forward) from specification DMSQ
| ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mk(val, opttid, nxt) = ps[lst], owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ null, opttid ≠ None, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, lst ∈ orl, lst ∈ vs, lst ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, mk(val, opttid, vs[lst].next)], ¬ dups(orl), ¬ node ∈ 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, mk(val, opttid, vs[lst].next)][r].deqID = ps[r].deqID ∨ ps[lst, mk(val, opttid, vs[lst].next)][r].deqID = vs[r].deqID) ∧ (ps[lst, mk(val, opttid, vs[lst].next)][r].val = ps[r].val ∨ ps[lst, mk(val, opttid, vs[lst].next)][r].val = vs[r].val) ∧ (ps[lst, mk(val, opttid, vs[lst].next)][r].next = ps[r].next ∨ ps[lst, mk(val, opttid, 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) ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).val = val; (s) Used terms: ps, lst, mk(val, opttid, vs[lst].next), r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ orl0.last, node ≠ null, node ≠ vtail0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ orl0.last, node ≠ null, node ≠ vtail0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ orl0.last, node ≠ null, node ≠ vtail0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl0, ¬ node ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vtail ∈ orl + vtail0 ' + orl1 + phead0 ' from vtail, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ equalrl(orl + vtail0 ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vtail ∈ orl + vtail0 ' + orl1 + phead0 ' from vtail, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦ |
vs[phead0].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + orl1).last ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (vtail0 ' + orl1).last ∈ orl + vtail0 ' + orl1 + phead0 ' from (vtail0 ' + orl1).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1 ⊦
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[vtail0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), (vtail0 ' + orl1).last ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (vtail0 ' + orl1).last ∈ orl + vtail0 ' + orl1 + phead0 ' from (vtail0 ' + orl1).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(orl1, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), orl1.last ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], orl1 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + vtail0 ' + orl1 + phead0 ' from orl1.last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].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) ⊦ 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: vtail0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), orl1.last ≠ phead0, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], orl1 ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + vtail0 ' + orl1 + phead0 ' from orl1.last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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, vhead0, y
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl, ¬ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ⊦
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 ' + orl1 + phead0 ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl, ¬ vhead ∈ orl + vtail0 ' + orl1 + phead0 ' from vhead, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ⊦ |
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ vtail0 ' + orl1 + phead0 ' 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].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)
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ vtail0 ' + orl1 + phead0 ' 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ vtail0 ', ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ vtail0 ' + orl1 + phead0 ' 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 = 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 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vtail0 ', orl1 + phead0 ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ vtail0 ', ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ vtail0 ' + orl1 + phead0 ' 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 = 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 ⊦ |
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1 + phead0 ' 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1 + phead0 ' 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1 + phead0 ' 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 = 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 ⊦
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: orl1, phead0 ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ orl1 + phead0 ' 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 = 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 ⊦ |
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ (phead0 = vhead ⊃ 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦
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)
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ vhead ∈ orl, ¬ vhead ∈ (phead0 = vhead ⊃ 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ |
ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead, tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ [], ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ 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 = 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 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)
| ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead, tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ [], ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ 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 = 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 ⊦ |
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead, tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], phead0 ≠ vhead, tid ≠ tid0, vhead ≠ vtail0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vhead ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ orl1, ¬ 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 ∧ 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, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ orl1, vtail = phead0 ∨ vtail = (vtail0 ' + orl1).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ |
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, vhead0, y
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ equalrl(orl + vtail0 ' + orl1 + phead0 ', vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦ |
⊦ 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, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ∈ orl + vtail0 ' + 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[(orl + vtail0 ' + orl1 + phead0 ').last].next ≠ null → vs[(orl + vtail0 ' + orl1 + phead0 ').last].next = vs[(orl + vtail0 ' + orl1 + phead0 ').last].next ∧ vs[vs[(orl + vtail0 ' + orl1 + phead0 ').last].next].val = vs[vs[(orl + vtail0 ' + orl1 + phead0 ').last].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 ⊦
Used terms: ps, orl + vtail0 ' + 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[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ∈ orl + vtail0 ' + 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[(orl + vtail0 ' + orl1 + phead0 ').last].next ≠ null → vs[(orl + vtail0 ' + orl1 + phead0 ').last].next = vs[(orl + vtail0 ' + orl1 + phead0 ').last].next ∧ vs[vs[(orl + vtail0 ' + orl1 + phead0 ').last].next].val = vs[vs[(orl + vtail0 ' + orl1 + phead0 ').last].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 ⊦ |
ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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, r ∈ orl ∨ r = vtail0 ∨ 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[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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, r ∈ orl ∨ r = vtail0 ∨ 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[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = lst, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ∈ orl ∨ r = vtail0 ∨ r ∈ orl1 ∨ r = phead0, 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 ⊦ 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, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = lst, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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 ∈ orl ∨ r = vtail0 ∨ r ∈ orl1 ∨ r = phead0, 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 ⊦ 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[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦
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[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns) ∧ lst ∈ orl + vtail0 ' + orl1 + phead0 ' → (∃ rl1, rl2. orl + vtail0 ' + orl1 + phead0 ' = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), 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 ⊦
Used terms: ps, orl + vtail0 ' + orl1 + phead0 ', owns, lst, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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), listp(orl + vtail0 ' + orl1 + phead0 ', vs, ps, owns) ∧ lst ∈ orl + vtail0 ' + orl1 + phead0 ' → (∃ rl1, rl2. orl + vtail0 ' + orl1 + phead0 ' = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), 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 ⊦ |
orl + vtail0 ' + orl1 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦
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) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ y → a ∈ x + y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| orl + vtail0 ' + orl1 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, vs[lst].next ≠ ps[lst].next, ps[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦ |
Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s)
| ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ 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 ⊦ |
⊦ 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, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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)), 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 ⊦
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, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ vtail0, node ≠ phead0, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ orl1, ¬ node ∈ orl, ¬ node ∈ 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)), 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 ⊦ |
ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ node ∈ orl1, ¬ node ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ phead0 ∈ orl1, ¬ 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), 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, 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, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, orl ≠ [], tid ≠ tid0, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ node ∈ orl1, ¬ node ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ orl, ¬ phead0 ∈ orl1, ¬ 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), 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, 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.