| ⊦ ( 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)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) |
dom gs.vrvHp = dom gs.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)
| dom gs.vrvHp = dom gs.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns) |
dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], r ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.ps, r ∈ gs.vs, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ (∃ rl. gs.orl + gs.qrl + rl = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)) ∧ (∃ rl0. gs.orl + rl0 = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl)) ∧ gs.vtail ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) from gs.vtail ∧ gs.phead ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) from gs.phead ∧ gs.vhead ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID], gs.owns) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ x + a = x + a '; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], r ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.ps, r ∈ gs.vs, gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ (∃ rl. gs.orl + gs.qrl + rl = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)) ∧ (∃ rl0. gs.orl + rl0 = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl)) ∧ gs.vtail ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) from gs.vtail ∧ gs.phead ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) from gs.phead ∧ gs.vhead ∈ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID], gs.owns) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), gs.vs) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs) |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs) |
dom vrvHp = dom prvHp, r = qrl.head, vs[qrl.head].deqID ≠ None, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs)
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used formulas: qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
| dom vrvHp = dom prvHp, r = qrl.head, vs[qrl.head].deqID ≠ None, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs) |
dom vrvHp = dom prvHp, vs[qrl.head].deqID ≠ None, qrl.head ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), qrl.head ∈ ps, qrl.head ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, 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 ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID], owns)
Used simplifier rules: ⊦ noidRely(tid, rl, vs, rl, vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → x.head ' + x.tail = x; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| dom vrvHp = dom prvHp, vs[qrl.head].deqID ≠ None, qrl.head ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), qrl.head ∈ ps, qrl.head ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, 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 ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[qrl.head, ps[qrl.head].deqID:= vs[qrl.head].deqID], owns) |
dom vrvHp = dom prvHp, qrl = vtail0 + orl0, vs[vtail0].deqID ≠ None, orl ≠ [], qrl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, 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[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns)
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| dom vrvHp = dom prvHp, qrl = vtail0 + orl0, vs[vtail0].deqID ≠ None, orl ≠ [], qrl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(orl0, 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[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ orl.last ∈ orl + vtail0 ' + orl0 from orl.last ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], 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) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, vs[orl.last].next ≠ null ∧ vs[vs[orl.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.last].next].deqID.tid)) = Claimed(vs[vs[orl.last].next].deqID.tid, vs[vs[orl.last].next].val), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ orl.last ∈ orl + vtail0 ' + orl0 from orl.last ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) |
ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl = orl1 + phead0 ', vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ phead0 ∈ orl + vtail0 ' + orl0 from phead0 ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[vtail0].deqID = None, dom vrvHp = dom prvHp, orl = orl1 + phead0 ', vs[vtail0].deqID ≠ None, orl ≠ [], vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vtail0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (vtail0 ' + orl0).last ∨ vtail = (orl + (vtail0 ' + orl0).butlast).last ∧ vs[(vtail0 ' + orl0).last].deqID = None ∧ vs[(vtail0 ' + orl0).last].next = null ⊦ vtail ∈ orl + vtail0 ' + orl0 from vtail ∧ phead0 ∈ orl + vtail0 ' + orl0 from phead0 ∧ equalrl(orl + vtail0 ' + orl0, vs, ps, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail0, ps[vtail0].deqID:= vs[vtail0].deqID], owns) |
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ vtail ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from vtail ∧ equalrl((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ vtail ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from vtail ∧ equalrl((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], owns) |
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ vtail ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from vtail, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null ⊦
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ equalrl((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID]), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null ⊦
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], owns), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null ⊦
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ vtail ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from vtail, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ vtail ∈ orl1 + phead0 ', ¬ vtail ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from vtail, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: orl1 + phead0 ', ps[phead0].next ' + orl0, vtail
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ vtail ∈ orl1 + phead0 ', ¬ vtail ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from vtail, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ |
vs[(ps[phead0].next ' + orl0).last].deqID = None, ps[ps[phead0].next].deqID = None, vs[(ps[phead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ (ps[phead0].next ' + orl0).last, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from 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[(ps[phead0].next ' + orl0).last].deqID = None, ps[ps[phead0].next].deqID = None, vs[(ps[phead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ (ps[phead0].next ' + orl0).last, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[ps[phead0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ orl0.last, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: ps[phead0].next ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[ps[phead0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ orl0.last, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ orl1, ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦ |
vs[orl0.last].deqID = None, ps[ps[phead0].next].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (ps[phead0].next ' + orl0.butlast).last ≠ orl0.last, (ps[phead0].next ' + orl0.butlast).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl0.butlast).last ∈ orl1, ¬ (ps[phead0].next ' + orl0.butlast).last ∈ ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl0.butlast).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| vs[orl0.last].deqID = None, ps[ps[phead0].next].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (ps[phead0].next ' + orl0.butlast).last ≠ orl0.last, (ps[phead0].next ' + orl0.butlast).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl0.butlast).last ∈ orl1, ¬ (ps[phead0].next ' + orl0.butlast).last ∈ ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl0.butlast).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦ |
ps[ps[phead0].next].deqID = None, vs[phead1].deqID = None, vs[phead1].next = null, dom vrvHp = dom prvHp, orl0 = orl + phead1 ', vs[ps[phead0].next].deqID ≠ None, (ps[phead0].next ' + orl).last ≠ phead1, (ps[phead0].next ' + orl).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead1, y
| ps[ps[phead0].next].deqID = None, vs[phead1].deqID = None, vs[phead1].next = null, dom vrvHp = dom prvHp, orl0 = orl + phead1 ', vs[ps[phead0].next].deqID ≠ None, (ps[phead0].next ' + orl).last ≠ phead1, (ps[phead0].next ' + orl).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl).last, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦ |
vs[phead1].deqID = None, ps[ps[phead0].next].deqID = None, ps[phead1].deqID = None, vs[phead1].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (ps[phead0].next ' + orl).last ≠ phead1, (ps[phead0].next ' + orl).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, phead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ ps[phead0].next ' + orl + phead1 ' from (ps[phead0].next ' + orl).last, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl1, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ phead0 ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦
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 ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[phead1].deqID = None, ps[ps[phead0].next].deqID = None, ps[phead1].deqID = None, vs[phead1].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, (ps[phead0].next ' + orl).last ≠ phead1, (ps[phead0].next ' + orl).last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, phead0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ ps[phead0].next ' + orl + phead1 ' from (ps[phead0].next ' + orl).last, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl1, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ phead0 ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead1].deqID = None, ps[ps[phead0].next].deqID = None, vs[phead1].deqID = None, vs[phead1].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, orl.last ≠ phead1, orl.last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl ≠ [], phead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ orl.last ∈ orl1, ¬ orl.last ∈ ps[phead0].next ' + orl + phead1 ' from orl.last, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl1, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ phead0 ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[phead0].next ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead1].deqID = None, ps[ps[phead0].next].deqID = None, vs[phead1].deqID = None, vs[phead1].next = null, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, orl.last ≠ phead1, orl.last ≠ phead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, orl ≠ [], phead0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + phead1 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ orl.last ∈ orl1, ¬ orl.last ∈ ps[phead0].next ' + orl + phead1 ' from orl.last, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl1, ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ phead0 ∈ orl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0 ⊦ |
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 ∈ 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: orl, phead2, y
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ equalrl((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID]), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].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[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), ∃ r. ¬ ( r ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 → vs[r].val = vs[r].val ∧ ps[r].val = ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next) ∧ ( vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next ≠ null → vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next = vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next ∧ vs[vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next].val = vs[vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next].val)), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦
Used terms: ps, (orl1 + phead0 ') + ps[phead0].next ' + orl0, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], 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[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), ∃ r. ¬ ( r ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 → vs[r].val = vs[r].val ∧ ps[r].val = ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next) ∧ ( vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next ≠ null → vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next = vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next ∧ vs[vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next].val = vs[vs[((orl1 + phead0 ') + ps[phead0].next ' + orl0).last].next].val)), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ |
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, r ∈ orl1 ∨ r = phead0 ∨ r = ps[phead0].next ∨ r ∈ orl0 ⊦ ps[r].val = ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val ∧ (ps[r].deqID ≠ None → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, r ∈ orl1 ∨ r = phead0 ∨ r = ps[phead0].next ∨ r ∈ orl0 ⊦ ps[r].val = ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val ∧ (ps[r].deqID ≠ None → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ (nd.deqID:= opttid).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, ps[phead0].next ∈ vs, ps[phead0].next ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], owns), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), phead ∈ orl1 ∨ phead = phead0, vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].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[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID] ∧ vs[r] = vs[r] ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = vs[r].next) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = ps[r].val ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = vs[r].val) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦
Used terms: ps, ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], 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[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ phead0, ps[phead0].next ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl1, ¬ ps[phead0].next ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID] ∧ vs[r] = vs[r] ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = vs[r].next) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = ps[r].val ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = vs[r].val) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0 ⊦ |
ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ null, ps[phead0].next ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = vs[r].deqID) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = ps[r].val ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = vs[r].val) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| ps[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, vs[ps[phead0].next].deqID ≠ None, ps[phead0].next ≠ null, ps[phead0].next ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), ps[phead0].next ∈ ps, ps[phead0].next ∈ vs, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID], ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), vtail = (ps[phead0].next ' + orl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∧ vs[(ps[phead0].next ' + orl0).last].deqID = None ∧ vs[(ps[phead0].next ' + orl0).last].next = null, phead ∈ orl1 ∨ phead = phead0, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = ps[r].deqID ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].deqID = vs[r].deqID) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = ps[r].val ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].val = vs[r].val) ∧ ( ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][r].next = ps[r].next ∨ ps[ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID][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.deqID:= opttid).deqID = opttid; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[phead0].next, ps[ps[phead0].next].deqID:= vs[ps[phead0].next].deqID, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) ∧ noidRely (tid0, orl + qrl, vs, (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl) + (qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), vs), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns)
Used simplifier rules: ⊦ noidRely(tid, rl, vs, rl, vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns) |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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) ⊦ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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) ⊦ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
⊦ r ∈ rl → r ∈ rl from r
ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used terms: (orl + (vhead0 ' + orl0).butlast).last, orl + vhead0 ' + orl0
| ⊦ r ∈ rl → r ∈ rl from r |
| ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ 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[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, (orl + (vhead0 ' + orl0).butlast).last ≠ vhead0, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, (orl + (vhead0 ' + orl0).butlast).last ≠ vhead0, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + vhead0 ' + orl0.butlast).last ≠ (vhead0 ' + orl0).last, (orl + vhead0 ' + orl0.butlast).last ≠ vhead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + vhead0 ' + orl0.butlast).last ∈ orl, ¬ (orl + vhead0 ' + orl0.butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: vhead0 ', orl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + vhead0 ' + orl0.butlast).last ≠ (vhead0 ' + orl0).last, (orl + vhead0 ' + orl0.butlast).last ≠ vhead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + vhead0 ' + orl0.butlast).last ∈ orl, ¬ (orl + vhead0 ' + orl0.butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
ps[vhead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl0.butlast).last ≠ orl0.last, (vhead0 ' + orl0.butlast).last ≠ vhead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl0.butlast).last ∈ orl, ¬ (vhead0 ' + orl0.butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps[vhead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl0.butlast).last ≠ orl0.last, (vhead0 ' + orl0.butlast).last ≠ vhead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl0.butlast).last ∈ orl, ¬ (vhead0 ' + orl0.butlast).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', (vhead0 ' + orl1).last ≠ phead0, (vhead0 ' + orl1).last ≠ vhead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl1).last ∈ orl, ¬ (vhead0 ' + orl1).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| vs[phead0].deqID = None, ps[vhead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', (vhead0 ' + orl1).last ≠ phead0, (vhead0 ' + orl1).last ≠ vhead0, orl ≠ [], orl0 ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (vhead0 ' + orl1).last ∈ orl, ¬ (vhead0 ' + orl1).last ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
ps[vhead0].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl1).last ≠ phead0, (vhead0 ' + orl1).last ≠ vhead0, orl ≠ [], r ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ (vhead0 ' + orl1).last ∈ orl, ¬ (vhead0 ' + orl1).last ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[vhead0].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, (vhead0 ' + orl1).last ≠ phead0, (vhead0 ' + orl1).last ≠ vhead0, orl ≠ [], r ≠ null, vhead0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ (vhead0 ' + orl1).last ∈ orl, ¬ (vhead0 ' + orl1).last ∈ orl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ r = vhead0 ∧ vs[vhead0].deqID ≠ None |
⊦ 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: vhead0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
⊦ r ∈ rl → r ∈ rl from r
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl, ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used terms: vhead, orl + qrl
| ⊦ r ∈ rl → r ∈ rl from r |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl, ¬ vhead ∈ orl + qrl from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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, vtail0, y
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[r, ps[r].deqID:= vs[r].deqID]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].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))
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ orl + qrl → vs[r0].val = vs[r0].val ∧ ps[r0].val = ps[r, ps[r].deqID:= vs[r].deqID][r0].val ∧ (vs[r0].deqID ≠ None → vs[r0].deqID = vs[r0].deqID) ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID) ∧ (vs[r0].next ≠ null → vs[r0].next = vs[r0].next) ∧ (ps[r0].next ≠ null → ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used terms: ps, orl + qrl, ps[r, ps[r].deqID:= vs[r].deqID], 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)) |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ orl + qrl → vs[r0].val = vs[r0].val ∧ ps[r0].val = ps[r, ps[r].deqID:= vs[r].deqID][r0].val ∧ (vs[r0].deqID ≠ None → vs[r0].deqID = vs[r0].deqID) ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID) ∧ (vs[r0].next ≠ null → vs[r0].next = vs[r0].next) ∧ (ps[r0].next ≠ null → ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r0 ∈ orl ∨ r0 ∈ qrl ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, ps[r0].val = ps[r, ps[r].deqID:= vs[r].deqID][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r0 ∈ orl ∨ r0 ∈ qrl ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, ps[r0].val = ps[r, ps[r].deqID:= vs[r].deqID][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
dom vrvHp = dom prvHp, r0 = r, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ orl ∨ r0 ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[r0].val = ps[r, ps[r].deqID:= vs[r].deqID][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used terms: ps, r, ps[r].deqID:= vs[r].deqID, r0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, r0 = r, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ orl ∨ r0 ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ps[r0].val = ps[r, ps[r].deqID:= vs[r].deqID][r0].val ∧ (ps[r0].deqID ≠ None → ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID) ∧ (ps[r0].next ≠ null → ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next), qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, vs[r].deqID ≠ ps[r].deqID, ps[r].deqID ≠ None, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used simplifier rules: ⊦ (nd.deqID:= opttid).next = nd.next; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s)
| dom vrvHp = dom prvHp, vs[r].deqID ≠ ps[r].deqID, ps[r].deqID ≠ None, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
dom vrvHp = dom prvHp, vs[r].deqID ≠ ps[r].deqID, ps[r].deqID ≠ None, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ r ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used terms: ps, orl + qrl, owns, r, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| dom vrvHp = dom prvHp, vs[r].deqID ≠ ps[r].deqID, ps[r].deqID ≠ None, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ r ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
orl + qrl = rl1 + r ' + rl2, dom vrvHp = dom prvHp, vs[r].deqID ≠ ps[r].deqID, ps[r].deqID ≠ None, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(r ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl + qrl = rl1 + r ' + rl2, dom vrvHp = dom prvHp, vs[r].deqID ≠ ps[r].deqID, ps[r].deqID ≠ None, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(r ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
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) ⊦ 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)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[r, ps[r].deqID:= vs[r].deqID], owns), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].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))
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None) → r0 ∈ vs ∧ r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID] ∧ vs[r0] = vs[r0] ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].next = vs[r0].next) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].val = ps[r0].val ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].val = vs[r0].val) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = vs[r0].deqID) ∧ owns(r0) = owns(r0)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None
Used terms: ps, ps[r, ps[r].deqID:= vs[r].deqID], tid0, owns, vs, owns, vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None) → r0 ∈ vs ∧ r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID] ∧ vs[r0] = vs[r0] ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].next = vs[r0].next) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].val = ps[r0].val ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].val = vs[r0].val) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = vs[r0].deqID) ∧ owns(r0) = owns(r0)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None |
dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r0 ∈ ps, r0 ∈ vs, r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, (ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = vs[r0].deqID) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].val = ps[r0].val ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].val = vs[r0].val) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].next = vs[r0].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| dom vrvHp = dom prvHp, orl ≠ [], r ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r0 ∈ ps, r0 ∈ vs, r0 ∈ ps[r, ps[r].deqID:= vs[r].deqID], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, owns(r0) = Some(tid0) ∨ owns(r0) = Weak(tid0) ∧ owns(r0) ≠ None ⊦ qrl ≠ [] ∧ r = qrl.head ∧ vs[qrl.head].deqID ≠ None, (ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = ps[r0].deqID ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].deqID = vs[r0].deqID) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].val = ps[r0].val ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].val = vs[r0].val) ∧ (ps[r, ps[r].deqID:= vs[r].deqID][r0].next = ps[r0].next ∨ ps[r, ps[r].deqID:= vs[r].deqID][r0].next = vs[r0].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.deqID:= opttid).deqID = opttid; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, r, ps[r].deqID:= vs[r].deqID, r0
| ⊦ 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.