[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof rely-D28-D29 (conclusion) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl) ∧ gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead ∧ gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof rely-D28-D29 (previous step) (back to tree)

gs.vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D28, a) = D29, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D28, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, ls.addr ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl) ∧ gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead ∧ gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ (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) ⊦ gstepf(gs, ls, D28, a) = ( ( gs .ps:= gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (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) ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pcstepf(gs, ls, D28, a) = D29; (s)

Proof step 3 from proof rely-D28-D29 (previous step) (back to tree)

gs.vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.rvowns(ls.addr) = Claimed(ls.othertid, gs.vs[ls.nxt].val), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.rvref ∈ gs.vrvHp, ls.addr ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.orl + gs.qrl + rl = (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl)) ∧ (∃ rl0. gs.orl + rl0 = (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl)) ∧ gs.vtail ∈ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl) from gs.vtail ∧ gs.phead ∈ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl) from gs.phead ∧ gs.vhead ∈ (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl) from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)], gs.owns) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head ';gs.orl) + (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl), gs.vs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

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

Proof step 4 from proof rely-D28-D29 (previous step) (back to tree)

vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val), rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.addr ∈ vrvHp, ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, phead ∈ orl, ls.first ∈ orl, phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 5 from proof rely-D28-D29 (previous step) (back to tree)

vs[ls.nxt].deqID = Some(ls.othertid), ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), rvowns(ls.addr) = Claimed(ls.othertid, vs[ls.nxt].val), vretRefs(ls.tid) = ls.rvref, ls.addr ≠ null, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ls.addr ∈ vrvHp, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.nxt, ps[ls.nxt].deqID:= Some(ls.othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (ps[ls.nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ls.nxt].deqID = None ⊃ qrl.tail;qrl), vs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval

Proof step 6 from proof rely-D28-D29 (previous step) (back to tree)

vs[nxt].deqID = Some(othertid), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(addr) = Claimed(othertid, vs[nxt].val), rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, addr ≠ null, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, addr ∈ vrvHp, rvref ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[nxt, ps[nxt].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[nxt, ps[nxt].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (ps[nxt].deqID = None ⊃ orl + qrl.head ';orl) + (ps[nxt].deqID = None ⊃ qrl.tail;qrl), vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ

Proof step 7 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ps[ps[first].next].deqID = None

Additional information

Used formulas: ps[ps[first].next].deqID = None

Proof step 8 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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 = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)

Proof step 9 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. qrl + rl = qrl.head ' + qrl.tail) ∧ vtail ∈ (orl + qrl.head ') + qrl.tail from vtail ∧ vhead ∈ (orl + qrl.head ') + qrl.tail from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (orl + qrl.head ') + qrl.tail, vs)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 10 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = qrl.head ' + qrl.tail) ∧ vtail ∈ (orl + qrl.head ') + qrl.tail from vtail ∧ vhead ∈ (orl + qrl.head ') + qrl.tail from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (orl + qrl.head ') + qrl.tail, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: list-elem-in1: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ vs; (forward) from specification DMSQ list-elem-in2: ⊦ listp(rl, vs, ps, owns) ∧ node ∈ rl → node ∈ ps; (forward) from specification DMSQ ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 11 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ orl, first ∈ orl, lst ∈ orl from first, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, lst ∈ orl, lst ∈ vs, lst ∈ ps, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ orl.last ∈ (orl + [].head ') + [].tail from orl.last ∧ vhead ∈ (orl + [].head ') + [].tail from vhead ∧ equalrl(orl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl, vs, (orl + [].head ') + [].tail, vs)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix, seq:⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), subst:[ps, rl, owns, r, vs] → [ps, orl, owns, first, vs]

Additional information

Used terms: ps, orl, owns, first, vs

Proof step 12 from proof rely-D28-D29 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))

A spec-lemma

Proof step 13 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), lst ∈ ps, lst ∈ vs, lst ∈ orl, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ orl from first, first ∈ orl, phead ∈ orl, ¬ dups(orl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2, vs, ps, owns)), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ orl.last ∈ (orl + [].head ') + [].tail from orl.last ∧ vhead ∈ (orl + [].head ') + [].tail from vhead ∧ equalrl(orl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl, vs, (orl + [].head ') + [].tail, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 → (b ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)

Proof step 14 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2, vs, ps, owns), listp(rl1 + first ' + rl2, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + rl2, vhead, vs), nonullRetRefs(rl1 + first ' + rl2, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ rl2, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ lst ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, rl2.last = vhead ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ rl2.last ⊦ rl2.last ∈ ((rl1 + first ' + rl2) + [].head ') + [].tail from rl2.last ∧ vhead ∈ ((rl1 + first ' + rl2) + [].head ') + [].tail from vhead ∧ equalrl(rl1 + first ' + rl2, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, rl1 + first ' + rl2, vs, ((rl1 + first ' + rl2) + [].head ') + [].tail, vs)

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a + x = a ' + x; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ a ∈ []; (s)

Proof step 15 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = first0 + qrl0, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. qrl + rl = qrl.head ' + qrl.tail) ∧ vtail ∈ (orl + qrl.head ') + qrl.tail from vtail ∧ vhead ∈ (orl + qrl.head ') + qrl.tail from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (orl + qrl.head ') + qrl.tail, vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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] ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (a ' + x).tail = x; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 16 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ vtail ∈ orl + first0 ' + qrl0 from vtail ∧ vhead ∈ orl + first0 ' + qrl0 from vhead ∧ equalrl(orl + first0 ' + qrl0, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 17 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail ∈ orl + first0 ' + qrl0 from vtail, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 44

Additional information

Proof step 18 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (first0 ' + qrl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail ∈ orl + first0 ' + qrl0 from vtail, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 19 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (first0 ' + qrl0).last ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ (first0 ' + qrl0).last ∈ orl + first0 ' + qrl0 from (first0 ' + qrl0).last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first0 ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ 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: first0 ', qrl0

Proof step 20 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 21 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, qrl0.last ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ qrl0.last ∈ orl + first0 ' + qrl0 from qrl0.last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, phead0, qrl]

Additional information

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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ 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) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, phead0, y

Proof step 22 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[(first0 ' + qrl0).last].deqID = None, vs[(first0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), vtail = (orl + (first0 ' + qrl0).butlast).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail ∈ orl + first0 ' + qrl0 from vtail, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof rely-D28-D29 (previous step) (back to tree)

vs[(first0 ' + qrl0).last].deqID = None, ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, vs[(first0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl + (first0 ' + qrl0).butlast).last ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ (orl + (first0 ' + qrl0).butlast).last ∈ orl + first0 ' + qrl0 from (orl + (first0 ' + qrl0).butlast).last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [first0 ', qrl0], <all paths>

Additional information

Used terms: first0 ', qrl0

Proof step 24 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 25 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[(first0 ' + qrl0).last].deqID = None, vs[(first0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = [], rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, (orl + (first0 ' + qrl0).butlast).last ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ (orl + (first0 ' + qrl0).butlast).last ∈ orl + first0 ' + qrl0 from (orl + (first0 ' + qrl0).butlast).last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)

Proof step 26 from proof rely-D28-D29 (previous step) (back to tree)

vs[first0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[first0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ first0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ', vhead, vs), nonullRetRefs(orl + first0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), first ∈ orl, phead ∈ orl, orl.last ∈ orl + first0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ orl from first, ¬ dups(orl), ¬ orl.last ∈ orl + first0 ' from orl.last, ¬ first0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, phead0, orl0]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y

Proof step 27 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[(first0 ' + qrl0).last].deqID = None, vs[(first0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, (orl + first0 ' + qrl0.butlast).last ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ (orl + first0 ' + qrl0.butlast).last ∈ orl + first0 ' + qrl0 from (orl + first0 ' + qrl0.butlast).last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 28 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, vs[qrl0.last].deqID = None, vs[qrl0.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ orl, first ∈ orl, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (first0 ' + qrl0.butlast).last ∈ orl + first0 ' + qrl0 from lst, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, ¬ (first0 ' + qrl0.butlast).last ∈ orl + first0 ' + qrl0 from (first0 ' + qrl0.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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, phead0, orl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, phead0, y

Proof step 29 from proof rely-D28-D29 (previous step) (back to tree)

vs[phead0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = orl0 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), (first0 ' + orl0).last ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, first ∈ orl, phead ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, ¬ (first0 ' + orl0).last ∈ orl + first0 ' + qrl0 from (first0 ' + orl0).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), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 30 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first0 ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(orl + first0 ' + orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, first ∈ orl, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (first0 ' + orl0).last ∈ orl + first0 ' + orl0 + phead0 ' from lst, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ (first0 ' + orl0).last ∈ orl + first0 ' + orl0 + phead0 ' from (first0 ' + orl0).last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ first0 ∈ orl, ¬ first0 ∈ 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[first0].deqID = None ∧ unmarkedp(orl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ orl0 ∨ lst = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [first0 ', orl0], <all paths>

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: first0 ', orl0

Proof step 31 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 32 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first0 ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(orl + first0 ' + orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), orl0.last ∈ orl + first0 ' + orl0 + phead0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, first ∈ orl, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ orl0.last ∈ orl + first0 ' + orl0 + phead0 ' from orl0.last, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ first0 ∈ orl, ¬ first0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ orl0 ∨ lst = phead0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

Proof step 33 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first0 ≠ phead0, lst ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(orl + first0 ' + orl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), orl0.last ∈ orl + first0 ' + orl0 + phead0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, first ∈ orl, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ first0 ∈ orl0, ¬ first0 ∈ orl, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ orl0.last ∈ orl + first0 ' + orl0 + phead0 ' from orl0.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[first0].deqID = None ∧ unmarkedp(orl0, vs), lst ∈ orl0 ∨ lst = first0 ∨ lst ∈ orl from first ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl0, vhead0, orl1]

Additional information

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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y

Proof step 34 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead ∈ orl + first0 ' + qrl0 from vhead, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 42

Additional information

Proof step 35 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, orl.last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead ∈ orl + first0 ' + qrl0 from vhead, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 36 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.last, vs), noid(tid, orl + first0 ' + qrl0, orl.last, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ orl.last ∈ orl + first0 ' + qrl0 from orl.last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, 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), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, vtail0, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y

Proof step 37 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[first0].deqID = None, orl.butlast.last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), orl.butlast ≠ [], ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vhead ∈ orl + first0 ' + qrl0 from vhead, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 38 from proof rely-D28-D29 (previous step) (back to tree)

vs[first0].deqID = None, ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + first0 ' + qrl0, orl.butlast.last, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ orl.butlast.last ∈ orl + first0 ' + qrl0 from orl.butlast.last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail0, qrl]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail

Proof step 39 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[first0].deqID = None, dom vrvHp = dom prvHp, orl = vtail0 + qrl, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl ≠ vtail0 ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + first0 ' + qrl0, orl.butlast.last, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ orl.butlast.last ∈ orl + first0 ' + qrl0 from orl.butlast.last, ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)

Proof step 40 from proof rely-D28-D29 (previous step) (back to tree)

vs[first0].deqID = None, ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first0 ≠ vtail0, phead ≠ qrl.last, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl) + first0 ' + qrl0, vs, ps, owns), markedp(qrl, vs), markedp(qrl, ps), nextnottid(tid, (vtail0 ' + qrl.butlast).last, vs), noid(tid, (vtail0 ' + qrl) + first0 ' + qrl0, (vtail0 ' + qrl.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl) + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (vtail0 ' + qrl) + first0 ' + qrl0 from lst, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ (vtail0 ' + qrl.butlast).last ∈ (vtail0 ' + qrl) + first0 ' + qrl0 from (vtail0 ' + qrl.butlast).last, ¬ first0 ∈ qrl, vs[(vtail0 ' + qrl.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl, first = vtail0 ∨ first ∈ qrl, lst ∈ vtail0 ' + qrl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (qrl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl, phead0, qrl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, phead0, y

Proof step 41 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, vs[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = qrl1 + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, first0 ≠ vtail0, phead ≠ phead0, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl) + first0 ' + qrl0, vs, ps, owns), markedp(qrl, ps), markedp(qrl, vs), nextnottid(tid, (vtail0 ' + qrl1).last, vs), noid(tid, (vtail0 ' + qrl) + first0 ' + qrl0, (vtail0 ' + qrl1).last, vs), nonullRetRefs((vtail0 ' + qrl) + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), vtail ∈ (vtail0 ' + qrl) + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ first0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ (vtail0 ' + qrl1).last ∈ (vtail0 ' + qrl) + first0 ' + qrl0 from (vtail0 ' + qrl1).last, ¬ first0 ∈ qrl, vs[(vtail0 ' + qrl1).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl1).last].next].val), vtail = (first0 ' + qrl0).last ∨ vtail = (qrl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ vtail0 ' + qrl from first ∨ lst = first0 ∨ lst ∈ qrl0, first = vtail0 ∨ first ∈ qrl, phead = vtail0 ∨ phead ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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] ⊦ (x + a ' + y).last = (a ' + y).last; (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 ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 42 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[phead0].next].deqID = None, vs[ps[phead0].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[phead0].next ≠ phead0, ps[phead0].next ≠ vtail0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, (vtail0 ' + qrl1).last, vs), noid(tid, (vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0, (vtail0 ' + qrl1).last, vs), nonullRetRefs((vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), vtail ∈ (vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(qrl1 + qrl0), ¬ ps[phead0].next ∈ qrl1, ¬ (vtail0 ' + qrl1).last ∈ (vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0 from (vtail0 ' + qrl1).last, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, vs[(vtail0 ' + qrl1).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl1).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl1).last].next].val), vtail = (ps[phead0].next ' + qrl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + qrl0).butlast).last ∧ vs[(ps[phead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[phead0].next ' + qrl0).last].next = null, first = vtail0 ∨ first ∈ qrl1 ∨ first = phead0, phead = vtail0 ∨ phead ∈ qrl1, lst ∈ vtail0 ' + qrl1 + phead0 ' from first ∨ lst = ps[phead0].next ∨ lst ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ markedp([], vs); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (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: vtail0 ', qrl1

Proof step 43 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 44 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[phead0].next].deqID = None, ps[ps[phead0].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[phead0].next ≠ phead0, ps[phead0].next ≠ vtail0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl1 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, qrl1.last, vs), noid(tid, (vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0, qrl1.last, vs), nonullRetRefs((vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0 from lst, ¬ dups(qrl0), ¬ dups(qrl1), ¬ dups(qrl1 + qrl0), ¬ ps[phead0].next ∈ qrl1, ¬ qrl1.last ∈ (vtail0 ' + qrl1 + phead0 ') + ps[phead0].next ' + qrl0 from qrl1.last, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ ps[phead0].next ∈ qrl0, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, vs[qrl1.last].next ≠ null ∧ vs[vs[qrl1.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl1.last].next].deqID.tid)) = Claimed(vs[vs[qrl1.last].next].deqID.tid, vs[vs[qrl1.last].next].val), lst ∈ vtail0 ' + qrl1 + phead0 ' from first ∨ lst = ps[phead0].next ∨ lst ∈ qrl0, phead = vtail0 ∨ phead ∈ qrl1, first = vtail0 ∨ first ∈ qrl1 ∨ first = phead0, vtail = (ps[phead0].next ' + qrl0).last ∨ vtail = (phead0 ' + (ps[phead0].next ' + qrl0).butlast).last ∧ vs[(ps[phead0].next ' + qrl0).last].deqID = None ∧ vs[(ps[phead0].next ' + qrl0).last].next = null ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl1, lst0, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ 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: qrl1, lst0, y

Proof step 45 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ equalrl(orl + first0 ' + qrl0, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ 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)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + first0 ' + qrl0, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], vs, vs], <all paths>

Additional information

Used terms: ps, orl + first0 ' + qrl0, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], vs, vs

Proof step 46 from proof rely-D28-D29 (previous step) (back to tree)

⊦ 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))

A spec-lemma

Proof step 47 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + first0 ' + qrl0 → vs[r].val = vs[r].val ∧ ps[r].val = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next) ∧ ( vs[(orl + first0 ' + qrl0).last].next ≠ null → vs[(orl + first0 ' + qrl0).last].next = vs[(orl + first0 ' + qrl0).last].next ∧ vs[vs[(orl + first0 ' + qrl0).last].next].val = vs[vs[(orl + first0 ' + qrl0).last].next].val)), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 48 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, r ∈ orl ∨ r = first0 ∨ r ∈ qrl0 ⊦ ps[r].val = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val ∧ (ps[r].deqID ≠ None → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), r], <all paths>

Additional information

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[first].next, ps[ps[first].next].deqID:= Some(othertid), r

Proof step 49 from proof rely-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 50 from proof rely-D28-D29 (previous step) (back to tree)

ps[first0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[ps[first].next].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + first0 ' + qrl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalowns-def, seq:⊦ 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)), subst:[ps, ps0, tid, owns, vs0, owns0, vs] → [ps, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], tid0, owns, vs, owns, vs], <all paths>

Additional information

Used terms: ps, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], tid0, owns, vs, owns, vs

Proof step 51 from proof rely-D28-D29 (previous step) (back to tree)

⊦ 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))

A spec-lemma

Proof step 52 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ first0 ∈ orl, ¬ first0 ∈ qrl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ∧ vs[r] = vs[r] ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = vs[r].next) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = ps[r].val ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = vs[r].val) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)

Proof step 53 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[first].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[first0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + first0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + first0 ' + qrl0, vhead, vs), nonullRetRefs(orl + first0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + first0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + qrl0), ¬ first0 ∈ qrl0, ¬ first0 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (first0 ' + qrl0).last ∨ vtail = (orl + (first0 ' + qrl0).butlast).last ∧ vs[(first0 ' + qrl0).last].deqID = None ∧ vs[(first0 ' + qrl0).last].next = null, lst ∈ orl from first ∨ lst = first0 ∨ lst ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[first0].deqID = None ∧ unmarkedp(qrl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = vs[r].deqID) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = ps[r].val ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = vs[r].val) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = vs[r].next)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), r], <all paths>

Additional information

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[first].next, ps[ps[first].next].deqID:= Some(othertid), r

Proof step 54 from proof rely-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 55 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl)) ∧ (∃ rl0. orl + rl0 = (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl)) ∧ vtail ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from vtail ∧ phead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from phead ∧ vhead ∈ (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl) from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns) ∧ noidRely(tid0, orl + qrl, vs, (ps[ps[first].next].deqID = None ⊃ orl + qrl.head ';orl) + (ps[ps[first].next].deqID = None ⊃ qrl.tail;qrl), vs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 56 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], owns)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 57 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 58 from proof rely-D28-D29 (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[qrl.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (orl + qrl.butlast).last ≠ qrl.last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, (orl + qrl.butlast).last ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), lst ∈ orl from first ∨ lst ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, phead0, orl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 59 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (orl + qrl.butlast).last ≠ qrl.last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl + qrl.butlast).last ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ 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), lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ 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)

Proof step 60 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), first ∈ orl, phead ∈ orl, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 45

Additional information

Proof step 61 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), orl.last = vhead, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 62 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.last, vs), noid(tid, orl + phead0 ' + orl0, orl.last, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), first ∈ orl, phead ∈ orl, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, 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), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, lst0, orl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, lst0, y

Proof step 63 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl = orl1 + lst0 ', pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, lst0, vs), noid(tid, orl + phead0 ' + orl0, lst0, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 64 from proof rely-D28-D29 (previous step) (back to tree)

ps[ps[lst0].next].deqID = None, vs[(ps[lst0].next ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[(ps[lst0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (lst0 ' + (ps[lst0].next ' + orl0).butlast).last ≠ (ps[lst0].next ' + orl0).last, ps[lst0].next ≠ lst0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, lst0, vs), noid(tid, (orl1 + lst0 ') + ps[lst0].next ' + orl0, lst0, vs), nonullRetRefs((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (lst0 ' + (ps[lst0].next ' + orl0).butlast).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from lst, first ∈ orl1, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (lst0 ' + (ps[lst0].next ' + orl0).butlast).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from (lst0 ' + (ps[lst0].next ' + orl0).butlast).last, ¬ ps[lst0].next ∈ orl0, ¬ ps[lst0].next ∈ orl1, ¬ lst0 ∈ orl0, ¬ lst0 ∈ orl1, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), phead ∈ orl1 ∨ phead = lst0, lst ∈ orl1 from first ∨ lst = lst0 ∨ lst = ps[lst0].next ∨ lst ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [ps[lst0].next ', orl0], <all paths>

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[lst0].next ', orl0

Proof step 65 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 66 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), vs[(ps[lst0].next ' + orl0).last].deqID = None, ps[ps[lst0].next].deqID = None, vs[(ps[lst0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (lst0 ' + ps[lst0].next ' + orl0.butlast).last ≠ (ps[lst0].next ' + orl0).last, ps[lst0].next ≠ lst0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, lst0, vs), noid(tid, (orl1 + lst0 ') + ps[lst0].next ' + orl0, lst0, vs), nonullRetRefs((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), first ∈ orl1, (lst0 ' + ps[lst0].next ' + orl0.butlast).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (lst0 ' + ps[lst0].next ' + orl0.butlast).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from (lst0 ' + ps[lst0].next ' + orl0.butlast).last, ¬ ps[lst0].next ∈ orl0, ¬ ps[lst0].next ∈ orl1, ¬ lst0 ∈ orl0, ¬ lst0 ∈ orl1, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), lst ∈ orl1 from first ∨ lst = lst0 ∨ lst = ps[lst0].next ∨ lst ∈ orl0, phead ∈ orl1 ∨ phead = lst0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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).last = x.last; (s)

Proof step 67 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[lst0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (ps[lst0].next ' + orl0.butlast).last ≠ orl0.last, ps[lst0].next ≠ lst0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, lst0, vs), noid(tid, (orl1 + lst0 ') + ps[lst0].next ' + orl0, lst0, vs), nonullRetRefs((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ orl1, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (ps[lst0].next ' + orl0.butlast).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from lst, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[lst0].next ∈ orl0, ¬ ps[lst0].next ∈ orl1, ¬ lst0 ∈ orl0, ¬ lst0 ∈ orl1, ¬ (ps[lst0].next ' + orl0.butlast).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from (ps[lst0].next ' + orl0.butlast).last, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), phead ∈ orl1 ∨ phead = lst0, lst ∈ orl1 from first ∨ lst = lst0 ∨ lst = ps[lst0].next ∨ lst ∈ orl0 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl0, phead0, orl]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y

Proof step 68 from proof rely-D28-D29 (previous step) (back to tree)

vs[phead0].deqID = None, ps[ps[lst0].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl + phead0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (ps[lst0].next ' + orl).last ≠ phead0, ps[lst0].next ≠ lst0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, lst0, vs), noid(tid, (orl1 + lst0 ') + ps[lst0].next ' + orl0, lst0, vs), nonullRetRefs((orl1 + lst0 ') + ps[lst0].next ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), (ps[lst0].next ' + orl).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, first ∈ orl1, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[lst0].next ∈ orl0, ¬ ps[lst0].next ∈ orl1, ¬ lst0 ∈ orl0, ¬ lst0 ∈ orl1, ¬ (ps[lst0].next ' + orl).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl0 from (ps[lst0].next ' + orl).last, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), lst ∈ orl1 from first ∨ lst = lst0 ∨ lst = ps[lst0].next ∨ lst ∈ orl0, phead ∈ orl1 ∨ phead = lst0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ 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)

Proof step 69 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[phead0].deqID = None, ps[ps[lst0].next].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (ps[lst0].next ' + orl).last ≠ phead0, ps[lst0].next ≠ phead0, ps[first].next ≠ null, ps[lst0].next ≠ lst0, addr ≠ null, first ≠ lst, lst ≠ phead0, lst0 ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, lst0, vs), noid(tid, (orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ', lst0, vs), nonullRetRefs((orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), (ps[lst0].next ' + orl).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, first ∈ orl1, ¬ dups(orl), ¬ dups(orl1), ¬ dups(orl1 + orl), ¬ lst0 ∈ orl, ¬ ps[lst0].next ∈ orl1, ¬ ps[lst0].next ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ (ps[lst0].next ' + orl).last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ' from (ps[lst0].next ' + orl).last, ¬ lst0 ∈ orl1, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), phead ∈ orl1 ∨ phead = lst0, lst ∈ orl ∨ lst = ps[lst0].next ∨ lst = lst0 ∨ lst ∈ orl1 from first ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [ps[lst0].next ', orl], <all paths>

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[lst0].next ', orl

Proof step 70 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 71 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[ps[lst0].next].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, orl.last ≠ phead0, ps[lst0].next ≠ phead0, ps[first].next ≠ null, ps[lst0].next ≠ lst0, addr ≠ null, first ≠ lst, lst ≠ phead0, lst0 ≠ phead0, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, lst0, vs), noid(tid, (orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ', lst0, vs), nonullRetRefs((orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), first ∈ orl1, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, orl.last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ' from lst, ¬ dups(orl), ¬ dups(orl1), ¬ dups(orl1 + orl), ¬ lst0 ∈ orl, ¬ ps[lst0].next ∈ orl1, ¬ ps[lst0].next ∈ orl, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ orl.last ∈ (orl1 + lst0 ') + ps[lst0].next ' + orl + phead0 ' from orl.last, ¬ lst0 ∈ orl1, vs[lst0].next ≠ null ∧ vs[vs[lst0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[lst0].next].deqID.tid)) = Claimed(vs[vs[lst0].next].deqID.tid, vs[vs[lst0].next].val), lst ∈ orl ∨ lst = ps[lst0].next ∨ lst = lst0 ∨ lst ∈ orl1 from first, phead ∈ orl1 ∨ phead = lst0 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, phead1, orl0]

Additional information

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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y

Proof step 72 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].deqID = None, orl.butlast.last = vhead, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), orl.butlast ≠ [], ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 73 from proof rely-D28-D29 (previous step) (back to tree)

vs[phead0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + phead0 ' + orl0, orl.butlast.last, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, vs), unmarkedp(orl0, ps), first ∈ orl, phead ∈ orl, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, lst0, orl1]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail

Proof step 74 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl = lst0 + orl1, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl ≠ lst0 ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + phead0 ' + orl0, orl.butlast.last, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + orl0).butlast).last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), lst ∈ orl from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)

Proof step 75 from proof rely-D28-D29 (previous step) (back to tree)

vs[phead0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (orl1 + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((lst0 ' + orl1) + phead0 ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl0, (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), (orl1 + (phead0 ' + orl0).butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ lst0 ∈ orl1, ¬ lst0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (orl1 + (phead0 ' + orl0).butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from (orl1 + (phead0 ' + orl0).butlast).last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), first = lst0 ∨ first ∈ orl1, phead = lst0 ∨ phead ∈ orl1, lst ∈ lst0 ' + orl1 from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [phead0 ', orl0], <all paths>

Additional information

Used terms: phead0 ', orl0

Proof step 76 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 77 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (orl1 + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((lst0 ' + orl1) + phead0 ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl0, (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl1 + (phead0 ' + orl0).butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from lst, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ lst0 ∈ orl1, ¬ lst0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (orl1 + (phead0 ' + orl0).butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from (orl1 + (phead0 ' + orl0).butlast).last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), lst ∈ lst0 ' + orl1 from first ∨ lst = phead0 ∨ lst ∈ orl0, phead = lst0 ∨ phead ∈ orl1, first = lst0 ∨ first ∈ orl1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s)

Proof step 78 from proof rely-D28-D29 (previous step) (back to tree)

vs[phead0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[phead0].deqID = None, vs[phead0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, orl1.last ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ phead0, orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, lst0 ' + orl1 + phead0 ', (lst0 ' + orl1.butlast).last, vs), nonullRetRefs(lst0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, orl1.last ∈ lst0 ' + orl1 + phead0 ' from lst, lst ∈ lst0 ' + orl1 from first, ¬ dups(orl1), ¬ orl1.last ∈ lst0 ' + orl1 + phead0 ' from orl1.last, ¬ phead0 ∈ orl1, ¬ lst0 ∈ orl1, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), phead = lst0 ∨ phead ∈ orl1, first = lst0 ∨ first ∈ orl1 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl1, lst1, orl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, lst1, y

Proof step 79 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (orl1 + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl0 ≠ [], orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((lst0 ' + orl1) + phead0 ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl0, (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (orl1 + phead0 ' + orl0.butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from lst, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ lst0 ∈ orl1, ¬ lst0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (orl1 + phead0 ' + orl0.butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from (orl1 + phead0 ' + orl0.butlast).last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), lst ∈ lst0 ' + orl1 from first ∨ lst = phead0 ∨ lst ∈ orl0, phead = lst0 ∨ phead ∈ orl1, first = lst0 ∨ first ∈ orl1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 80 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[phead0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, (phead0 ' + orl0.butlast).last ≠ orl0.last, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl0 ≠ [], orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((lst0 ' + orl1) + phead0 ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl0, (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(orl0, vs), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, (phead0 ' + orl0.butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from lst, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ lst0 ∈ orl1, ¬ lst0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from (phead0 ' + orl0.butlast).last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), first = lst0 ∨ first ∈ orl1, phead = lst0 ∨ phead ∈ orl1, lst ∈ lst0 ' + orl1 from first ∨ lst = phead0 ∨ lst ∈ orl0 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl0, lst1, orl]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, lst1, y

Proof step 81 from proof rely-D28-D29 (previous step) (back to tree)

vs[lst1].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].deqID = None, ps[phead0].deqID = None, vs[lst1].next = null, dom vrvHp = dom prvHp, orl0 = orl + lst1 ', pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (phead0 ' + orl).last ≠ lst1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl0 ≠ [], orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((lst0 ' + orl1) + phead0 ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl0, (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl0, ps), unmarkedp(orl0, vs), (phead0 ' + orl).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from lst, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, ¬ dups(orl1 + orl0), ¬ dups(orl1), ¬ dups(orl0), ¬ lst0 ∈ orl1, ¬ lst0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl).last ∈ (lst0 ' + orl1) + phead0 ' + orl0 from (phead0 ' + orl).last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), lst ∈ lst0 ' + orl1 from first ∨ lst = phead0 ∨ lst ∈ orl0, phead = lst0 ∨ phead ∈ orl1, first = lst0 ∨ first ∈ orl1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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)

Proof step 82 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst1].deqID = None, vs[lst1].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[phead0].deqID = None, ps[phead0].deqID = None, vs[lst1].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, (phead0 ' + orl).last ≠ lst1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ lst1, lst0 ≠ lst1, orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst1, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((lst0 ' + orl1) + phead0 ' + orl + lst1 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl + lst1 ', (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl + lst1 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst0].deqID), some?(ps[lst0].deqID), unmarkedp(orl, ps), unmarkedp(orl, vs), (phead0 ' + orl).last ∈ (lst0 ' + orl1) + phead0 ' + orl + lst1 ' from lst, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, ¬ dups(orl), ¬ dups(orl1), ¬ dups(orl1 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ lst0 ∈ orl, ¬ lst0 ∈ orl1, ¬ lst1 ∈ orl, ¬ lst1 ∈ orl1, ¬ (phead0 ' + orl).last ∈ (lst0 ' + orl1) + phead0 ' + orl + lst1 ' from (phead0 ' + orl).last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), phead = lst0 ∨ phead ∈ orl1, first = lst0 ∨ first ∈ orl1, lst ∈ orl ∨ lst = phead0 ∨ lst ∈ lst0 ' + orl1 from first ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [phead0 ', orl], <all paths>

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead0 ', orl

Proof step 83 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 84 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead0].deqID = None, vs[phead0].deqID = None, vs[ps[first].next].deqID = Some(othertid), vs[lst1].deqID = None, ps[lst1].deqID = None, vs[lst1].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, orl.last ≠ lst1, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ lst1, lst0 ≠ lst1, orl ≠ [], orl1 ≠ [], phead ≠ orl1.last, phead0 ≠ lst1, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((lst0 ' + orl1) + phead0 ' + orl + lst1 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nextnottid(tid, (lst0 ' + orl1.butlast).last, vs), noid(tid, (lst0 ' + orl1) + phead0 ' + orl + lst1 ', (lst0 ' + orl1.butlast).last, vs), nonullRetRefs((lst0 ' + orl1) + phead0 ' + orl + lst1 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(orl, vs), unmarkedp(orl, ps), vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, orl.last ∈ (lst0 ' + orl1) + phead0 ' + orl + lst1 ' from lst, ¬ dups(orl), ¬ dups(orl1), ¬ dups(orl1 + orl), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ lst0 ∈ orl, ¬ lst0 ∈ orl1, ¬ lst1 ∈ orl, ¬ lst1 ∈ orl1, ¬ orl.last ∈ (lst0 ' + orl1) + phead0 ' + orl + lst1 ' from orl.last, vs[(lst0 ' + orl1.butlast).last].next ≠ null ∧ vs[vs[(lst0 ' + orl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(lst0 ' + orl1.butlast).last].next].deqID.tid, vs[vs[(lst0 ' + orl1.butlast).last].next].val), lst ∈ orl ∨ lst = phead0 ∨ lst ∈ lst0 ' + orl1 from first, first = lst0 ∨ first ∈ orl1, phead = lst0 ∨ phead ∈ orl1 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, lst2, orl0]

Additional information

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) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, lst2, y

Proof step 85 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 39

Additional information

Proof step 86 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), orl.last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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), qrl ≠ [] → unmarkedp(qrl.tail, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s)

Proof step 87 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.last, vs), noid(tid, orl + qrl, orl.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl.tail, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.last ∈ orl + qrl from orl.last, 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), lst ∈ orl from first ∨ lst ∈ qrl, vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, vtail0, qrl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 88 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = vtail0 + qrl0, rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.last, vs), noid(tid, orl + qrl, orl.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.last ∈ orl + qrl from orl.last, 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 = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s)

Proof step 89 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.last, vs), noid(tid, orl + vtail0 ' + qrl0, orl.last, vs), nonullRetRefs(orl + vtail0 ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), unmarkedp(qrl0, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + vtail0 ' + qrl0 from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ orl, ¬ orl.last ∈ orl + vtail0 ' + qrl0 from orl.last, 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), lst ∈ orl from first ∨ lst = vtail0 ∨ lst ∈ qrl0, vtail = (vtail0 ' + qrl0).last ∨ vtail = (orl + (vtail0 ' + qrl0).butlast).last ∧ vs[(vtail0 ' + qrl0).last].deqID = None ∧ vs[(vtail0 ' + qrl0).last].next = null ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, phead0, qrl]

Additional information

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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y

Proof step 90 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), orl.butlast.last = vhead, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), orl.butlast ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ 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, lst ∈ orl from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 91 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl + qrl from orl.butlast.last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail0, qrl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail

Proof step 92 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, orl = vtail0 + qrl0, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], orl ≠ vtail0 ', phead ≠ orl.last, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, orl.butlast.last, vs), noid(tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ orl.butlast.last ∈ orl + qrl from orl.butlast.last, vs[orl.butlast.last].next ≠ null ∧ vs[vs[orl.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)

Proof step 93 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vtail0 ' + qrl0.butlast).last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl0.butlast).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (vtail0 ' + qrl0) + qrl from lst, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl0.butlast).last ∈ (vtail0 ' + qrl0) + qrl from (vtail0 ' + qrl0.butlast).last, vs[(vtail0 ' + qrl0.butlast).last].next ≠ null ∧ vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl0.butlast).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl0.butlast).last].next].val), phead = vtail0 ∨ phead ∈ qrl0, first = vtail0 ∨ first ∈ qrl0, lst ∈ vtail0 ' + qrl0 from first ∨ lst ∈ qrl, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', qrl0.butlast], <all paths>

Additional information

Used simplifier rules: ⊦ 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: vtail0 ', qrl0.butlast

Proof step 94 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 95 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), qrl0.butlast ≠ [], ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ qrl0.last, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.butlast.last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, qrl0.butlast.last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail ∈ (vtail0 ' + qrl0) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ qrl0.butlast.last ∈ (vtail0 ' + qrl0) + qrl from qrl0.butlast.last, vs[qrl0.butlast.last].next ≠ null ∧ vs[vs[qrl0.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.butlast.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.butlast.last].next].deqID.tid, vs[vs[qrl0.butlast.last].next].val), vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ vtail0 ' + qrl0 from first ∨ lst ∈ qrl, first = vtail0 ∨ first ∈ qrl0, phead = vtail0 ∨ phead ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 96 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ qrl0.last, qrl0 ≠ [], qrl0 ≠ qrl0.head ', tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, qrl0.butlast.last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, qrl0.butlast.last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (vtail0 ' + qrl0) + qrl from lst, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ qrl0.butlast.last ∈ (vtail0 ' + qrl0) + qrl from qrl0.butlast.last, vs[qrl0.butlast.last].next ≠ null ∧ vs[vs[qrl0.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.butlast.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.butlast.last].next].deqID.tid, vs[vs[qrl0.butlast.last].next].val), phead = vtail0 ∨ phead ∈ qrl0, first = vtail0 ∨ first ∈ qrl0, lst ∈ vtail0 ' + qrl0 from first ∨ lst ∈ qrl, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl0, vtail1, qrl1]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail

Proof step 97 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl0 = vtail1 + qrl1, rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ qrl0.last, qrl0 ≠ [], qrl0 ≠ vtail1 ', tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.butlast.last, vs), noid(tid, (vtail0 ' + qrl0) + qrl, qrl0.butlast.last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail ∈ (vtail0 ' + qrl0) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ qrl0.butlast.last ∈ (vtail0 ' + qrl0) + qrl from qrl0.butlast.last, vs[qrl0.butlast.last].next ≠ null ∧ vs[vs[qrl0.butlast.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.butlast.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.butlast.last].next].deqID.tid, vs[vs[qrl0.butlast.last].next].val), vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ vtail0 ' + qrl0 from first ∨ lst ∈ qrl, first = vtail0 ∨ first ∈ qrl0, phead = vtail0 ∨ phead ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s)

Proof step 98 from proof rely-D28-D29 (previous step) (back to tree)

ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ qrl1.last, qrl1 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + qrl1 + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), nextnottid(tid, (vs[vtail0].next ' + qrl1.butlast).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl, (vs[vtail0].next ' + qrl1.butlast).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail0 ∈ ps, vtail0 ∈ vs, vtail ∈ vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ weak?(vs[vtail0].deqID), ¬ (vs[vtail0].next ' + qrl1.butlast).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl from (vs[vtail0].next ' + qrl1.butlast).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl1, vs[(vs[vtail0].next ' + qrl1.butlast).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl1.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl1.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl1.butlast).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl1.butlast).last].next].val), vtail = (qrl1 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl1 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl1 from first ∨ lst ∈ qrl, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl1, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl1 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl1, phead0, qrl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl1, phead0, y

Proof step 99 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), qrl1 = qrl0 + phead0 ', rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl1 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + qrl1 + qrl, vs, ps, owns), markedp(qrl1, vs), markedp(qrl1, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl), ¬ dups(qrl1), ¬ dups(qrl1 + qrl), ¬ weak?(vs[vtail0].deqID), ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl1) + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl1, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl1, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl1, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl1 from first ∨ lst ∈ qrl, vtail = (qrl1 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl1 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ (x + a ' + y).last = (a ' + y).last; (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)

Proof step 100 from proof rely-D28-D29 (previous step) (back to tree)

ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail0 ∈ ps, vtail0 ∈ vs, vtail ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 61

Additional information

Proof step 101 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vtail = (phead0 ' + qrl).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 102 from proof rely-D28-D29 (previous step) (back to tree)

ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail0 ∈ ps, vtail0 ∈ vs, (phead0 ' + qrl).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [phead0 ', qrl], <all paths>

Additional information

Used terms: phead0 ', qrl

Proof step 103 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 104 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), qrl = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (phead0 ' + qrl).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s)

Proof step 105 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ phead0, phead ≠ phead0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + qrl0 + phead0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, phead0 ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0), ¬ weak?(vs[vtail0].deqID), ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from (vs[vtail0].next ' + qrl0).last, ¬ phead0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first ∈ qrl0 ∨ first = vs[vtail0].next ∨ first = vtail0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vtail0].next ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ markedp([], vs); (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vs[vtail0].next ', qrl0

Proof step 106 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 107 from proof rely-D28-D29 (previous step) (back to tree)

ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ phead0, phead ≠ phead0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + qrl0 + phead0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.last, vs), noid(tid, vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ', qrl0.last, vs), nonullRetRefs(vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), vtail0 ∈ ps, vtail0 ∈ vs, phead0 ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first, ¬ dups(qrl0), ¬ weak?(vs[vtail0].deqID), ¬ qrl0.last ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from qrl0.last, ¬ phead0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), first ∈ qrl0 ∨ first = vs[vtail0].next ∨ first = vtail0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, lst0, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ 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: qrl0, lst0, y

Proof step 108 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, qrl.last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl, lst0, qrl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, lst0, y

Proof step 109 from proof rely-D28-D29 (previous step) (back to tree)

ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), qrl = qrl1 + lst0 ', rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail0 ∈ ps, vtail0 ∈ vs, lst0 ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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)

Proof step 110 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, ps[lst0].deqID = None, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, vs[vtail0].next ≠ lst0, addr ≠ null, first ≠ lst, phead ≠ phead0, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, lst0 ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl1, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl1 ∨ lst = lst0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vtail0].next ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ markedp([], vs); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vs[vtail0].next ', qrl0

Proof step 111 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 112 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst0].deqID = None, vs[lst0].deqID = None, ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, vs[vtail0].next ≠ lst0, addr ≠ null, first ≠ lst, phead ≠ phead0, phead0 ≠ lst0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', qrl0.last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), vtail0 ∈ ps, vtail0 ∈ vs, lst0 ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ qrl0.last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from qrl0.last, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl1, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl1 ∨ lst = lst0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, phead1, qrl]

Additional information

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) ⊦ 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: qrl0, phead1, y

Proof step 113 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[qrl.last].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[qrl.last].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vtail = (phead0 ' + qrl.butlast).last, ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 114 from proof rely-D28-D29 (previous step) (back to tree)

vs[qrl.last].deqID = None, ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), vs[qrl.last].next = null, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail0 ∈ ps, vtail0 ∈ vs, (phead0 ' + qrl.butlast).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl, lst0, qrl1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl, lst0, y

Proof step 115 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[lst0].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), qrl = qrl1 + lst0 ', rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, addr ≠ null, first ≠ lst, phead ≠ phead0, qrl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (phead0 ' + qrl1).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (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)

Proof step 116 from proof rely-D28-D29 (previous step) (back to tree)

vs[lst0].deqID = None, ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[lst0].deqID = None, vs[lst0].next = null, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, vs[vtail0].next ≠ lst0, addr ≠ null, first ≠ lst, phead ≠ phead0, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), vtail0 ∈ ps, vtail0 ∈ vs, (phead0 ' + qrl1).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl1, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl1 ∨ lst = lst0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [phead0 ', qrl1], <all paths>

Additional information

Used terms: phead0 ', qrl1

Proof step 117 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 118 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[lst0].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), qrl1 = [], rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, vs[vtail0].next ≠ lst0, addr ≠ null, first ≠ lst, phead ≠ phead0, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, (phead0 ' + qrl1).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl1, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl1 ∨ lst = lst0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s)

Proof step 119 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[lst0].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ lst0, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ phead0, lst ≠ lst0, phead ≠ phead0, phead0 ≠ lst0, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ lst0, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, phead0 ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first, ¬ dups(qrl0), ¬ weak?(vs[vtail0].deqID), ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ phead0 ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first ∈ qrl0 ∨ first = vs[vtail0].next ∨ first = vtail0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vtail0].next ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ markedp([], vs); (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) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vs[vtail0].next ', qrl0

Proof step 120 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 121 from proof rely-D28-D29 (previous step) (back to tree)

vs[lst0].deqID = None, ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[lst0].deqID = None, vs[lst0].next = null, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ lst0, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, first ≠ phead0, lst ≠ lst0, phead ≠ phead0, phead0 ≠ lst0, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ lst0, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.last, vs), noid(tid, vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ', qrl0.last, vs), nonullRetRefs(vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first, vtail0 ∈ ps, vtail0 ∈ vs, phead0 ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0), ¬ weak?(vs[vtail0].deqID), ¬ qrl0.last ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' + lst0 ' from qrl0.last, ¬ phead0 ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, ¬ vtail0 ∈ qrl0, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), first ∈ qrl0 ∨ first = vs[vtail0].next ∨ first = vtail0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, phead1, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ 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: qrl0, phead1, y

Proof step 122 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[lst0].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, vs[vtail0].next ≠ phead0, vs[vtail0].next ≠ lst0, addr ≠ null, first ≠ lst, phead ≠ phead0, phead0 ≠ lst0, qrl1 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ null, vtail0 ≠ phead0, vtail0 ≠ lst0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, qrl1.last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl1), ¬ dups(qrl0), ¬ dups(qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ qrl1, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl1, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ∨ lst ∈ qrl1 ∨ lst = lst0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)

Proof step 123 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[lst0].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ lst0, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ lst0, phead ≠ phead0, phead0 ≠ lst0, qrl1 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ lst0, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl1, vs), unmarkedp(qrl1, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, qrl1.last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ phead0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ lst0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ qrl1 ∨ lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl1, phead1, qrl]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl1, phead1, y

Proof step 124 from proof rely-D28-D29 (previous step) (back to tree)

vs[lst0].deqID = None, ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[lst0].deqID = None, vs[lst0].next = null, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), qrl1 = qrl + phead1 ', rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ lst0, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, addr ≠ null, first ≠ lst, lst ≠ lst0, phead ≠ phead0, phead0 ≠ lst0, qrl1 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ lst0, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + qrl1 + lst0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl1, ps), unmarkedp(qrl1, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead1 ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl1), ¬ dups(qrl0), ¬ dups(qrl0 + qrl1), ¬ weak?(vs[vtail0].deqID), ¬ vs[vtail0].next ∈ qrl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl1, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + qrl1 + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ phead0 ∈ qrl1, ¬ phead0 ∈ qrl0, ¬ lst0 ∈ qrl1, ¬ lst0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), lst ∈ qrl1 ∨ lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 125 from proof rely-D28-D29 (previous step) (back to tree)

ps[lst0].deqID = None, vs[ps[first].next].deqID = Some(othertid), ps[vtail0].deqID = vs[vtail0].deqID, vs[lst0].deqID = None, vs[phead1].deqID = None, ps[phead1].deqID = None, ps[vtail0].next = vs[vtail0].next, vs[lst0].next = null, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ lst0, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, vs[vtail0].next ≠ phead1, addr ≠ null, first ≠ lst, lst ≠ lst0, lst0 ≠ phead1, phead ≠ phead0, phead0 ≠ lst0, phead0 ≠ phead1, tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ lst0, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ phead1, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ', vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, (vs[vtail0].next ' + qrl0).last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ', (vs[vtail0].next ' + qrl0).last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[vtail0].deqID), some?(vs[vs[vtail0].next].deqID), some?(ps[vs[vtail0].next].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, phead1 ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ' from lst, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ lst0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vs[vtail0].next ' + qrl0).last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ' from (vs[vtail0].next ' + qrl0).last, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl0, ¬ lst0 ∈ qrl, vs[(vs[vtail0].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[vtail0].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[vtail0].next ' + qrl0).last].next].val), phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, lst ∈ qrl ∨ lst = phead1 ∨ lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vs[vtail0].next ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ markedp([], vs); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vs[vtail0].next ', qrl0

Proof step 126 from proof rely-D28-D29 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 127 from proof rely-D28-D29 (previous step) (back to tree)

ps[phead1].deqID = None, vs[phead1].deqID = None, vs[lst0].deqID = None, ps[vtail0].deqID = vs[vtail0].deqID, vs[ps[first].next].deqID = Some(othertid), ps[lst0].deqID = None, vs[lst0].next = null, ps[vtail0].next = vs[vtail0].next, ps[vtail0].val = vs[vtail0].val, dom vrvHp = dom prvHp, owns(vtail0) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, vs[vtail0].next ≠ lst0, vs[vtail0].next ≠ phead0, ps[first].next ≠ null, vs[vtail0].next ≠ phead1, addr ≠ null, first ≠ lst, lst ≠ lst0, lst0 ≠ phead1, phead ≠ phead0, phead0 ≠ lst0, phead0 ≠ phead1, qrl0 ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, vtail0 ≠ lst0, vtail0 ≠ phead0, vtail0 ≠ null, vtail0 ≠ vs[vtail0].next, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[vtail0].next ' + (qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ', vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, qrl0.last, vs), noid(tid, vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ', qrl0.last, vs), nonullRetRefs(vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[vtail0].next].deqID), some?(vs[vs[vtail0].next].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vtail0 ∈ ps, vtail0 ∈ vs, phead1 ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ' from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ weak?(vs[vtail0].deqID), ¬ lst0 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl0, ¬ phead1 ∈ qrl, ¬ phead1 ∈ qrl0, ¬ vs[vtail0].next ∈ qrl, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ qrl0.last ∈ vtail0 ' + (vs[vtail0].next ' + qrl0 + phead0 ') + (qrl + phead1 ') + lst0 ' from qrl0.last, ¬ phead0 ∈ qrl, ¬ phead0 ∈ qrl0, ¬ lst0 ∈ qrl, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), lst ∈ qrl ∨ lst = phead1 ∨ lst ∈ vtail0 ' + vs[vtail0].next ' + qrl0 + phead0 ' from first, first = vtail0 ∨ first = vs[vtail0].next ∨ first ∈ qrl0 ∨ first = phead0, phead = vtail0 ∨ phead = vs[vtail0].next ∨ phead ∈ qrl0 ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [qrl0, first0, qrl1]

Additional information

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) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, first0, y

Proof step 128 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)]), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ 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)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], vs, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], vs, vs

Proof step 129 from proof rely-D28-D29 (previous step) (back to tree)

⊦ 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))

A spec-lemma

Proof step 130 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 131 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val ∧ (ps[r].deqID ≠ None → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), r], <all paths>

Additional information

Used terms: ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), r

Proof step 132 from proof rely-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 133 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), r = ps[first].next, rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ orl ∨ r ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ps[r].val = ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val ∧ (ps[r].deqID ≠ None → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 134 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, Some(othertid) ≠ ps[ps[first].next].deqID, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ps[first].next ∈ orl ∨ ps[first].next ∈ qrl ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix1, seq:⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)), subst:[ps, rl, owns, r, rl0, vs] → [ps, orl, owns, first, qrl, vs]

Additional information

Used terms: ps, orl, owns, first, qrl, vs

Proof step 135 from proof rely-D28-D29 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))

A spec-lemma

Proof step 136 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, Some(othertid) ≠ ps[ps[first].next].deqID, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), ps[first].next ∈ orl ∨ ps[first].next ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)

Proof step 137 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, Some(othertid) ≠ ps[ps[first].next].deqID, addr ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 138 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, Some(othertid) ≠ ps[ps[first].next].deqID, addr ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 139 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, Some(othertid) ≠ ps[ps[first].next].deqID, addr ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), first = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ first ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ qrl, phead ∈ rl1 ∨ phead = first ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, vtail0, qrl0]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail0, y

Proof step 140 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = first0 + rl, rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, Some(othertid) ≠ ps[ps[first].next].deqID, addr ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, ps[first].next ∈ rl1 ∨ ps[first].next = first ∨ ps[first].next ∈ rl2 ∨ ps[first].next ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 141 from proof rely-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(othertid) ≠ ps[vs[first].next].deqID, addr ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl, ps), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 142 from proof rely-D28-D29 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(othertid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rl = [], rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(othertid) ≠ ps[vs[first].next].deqID, addr ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 143 from proof rely-D28-D29 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(othertid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[vs[first].next].val), ps[vs[first].next].deqID ≠ None, vs[first].next ≠ null, Some(othertid) ≠ ps[vs[first].next].deqID, addr ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + vs[first].next ' + qrl, vhead, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl, vs[first].next = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ first = vhead ∧ phead ≠ vs[vhead].next ∧ unmarkedp(qrl, vs) ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).tail = x; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s)

Proof step 144 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, addr ∈ vrvHp, vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, phead ∈ orl, first ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalowns-def, seq:⊦ 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)), subst:[ps, ps0, tid, owns, vs0, owns0, vs] → [ps, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], tid0, owns, vs, owns, vs], <all paths>

Additional information

Used terms: ps, ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], tid0, owns, vs, owns, vs

Proof step 145 from proof rely-D28-D29 (previous step) (back to tree)

⊦ 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))

A spec-lemma

Proof step 146 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)] ∧ vs[r] = vs[r] ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = vs[r].next) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = ps[r].val ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = vs[r].val) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)

Proof step 147 from proof rely-D28-D29 (previous step) (back to tree)

vs[ps[first].next].deqID = Some(othertid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(othertid, vs[ps[first].next].val), ps[ps[first].next].deqID ≠ None, ps[first].next ≠ null, addr ≠ null, first ≠ lst, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ orl, phead ∈ orl, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, addr ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = ps[r].deqID ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].deqID = vs[r].deqID) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = ps[r].val ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].val = vs[r].val) ∧ ( ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = ps[r].next ∨ ps[ps[first].next, ps[ps[first].next].deqID:= Some(othertid)][r].next = vs[r].next)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [ps, ps[first].next, ps[ps[first].next].deqID:= Some(othertid), r], <all paths>

Additional information

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[first].next, ps[ps[first].next].deqID:= Some(othertid), r

Proof step 148 from proof rely-D28-D29 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof Tree for rely-D28-D29 (View conclusion)

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.

the proof tree