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



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

Proof step 1 from proof rely-D13-D14 (conclusion) (back to tree)

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof rely-D13-D14 (previous step) (back to tree)

ls.nxt = null, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D13, a) = D14, gs.orl ≠ [], ls.rvref ≠ null, ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D13, 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.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D13, a).orl) ∧ gstepf(gs, ls, D13, a).vtail ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vtail ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.phead ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D13, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D13, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D13, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D13, a).owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ gstepf(gs, ls, D13, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, Empty]; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) 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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D13, a) = D14; (s)

Proof step 3 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 4 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 5 from proof rely-D13-D14 (previous step) (back to tree)

ls.nxt = null, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs, vrvHp[ls.rvref, Empty])

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 6 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 7 from proof rely-D13-D14 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 8 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)

Proof step 9 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 10 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 11 from proof rely-D13-D14 (previous step) (back to tree)

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

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] → [lst0 ', orl0], <all paths>

Additional information

Used terms: lst0 ', orl0

Proof step 12 from proof rely-D13-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 13 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 14 from proof rely-D13-D14 (previous step) (back to tree)

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

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

Additional information

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

Proof step 15 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 16 from proof rely-D13-D14 (previous step) (back to tree)

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

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

Additional information

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

Proof step 17 from proof rely-D13-D14 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 18 from proof rely-D13-D14 (previous step) (back to tree)

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

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] → [lst0 ', orl1], <all paths>

Additional information

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

Proof step 19 from proof rely-D13-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 20 from proof rely-D13-D14 (previous step) (back to tree)

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

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] → [orl1, first0, orl0]

Additional information

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

Proof step 21 from proof rely-D13-D14 (previous step) (back to tree)

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

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

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl from r0 → r ∈ rl; (ss) Used terms: orl, qrl, vhead

Proof step 22 from proof rely-D13-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 23 from proof rely-D13-D14 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs, vrvHp[vretRefs(tid), Empty]), vs[vhead].next ≠ null ∧ vs[vs[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) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:rvrely-def, seq:⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ↔ vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val), subst:[vrvHp, vretRefs, tid, rvowns, vrvHp0, vretRefs0] → [vrvHp, vretRefs, tid0, rvowns, vrvHp[vretRefs(tid), Empty], vretRefs], <all paths>

Additional information

Used terms: vrvHp, vretRefs, tid0, rvowns, vrvHp[vretRefs(tid), Empty], vretRefs

Proof step 24 from proof rely-D13-D14 (previous step) (back to tree)

⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ↔ vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val)

A spec-lemma

Proof step 25 from proof rely-D13-D14 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[retval-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vrvHp, vretRefs(tid), Empty, vretRefs(tid0)], <all paths>

Additional information

Used simplifier rules: ⊦ rvownerok(vretRefs, vrvHp, rvowns) ∧ tid ≠ tid0 → ( vretRefs(tid) = vretRefs(tid0) ↔ vretRefs(tid) = null ∧ vretRefs(tid0) = null); (as) Used terms: vrvHp, vretRefs(tid), Empty, vretRefs(tid0)

Proof step 26 from proof rely-D13-D14 (previous step) (back to tree)

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

A spec-lemma

Proof Tree for rely-D13-D14 (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