[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 step-E14-E15 (conclusion) (back to tree)

⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → ( gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid) ∧ lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs) ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps) ∧ gstepf(gs, ls, E14, a).orl ≠ [] ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl ∧ rvownerok(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp) ∧ dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp ∧ ( gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs(gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ (gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs)) ∧ ( gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E14, a).vs[(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps ∧ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs ∧ lstepf(gs, ls, E14, a).node ≠ null ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl) ∧ gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null) ∧ gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] ∧ ¬ lstepf(gs, ls, E14, a).success ∧ nextnottid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ noid (lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ oneowns (lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-E14-E15 (previous step) (back to tree)

ls.nxt = gs.vs[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E14, a) = E15, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E14, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid) ∧ lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs) ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps) ∧ gstepf(gs, ls, E14, a).orl ≠ [] ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl ∧ rvownerok(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp) ∧ dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp ∧ ( gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs(gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ (gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs)) ∧ ( gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E14, a).vs[(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps ∧ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs ∧ lstepf(gs, ls, E14, a).node ≠ null ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl) ∧ gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null) ∧ gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] ∧ ¬ lstepf(gs, ls, E14, a).success ∧ nextnottid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ noid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ oneowns (lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps)

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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, E14, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + gs.vs[ls.lst].next ;gs.qrl )) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(gs.vs[ls.lst].next; None) ;gs.owns ); (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ lstepf(gs, ls, E14, a) = ls; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, E14, a) = E15; (s)

Proof step 3 from proof step-E14-E15 (previous step) (back to tree)

ls.nxt = gs.vs[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ls.node ∈ gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt], ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ oneowns(ls.tid, ls.node, (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns), gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ noid(ls.tid, gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vhead, gs.vs) ∧ gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt][ls.node] = mk(ls.value, None, null) ∧ ¬ ls.node ∈ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ∧ ( gs.vtail = (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)).last ∨ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ≠ [] ∧ gs.vtail = (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).butlast).last ∧ gs.vs[(ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).last].deqID = None ∧ gs.vs[(ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).last].next = null) ∧ ( gs.orl.last = gs.vhead ∧ ( (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl) ≠ [] → unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl).tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs)) ∧ nonullRetRefs(gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs, gs.vretRefs, gs.pretRefs) ∧ unmarkedp((ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ markedp(gs.orl, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt]) ∧ ¬ dups(gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ listp (gs.orl + (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl), gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.nxt], (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)) ∧ (ls.lst ∈ gs.orl ∨ ls.lst ∈ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt ';gs.qrl)) ∧ (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns)(ls.node) = Some(ls.tid)

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 step-E14-E15 (previous step) (back to tree)

ls.nxt = vs[ls.lst].next, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ ps[ls.lst, ps[ls.lst].next:= ls.nxt], ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(ls.tid, ls.node, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ noid(ls.tid, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vhead, vs) ∧ ps[ls.lst, ps[ls.lst].next:= ls.nxt][ls.node] = mk(ls.value, None, null) ∧ ¬ ls.node ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ∧ ( vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)).last ∨ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] ∧ vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).butlast).last ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].deqID = None ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] → unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs)) ∧ nonullRetRefs(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ ¬ dups(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ listp (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ (ls.lst ∈ orl ∨ ls.lst ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)(ls.node) = Some(ls.tid)

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 step-E14-E15 (previous step) (back to tree)

ls.nxt = vs[ls.lst].next, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, ls.node ∈ ps[ls.lst, ps[ls.lst].next:= ls.nxt], phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(ls.tid, ls.node, (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ noid(ls.tid, orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vhead, vs) ∧ ps[ls.lst, ps[ls.lst].next:= ls.nxt][ls.node] = mk(ls.value, None, null) ∧ ¬ ls.node ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ∧ ( vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)).last ∨ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] ∧ vtail = (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).butlast).last ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].deqID = None ∧ vs[(ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl) ≠ [] → unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs)) ∧ nonullRetRefs(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ markedp(orl, ps[ls.lst, ps[ls.lst].next:= ls.nxt]) ∧ ¬ dups(orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ listp (orl + (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl), vs, ps[ls.lst, ps[ls.lst].next:= ls.nxt], (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)) ∧ (ls.lst ∈ orl ∨ ls.lst ∈ (ls.lst = (orl + qrl).last ⊃ qrl + ls.nxt ';qrl)) ∧ (ls.lst = (orl + qrl).last ⊃ owns(ls.nxt; None);owns)(ls.node) = Some(ls.tid)

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 step-E14-E15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, node ∈ ps[lst, ps[lst].next:= vs[lst].next], phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns), vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ ps[lst, ps[lst].next:= vs[lst].next][node] = mk(value, None, null) ∧ ¬ node ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)(node) = Some(tid)

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 + qrl, owns, lst, vs]

Additional information

Used terms: ps, orl + qrl, owns, lst, vs

Proof step 8 from proof step-E14-E15 (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 9 from proof step-E14-E15 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ ps[lst, ps[lst].next:= vs[lst].next], node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ lst ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(tid, node, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns), vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ ps[lst, ps[lst].next:= vs[lst].next][node] = mk(value, None, null) ∧ ¬ node ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)(node) = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 10 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, node ≠ lst, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(tid, node, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns), vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ ¬ node ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)(node) = Some(tid)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: lst = (orl + qrl).last

Additional information

Used formulas: lst = (orl + qrl).last

Proof step 11 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, lst = (orl + qrl).last, owns(node) = Some(tid), vs[lst].next ≠ null, node ≠ null, node ≠ lst, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns), vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ ¬ node ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)(node) = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ 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) ⊦ (x + a ').last = a; (s) ⊦ (x + a ').butlast = x; (s)

Proof step 12 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ' + rl2, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(orl + qrl).last].next ≠ null, node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(tid, node, owns(vs[(orl + qrl).last].next; None), vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ noid(tid, orl + qrl + vs[(orl + qrl).last].next ', vhead, vs) ∧ node ≠ vs[(orl + qrl).last].next ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ ( orl.last = vhead ∧ unmarkedp((qrl + vs[(orl + qrl).last].next ').tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + qrl + vs[(orl + qrl).last].next ', vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ listp (orl + qrl + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

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 + vs[(orl + qrl).last].next ', vtail0, rl]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x + [] = x; (s) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl + vs[(orl + qrl).last].next ', vtail0, y

Proof step 13 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ' + rl2, qrl + vs[(orl + qrl).last].next ' = vtail0 + rl, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl + vs[(orl + qrl).last].next ' ≠ [], vs[(orl + qrl).last].next ≠ null, node ≠ null, node ≠ (orl + qrl).last, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, owns(vs[(orl + qrl).last].next; None), vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ noid(tid, orl + qrl + vs[(orl + qrl).last].next ', vhead, vs) ∧ node ≠ vs[(orl + qrl).last].next ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ (orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + qrl + vs[(orl + qrl).last].next ', vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ listp (orl + qrl + vs[(orl + qrl).last].next ', vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next)

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 14 from proof step-E14-E15 (previous step) (back to tree)

qrl + vs[(orl + qrl).last].next ' = vtail0 ' + rl, orl + qrl = rl1 + (orl + qrl).last ' + rl2, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(orl + qrl).last].next ≠ null, node ≠ (orl + qrl).last, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ rl, vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next ⊦ oneowns(tid, node, owns(vs[(orl + qrl).last].next; None), vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ noid(tid, orl + vtail0 ' + rl, vhead, vs) ∧ node ≠ vs[(orl + qrl).last].next ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ (orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + vtail0 ' + rl, vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ listp(orl + vtail0 ' + rl, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next)

Heuristic use patterns 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] → [orl, qrl], <all paths>

Additional information

Used terms: orl, qrl

Proof step 15 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 16 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ' + rl2, qrl + vs[(orl + qrl).last].next ' = vtail0 ' + rl, vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = [], vs[(orl + qrl).last].next ≠ null, node ≠ (orl + qrl).last, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[(orl + qrl).last].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 ∈ qrl ∨ vtail0 = vs[(orl + qrl).last].next, vs[(orl + qrl).last].next = vtail0 ∨ vs[(orl + qrl).last].next ∈ rl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(tid, node, owns(vs[(orl + qrl).last].next; None), vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ noid(tid, orl + vtail0 ' + rl, vhead, vs) ∧ node ≠ vs[(orl + qrl).last].next ∧ (vtail = vs[(orl + qrl).last].next ∨ vtail = (orl + qrl).last) ∧ (orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + vtail0 ' + rl, vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][vs[(orl + qrl).last].next].deqID = None ∧ markedp(orl, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next]) ∧ ¬ vs[(orl + qrl).last].next ∈ orl ∧ ¬ vs[(orl + qrl).last].next ∈ qrl ∧ listp(orl + vtail0 ' + rl, vs, ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], owns(vs[(orl + qrl).last].next; None)) ∧ ((orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ∨ (orl + qrl).last = vs[(orl + qrl).last].next)

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 + [] = x; (s) ⊦ unmarkedp([], vs); (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s)

Proof step 17 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, orl = rl1 + orl.last ' + rl2, owns(node) = Some(tid), vs[orl.last].next ≠ null, node ≠ null, node ≠ orl.last, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl, vs, ps, owns), listp(orl.last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[orl.last].next)), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ oneowns(tid, node, owns(vs[orl.last].next; None), vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ noid(tid, orl + vs[orl.last].next ', vhead, vs) ∧ node ≠ vs[orl.last].next ∧ nonullRetRefs(orl + vs[orl.last].next ', vs, vretRefs, pretRefs) ∧ ps[orl.last, ps[orl.last].next:= vs[orl.last].next][vs[orl.last].next].deqID = None ∧ markedp(orl, ps[orl.last, ps[orl.last].next:= vs[orl.last].next]) ∧ ¬ vs[orl.last].next ∈ orl ∧ listp(orl + vs[orl.last].next ', vs, ps[orl.last, ps[orl.last].next:= vs[orl.last].next], owns(vs[orl.last].next; None))

Heuristic use patterns 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, phead0, rl]

Additional information

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

Proof step 18 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl1 + phead0 ' + rl2, orl = rl + phead0 ', owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ noid(tid, orl + vs[phead0].next ', vhead, vs) ∧ node ≠ vs[phead0].next ∧ nonullRetRefs(orl + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][vs[phead0].next].deqID = None ∧ markedp(orl, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ¬ vs[phead0].next ∈ orl ∧ listp(orl + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 19 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ noid(tid, (rl + phead0 ') + vs[phead0].next ', vhead, vs) ∧ node ≠ vs[phead0].next ∧ nonullRetRefs((rl + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[phead0].next ∈ rl ∧ vs[phead0].next ≠ phead0 ∧ listp((rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).head = (x + a ').head; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 20 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, node, vs], <all paths>

Additional information

Used terms: ps, tid, owns, node, vs

Proof step 21 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 22 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl), ¬ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[phead0, ps[phead0].next:= vs[phead0].next], tid, owns(vs[phead0].next; None), node, vs], <all paths>

Additional information

Used terms: ps[phead0, ps[phead0].next:= vs[phead0].next], tid, owns(vs[phead0].next; None), node, vs

Proof step 23 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 24 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), node ∈ ps, node ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, ¬ node ∈ vs ∨ ¬ node ∈ ps[phead0, ps[phead0].next:= vs[phead0].next] ∨ owns(vs[phead0].next; None)(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(vs[phead0].next; None)(r0) ≠ None → owns(vs[phead0].next; None)(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 25 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0, (vs[phead0].next = node ⊃ None;Some(tid)) ≠ Some(tid) ∨ ¬(r0 ≠ node ∧ ¬(vs[phead0].next ≠ r0 → None = owns(r0)) → owns(r0).tid ≠ tid) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 44

Additional information

Proof step 26 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, (vs[phead0].next = node ⊃ None;Some(tid)) ≠ Some(tid), node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), node ∈ ps, node ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 13

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 27 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, owns(r0).tid = tid, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ r0, vs[phead0].next ≠ null, None ≠ owns(r0), node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ node, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), node ∈ ps, node ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 28 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(owns(r0).tid), vs[phead0].next ≠ r0, vs[phead0].next ≠ null, None ≠ owns(r0), node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, phead ∈ vs, phead ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ≠ node ∧ owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 44 terms: r0

Additional information

Used terms: r0

Proof step 29 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ noid(tid, (rl + phead0 ') + vs[phead0].next ', vhead, vs), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-reduce, seq:⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))), subst:[rl, tid, r, vs0, rl0, vs] → [rl + phead0 ', tid, vhead, vs, (rl + phead0 ') + vs[phead0].next ', vs], <all paths>

Additional information

Used terms: rl + phead0 ', tid, vhead, vs, (rl + phead0 ') + vs[phead0].next ', vs

Proof step 30 from proof step-E14-E15 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid)))

A spec-lemma

Proof step 31 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( (r0 ≠ vhead ∧ r0 ∈ rl + phead0 ' from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ (rl + phead0 ') + vs[phead0].next ' from vhead → vs[r0].deqID ≠ Some(tid)), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 32 from proof step-E14-E15 (previous step) (back to tree)

vs[r0].deqID = Some(tid), vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, r0 ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), r0 ∈ (rl + phead0 ') + vs[phead0].next ' from vhead, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ r0 ∈ rl + phead0 ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl + phead0 ', vs[phead0].next ', vhead], <all paths>

Additional information

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

Proof step 33 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 34 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ rl, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

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 35 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, ps), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vs[phead0].next ∈ rl, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0, phead ∈ rl ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[reflist], name:in-def, seq: ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)), subst:[a, x] → [vs[phead0].next, rl], <all paths>

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[phead0].next, rl

Proof step 36 from proof step-E14-E15 (previous step) (back to tree)

⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))

A spec-lemma

Proof step 37 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = vs[phead0].deqID, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl + phead0 ', vhead, vs), nonullRetRefs(rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ listp((rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ weak?(vs[phead0].deqID), ¬ phead0 ∈ rl, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ rl ≠ [] ∧ rl.last = vhead ∧ phead ≠ phead0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-enq, seq:⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → ( listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None), subst:[ps, rl, owns, r, vs] → [ps, rl + phead0 ', owns, vs[phead0].next, vs]

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, rl + phead0 ', owns, vs[phead0].next, vs

Proof step 38 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)

A spec-lemma

Proof step 39 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + qrl.last ' + rl2, qrl + vs[qrl.last].next ' = vtail0 ' + rl, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[qrl.last].next ≠ null, node ≠ qrl.last, node ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl.last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 ∈ qrl ∨ vtail0 = vs[qrl.last].next, vs[qrl.last].next = vtail0 ∨ vs[qrl.last].next ∈ rl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), qrl.last ∈ orl ∨ qrl.last ∈ qrl, vtail = qrl.last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ oneowns(tid, node, owns(vs[qrl.last].next; None), vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ noid(tid, orl + vtail0 ' + rl, vhead, vs) ∧ node ≠ vs[qrl.last].next ∧ (vtail = vs[qrl.last].next ∨ vtail = qrl.last) ∧ (orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + vtail0 ' + rl, vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ¬ vs[qrl.last].next ∈ orl ∧ ¬ vs[qrl.last].next ∈ qrl ∧ listp(orl + vtail0 ' + rl, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None)) ∧ (qrl.last ∈ orl ∨ qrl.last ∈ qrl ∨ qrl.last = vs[qrl.last].next)

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-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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-08: ⊦ a ' + x = y + b ' ∧ y ≠ [] → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ x.last ∈ x ↔ x ≠ []; (s)

Proof step 40 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + qrl.last ' + rl2, qrl + vs[qrl.last].next ' = vtail0 ' + rl, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[qrl.last].next ≠ null, node ≠ null, node ≠ qrl.last, orl ≠ [], qrl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(qrl.last ' + rl2, vs, ps, owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vtail0 ∈ qrl, vs[qrl.last].next ∈ rl, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, owns(vs[qrl.last].next; None), vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ noid(tid, orl + vtail0 ' + rl, vhead, vs) ∧ node ≠ vs[qrl.last].next ∧ (orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + vtail0 ' + rl, vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ¬ vs[qrl.last].next ∈ orl ∧ ¬ vs[qrl.last].next ∈ qrl ∧ listp(orl + vtail0 ' + rl, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None))

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, rl0]

Additional information

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

Proof step 41 from proof step-E14-E15 (previous step) (back to tree)

qrl + vs[qrl.last].next ' = vtail0 ' + rl, orl + qrl = rl1 + qrl.last ' + rl2, vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = phead0 + rl0, vs[qrl.last].next ≠ null, node ≠ null, node ≠ qrl.last, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(qrl.last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), weak?(owns(vs[qrl.last].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, vs[qrl.last].next ∈ rl, vtail0 ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, owns(vs[qrl.last].next; None), vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ noid(tid, orl + vtail0 ' + rl, vhead, vs) ∧ node ≠ vs[qrl.last].next ∧ (orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ nonullRetRefs(orl + vtail0 ' + rl, vs, vretRefs, pretRefs) ∧ unmarkedp(qrl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next][vs[qrl.last].next].deqID = None ∧ markedp(orl, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next]) ∧ ¬ vs[qrl.last].next ∈ orl ∧ ¬ vs[qrl.last].next ∈ qrl ∧ listp(orl + vtail0 ' + rl, vs, ps[qrl.last, ps[qrl.last].next:= vs[qrl.last].next], owns(vs[qrl.last].next; None))

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

Proof step 42 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + (vtail0 ' + rl0).last ' + rl2, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + rl0).last].next].deqID = None, vs[vs[(vtail0 ' + rl0).last].next].next = null, ps[vs[(vtail0 ' + rl0).last].next] = vs[vs[(vtail0 ' + rl0).last].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[(vtail0 ' + rl0).last].next ≠ null, node ≠ vtail0, node ≠ (vtail0 ' + rl0).last, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + rl0, vs, ps, owns), listp((vtail0 ' + rl0).last ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + rl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + rl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[(vtail0 ' + rl0).last].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[(vtail0 ' + rl0).last].next ∈ vs, vs[(vtail0 ' + rl0).last].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ⊦ oneowns (tid, node, owns(vs[(vtail0 ' + rl0).last].next; None), vs, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next]) ∧ noid(tid, orl + vtail0 ' + rl0 + vs[(vtail0 ' + rl0).last].next ', vhead, vs) ∧ node ≠ vs[(vtail0 ' + rl0).last].next ∧ nonullRetRefs(orl + vtail0 ' + rl0 + vs[(vtail0 ' + rl0).last].next ', vs, vretRefs, pretRefs) ∧ ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next]) ∧ ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next][vs[(vtail0 ' + rl0).last].next].deqID = None ∧ markedp(orl, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next]) ∧ ¬ vs[(vtail0 ' + rl0).last].next ∈ orl ∧ vs[(vtail0 ' + rl0).last].next ≠ vtail0 ∧ ¬ vs[(vtail0 ' + rl0).last].next ∈ rl0 ∧ listp (orl + vtail0 ' + rl0 + vs[(vtail0 ' + rl0).last].next ', vs, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next], owns(vs[(vtail0 ' + rl0).last].next; None))

Heuristic use patterns 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 ', rl0], <all paths>

Additional information

Used terms: vtail0 ', rl0

Proof step 43 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 44 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + (vtail0 ' + rl0).last ' + rl2, vs[vs[(vtail0 ' + rl0).last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[(vtail0 ' + rl0).last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[(vtail0 ' + rl0).last].next] = vs[vs[(vtail0 ' + rl0).last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0 = [], vs[(vtail0 ' + rl0).last].next ≠ null, node ≠ vtail0, node ≠ (vtail0 ' + rl0).last, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + rl0).last ' + rl2, vs, ps, owns), listp(orl + vtail0 ' + rl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + rl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + rl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[(vtail0 ' + rl0).last].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[(vtail0 ' + rl0).last].next ∈ ps, vs[(vtail0 ' + rl0).last].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ⊦ oneowns (tid, node, owns(vs[(vtail0 ' + rl0).last].next; None), vs, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next]) ∧ noid(tid, orl + vtail0 ' + rl0 + vs[(vtail0 ' + rl0).last].next ', vhead, vs) ∧ node ≠ vs[(vtail0 ' + rl0).last].next ∧ nonullRetRefs(orl + vtail0 ' + rl0 + vs[(vtail0 ' + rl0).last].next ', vs, vretRefs, pretRefs) ∧ ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next]) ∧ ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next][vs[(vtail0 ' + rl0).last].next].deqID = None ∧ markedp(orl, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next]) ∧ ¬ vs[(vtail0 ' + rl0).last].next ∈ orl ∧ vs[(vtail0 ' + rl0).last].next ≠ vtail0 ∧ ¬ vs[(vtail0 ' + rl0).last].next ∈ rl0 ∧ listp (orl + vtail0 ' + rl0 + vs[(vtail0 ' + rl0).last].next ', vs, ps[(vtail0 ' + rl0).last, ps[(vtail0 ' + rl0).last].next:= vs[(vtail0 ' + rl0).last].next], owns(vs[(vtail0 ' + rl0).last].next; None))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ unmarkedp([], vs); (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws)

Proof step 45 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, node ≠ null, node ≠ vtail0, orl ≠ [], vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), weak?(owns(vs[vtail0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(orl), ¬ weak?(vs[vtail0].deqID), ¬ vtail0 ∈ orl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ⊦ oneowns(tid, node, owns(vs[vtail0].next; None), vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next]) ∧ noid(tid, orl + vtail0 ' + vs[vtail0].next ', vhead, vs) ∧ node ≠ vs[vtail0].next ∧ nonullRetRefs(orl + vtail0 ' + vs[vtail0].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[vtail0].next ∈ orl ∧ vs[vtail0].next ≠ vtail0 ∧ listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None))

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, phead0, orl0]

Additional information

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

Proof step 46 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, orl = orl0 + phead0 ', owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, node ≠ null, node ≠ vtail0, orl ≠ [], vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vtail0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ', vhead, vs), nonullRetRefs(orl + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), weak?(owns(vs[vtail0].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl), ¬ weak?(vs[vtail0].deqID), ¬ vtail0 ∈ orl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦ oneowns(tid, node, owns(vs[vtail0].next; None), vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next]) ∧ noid(tid, orl + vtail0 ' + vs[vtail0].next ', vhead, vs) ∧ node ≠ vs[vtail0].next ∧ nonullRetRefs(orl + vtail0 ' + vs[vtail0].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[vtail0].next ∈ orl ∧ vs[vtail0].next ≠ vtail0 ∧ listp(orl + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 47 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦ listp((orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)) ∧ vs[vtail0].next ≠ vtail0 ∧ ¬ vs[vtail0].next ∈ orl0 ∧ nonullRetRefs((orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vs, vretRefs, pretRefs) ∧ node ≠ vs[vtail0].next ∧ noid(tid, (orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vhead, vs) ∧ oneowns(tid, node, owns(vs[vtail0].next; None), vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ ¬ weak?(Some(tid)); (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ' + y).head = (x + a ').head; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 48 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(orl0), ¬ listp((orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next], owns(vs[vtail0].next; None)), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-enq, seq:⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → ( listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None), subst:[ps, rl, owns, r, vs] → [ps, (orl0 + phead0 ') + vtail0 ', owns, vs[vtail0].next, vs]

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (orl0 + phead0 ') + vtail0 ', owns, vs[vtail0].next, vs

Proof step 49 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)

A spec-lemma

Proof step 50 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), vs[vtail0].next ∈ orl0, vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

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 51 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vtail0 ∈ vs, vtail0 ∈ ps, vs[vtail0].next ∈ orl0, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[reflist], name:in-def, seq: ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)), subst:[a, x] → [vs[vtail0].next, orl0], <all paths>

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[vtail0].next, orl0

Proof step 52 from proof step-E14-E15 (previous step) (back to tree)

⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))

A spec-lemma

Proof step 53 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(orl0), ¬ noid(tid, (orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vhead, vs), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-reduce, seq:⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))), subst:[rl, tid, r, vs0, rl0, vs] → [(orl0 + phead0 ') + vtail0 ', tid, vhead, vs, (orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vs], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: (orl0 + phead0 ') + vtail0 ', tid, vhead, vs, (orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ', vs

Proof step 54 from proof step-E14-E15 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid)))

A spec-lemma

Proof step 55 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( (r0 ≠ vhead ∧ r0 ∈ (orl0 + phead0 ') + vtail0 ' from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ (orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ' from vhead → vs[r0].deqID ≠ Some(tid)), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 56 from proof step-E14-E15 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), r0 ∈ (orl0 + phead0 ') + vtail0 ' + vs[vtail0].next ' from vhead, vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ r0 ∈ (orl0 + phead0 ') + vtail0 ' 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), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [orl0 + phead0 ', vtail0 ' + vs[vtail0].next ', vhead], <all paths>

Additional information

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

Proof step 57 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 58 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r0 ∈ (orl0 + phead0 ' from vhead) + vtail0 ' + vs[vtail0].next ', vhead ∈ orl0 + phead0 ', ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ r0 ∈ (orl0 + phead0 ') + vtail0 ' 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), phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦

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 from r0 → r ∈ rl + rl0 from r0; (ss) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 59 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ phead0, vs[vtail0].next ≠ null, node ≠ null, node ≠ vtail0, node ≠ phead0, r0 ≠ vhead, vtail0 ≠ null, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ r0 ∈ (orl0 + phead0 ') + vtail0 ' from vhead, ¬ phead0 ∈ orl0, ¬ vtail0 ∈ orl0, ¬ node ∈ orl0, ¬ r0 ∈ orl0 + phead0 ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ∈ orl0 ∨ vhead = phead0, phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, r0 = vs[vtail0].next ∨ r0 = vtail0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [orl0, phead0 ', vhead], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ weak?(None); (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) Used terms: orl0, phead0 ', vhead

Proof step 60 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 61 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(orl0), ¬ oneowns(tid, node, owns(vs[vtail0].next; None), vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next]), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, node, vs], <all paths>

Additional information

Used terms: ps, tid, owns, node, vs

Proof step 62 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 63 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), phead ∈ ps, phead ∈ vs, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ oneowns(tid, node, owns(vs[vtail0].next; None), vs, ps[vtail0, ps[vtail0].next:= vs[vtail0].next]), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[vtail0, ps[vtail0].next:= vs[vtail0].next], tid, owns(vs[vtail0].next; None), node, vs], <all paths>

Additional information

Used terms: ps[vtail0, ps[vtail0].next:= vs[vtail0].next], tid, owns(vs[vtail0].next; None), node, vs

Proof step 64 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 65 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ ps, node ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0, ¬ node ∈ vs ∨ ¬ node ∈ ps[vtail0, ps[vtail0].next:= vs[vtail0].next] ∨ owns(vs[vtail0].next; None)(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(vs[vtail0].next; None)(r0) ≠ None → owns(vs[vtail0].next; None)(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 66 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(vtail0) = None, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), phead ∈ ps, phead ∈ vs, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, (vs[vtail0].next = node ⊃ None;Some(tid)) ≠ Some(tid) ∨ ¬(r0 ≠ node ∧ ¬(vs[vtail0].next ≠ r0 → None = owns(r0)) → owns(r0).tid ≠ tid) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 49

Additional information

Proof step 67 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, (vs[vtail0].next = node ⊃ None;Some(tid)) ≠ Some(tid), node ≠ phead0, node ≠ vtail0, node ≠ null, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ ps, node ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 14

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 68 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[vs[vtail0].next].deqID = None, ps[vtail0].next = null, vs[vs[vtail0].next].next = null, owns(r0).tid = tid, ps[vtail0].val = vs[vtail0].val, ps[vs[vtail0].next] = vs[vs[vtail0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(vtail0) = None, owns(node) = Some(tid), vs[vtail0].next ≠ r0, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, None ≠ owns(r0), node ≠ phead0, node ≠ vtail0, node ≠ null, r0 ≠ node, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), weak?(owns(vs[vtail0].next)), node ∈ ps, node ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[vtail0].next ∈ vs, vs[vtail0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None, phead ∈ orl0 ∨ phead = phead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 69 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[vtail0].next].deqID = None, ps[vtail0].deqID = None, vs[vs[vtail0].next].next = null, ps[vtail0].next = null, ps[vtail0].val = vs[vtail0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[vtail0].next] = vs[vs[vtail0].next], dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), owns(vtail0) = None, vs[vtail0].next ≠ r0, vs[vtail0].next ≠ null, vs[vtail0].next ≠ phead0, None ≠ owns(r0), node ≠ phead0, node ≠ vtail0, node ≠ null, r0 ≠ node, vtail0 ≠ phead0, vtail0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + phead0 ') + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, (orl0 + phead0 ') + vtail0 ', vhead, vs), nonullRetRefs((orl0 + phead0 ') + vtail0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), weak?(owns(vs[vtail0].next)), phead ∈ ps, phead ∈ vs, vs[vtail0].next ∈ ps, vs[vtail0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(orl0), ¬ weak?(vs[vtail0].deqID), ¬ node ∈ orl0, ¬ vtail0 ∈ orl0, ¬ phead0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ≠ node ∧ owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, phead ∈ orl0 ∨ phead = phead0, phead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead0 ∧ vs[vtail0].deqID = None ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 49 terms: r0

Additional information

Used terms: r0

Proof step 70 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + rl0.last ' + rl2, vs[vs[rl0.last].next].deqID = None, ps[vtail0].deqID = None, vs[vs[rl0.last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[rl0.last].next] = vs[vs[rl0.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[rl0.last].next ≠ null, node ≠ vtail0, node ≠ rl0.last, node ≠ null, orl ≠ [], rl0 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl0.last ' + rl2, vs, ps, owns), listp(orl + vtail0 ' + rl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + rl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + rl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[rl0.last].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[rl0.last].next ∈ ps, vs[rl0.last].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ⊦ oneowns(tid, node, owns(vs[rl0.last].next; None), vs, ps[rl0.last, ps[rl0.last].next:= vs[rl0.last].next]) ∧ noid(tid, orl + vtail0 ' + rl0 + vs[rl0.last].next ', vhead, vs) ∧ node ≠ vs[rl0.last].next ∧ nonullRetRefs(orl + vtail0 ' + rl0 + vs[rl0.last].next ', vs, vretRefs, pretRefs) ∧ ps[rl0.last, ps[rl0.last].next:= vs[rl0.last].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[rl0.last, ps[rl0.last].next:= vs[rl0.last].next]) ∧ ps[rl0.last, ps[rl0.last].next:= vs[rl0.last].next][vs[rl0.last].next].deqID = None ∧ markedp(orl, ps[rl0.last, ps[rl0.last].next:= vs[rl0.last].next]) ∧ ¬ vs[rl0.last].next ∈ orl ∧ vs[rl0.last].next ≠ vtail0 ∧ ¬ vs[rl0.last].next ∈ rl0 ∧ listp(orl + vtail0 ' + rl0 + vs[rl0.last].next ', vs, ps[rl0.last, ps[rl0.last].next:= vs[rl0.last].next], owns(vs[rl0.last].next; None))

Heuristic use patterns 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] → [rl0, phead0, rl]

Additional information

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

Proof step 71 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + phead0 ' + rl2, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0 = rl + phead0 ', vs[phead0].next ≠ null, node ≠ vtail0, node ≠ phead0, node ≠ null, orl ≠ [], rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vtail0 ' + rl0, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + vtail0 ' + rl0, vhead, vs), nonullRetRefs(orl + vtail0 ' + rl0, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + rl0), ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ⊦ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ noid(tid, orl + vtail0 ' + rl0 + vs[phead0].next ', vhead, vs) ∧ node ≠ vs[phead0].next ∧ nonullRetRefs(orl + vtail0 ' + rl0 + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ps[phead0, ps[phead0].next:= vs[phead0].next][vs[phead0].next].deqID = None ∧ markedp(orl, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ ¬ vs[phead0].next ∈ orl ∧ vs[phead0].next ≠ vtail0 ∧ ¬ vs[phead0].next ∈ rl0 ∧ listp(orl + vtail0 ' + rl0 + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None))

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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 72 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(rl), ¬ dups(orl), ¬ dups(orl + rl), ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ noid(tid, orl + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vhead, vs) ∧ node ≠ vs[phead0].next ∧ nonullRetRefs(orl + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[phead0].next ∈ orl ∧ vs[phead0].next ≠ vtail0 ∧ ¬ vs[phead0].next ∈ rl ∧ vs[phead0].next ≠ phead0 ∧ listp(orl + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None))

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, vhead0, rl0]

Additional information

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

Proof step 73 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, orl = rl0 + vhead0 ', owns(node) = Some(tid), vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(orl), ¬ dups(orl + rl), ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl, ¬ node ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]) ∧ noid(tid, orl + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vhead, vs) ∧ node ≠ vs[phead0].next ∧ nonullRetRefs(orl + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ ¬ vs[phead0].next ∈ orl ∧ vs[phead0].next ≠ vtail0 ∧ ¬ vs[phead0].next ∈ rl ∧ vs[phead0].next ≠ phead0 ∧ listp(orl + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 74 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦ listp ((rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)) ∧ vs[phead0].next ≠ phead0 ∧ ¬ vs[phead0].next ∈ rl ∧ vs[phead0].next ≠ vtail0 ∧ ¬ vs[phead0].next ∈ rl0 ∧ nonullRetRefs((rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs) ∧ node ≠ vs[phead0].next ∧ noid(tid, (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vhead, vs) ∧ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 75 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ listp ((rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: rotate

Additional information

Proof step 76 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp((rl0 + vhead0 ') + vtail0 ' + rl + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ') + vtail0 ' + rl + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ') + vtail0 ' + rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ listp ((rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, ps[phead0, ps[phead0].next:= vs[phead0].next], owns(vs[phead0].next; None)), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-enq, seq:⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → ( listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None), subst:[ps, rl, owns, r, vs] → [ps, (rl0 + vhead0 ') + vtail0 ' + rl + phead0 ', owns, vs[phead0].next, vs]

Additional information

Used simplifier rules: ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (rl0 + vhead0 ') + vtail0 ' + rl + phead0 ', owns, vs[phead0].next, vs

Proof step 77 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ r ≠ null ∧ r ∈ vs ∧ r ∈ ps → (listp(rl + r ', vs, ps[rl.last, ps[rl.last].next:= r], owns(r; None)) ↔ vs[rl.last].next = r ∧ ps[r].next = null ∧ ps[r].deqID = None)

A spec-lemma

Proof step 78 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ rl, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[reflist], name:in-def, seq: ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)), subst:[a, x] → [vs[phead0].next, rl], <all paths>

Additional information

Used terms: vs[phead0].next, rl

Proof step 79 from proof step-E14-E15 (previous step) (back to tree)

⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))

A spec-lemma

Proof step 80 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ y, z. rl = y + (vs[phead0].next + z), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 81 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + (vs[phead0].next ' + rl4) + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, vtail0 ≠ vs[phead0].next, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4, phead0, rl1 + phead0 ' + rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4, phead0, rl1 + phead0 ' + rl2

Proof step 82 from proof step-E14-E15 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 83 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4 = (rl1 + phead0 ' + rl2).butlast, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (rl1 + phead0 ' + rl2).last, rl1 + phead0 ' + rl2 ≠ [], vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, vtail0 ≠ vs[phead0].next, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl3, ps), unmarkedp(rl4, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 84 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4 = rl1 + (phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, vtail0 ≠ vs[phead0].next, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

Heuristic use patterns 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 ', rl2], <all paths>

Additional information

Used terms: phead0 ', rl2

Proof step 85 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 86 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4 = rl1 + (phead0 ' + rl2).butlast, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, rl2 = [], vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, vtail0 ≠ vs[phead0].next, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl3, ps), unmarkedp(rl4, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ⊦

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 ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 87 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, ps[vhead0].next ≠ vs[phead0].next, ps[vhead0].next ≠ phead0, ps[vhead0].next ≠ vhead0, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ ps[vhead0].next, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead0].next ∈ vs, ps[vhead0].next ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ weak?(vs[phead0].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ ps[vhead0].next ∈ rl4, ¬ ps[vhead0].next ∈ rl3, ¬ ps[vhead0].next ∈ rl0, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps, rl0 + vhead0 ' + ps[vhead0].next ' + rl3, owns, vs[phead0].next ' + rl4 + phead0 ', vs]

Additional information

Used terms: ps, rl0 + vhead0 ' + ps[vhead0].next ' + rl3, owns, vs[phead0].next ' + rl4 + phead0 ', vs

Proof step 88 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 89 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, vs[vs[phead0].next].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, ps[vhead0].next ≠ vs[phead0].next, ps[vhead0].next ≠ phead0, ps[vhead0].next ≠ vhead0, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ ps[vhead0].next, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, phead0 ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl3, ps), unmarkedp(rl4, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, ps[vhead0].next ∈ ps, ps[vhead0].next ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ weak?(vs[phead0].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ ps[vhead0].next ∈ rl4, ¬ ps[vhead0].next ∈ rl3, ¬ ps[vhead0].next ∈ rl0, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl3) + vs[phead0].next ' + rl4 + phead0 ', vs, ps, owns) → (listp(vs[phead0].next ' + rl4 + phead0 ', vs, ps, owns) ↔ vs[phead0].next ' + rl4 + phead0 ' ≠ []), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ⊦

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 ≠ []; (s)

Proof step 90 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, ps[vhead0].next ≠ vs[phead0].next, ps[vhead0].next ≠ phead0, ps[vhead0].next ≠ vhead0, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ ps[vhead0].next, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, phead0 ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vs, ps, owns), listp(vs[phead0].next ' + rl4 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + ps[vhead0].next ' + rl3 + vs[phead0].next ' + rl4) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead0].next ∈ vs, ps[vhead0].next ∈ ps, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ weak?(vs[phead0].deqID), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ ps[vhead0].next ∈ rl4, ¬ ps[vhead0].next ∈ rl3, ¬ ps[vhead0].next ∈ rl0, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl4

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ 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) ⊦ weak?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s)

Proof step 91 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4 = rl1 + phead0 ' + rl2.butlast, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ vs[phead0].next, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vs[phead0].next, phead0 ≠ vhead0, rl2 ≠ [], vtail0 ≠ vs[phead0].next, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl3, ps), unmarkedp(rl4, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl4), ¬ dups(rl0 + rl3), ¬ dups(rl3 + rl4), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl0), ¬ dups(rl3), ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl4, ¬ node ∈ rl3, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl3, ¬ node ∈ rl0, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl3, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 92 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[rl2.last].next ' + rl4 = rl1 + rl2.last ' + rl2.butlast, ps[rl2.last].deqID = None, ps[vtail0].deqID = None, vs[vs[rl2.last].next].deqID = None, vs[vs[rl2.last].next].next = null, ps[vs[rl2.last].next] = vs[vs[rl2.last].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2.last ≠ vhead0, rl2.last ≠ vs[rl2.last].next, vs[rl2.last].next ≠ null, vs[rl2.last].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ rl2.last, node ≠ null, node ≠ vs[rl2.last].next, rl2 ≠ [], vtail0 ≠ vhead0, vtail0 ≠ rl2.last, vtail0 ≠ vs[rl2.last].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + rl2.last ' + rl2, vs, ps, owns), listp(rl2.last ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl2.last ' + rl2, vhead, vs), nonullRetRefs(rl1 + rl2.last ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl3, ps), unmarkedp(rl4, ps), weak?(owns(vs[rl2.last].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[rl2.last].next ∈ vs, vs[rl2.last].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl3), ¬ dups(rl0), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl3 + rl4), ¬ dups(rl0 + rl3), ¬ dups(rl4), ¬ vhead0 ∈ rl0, ¬ vs[rl2.last].next ∈ rl3, ¬ vs[rl2.last].next ∈ rl4, ¬ vs[rl2.last].next ∈ rl0, ¬ node ∈ rl0, ¬ rl2.last ∈ rl3, ¬ rl2.last ∈ rl4, ¬ rl2.last ∈ rl0, ¬ node ∈ rl3, ¬ node ∈ rl4, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl4, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[rl2.last].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[rl2.last].deqID = None ⊦

Heuristic use patterns 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] → [rl2, phead0, rl]

Additional information

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

Proof step 93 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4 = rl1 + phead0 ' + rl, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl + phead0 ', vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ vs[phead0].next, phead0 ≠ vhead0, phead0 ≠ vs[phead0].next, rl2 ≠ [], vtail0 ≠ vhead0, vtail0 ≠ phead0, vtail0 ≠ vs[phead0].next, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl4, ps), unmarkedp(rl3, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl3), ¬ dups(rl0), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl3 + rl4), ¬ dups(rl0 + rl3), ¬ dups(rl4), ¬ vhead0 ∈ rl0, ¬ vs[phead0].next ∈ rl3, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl0, ¬ phead0 ∈ rl3, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl0, ¬ node ∈ rl3, ¬ node ∈ rl4, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl4, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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

Proof step 94 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl3 + vs[phead0].next ' + rl4 = rl1 + phead0 ' + rl, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ vs[phead0].next, phead0 ≠ vhead0, phead0 ≠ vs[phead0].next, vtail0 ≠ vhead0, vtail0 ≠ phead0, vtail0 ≠ vs[phead0].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl + phead0 ', vs, ps, owns), listp(phead0 ' + rl + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl3, ps), unmarkedp(rl4, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl3), ¬ dups(rl0), ¬ dups((rl0 + rl3) + rl4), ¬ dups(rl3 + rl4), ¬ dups(rl0 + rl3), ¬ dups(rl4), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl3, ¬ vtail0 ∈ rl4, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl4, ¬ vhead0 ∈ rl0, ¬ vs[phead0].next ∈ rl3, ¬ vs[phead0].next ∈ rl4, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl0, ¬ phead0 ∈ rl3, ¬ phead0 ∈ rl4, ¬ phead0 ∈ rl0, ¬ node ∈ rl3, ¬ node ∈ rl4, ¬ node ∈ rl1, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl3, vs) ∧ unmarkedp(rl4, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-nodups, seq: ⊦ listp(rl, vs, ps, owns) → ¬ dups(rl), subst:[owns, rl, vs, ps] → [owns, phead0 ' + rl + phead0 ', vs, ps]

Additional information

Used simplifier rules: ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: owns, phead0 ' + rl + phead0 ', vs, ps

Proof step 95 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) → ¬ dups(rl)

A spec-lemma

Proof step 96 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[phead0].next = vtail0, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 97 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vs[phead0].next ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vs[phead0].next, node ≠ vhead0, phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vs[phead0].next ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl0 + vhead0 ' + vs[phead0].next ' + rl, phead0, rl1 + phead0 ' + rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl0 + vhead0 ' + vs[phead0].next ' + rl, phead0, rl1 + phead0 ' + rl2

Proof step 98 from proof step-E14-E15 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 99 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[phead0].next ' + rl = (rl1 + phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (rl1 + phead0 ' + rl2).last, rl1 + phead0 ' + rl2 ≠ [], vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vs[phead0].next, node ≠ vhead0, phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vs[phead0].next ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 100 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[phead0].next ' + rl = rl1 + (phead0 ' + rl2).butlast, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vs[phead0].next, node ≠ vhead0, phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vs[phead0].next ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

Heuristic use patterns 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 ', rl2], <all paths>

Additional information

Used terms: phead0 ', rl2

Proof step 101 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 102 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[phead0].next ' + rl = rl1 + (phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, rl2 = [], vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vs[phead0].next, node ≠ vhead0, phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vs[phead0].next ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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 ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 103 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vhead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ phead0, node ≠ vhead0, node ≠ vs[phead0].next, node ≠ phead0, node ≠ null, phead0 ≠ null, phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps, rl0 + vhead0 ', owns, vs[phead0].next ' + rl + phead0 ', vs]

Additional information

Used terms: ps, rl0 + vhead0 ', owns, vs[phead0].next ' + rl + phead0 ', vs

Proof step 104 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 105 from proof step-E14-E15 (previous step) (back to tree)

ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vhead0].next = vs[phead0].next, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ phead0, node ≠ vhead0, node ≠ vs[phead0].next, node ≠ phead0, node ≠ null, phead0 ≠ null, phead0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp((rl0 + vhead0 ') + vs[phead0].next ' + rl + phead0 ', vs, ps, owns) → (listp(vs[phead0].next ' + rl + phead0 ', vs, ps, owns) ↔ vs[phead0].next ' + rl + phead0 ' ≠ []), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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 ≠ []; (s)

Proof step 106 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[vhead0].next = vs[phead0].next, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ phead0, node ≠ vhead0, node ≠ vs[phead0].next, node ≠ phead0, node ≠ null, phead0 ≠ null, phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vs, ps, owns), listp(vs[phead0].next ' + rl + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + vs[phead0].next ' + rl) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ 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) ⊦ weak?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s)

Proof step 107 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[phead0].next ' + rl = rl1 + phead0 ' + rl2.butlast, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vs[phead0].next, node ≠ vhead0, phead0 ≠ vhead0, rl2 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vs[phead0].next ∈ rl, ¬ vs[phead0].next ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 108 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[rl2.last].next ' + rl = rl1 + rl2.last ' + rl2.butlast, vs[vs[rl2.last].next].deqID = None, ps[rl2.last].deqID = None, vs[vs[rl2.last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2.last ≠ vhead0, vs[rl2.last].next ≠ null, vs[rl2.last].next ≠ vhead0, vs[rl2.last].next ≠ rl2.last, node ≠ vhead0, node ≠ vs[rl2.last].next, node ≠ rl2.last, node ≠ null, rl2 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl2.last ' + rl2, vs, ps, owns), listp(rl1 + rl2.last ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl2.last ' + rl2, vhead, vs), nonullRetRefs(rl1 + rl2.last ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[rl2.last].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[rl2.last].next ∈ ps, vs[rl2.last].next ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ rl2.last ∈ rl, ¬ rl2.last ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vs[rl2.last].next ∈ rl0, ¬ vs[rl2.last].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[rl2.last].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[rl2.last].deqID = None ⊦

Heuristic use patterns 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] → [rl2, phead0, rl3]

Additional information

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

Proof step 109 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[phead0].next ' + rl = rl1 + phead0 ' + rl3, ps[phead0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl3 + phead0 ', vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ phead0, node ≠ vhead0, node ≠ vs[phead0].next, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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

Proof step 110 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vs[phead0].next ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ phead0, node ≠ vhead0, node ≠ vs[phead0].next, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ vs[phead0].next ∈ rl0, ¬ vs[phead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-nodups, seq: ⊦ listp(rl, vs, ps, owns) → ¬ dups(rl), subst:[owns, rl, vs, ps] → [owns, rl1 + phead0 ' + rl3 + phead0 ', vs, ps]

Additional information

Used simplifier rules: ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: owns, rl1 + phead0 ' + rl3 + phead0 ', vs, ps

Proof step 111 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) → ¬ dups(rl)

A spec-lemma

Proof step 112 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vs[phead0].next ∈ rl0, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[reflist], name:in-def, seq: ⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z)), subst:[a, x] → [vs[phead0].next, rl0], <all paths>

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ some?(opttid) → opttid ≠ None; (as) Used terms: vs[phead0].next, rl0

Proof step 113 from proof step-E14-E15 (previous step) (back to tree)

⊦ a ∈ x ↔ (∃ y, z. x = y + (a + z))

A spec-lemma

Proof step 114 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ nonullRetRefs((rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs, vretRefs, pretRefs), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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).head = (x + a ').head; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)

Proof step 115 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r ≠ (rl0 + vhead0 ').head, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, r ∈ rl0 ∨ r = vhead0 ∨ r = vtail0 ∨ r ∈ rl ∨ r = phead0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, (r ∈ rl1 ∨ r = phead0 ∨ r ∈ rl2) ∧ r ≠ (rl1 + phead0 ').head

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

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] → [rl0 + vhead0 ', r0, rl3]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: rl0 + vhead0 ', r0, y

Proof step 116 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, rl0 + vhead0 ' = r0 + rl3, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0 + vhead0 ' ≠ [], vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r ≠ r0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ rl0 ∨ r = vhead0 ∨ r = vtail0 ∨ r ∈ rl ∨ r = phead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦ (r ∈ rl1 ∨ r = phead0 ∨ r ∈ rl2) ∧ r ≠ (rl1 + phead0 ').head, vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 117 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' = r0 ' + rl3, (r0 ' + rl3) + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r ≠ r0, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ rl0 ∨ r = vhead0 ∨ r = vtail0 ∨ r ∈ rl ∨ r = phead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, vhead0 = r0 ∨ vhead0 ∈ rl3, r0 ∈ rl0 ∨ r0 = vhead0, r0 ∈ rl1 ∨ r0 = phead0 ∨ r0 ∈ rl2 ⊦ (r ∈ rl1 ∨ r = phead0 ∨ r ∈ rl2) ∧ r ≠ (rl1 + phead0 ').head, vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

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] → [rl1 + phead0 ', node0, rl4]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: rl1 + phead0 ', node0, y

Proof step 118 from proof step-E14-E15 (previous step) (back to tree)

(r0 ' + rl3) + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, rl0 + vhead0 ' = r0 ' + rl3, rl1 + phead0 ' = node0 + rl4, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl1 + phead0 ' ≠ [], vs[r].deqID ≠ None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r ≠ r0, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl1 ∨ r0 = phead0 ∨ r0 ∈ rl2, r0 ∈ rl0 ∨ r0 = vhead0, vhead0 = r0 ∨ vhead0 ∈ rl3, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, r ∈ rl0 ∨ r = vhead0 ∨ r = vtail0 ∨ r ∈ rl ∨ r = phead0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, (r ∈ rl1 ∨ r = phead0 ∨ r ∈ rl2) ∧ r ≠ node0

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 119 from proof step-E14-E15 (previous step) (back to tree)

rl1 + phead0 ' = node0 ' + rl4, (r0 ' + rl3) + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, rl0 + vhead0 ' = r0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r ≠ r0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl1 ∨ r0 = phead0 ∨ r0 ∈ rl2, r0 ∈ rl0 ∨ r0 = vhead0, vhead0 = r0 ∨ vhead0 ∈ rl3, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, r ∈ rl0 ∨ r = vhead0 ∨ r = vtail0 ∨ r ∈ rl ∨ r = phead0, phead0 = node0 ∨ phead0 ∈ rl4, node0 ∈ rl1 ∨ node0 = phead0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null, (r ∈ rl1 ∨ r = phead0 ∨ r ∈ rl2) ∧ r ≠ node0

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl1

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws) ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s)

Proof step 120 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' = r0 ' + rl3, (r0 ' + rl3) + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, rl1 + phead0 ' = node0 ' + rl4, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl1 = phead1 + rl5, vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r ≠ r0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node0 ∈ rl1 ∨ node0 = phead0, phead0 = node0 ∨ phead0 ∈ rl4, r ∈ rl0 ∨ r = vhead0 ∨ r = vtail0 ∨ r ∈ rl ∨ r = phead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, vhead0 = r0 ∨ vhead0 ∈ rl3, r0 ∈ rl0 ∨ r0 = vhead0, r0 ∈ rl1 ∨ r0 = phead0 ∨ r0 ∈ rl2 ⊦ (r ∈ rl1 ∨ r = phead0 ∨ r ∈ rl2) ∧ r ≠ node0, vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 121 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' = node0 ' + rl3, rl3 + vtail0 ' + rl + phead0 ' = rl5 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, r ≠ vtail0, r ≠ phead0, r ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r ∈ rl2, ¬ r ∈ rl5, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl5, vs[vhead].next ≠ null ∧ vs[vs[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 ∈ rl ∨ r = vhead0 ∨ r ∈ rl0, vhead0 = node0 ∨ vhead0 ∈ rl3, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, node0 ∈ rl0 ∨ node0 = vhead0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl0

Additional information

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

Proof step 122 from proof step-E14-E15 (previous step) (back to tree)

rl3 + vtail0 ' + rl + phead0 ' = rl5 + phead0 ' + rl2, rl0 + vhead0 ' = node0 ' + rl3, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0 = [], vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, r ≠ vtail0, r ≠ phead0, r ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r ∈ rl2, ¬ r ∈ rl5, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl5, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node0 ∈ rl0 ∨ node0 = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, vhead0 = node0 ∨ vhead0 ∈ rl3, r ∈ rl ∨ r = vhead0 ∨ r ∈ rl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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 ∈ x → (a ∈ b ' + x ↔ a = b); (s) inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)

Proof step 123 from proof step-E14-E15 (previous step) (back to tree)

vtail0 ' + rl + phead0 ' = rl5 + phead0 ' + rl2, vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ node0, phead0 ≠ node0, r ≠ node0, r ≠ phead0, r ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), nextnottid(tid, node0, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, node0, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ rl5, r ∈ rl, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, node0 ∈ vs, node0 ∈ ps, node ∈ vs, ¬ dups(rl), ¬ node ∈ rl5, ¬ node ∈ rl, ¬ phead0 ∈ rl, ¬ node0 ∈ rl, ¬ vtail0 ∈ rl, ¬ node ∈ rl2, ¬ r ∈ rl5, ¬ r ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [vtail0 ' + rl, phead0, rl5 + phead0 ' + rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vtail0 ' + rl, phead0, rl5 + phead0 ' + rl2

Proof step 124 from proof step-E14-E15 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 125 from proof step-E14-E15 (previous step) (back to tree)

vtail0 ' + rl = (rl5 + phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (rl5 + phead0 ' + rl2).last, rl5 + phead0 ' + rl2 ≠ [], vs[r].deqID ≠ None, vs[phead0].next ≠ node0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ node0, phead0 ≠ node0, r ≠ node0, r ≠ phead0, r ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), nextnottid(tid, node0, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, node0, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), weak?(owns(vs[phead0].next)), node ∈ vs, node0 ∈ ps, node0 ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r ∈ rl, vtail0 ∈ rl5, ¬ dups(rl), ¬ node ∈ rl5, ¬ node ∈ rl, ¬ phead0 ∈ rl, ¬ node0 ∈ rl, ¬ vtail0 ∈ rl, ¬ node ∈ rl2, ¬ r ∈ rl5, ¬ r ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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 ∈ x → a ∈ x + y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 126 from proof step-E14-E15 (previous step) (back to tree)

vtail0 ' + rl = rl5 + (phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ node0, node ≠ node0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ node0, r ≠ vtail0, r ≠ phead0, r ≠ node0, vtail0 ≠ node0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), nextnottid(tid, node0, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, node0, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), weak?(owns(vs[phead0].next)), node ∈ vs, node0 ∈ ps, node0 ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r ∈ rl, vtail0 ∈ rl5, ¬ dups(rl), ¬ r ∈ rl2, ¬ r ∈ rl5, ¬ node ∈ rl2, ¬ vtail0 ∈ rl, ¬ node0 ∈ rl, ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ node ∈ rl5, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val) ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

Heuristic use patterns 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 ', rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (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) ⊦ ¬ weak?(None); (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) Used terms: phead0 ', rl2

Proof step 127 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 128 from proof step-E14-E15 (previous step) (back to tree)

rl3 + vtail0 ' + rl + phead0 ' = rl5 + phead0 ' + rl2, rl0 + vhead0 ' = node0 ' + rl3, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0 = vhead1 + rl1, vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, r ≠ vtail0, r ≠ phead0, r ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r ∈ rl2, ¬ r ∈ rl5, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl5, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), node0 ∈ rl0 ∨ node0 = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, vhead0 = node0 ∨ vhead0 ∈ rl3, r ∈ rl ∨ r = vhead0 ∨ r ∈ rl0 ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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 ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 129 from proof step-E14-E15 (previous step) (back to tree)

(rl1 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl5 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ node0, phead0 ≠ vhead0, r ≠ node0, r ≠ phead0, r ≠ vtail0, r ≠ vhead0, vhead0 ≠ node0, vtail0 ≠ node0, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl1, ¬ node ∈ rl2, ¬ r ∈ rl5, ¬ r ∈ rl2, ¬ node0 ∈ rl, ¬ node0 ∈ rl1, ¬ node ∈ rl5, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, r ∈ rl1 ∨ r ∈ rl ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl1 + vhead0 ' + vtail0 ' + rl, phead0, rl5 + phead0 ' + rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + vhead0 ' + vtail0 ' + rl, phead0, rl5 + phead0 ' + rl2

Proof step 130 from proof step-E14-E15 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 131 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = (rl5 + phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (rl5 + phead0 ' + rl2).last, rl5 + phead0 ' + rl2 ≠ [], vs[r].deqID ≠ None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ node0, phead0 ≠ vhead0, r ≠ node0, r ≠ phead0, r ≠ vtail0, r ≠ vhead0, vhead0 ≠ node0, vtail0 ≠ node0, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl1, ¬ node ∈ rl2, ¬ r ∈ rl5, ¬ r ∈ rl2, ¬ node0 ∈ rl, ¬ node0 ∈ rl1, ¬ node ∈ rl5, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ rl1 ∨ r ∈ rl, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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] ⊦ x + a ' + y ≠ []; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s)

Proof step 132 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = rl5 + (phead0 ' + rl2).butlast, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[r].deqID ≠ None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ node0, phead0 ≠ vhead0, r ≠ node0, r ≠ phead0, r ≠ vtail0, r ≠ vhead0, vhead0 ≠ node0, vtail0 ≠ node0, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl1, ¬ node ∈ rl2, ¬ r ∈ rl5, ¬ r ∈ rl2, ¬ node0 ∈ rl, ¬ node0 ∈ rl1, ¬ node ∈ rl5, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, r ∈ rl1 ∨ r ∈ rl ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

Heuristic use patterns 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 ', rl2], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ a ∈ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead0 ', rl2

Proof step 133 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 134 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = rl5 + phead0 ' + rl2.butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[r].deqID ≠ None, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ node0, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ node0, phead0 ≠ vhead0, r ≠ node0, r ≠ phead0, r ≠ vtail0, r ≠ vhead0, rl2 ≠ [], vhead0 ≠ node0, vtail0 ≠ node0, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl1, ¬ vhead0 ∈ rl1, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl1, ¬ node ∈ rl2, ¬ r ∈ rl5, ¬ r ∈ rl2, ¬ node0 ∈ rl, ¬ node0 ∈ rl1, ¬ node ∈ rl5, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ rl1 ∨ r ∈ rl, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 135 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = rl5 + rl2.last ' + rl2.butlast, vs[vs[rl2.last].next].deqID = None, ps[vtail0].deqID = None, ps[rl2.last].deqID = None, vs[vs[rl2.last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, rl2.last ≠ vhead0, rl2.last ≠ node0, vs[rl2.last].next ≠ null, vs[rl2.last].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ rl2.last, node ≠ null, node ≠ node0, r ≠ vhead0, r ≠ vtail0, r ≠ rl2.last, r ≠ node0, rl2 ≠ [], vhead0 ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ rl2.last, vtail0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl2.last ' + rl2, vs, ps, owns), listp((node0 ' + rl5) + rl2.last ' + rl2, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + rl2.last ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + rl2.last ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl, ps), weak?(owns(vs[rl2.last].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[rl2.last].next ∈ ps, vs[rl2.last].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ node ∈ rl, ¬ node ∈ rl5, ¬ node0 ∈ rl1, ¬ node0 ∈ rl, ¬ r ∈ rl2, ¬ r ∈ rl5, ¬ node ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl1, ¬ node ∈ rl1, ¬ rl2.last ∈ rl, ¬ rl2.last ∈ 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), r ∈ rl1 ∨ r ∈ rl, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[rl2.last].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[rl2.last].deqID = None ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

Heuristic use patterns 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] → [rl2, phead0, rl0]

Additional information

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

Proof step 136 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = rl5 + phead0 ' + rl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl0 + phead0 ', vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, r ≠ vhead0, r ≠ vtail0, r ≠ phead0, r ≠ node0, rl2 ≠ [], vhead0 ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl2, vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ node ∈ rl, ¬ node ∈ rl5, ¬ node0 ∈ rl1, ¬ node0 ∈ rl, ¬ r ∈ rl2, ¬ r ∈ rl5, ¬ node ∈ rl2, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl1, ¬ node ∈ rl1, ¬ phead0 ∈ rl, ¬ phead0 ∈ 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), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, r ∈ rl1 ∨ r ∈ rl ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ 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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s)

Proof step 137 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = rl5 + phead0 ' + rl0, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, r ≠ vhead0, r ≠ vtail0, r ≠ phead0, r ≠ node0, vhead0 ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl0 + phead0 ', vs, ps, owns), listp((node0 ' + rl5) + phead0 ' + rl0 + phead0 ', vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl0 + phead0 ', vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), some?(vs[node0].deqID), some?(ps[node0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl1, ¬ node ∈ rl1, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl5, ¬ node0 ∈ rl1, ¬ node0 ∈ rl, ¬ r ∈ rl0, ¬ r ∈ rl5, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r ∈ rl1 ∨ r ∈ rl, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: r ∈ rl1 + vhead0 ' + vtail0 ' + rl

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: r ∈ rl1 + vhead0 ' + vtail0 ' + rl

Proof step 138 from proof step-E14-E15 (previous step) (back to tree)

rl1 + vhead0 ' + vtail0 ' + rl = rl5 + phead0 ' + rl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[r].deqID ≠ None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node ≠ node0, phead0 ≠ vhead0, phead0 ≠ node0, r ≠ vhead0, r ≠ vtail0, r ≠ phead0, r ≠ node0, vhead0 ≠ node0, vtail0 ≠ vhead0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((node0 ' + rl5) + phead0 ' + rl0 + phead0 ', vs, ps, owns), listp(phead0 ' + rl0 + phead0 ', vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (node0 ' + rl5) + phead0 ' + rl0 + phead0 ', vhead, vs), nonullRetRefs((node0 ' + rl5) + phead0 ' + rl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[node0].deqID), some?(vs[node0].deqID), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, r ∈ rl1 + vhead0 ' + vtail0 ' + rl, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl1, ¬ node ∈ rl1, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl1, ¬ node ∈ rl, ¬ node ∈ rl5, ¬ node0 ∈ rl1, ¬ node0 ∈ rl, ¬ r ∈ rl0, ¬ r ∈ rl5, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ (node0 ' + rl1).last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead = node0 ∨ phead ∈ rl1 ∨ phead = vhead0, r ∈ rl1 ∨ r ∈ rl ⊦ vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: discard

Additional information

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

Proof step 139 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ noid(tid, (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vhead, vs), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-reduce, seq:⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))), subst:[rl, tid, r, vs0, rl0, vs] → [rl1 + phead0 ' + rl2, tid, vhead, vs, (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1 + phead0 ' + rl2, tid, vhead, vs, (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vs

Proof step 140 from proof step-E14-E15 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) → (noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid)))

A spec-lemma

Proof step 141 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∃ r0. ¬ ( (r0 ≠ vhead ∧ r0 ∈ rl1 + phead0 ' + rl2 from vhead → vs[r0].deqID ≠ Some(tid)) → r0 ≠ vhead ∧ r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead → vs[r0].deqID ≠ Some(tid)), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 142 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl2 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), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[x, a, y] → [rl0 + vhead0 ' + vtail0 ' + rl, phead0, rl1 + phead0 ' + rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl0 + vhead0 ' + vtail0 ' + rl, phead0, rl1 + phead0 ' + rl2

Proof step 143 from proof step-E14-E15 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 144 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = (rl1 + phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (rl1 + phead0 ' + rl2).last, rl1 + phead0 ' + rl2 ≠ [], vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl2 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), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 145 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + (phead0 ' + rl2).butlast, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl2 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), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

Heuristic use patterns 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 ', rl2], <all paths>

Additional information

Used terms: phead0 ', rl2

Proof step 146 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 147 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + (phead0 ' + rl2).butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, rl2 = [], vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl2 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), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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 ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ a '.butlast = []; (s) ⊦ a '.last = a; (s)

Proof step 148 from proof step-E14-E15 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[ps[vhead0].next].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[phead0].next = null, ps[phead0].val = vs[phead0].val, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), owns(phead0) = None, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, node ≠ vhead0, node ≠ ps[vhead0].next, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, phead0 ≠ null, r0 ≠ vhead, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), r0 ∈ (rl0 + vhead0 ') + ps[vhead0].next ' + (rl + phead0 ') + vs[phead0].next ' from vhead, ps[vhead0].next ∈ ps, ps[vhead0].next ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ ps[vhead0].next ∈ rl0, ¬ ps[vhead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ (rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl0 + vhead0 ', ps[vhead0].next ' + (rl + phead0 ') + vs[phead0].next ', vhead], <all paths>

Additional information

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

Proof step 149 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 150 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, ps[vhead0].next ≠ vhead0, ps[vhead0].next ≠ phead0, node ≠ vhead0, node ≠ ps[vhead0].next, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, phead0 ≠ null, r0 ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead0].next ∈ vs, ps[vhead0].next ∈ ps, r0 ∈ (rl0 + vhead0 ' from vhead) + ps[vhead0].next ' + (rl + phead0 ') + vs[phead0].next ', vhead ∈ rl0 + vhead0 ', ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ weak?(vs[phead0].deqID), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ ps[vhead0].next ∈ rl0, ¬ ps[vhead0].next ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ (rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ' from vhead, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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 from r0 → r ∈ rl + rl0 from r0; (ss) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 151 from proof step-E14-E15 (previous step) (back to tree)

vs[vs[phead0].next].deqID = None, ps[ps[vhead0].next].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), ps[phead0].next = null, vs[vs[phead0].next].next = null, ps[phead0].val = vs[phead0].val, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(phead0) = None, owns(node) = Some(tid), ps[vhead0].next ≠ phead0, ps[vhead0].next ≠ vhead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ ps[vhead0].next, node ≠ vhead0, phead0 ≠ null, phead0 ≠ vhead0, r0 ≠ vhead, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, (rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vhead, vs), nonullRetRefs((rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, ps[vhead0].next ∈ vs, ps[vhead0].next ∈ ps, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ weak?(vs[phead0].deqID), ¬ r0 ∈ (rl0 + vhead0 ' + ps[vhead0].next ' + rl) + phead0 ' from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ ps[vhead0].next ∈ rl, ¬ ps[vhead0].next ∈ rl0, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ rl0 + vhead0 ' 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), vhead ∈ rl0 ∨ vhead = vhead0, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[ps[vhead0].next].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, r0 = vs[phead0].next ∨ r0 = phead0 ∨ r0 ∈ rl ∨ r0 = ps[vhead0].next ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl0, vhead0 ', vhead], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ weak?(None); (s) ⊦ None ≠ Some(tid); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) Used terms: rl0, vhead0 ', vhead

Proof step 152 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 153 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl2.butlast, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), phead0 = (phead0 ' + rl2).last, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vhead, rl2 ≠ [], vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl2 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), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

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

Proof step 154 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + rl2.last ' + rl2.butlast, vs[vs[rl2.last].next].deqID = None, ps[vtail0].deqID = None, ps[rl2.last].deqID = None, vs[r0].deqID = Some(tid), vs[vs[rl2.last].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[rl2.last].next] = vs[vs[rl2.last].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2.last ≠ vhead0, vs[rl2.last].next ≠ vhead0, vs[rl2.last].next ≠ null, node ≠ null, node ≠ rl2.last, node ≠ vtail0, node ≠ vhead0, r0 ≠ vhead, rl2 ≠ [], vtail0 ≠ rl2.last, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl2.last ' + rl2, vs, ps, owns), listp(rl1 + rl2.last ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + rl2.last ' + rl2, vhead, vs), nonullRetRefs(rl1 + rl2.last ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[rl2.last].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[rl2.last].next ∈ ps, vs[rl2.last].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + rl2.last ') + vs[rl2.last].next ' from vhead, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ r0 ∈ rl1 + rl2.last ' + rl2 from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ rl2.last ∈ rl0, ¬ rl2.last ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[rl2.last].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[rl2.last].deqID = None ⊦

Heuristic use patterns 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] → [rl2, phead0, rl3]

Additional information

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

Proof step 155 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl3 + phead0 ', vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r0 ≠ vhead, rl2 ≠ [], vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ r0 ∈ rl1 + phead0 ' + rl2 from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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

Proof step 156 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, r0 ∈ (rl0 + vhead0 ') + vtail0 ' + (rl + phead0 ') + vs[phead0].next ' from vhead, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl0 + vhead0 ', vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vhead], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: rl0 + vhead0 ', vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vhead

Proof step 157 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 158 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), r0 ∈ (rl0 + vhead0 ' from vhead) + vtail0 ' + (rl + phead0 ') + vs[phead0].next ', vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vhead ∈ rl0 + vhead0 ', ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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

Proof step 159 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, vhead ∈ rl0 ∨ vhead = vhead0, r0 ∈ rl0 + vhead0 ' from vhead ∨ r0 = vtail0 ∨ r0 ∈ rl ∨ r0 = phead0 ∨ r0 = vs[phead0].next ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, phead0 ' + rl3 + phead0 ', vhead], <all paths>

Additional information

Used terms: rl1, phead0 ' + rl3 + phead0 ', vhead

Proof step 160 from proof step-E14-E15 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 161 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead ∈ rl1, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from vhead, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl0 + vhead0 ' from vhead ∨ r0 = vtail0 ∨ r0 ∈ rl ∨ r0 = phead0 ∨ r0 = vs[phead0].next, vhead ∈ rl0 ∨ vhead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ y ∧ ¬ b ∈ x → (x + a ' + z = y + b ' + y0 ↔ a = b ∧ x = y ∧ z = y0); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 162 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[phead0].deqID = None, vs[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0.last ≠ vhead0, vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, r0 ≠ rl0.last, rl0 ≠ [], vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, rl0.last, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', rl0.last, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead ∈ rl0, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl3, ¬ rl0.last ∈ rl1, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ phead0 ' + rl3 + phead0 ' from rl0.last, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val), r0 ∈ rl0 + vhead0 ' from rl0.last ∨ r0 = vtail0 ∨ r0 ∈ rl ∨ r0 = phead0 ∨ r0 = vs[phead0].next ⊦

Heuristic use patterns 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] → [rl0, node0, rl2]

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) ⊦ ¬ a ∈ y ∧ ¬ b ∈ x → (x + a ' + z = y + b ' + y0 ↔ a = b ∧ x = y ∧ z = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, node0, y

Proof step 163 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ vhead0, vs[phead0].next ≠ null, node ≠ null, node ≠ phead0, node ≠ vtail0, node ≠ vhead0, phead0 ≠ vhead0, r0 ≠ vhead, vtail0 ≠ phead0, vtail0 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vhead ∈ rl1, ¬ dups(rl0 + rl), ¬ dups(rl0), ¬ dups(rl), ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ rl, ¬ node ∈ rl0, ¬ r0 ∈ (rl1 from vhead) + phead0 ' + rl3 + phead0 ', ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ rl0, ¬ node ∈ rl3, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl0 + vhead0 ' from vhead ∨ r0 = vtail0 ∨ r0 ∈ rl ∨ r0 = phead0 ∨ r0 = vs[phead0].next, vhead ∈ rl0 ∨ vhead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

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 ∈ y ∧ ¬ a ∈ z → (x + a ' + y = x0 + b ' + z ↔ x = x0 ∧ a = b ∧ y = z); (ws) 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 ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)

Proof step 164 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vhead ∈ ps, vhead ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vhead ∈ rl1, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ∈ rl0 ∨ vhead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, r0 = vs[phead0].next ∨ r0 ∈ rl ∨ r0 ∈ rl0 + vhead0 ' from vhead ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: r0 = vs[phead0].next

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) Used formulas: r0 = vs[phead0].next

Proof step 165 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vs[phead0].next, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vhead ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, vhead ∈ vs, vhead ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 = vs[phead0].next ∨ r0 ∈ rl ∨ r0 ∈ rl0 + vhead0 ' from vhead, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, vhead ∈ rl0 ∨ vhead = vhead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 166 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vs[phead0].next, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vhead ∈ ps, vhead ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vhead ∈ rl1, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ∈ rl0 ∨ vhead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, r0 ∈ rl ∨ r0 ∈ rl0 + vhead0 ' from vhead ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: r0 ∈ rl

Additional information

Used formulas: r0 ∈ rl

Proof step 167 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vs[phead0].next, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vhead ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, vhead ∈ vs, vhead ∈ ps, r0 ∈ rl, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl ∨ r0 ∈ rl0 + vhead0 ' from vhead, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, vhead ∈ rl0 ∨ vhead = vhead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 168 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[r0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vs[phead0].next, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), r0 ∈ rl, vhead ∈ ps, vhead ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vhead ∈ rl1, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ∈ rl0 ∨ vhead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: r0 ∈ rl1 + phead0 ' + rl3 from vhead

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: r0 ∈ rl1 + phead0 ' + rl3 from vhead

Proof step 169 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vs[phead0].next, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vhead ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, vhead ∈ vs, vhead ∈ ps, r0 ∈ rl, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl1 + phead0 ' + rl3 from vhead, ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, vhead ∈ rl0 ∨ vhead = vhead0 ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

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

Proof step 170 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[r0].deqID = Some(tid), vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ vs[phead0].next, r0 ≠ phead0, r0 ≠ vhead, r0 ≠ vtail0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vhead ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, vhead ∈ vs, vhead ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ r0 ∈ rl, ¬ r0 ∈ rl3, ¬ r0 ∈ rl1 from vhead, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl ∨ r0 ∈ rl0 + vhead0 ' from vhead, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, vhead ∈ rl0 ∨ vhead = vhead0 ⊦

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] 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 ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 171 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[phead0].deqID = None, vs[vtail0].deqID = None, vs[vhead0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0.last ≠ vhead0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead ≠ vhead0, phead0 ≠ vhead0, rl0 ≠ [], vhead0 ≠ vtail0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, rl0.last, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', rl0.last, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead ∈ rl0, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, rl0.last ∈ rl1, rl0.last ∈ vs, rl0.last ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from rl0.last, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[rl0.last].next ≠ null ∧ vs[vs[rl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[rl0.last].next].deqID.tid)) = Claimed(vs[vs[rl0.last].next].deqID.tid, vs[vs[rl0.last].next].val) ⊦

Heuristic use patterns 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] → [rl0, node0, rl2]

Additional information

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

Proof step 172 from proof step-E14-E15 (previous step) (back to tree)

rl0 + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = Some(tid), vs[vtail0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), rl0 = rl2 + node0 ', vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, rl0 ≠ [], vhead0 ≠ vtail0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, node0, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vhead0].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), weak?(owns(vs[phead0].next)), node0 ∈ ps, node0 ∈ vs, node0 ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, phead ∈ rl0, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val) ⊦

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

Proof step 173 from proof step-E14-E15 (previous step) (back to tree)

(rl2 + node0 ') + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[phead0].deqID = None, vs[vtail0].deqID = None, vs[vhead0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, phead0 ≠ node0, vhead0 ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl2, ps), markedp(rl2, vs), nextnottid(tid, node0, vs), noid(tid, rl1 + phead0 ' + rl3 + phead0 ', node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, node0 ∈ rl1, node0 ∈ vs, node0 ∈ ps, ¬ dups(rl2 + rl), ¬ dups(rl2), ¬ dups(rl), ¬ node0 ∈ rl2, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl2, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl2, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val), phead ∈ rl2 ∨ phead = node0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, rl1 + phead0 ' + rl3 + phead0 ', node0, vs], <all paths>

Additional information

Used terms: tid, rl1 + phead0 ' + rl3 + phead0 ', node0, vs

Proof step 174 from proof step-E14-E15 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 175 from proof step-E14-E15 (previous step) (back to tree)

(rl2 + node0 ') + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = Some(tid), vs[vtail0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, phead0 ≠ node0, vhead0 ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl2, vs), markedp(rl2, ps), nextnottid(tid, node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), weak?(owns(vs[phead0].next)), node0 ∈ ps, node0 ∈ vs, node0 ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl2 + rl), ¬ dups(rl2), ¬ dups(rl), ¬ node0 ∈ rl2, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl2, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl2, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val), ∀ r0. r0 ≠ node0 ∧ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0 → vs[r0].deqID ≠ Some(tid), phead ∈ rl2 ∨ phead = node0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 73 terms: vhead0 abort: F discard: F computed: T

Additional information

Used terms: vhead0

Proof step 176 from proof step-E14-E15 (previous step) (back to tree)

(rl2 + node0 ') + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[phead0].deqID = None, vs[vtail0].deqID = None, vs[vhead0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, phead0 ≠ node0, vhead0 ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl2, ps), markedp(rl2, vs), nextnottid(tid, node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, node0 ∈ rl1, node0 ∈ vs, node0 ∈ ps, ¬ dups(rl2 + rl), ¬ dups(rl2), ¬ dups(rl), ¬ node0 ∈ rl2, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl2, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl2, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val), vhead0 ≠ node0 ∧ vhead0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0 → vs[vhead0].deqID ≠ Some(tid), ∀ r0. r0 ≠ node0 ∧ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0 → vs[r0].deqID ≠ Some(tid), phead ∈ rl2 ∨ phead = node0 ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 73

Additional information

Proof step 177 from proof step-E14-E15 (previous step) (back to tree)

(rl2 + node0 ') + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = Some(tid), vs[vtail0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, phead0 ≠ node0, vhead0 ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl2, vs), markedp(rl2, ps), nextnottid(tid, node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), weak?(owns(vs[phead0].next)), node0 ∈ ps, node0 ∈ vs, node0 ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl2 + rl), ¬ dups(rl2), ¬ dups(rl), ¬ node0 ∈ rl2, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl2, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl2, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val), ∀ r0. r0 ≠ node0 ∧ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0 → vs[r0].deqID ≠ Some(tid), phead ∈ rl2 ∨ phead = node0 ⊦ vhead0 ≠ node0 ∧ vhead0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 178 from proof step-E14-E15 (previous step) (back to tree)

(rl2 + node0 ') + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[phead0].deqID = None, vs[vtail0].deqID = None, vs[vhead0].deqID = Some(tid), ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, phead0 ≠ node0, vhead0 ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl2, ps), markedp(rl2, vs), nextnottid(tid, node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(ps[node0].deqID), some?(vs[node0].deqID), unmarkedp(rl, vs), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, node0 ∈ rl1, node0 ∈ vs, node0 ∈ ps, ¬ dups(rl2 + rl), ¬ dups(rl2), ¬ dups(rl), ¬ vhead0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0, ¬ node0 ∈ rl2, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl2, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl2, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val), ∀ r0. r0 ≠ node0 ∧ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0 → vs[r0].deqID ≠ Some(tid), phead ∈ rl2 ∨ phead = node0 ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: vhead0 ∈ (rl1 + phead0 ' + rl3) + phead0 ' from node0

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: vhead0 ∈ (rl1 + phead0 ' + rl3) + phead0 ' from node0

Proof step 179 from proof step-E14-E15 (previous step) (back to tree)

(rl2 + node0 ') + vhead0 ' + vtail0 ' + rl = rl1 + phead0 ' + rl3, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = Some(tid), vs[vtail0].deqID = None, vs[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, node0 ≠ vhead0, phead ≠ vhead0, phead0 ≠ vhead0, phead0 ≠ node0, vhead0 ≠ vtail0, vtail0 ≠ phead0, vtail0 ≠ node0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl3 + phead0 ', vs, ps, owns), listp(rl1 + phead0 ' + rl3 + phead0 ', vs, ps, owns), markedp(rl2, vs), markedp(rl2, ps), nextnottid(tid, node0, vs), nonullRetRefs(rl1 + phead0 ' + rl3 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[node0].deqID), some?(ps[node0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), weak?(owns(vs[phead0].next)), node0 ∈ ps, node0 ∈ vs, node0 ∈ rl1, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, ¬ dups(rl2 + rl), ¬ dups(rl2), ¬ dups(rl), ¬ vhead0 ∈ (rl1 + phead0 ' + rl3) + phead0 ' from node0, ¬ vhead0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0, ¬ node0 ∈ rl2, ¬ node0 ∈ rl, ¬ vhead0 ∈ rl3, ¬ vhead0 ∈ rl1 from node0, ¬ node ∈ rl2, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl2, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl3, ¬ vtail0 ∈ rl2, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl2, vs[node0].next ≠ null ∧ vs[vs[node0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[node0].next].deqID.tid)) = Claimed(vs[vs[node0].next].deqID.tid, vs[vs[node0].next].val), ∀ r0. r0 ≠ node0 ∧ r0 ∈ rl1 + phead0 ' + rl3 + phead0 ' from node0 → vs[r0].deqID ≠ Some(tid), phead ∈ rl2 ∨ phead = node0 ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

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

Proof step 180 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, node, vs], <all paths>

Additional information

Used terms: ps, tid, owns, node, vs

Proof step 181 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 182 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ oneowns(tid, node, owns(vs[phead0].next; None), vs, ps[phead0, ps[phead0].next:= vs[phead0].next]), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[phead0, ps[phead0].next:= vs[phead0].next], tid, owns(vs[phead0].next; None), node, vs], <all paths>

Additional information

Used terms: ps[phead0, ps[phead0].next:= vs[phead0].next], tid, owns(vs[phead0].next; None), node, vs

Proof step 183 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 184 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ ps, node ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0, ¬ node ∈ vs ∨ ¬ node ∈ ps[phead0, ps[phead0].next:= vs[phead0].next] ∨ owns(vs[phead0].next; None)(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(vs[phead0].next; None)(r0) ≠ None → owns(vs[phead0].next; None)(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 185 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, (vs[phead0].next = node ⊃ None;Some(tid)) ≠ Some(tid) ∨ ¬(r0 ≠ node ∧ ¬(vs[phead0].next ≠ r0 → None = owns(r0)) → owns(r0).tid ≠ tid) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 60

Additional information

Proof step 186 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, (vs[phead0].next = node ⊃ None;Some(tid)) ≠ Some(tid), node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ ps, node ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 13

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ ¬ weak?(Some(tid)); (s)

Proof step 187 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, ps[phead0].deqID = None, ps[vtail0].deqID = None, vs[vs[phead0].next].deqID = None, vs[vs[phead0].next].next = null, owns(r0).tid = tid, ps[vs[phead0].next] = vs[vs[phead0].next], vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[phead0].next ≠ r0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, None ≠ owns(r0), node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ node, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + phead0 ' + rl2, vs, ps, owns), listp(phead0 ' + rl2, vs, ps, owns), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), node ∈ ps, node ∈ vs, vtail0 ∈ ps, vtail0 ∈ vs, vs[phead0].next ∈ vs, vs[phead0].next ∈ ps, phead ∈ vs, phead ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None, phead ∈ rl0 ∨ phead = vhead0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 188 from proof step-E14-E15 (previous step) (back to tree)

(rl0 + vhead0 ') + vtail0 ' + rl + phead0 ' = rl1 + phead0 ' + rl2, vs[vs[phead0].next].deqID = None, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[vs[phead0].next].next = null, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), ps[vs[phead0].next] = vs[vs[phead0].next], dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), vs[phead0].next ≠ r0, vs[phead0].next ≠ null, vs[phead0].next ≠ vhead0, None ≠ owns(r0), node ≠ vhead0, node ≠ vtail0, node ≠ phead0, node ≠ null, phead0 ≠ vhead0, r0 ≠ node, vtail0 ≠ vhead0, vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(phead0 ' + rl2, vs, ps, owns), listp(rl1 + phead0 ' + rl2, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, rl1 + phead0 ' + rl2, vhead, vs), nonullRetRefs(rl1 + phead0 ' + rl2, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), unmarkedp(rl, ps), weak?(owns(vs[phead0].next)), phead ∈ ps, phead ∈ vs, vs[phead0].next ∈ ps, vs[phead0].next ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, node ∈ vs, node ∈ ps, ¬ dups(rl), ¬ dups(rl0), ¬ dups(rl0 + rl), ¬ node ∈ rl0, ¬ phead0 ∈ rl, ¬ phead0 ∈ rl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ node ∈ rl2, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ rl, ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ≠ node ∧ owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, phead ∈ rl0 ∨ phead = vhead0, vhead0 = vhead ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ∨ rl0 ≠ [] ∧ rl0.last = vhead ∧ phead ≠ vhead0 ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs) ∧ vs[phead0].deqID = None ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 60 terms: r0

Additional information

Used terms: r0

Proof step 189 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (orl + qrl).last, node ≠ null, node ≠ lst, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ oneowns(tid, node, (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns), vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ noid(tid, orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vhead, vs) ∧ ¬ node ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ∧ ( vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)).last ∨ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] ∧ vtail = (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).butlast).last ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].deqID = None ∧ vs[(lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).last].next = null) ∧ ( orl.last = vhead ∧ ( (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl) ≠ [] → unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs)) ∧ nonullRetRefs(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, vretRefs, pretRefs) ∧ unmarkedp((lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ¬ dups(orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ listp (orl + (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl), vs, ps[lst, ps[lst].next:= vs[lst].next], (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)) ∧ (lst ∈ orl ∨ lst ∈ (lst = (orl + qrl).last ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) ∧ (lst = (orl + qrl).last ⊃ owns(vs[(orl + qrl).last].next; None);owns)(node) = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 190 from proof step-E14-E15 (previous step) (back to tree)

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

Heuristic use patterns 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] → [orl, qrl], <all paths>

Additional information

Used terms: orl, qrl

Proof step 191 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 192 from proof step-E14-E15 (previous step) (back to tree)

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

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] ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 193 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (lst ' + rl2).last, node ≠ lst, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ 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 = lst ∨ phead ∈ rl2, (lst ' + rl2).last = vhead ∨ rl1 + (lst ' + rl2).butlast ≠ [] ∧ (rl1 + (lst ' + rl2).butlast).last = vhead ∧ phead ≠ (lst ' + rl2).last ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

Heuristic use patterns 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] → [lst ', rl2], <all paths>

Additional information

Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: lst ', rl2

Proof step 194 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 195 from proof step-E14-E15 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ rl2.last, node ≠ lst, node ≠ null, rl2 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(rl1 + lst ' + rl2, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst].deqID), some?(ps[lst].deqID), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ 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), rl2.last = vhead ∨ rl1 + (lst ' + rl2).butlast ≠ [] ∧ (rl1 + (lst ' + rl2).butlast).last = vhead ∧ phead ≠ rl2.last, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl2 ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

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).butlast = a ' + x.butlast; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 196 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ rl2.last, node ≠ lst, node ≠ null, rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(rl1, ps), markedp(rl2, ps), markedp(rl1, vs), markedp(rl2, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ 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 = lst ∨ phead ∈ rl2, rl2.last = vhead ∨ (lst ' + rl2.butlast).last = vhead ∧ phead ≠ rl2.last ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

Heuristic use patterns 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] → [rl2, phead0, rl]

Additional information

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

Proof step 197 from proof step-E14-E15 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl2 = rl + phead0 ', vs[lst].next ≠ null, lst ≠ phead0, node ≠ lst, node ≠ null, rl2 ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(rl1 + lst ' + rl2, vs, ps, owns), markedp(rl2, vs), markedp(rl1, vs), markedp(rl2, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst].deqID), some?(ps[lst].deqID), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl1), ¬ dups(rl2), ¬ node ∈ rl2, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl2 ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

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

Proof step 198 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ lst, node ≠ null, node ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl + phead0 ', vs, ps, owns), listp(lst ' + rl + phead0 ', vs, ps, owns), markedp(rl1, ps), markedp(rl, ps), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl ∨ phead = phead0 ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl + phead0 ', vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-flushnxt, seq:⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), subst:[ps, rl, lst, owns, vs] → [ps, rl1 + lst ' + rl + phead0 ', lst, owns, vs], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, rl1 + lst ' + rl + phead0 ', lst, owns, vs

Proof step 199 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

A spec-lemma

Proof step 200 from proof step-E14-E15 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (rl1 + lst ' + rl + phead0 ').last, lst ≠ phead0, node ≠ lst, node ≠ null, node ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl + phead0 ', vs, ps, owns), listp(rl1 + lst ' + rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[lst].deqID), some?(ps[lst].deqID), node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, lst ∈ rl1 + lst ' + rl + phead0 ', ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0 ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ true

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

Proof step 201 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ lst, node ≠ null, node ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl + phead0 ', vs, ps, owns), listp(lst ' + rl + phead0 ', vs, ps, owns), markedp(rl1, ps), markedp(rl, ps), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + rl + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl ∨ phead = phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, node, vs], <all paths>

Additional information

Used terms: ps, tid, owns, node, vs

Proof step 202 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 203 from proof step-E14-E15 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ lst, node ≠ null, node ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl + phead0 ', vs, ps, owns), listp(rl1 + lst ' + rl + phead0 ', vs, ps, owns), markedp(rl, vs), markedp(rl1, vs), markedp(rl, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), some?(vs[lst].deqID), some?(ps[lst].deqID), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl ∨ phead = phead0, phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[lst, ps[lst].next:= vs[lst].next], tid, owns, node, vs], <all paths>

Additional information

Used terms: ps[lst, ps[lst].next:= vs[lst].next], tid, owns, node, vs

Proof step 204 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 205 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ lst, node ≠ null, node ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl + phead0 ', vs, ps, owns), listp(lst ' + rl + phead0 ', vs, ps, owns), markedp(rl1, ps), markedp(rl, ps), markedp(rl1, vs), markedp(rl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ phead0 ∈ rl1, ¬ phead0 ∈ rl, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ lst ∈ rl1, ¬ lst ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl ∨ phead = phead0, ¬ node ∈ vs ∨ ¬ node ∈ ps[lst, ps[lst].next:= vs[lst].next] ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 206 from proof step-E14-E15 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ phead0, node ≠ null, node ≠ lst, owns(r0) ≠ None, r0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl + phead0 ', vs, ps, owns), listp(lst ' + rl + phead0 ', vs, ps, owns), markedp(rl1, ps), markedp(rl, ps), markedp(rl1, vs), markedp(rl, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, rl1 + lst ' + rl + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + rl + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(rl), ¬ dups(rl1), ¬ dups(rl1 + rl), ¬ lst ∈ rl, ¬ lst ∈ rl1, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ phead0 ∈ rl, ¬ phead0 ∈ 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), ∀ r. r ≠ node ∧ owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, phead0 = vhead ∨ (lst ' + rl).last = vhead ∧ phead ≠ phead0, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ rl ∨ phead = phead0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 43 terms: r0

Additional information

Used terms: r0

Proof step 207 from proof step-E14-E15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 208 from proof step-E14-E15 (previous step) (back to tree)

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

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, rl]

Additional information

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

Proof step 209 from proof step-E14-E15 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), qrl = vtail0 + rl, vs[lst].next ≠ null, lst ≠ qrl.last, node ≠ null, node ≠ lst, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ node ∈ rl1, ¬ node ∈ qrl, ¬ node ∈ orl, ¬ node ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ unmarkedp(qrl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(orl + qrl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

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

Proof step 210 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl = rl1 + lst ' + rl2, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (vtail0 ' + rl).last, node ≠ null, node ≠ lst, node ≠ vtail0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(rl1 + lst ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ node ∈ orl, ¬ node ∈ rl2, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs), vtail = (vtail0 ' + rl).last ∨ vtail = (orl + (vtail0 ' + rl).butlast).last ∧ vs[(vtail0 ' + rl).last].deqID = None ∧ vs[(vtail0 ' + rl).last].next = null ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

Heuristic use patterns 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 ', rl], <all paths>

Additional information

Used terms: vtail0 ', rl

Proof step 211 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 212 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl = rl1 + lst ' + rl2, ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = [], vs[lst].next ≠ null, lst ≠ (vtail0 ' + rl).last, node ≠ null, node ≠ lst, node ≠ vtail0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ node ∈ orl, ¬ node ∈ rl2, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (vtail0 ' + rl).last ∨ vtail = (orl + (vtail0 ' + rl).butlast).last ∧ vs[(vtail0 ' + rl).last].deqID = None ∧ vs[(vtail0 ' + rl).last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

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] ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x = y + a ' + z → a ∈ x; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ y → a ∈ x + y; (s) 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 in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 213 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ lst, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), markedp(rl1, ps), markedp(orl0, ps), markedp(rl1, vs), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, lst ∈ ps, lst ∈ vs, ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ node ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ orl0, ¬ node ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-flushnxt, seq:⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), subst:[ps, rl, lst, owns, vs] → [ps, (rl1 + lst ' + orl0) + vtail0 ', lst, owns, vs], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, (rl1 + lst ' + orl0) + vtail0 ', lst, owns, vs

Proof step 214 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

A spec-lemma

Proof step 215 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ ((rl1 + lst ' + orl0) + vtail0 ').last, lst ≠ vtail0, node ≠ vtail0, node ≠ lst, node ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(rl1, vs), markedp(orl0, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst].deqID), some?(ps[lst].deqID), lst ∈ vs, lst ∈ ps, vtail0 ∈ ps, vtail0 ∈ vs, node ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ ps, lst ∈ (rl1 + lst ' + orl0) + vtail0 ', ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ node ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ orl0, ¬ node ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0 ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ true

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

Proof step 216 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ lst, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), markedp(rl1, ps), markedp(orl0, ps), markedp(rl1, vs), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, phead ∈ vs, phead ∈ ps, node ∈ vs, vtail0 ∈ vs, vtail0 ∈ ps, lst ∈ ps, lst ∈ vs, ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ node ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ orl0, ¬ node ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, node, vs], <all paths>

Additional information

Used terms: ps, tid, owns, node, vs

Proof step 217 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 218 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ lst, node ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), markedp(orl0, vs), markedp(rl1, vs), markedp(orl0, ps), markedp(rl1, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[lst].deqID), some?(ps[lst].deqID), lst ∈ vs, lst ∈ ps, vtail0 ∈ ps, vtail0 ∈ vs, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ node ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ orl0, ¬ node ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[lst, ps[lst].next:= vs[lst].next], tid, owns, node, vs], <all paths>

Additional information

Used terms: ps[lst, ps[lst].next:= vs[lst].next], tid, owns, node, vs

Proof step 219 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 220 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ vtail0, node ≠ lst, node ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), markedp(rl1, ps), markedp(orl0, ps), markedp(rl1, vs), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vtail0 ∈ vs, vtail0 ∈ ps, lst ∈ ps, lst ∈ vs, ¬ dups(rl1 + orl0), ¬ dups(rl1), ¬ dups(orl0), ¬ node ∈ orl0, ¬ lst ∈ rl1, ¬ lst ∈ orl0, ¬ node ∈ rl1, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None, ¬ node ∈ vs ∨ ¬ node ∈ ps[lst, ps[lst].next:= vs[lst].next] ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 221 from proof step-E14-E15 (previous step) (back to tree)

ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), vs[lst].next ≠ null, lst ≠ vtail0, node ≠ null, node ≠ lst, node ≠ vtail0, owns(r0) ≠ None, r0 ≠ node, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + lst ' + orl0) + vtail0 ', vs, ps, owns), listp(lst ' + orl0 + vtail0 ', vs, ps, owns), markedp(rl1, ps), markedp(orl0, ps), markedp(rl1, vs), markedp(orl0, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, (rl1 + lst ' + orl0) + vtail0 ', vhead, vs), nonullRetRefs((rl1 + lst ' + orl0) + vtail0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[lst].deqID), some?(vs[lst].deqID), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, vtail0 ∈ vs, vtail0 ∈ ps, lst ∈ ps, lst ∈ vs, ¬ dups(orl0), ¬ dups(rl1), ¬ dups(rl1 + orl0), ¬ vtail0 ∈ orl0, ¬ vtail0 ∈ rl1, ¬ node ∈ rl1, ¬ lst ∈ orl0, ¬ lst ∈ rl1, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ≠ node ∧ owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, phead ∈ rl1 ∨ phead = lst ∨ phead ∈ orl0, vtail = vtail0 ∨ vtail = (lst ' + orl0).last ∧ vs[vtail0].deqID = None ∧ vs[vtail0].next = null, (lst ' + orl0).last = vhead ∨ rl1 + (lst ' + orl0).butlast ≠ [] ∧ (rl1 + (lst ' + orl0).butlast).last = vhead ∧ phead ≠ (lst ' + orl0).last ∧ vs[vtail0].deqID = None ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 46 terms: r0

Additional information

Used terms: r0

Proof step 222 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl = rl1 + lst ' + rl2, ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ rl.last, node ≠ null, node ≠ lst, node ≠ vtail0, orl ≠ [], rl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ node ∈ orl, ¬ node ∈ rl2, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = rl.last ∨ vtail = (orl + (vtail0 ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

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).butlast = a ' + x.butlast; (s)

Proof step 223 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl = rl1 + lst ' + rl2, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ rl.last, node ≠ null, node ≠ lst, node ≠ vtail0, orl ≠ [], rl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp(rl1 + lst ' + rl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl, ps), node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ node ∈ orl, ¬ node ∈ rl2, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs), vtail = rl.last ∨ vtail = (vtail0 ' + rl.butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

Heuristic use patterns 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] → [rl, phead0, rl0]

Additional information

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

Proof step 224 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl = rl1 + lst ' + rl2, ps[vtail0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), rl = rl0 + phead0 ', vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, orl ≠ [], rl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + lst ' + rl2, vs, ps, owns), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + rl2, vhead, vs), nonullRetRefs(rl1 + lst ' + rl2, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, ¬ dups(orl + rl), ¬ dups(orl), ¬ dups(rl), ¬ node ∈ orl, ¬ node ∈ rl2, ¬ vtail0 ∈ rl, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(rl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl, vs), lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + rl2, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ y → a ∈ x + y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (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 225 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ listp(rl1 + lst ' + orl0 + phead0 ', vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-flushnxt, seq:⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), subst:[ps, rl, lst, owns, vs] → [ps, rl1 + lst ' + orl0 + phead0 ', lst, owns, vs], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, rl1 + lst ' + orl0 + phead0 ', lst, owns, vs

Proof step 226 from proof step-E14-E15 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ lst ∈ rl ∧ lst ≠ rl.last → listp(rl, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)

A spec-lemma

Proof step 227 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ (rl1 + lst ' + orl0 + phead0 ').last, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, lst ∈ rl1 + lst ' + orl0 + phead0 ', ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]) ∧ true

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

Proof step 228 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ ps[lst, ps[lst].next:= vs[lst].next][vtail0].deqID = None ∧ unmarkedp(rl0, ps[lst, ps[lst].next:= vs[lst].next]) ∧ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (x + a ' + y = z + a ' + y0 ↔ y = y0 ∧ x = z); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s)

Proof step 229 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, node, vs], <all paths>

Additional information

Used terms: ps, tid, owns, node, vs

Proof step 230 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 231 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ oneowns(tid, node, owns, vs, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps[lst, ps[lst].next:= vs[lst].next], tid, owns, node, vs], <all paths>

Additional information

Used terms: ps[lst, ps[lst].next:= vs[lst].next], tid, owns, node, vs

Proof step 232 from proof step-E14-E15 (previous step) (back to tree)

⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 233 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, ¬ node ∈ vs ∨ ¬ node ∈ ps[lst, ps[lst].next:= vs[lst].next] ∨ owns(node) ≠ Some(tid) ∨ (∃ r0. ¬(r0 ≠ node ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 234 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(owns(r0).tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ phead0, node ≠ vtail0, node ≠ lst, node ≠ null, orl ≠ [], owns(r0) ≠ None, r0 ≠ node, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(owns(r0).tid, vhead, vs), noid(owns(r0).tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl + rl0), ¬ dups(rl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead0 ∈ rl0, ¬ phead0 ∈ orl, ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ≠ node ∧ owns(r) ≠ None → owns(r).tid ≠ owns(r0).tid, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 49 terms: r0

Additional information

Used terms: r0

Proof step 235 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ unmarkedp(rl0, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:unmarkedp-def, seq: ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None), subst:[rl, vs] → [rl0, ps], <all paths>

Additional information

Used terms: rl0, ps

Proof step 236 from proof step-E14-E15 (previous step) (back to tree)

⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)

A spec-lemma

Proof step 237 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ unmarkedp(rl0, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl0 → ps[r].deqID = None, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:unmarkedp-def, seq: ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None), subst:[rl, vs] → [rl0, ps[lst, ps[lst].next:= vs[lst].next]], <all paths>

Additional information

Used terms: rl0, ps[lst, ps[lst].next:= vs[lst].next]

Proof step 238 from proof step-E14-E15 (previous step) (back to tree)

⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)

A spec-lemma

Proof step 239 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl0 → ps[r].deqID = None, ∃ r. ¬(r ∈ rl0 → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = None), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].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 ∈ x → (b ' + x).last = x.last; (s)

Proof step 240 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ rl0, phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl0 → ps[r].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = rl0.last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

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, lst, ps[lst].next:= vs[lst].next, r], <all paths>

Additional information

Used terms: ps, lst, ps[lst].next:= vs[lst].next, r

Proof step 241 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 242 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = lst, ps[lst, ps[lst].next:= vs[lst].next][r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, r ∈ rl0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl0 → ps[r].deqID = None, vtail = phead0 ∨ vtail = rl0.last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 243 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].deqID ≠ None, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), lst ∈ rl0, phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl0 → ps[r].deqID = None, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, vtail = phead0 ∨ vtail = rl0.last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 49 terms: lst

Additional information

Used terms: lst

Proof step 244 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[r].deqID ≠ None, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], r ≠ lst, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, r ∈ rl0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ rl0 → ps[r].deqID = None, vtail = phead0 ∨ vtail = rl0.last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 50 terms: r

Additional information

Used terms: r

Proof step 245 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:markedp-def, seq: ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)), subst:[rl, vs] → [orl, ps], <all paths>

Additional information

Used terms: orl, ps

Proof step 246 from proof step-E14-E15 (previous step) (back to tree)

⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))

A spec-lemma

Proof step 247 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ markedp(orl, ps[lst, ps[lst].next:= vs[lst].next]), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl → some?(ps[r].deqID), vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:markedp-def, seq: ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)), subst:[rl, vs] → [orl, ps[lst, ps[lst].next:= vs[lst].next]], <all paths>

Additional information

Used terms: orl, ps[lst, ps[lst].next:= vs[lst].next]

Proof step 248 from proof step-E14-E15 (previous step) (back to tree)

⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))

A spec-lemma

Proof step 249 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl → some?(ps[r].deqID), ∃ r. ¬(r ∈ orl → some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID)), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 250 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), r ∈ orl, phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl → some?(ps[r].deqID), vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦

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, lst, ps[lst].next:= vs[lst].next, r], <all paths>

Additional information

Used terms: ps, lst, ps[lst].next:= vs[lst].next, r

Proof step 251 from proof step-E14-E15 (previous step) (back to tree)

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

A spec-lemma

Proof step 252 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), r = lst, vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, r ∈ orl, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ some?(ps[lst, ps[lst].next:= vs[lst].next][r].deqID), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl → some?(ps[r].deqID), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 253 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[phead0].deqID = None, ps[vtail0].deqID = None, ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], vtail0 ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), listp(lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(rl0, ps), lst ∈ orl, phead0 ∈ ps, phead0 ∈ vs, node ∈ vs, phead ∈ orl, phead ∈ ps, phead ∈ vs, node ∈ ps, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ some?(ps[lst].deqID), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl → some?(ps[r].deqID), vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null, orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 49 terms: lst

Additional information

Used terms: lst

Proof step 254 from proof step-E14-E15 (previous step) (back to tree)

orl + vtail0 ' + rl0 = rl1 + lst ' + orl0, ps[vtail0].deqID = None, ps[phead0].deqID = None, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), vs[lst].next ≠ null, lst ≠ phead0, node ≠ null, node ≠ lst, node ≠ vtail0, node ≠ phead0, orl ≠ [], r ≠ lst, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(lst ' + orl0 + phead0 ', vs, ps, owns), listp(rl1 + lst ' + orl0 + phead0 ', vs, ps, owns), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, rl1 + lst ' + orl0 + phead0 ', vhead, vs), nonullRetRefs(rl1 + lst ' + orl0 + phead0 ', vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(rl0, ps), node ∈ ps, phead ∈ vs, phead ∈ ps, phead ∈ orl, node ∈ vs, phead0 ∈ vs, phead0 ∈ ps, r ∈ orl, ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ some?(ps[r].deqID), ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ phead0 ∈ orl, ¬ phead0 ∈ rl0, ¬ node ∈ orl, ¬ node ∈ orl0, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl → some?(ps[r].deqID), orl.last = vhead ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail0].deqID = None ∧ unmarkedp(rl0, vs) ∧ vs[phead0].deqID = None, lst ∈ orl ∨ lst = vtail0 ∨ lst ∈ rl0, vtail = phead0 ∨ vtail = (vtail0 ' + rl0).last ∧ vs[phead0].deqID = None ∧ vs[phead0].next = null ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 50 terms: r

Additional information

Used terms: r

Proof Tree for step-E14-E15 (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