Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃)
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: E+1 ≤ 0
t₇: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 1 ≤ E
t₈: l1(X₀, X₁, X₂, X₃) → l3(X₂, X₃, X₂, X₃)
t₉: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃-1)
t₂: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₃: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ ≤ 0
t₄: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₀-1, X₁-1)
t₁₀: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₁: l6(X₀, X₁, X₂, X₃) → l3(X₁, X₀, X₂, X₃)

Preprocessing

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l2

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃)
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: E+1 ≤ 0 ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₇: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 1 ≤ E ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₈: l1(X₀, X₁, X₂, X₃) → l3(X₂, X₃, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₉: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃-1) :|: 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₂: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₃: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ ≤ 0
t₄: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₀-1, X₁-1) :|: 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₁₀: l5(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₁: l6(X₀, X₁, X₂, X₃) → l3(X₁, X₀, X₂, X₃)

MPRF for transition t₂: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 1 ≤ X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF for transition t₅: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₀-1, X₁-1) :|: 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF for transition t₈: l1(X₀, X₁, X₂, X₃) → l3(X₂, X₃, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

Chain transitions t₅: l4→l1 and t₈: l1→l3 to t₇₃: l4→l3

Chain transitions t₉: l2→l1 and t₈: l1→l3 to t₇₄: l2→l3

Chain transitions t₉: l2→l1 and t₇: l1→l2 to t₇₅: l2→l2

Chain transitions t₅: l4→l1 and t₇: l1→l2 to t₇₆: l4→l2

Chain transitions t₉: l2→l1 and t₆: l1→l2 to t₇₇: l2→l2

Chain transitions t₅: l4→l1 and t₆: l1→l2 to t₇₈: l4→l2

Chain transitions t₁: l6→l3 and t₄: l3→l5 to t₇₉: l6→l5

Chain transitions t₇₃: l4→l3 and t₄: l3→l5 to t₈₀: l4→l5

Chain transitions t₇₃: l4→l3 and t₃: l3→l5 to t₈₁: l4→l5

Chain transitions t₁: l6→l3 and t₃: l3→l5 to t₈₂: l6→l5

Chain transitions t₇₄: l2→l3 and t₃: l3→l5 to t₈₃: l2→l5

Chain transitions t₇₄: l2→l3 and t₄: l3→l5 to t₈₄: l2→l5

Chain transitions t₇₄: l2→l3 and t₂: l3→l4 to t₈₅: l2→l4

Chain transitions t₇₃: l4→l3 and t₂: l3→l4 to t₈₆: l4→l4

Chain transitions t₁: l6→l3 and t₂: l3→l4 to t₈₇: l6→l4

Analysing control-flow refined program

Cut unsatisfiable transition t₈₄: l2→l5

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l2

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

MPRF for transition t₇₆: l4(X₀, X₁, X₂, X₃) -{2}> l2(X₀, X₁, X₀-1, X₁-1) :|: 1 ≤ Temp_Int₂₆₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ 0 ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 2 ≤ X₁+X₀ ∧ 2 ≤ 2⋅X₀ ∧ 0 ≤ 0 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF for transition t₇₈: l4(X₀, X₁, X₂, X₃) -{2}> l2(X₀, X₁, X₀-1, X₁-1) :|: Temp_Int₂₇₂+1 ≤ 0 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ 0 ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 2 ≤ X₁+X₀ ∧ 2 ≤ 2⋅X₀ ∧ 0 ≤ 0 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF for transition t₈₅: l2(X₀, X₁, X₂, X₃) -{3}> l4(1+X₂, X₃-1, 1+X₂, X₃-1) :|: 2 ≤ X₃ ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF for transition t₈₆: l4(X₀, X₁, X₂, X₃) -{3}> l4(X₀-1, X₁-1, X₀-1, X₁-1) :|: 2 ≤ X₁ ∧ 2 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ 0 ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 2 ≤ X₁+X₀ ∧ 2 ≤ 2⋅X₀ ∧ 0 ≤ 0 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant 2+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___2

Found invariant 2+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l2___1

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l2___3

Found invariant 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l1

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

Solv. Size Bound: t₅: l4→l1 for X₀

Solv. Size Bound: t₅: l4→l1 for X₁

Solv. Size Bound: t₅: l4→l1 for X₂

cycle: [t₅: l4→l1; t₂₂₀: l1→n_l2___3; t₂₂₁: l1→n_l2___3; t₂₂₃: n_l2___3→n_l1___2; t₂₂₉: n_l1___2→l3; t₂: l3→l4]
loop: (0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 3 ≤ X₁ ∧ 1 ≤ X₀ ∨ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 3 ≤ X₁ ∧ 1 ≤ X₀,(X₀,X₂) -> (X₀,X₀)
overappr. closed-form: 2⋅X₀ {O(n)}
runtime bound: X₁+1 {O(n)}

Solv. Size Bound - Lifting for t₅: l4→l1 and X₂: inf {Infinity}

Solv. Size Bound: t₂₂₉: n_l1___2→l3 for X₀

cycle: [t₂₂₉: n_l1___2→l3; t₂: l3→l4; t₅: l4→l1; t₂₂₀: l1→n_l2___3; t₂₂₁: l1→n_l2___3; t₂₂₃: n_l2___3→n_l1___2]
loop: (1 ≤ X₃ ∧ 1 ≤ X₂ ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∨ 1 ≤ X₃ ∧ 1 ≤ X₂ ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0,(X₀,X₂) -> (X₂,X₂)
overappr. closed-form: 2⋅X₂ {O(n)}
runtime bound: X₃+1 {O(n)}

Solv. Size Bound - Lifting for t₂₂₉: n_l1___2→l3 and X₀: inf {Infinity}

knowledge_propagation leads to new time bound X₀ {O(n)} for transition t₂₂₀: l1(X₀, X₁, X₂, X₃) → n_l2___3(X₀, X₁, X₂, X₃) :|: X₁ ≤ 1+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀

knowledge_propagation leads to new time bound X₀ {O(n)} for transition t₂₂₁: l1(X₀, X₁, X₂, X₃) → n_l2___3(X₀, X₁, X₂, X₃) :|: X₁ ≤ 1+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀

knowledge_propagation leads to new time bound 2⋅X₀ {O(n)} for transition t₂₂₃: n_l2___3(X₀, X₁, X₂, X₃) → n_l1___2(X₀, X₁, X₂+1, X₃-1) :|: X₁ ≤ X₃+1 ∧ X₀ ≤ X₂+1 ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀ ∧ X₀ ≤ 1+X₂ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀

MPRF for transition t₂₂₉: n_l1___2(X₀, X₁, X₂, X₃) → l3(X₂, X₃, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ ∧ 2+X₃ ≤ X₁ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

Solv. Size Bound: t₅: l4→l1 for X₀

Solv. Size Bound: t₅: l4→l1 for X₁

Solv. Size Bound - Lifting for t₅: l4→l1 and X₂: inf {Infinity}

Solv. Size Bound - Lifting for t₂₂₉: n_l1___2→l3 and X₀: inf {Infinity}

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀ {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: X₀ {O(n)}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₈: X₀ {O(n)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀ {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: X₀ {O(n)}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₈: X₀ {O(n)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₀, X₃: X₃ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₀ {O(n)}
t₁, X₂: X₂ {O(n)}
t₁, X₃: X₃ {O(n)}