Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: nondef.0
Locations: l0, l1, l10, l11, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄)
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l10(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l9(X₀, X₁, X₂, X₃, X₄) :|: X₁ < X₄
t₁₅: l10(X₀, X₁, X₂, X₃, X₄) → l11(X₀, X₁, X₂, X₃, X₄)
t₁₁: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0
t₁₀: l2(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₀
t₆: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ X₂
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₂ < X₄
t₁₃: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₂-1, X₂, X₃, X₄) :|: 0 < X₃
t₁₄: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₂, X₂, X₃, X₄) :|: X₃ ≤ 0
t₇: l5(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄)
t₉: l6(X₀, X₁, X₂, X₃, X₄) → l2(nondef.0, X₁, X₂, X₃, X₄)
t₁₂: l7(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂+1, X₃+1, X₄)
t₁: l8(X₀, X₁, X₂, X₃, X₄) → l1(X₀, 0, X₂, X₃, X₄)
t₄: l9(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₁+1, 0, X₄)
Preprocessing
Found invariant X₄ ≤ X₁ ∧ 0 ≤ X₁ for location l11
Found invariant 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l2
Found invariant 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l6
Found invariant 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l7
Found invariant 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l5
Found invariant 0 ≤ X₁ for location l1
Found invariant X₄ ≤ X₁ ∧ 0 ≤ X₁ for location l10
Found invariant 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l4
Found invariant 1 ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 0 ≤ X₁ for location l9
Found invariant 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ for location l3
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: nondef.0
Locations: l0, l1, l10, l11, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄)
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l10(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ X₁ ∧ 0 ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l9(X₀, X₁, X₂, X₃, X₄) :|: X₁ < X₄ ∧ 0 ≤ X₁
t₁₅: l10(X₀, X₁, X₂, X₃, X₄) → l11(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ X₁ ∧ 0 ≤ X₁
t₁₁: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0 ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₁₀: l2(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₀ ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₆: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₂ < X₄ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₁₃: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₂-1, X₂, X₃, X₄) :|: 0 < X₃ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₁₄: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₂, X₂, X₃, X₄) :|: X₃ ≤ 0 ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₇: l5(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₉: l6(X₀, X₁, X₂, X₃, X₄) → l2(nondef.0, X₁, X₂, X₃, X₄) :|: 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁
t₁₂: l7(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂+1, X₃+1, X₄) :|: 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₁: l8(X₀, X₁, X₂, X₃, X₄) → l1(X₀, 0, X₂, X₃, X₄)
t₄: l9(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₁+1, 0, X₄) :|: 1 ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 0 ≤ X₁
MPRF for transition t₂: l1(X₀, X₁, X₂, X₃, X₄) → l9(X₀, X₁, X₂, X₃, X₄) :|: X₁ < X₄ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄ {O(n)}
MPRF for transition t₄: l9(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₁+1, 0, X₄) :|: 1 ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄ {O(n)}
MPRF for transition t₅: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₂ < X₄ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
3⋅X₄+1 {O(n)}
MPRF for transition t₆: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄ {O(n)}
MPRF for transition t₇: l5(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
2⋅X₄+1 {O(n)}
MPRF for transition t₉: l6(X₀, X₁, X₂, X₃, X₄) → l2(nondef.0, X₁, X₂, X₃, X₄) :|: 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
2⋅X₄+2 {O(n)}
MPRF for transition t₁₀: l2(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₀ ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄+1 {O(n)}
MPRF for transition t₁₁: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0 ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄ {O(n)}
MPRF for transition t₁₂: l7(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂+1, X₃+1, X₄) :|: 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2+X₁ ≤ X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
X₄+1 {O(n)}
MPRF for transition t₁₃: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₂-1, X₂, X₃, X₄) :|: 0 < X₃ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄ {O(n)}
MPRF for transition t₁₄: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₂, X₂, X₃, X₄) :|: X₃ ≤ 0 ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 1+X₃ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 0 ≤ X₁ of depth 1:
new bound:
X₄ {O(n)}
All Bounds
Timebounds
Overall timebound:15⋅X₄+10 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₄ {O(n)}
t₃: 1 {O(1)}
t₄: X₄ {O(n)}
t₅: 3⋅X₄+1 {O(n)}
t₆: X₄ {O(n)}
t₇: 2⋅X₄+1 {O(n)}
t₉: 2⋅X₄+2 {O(n)}
t₁₀: X₄+1 {O(n)}
t₁₁: X₄ {O(n)}
t₁₂: X₄+1 {O(n)}
t₁₃: X₄ {O(n)}
t₁₄: X₄ {O(n)}
t₁₅: 1 {O(1)}
Costbounds
Overall costbound: 15⋅X₄+10 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₄ {O(n)}
t₃: 1 {O(1)}
t₄: X₄ {O(n)}
t₅: 3⋅X₄+1 {O(n)}
t₆: X₄ {O(n)}
t₇: 2⋅X₄+1 {O(n)}
t₉: 2⋅X₄+2 {O(n)}
t₁₀: X₄+1 {O(n)}
t₁₁: X₄ {O(n)}
t₁₂: X₄+1 {O(n)}
t₁₃: X₄ {O(n)}
t₁₄: X₄ {O(n)}
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₁: 0 {O(1)}
t₁, X₂: X₂ {O(n)}
t₁, X₃: X₃ {O(n)}
t₁, X₄: X₄ {O(n)}
t₂, X₁: 2⋅X₄+1 {O(n)}
t₂, X₂: 8⋅X₄+X₂+4 {O(n)}
t₂, X₃: 2⋅X₄+X₃+2 {O(n)}
t₂, X₄: X₄ {O(n)}
t₃, X₁: 2⋅X₄+1 {O(n)}
t₃, X₂: 4⋅X₄+X₂+2 {O(n)}
t₃, X₃: X₃ {O(n)}
t₃, X₄: 2⋅X₄ {O(n)}
t₄, X₁: 2⋅X₄+1 {O(n)}
t₄, X₂: 2⋅X₄+1 {O(n)}
t₄, X₃: 0 {O(1)}
t₄, X₄: X₄ {O(n)}
t₅, X₁: 2⋅X₄+1 {O(n)}
t₅, X₂: 2⋅X₄+1 {O(n)}
t₅, X₃: X₄+1 {O(n)}
t₅, X₄: X₄ {O(n)}
t₆, X₁: 4⋅X₄+2 {O(n)}
t₆, X₂: 2⋅X₄+1 {O(n)}
t₆, X₃: X₄+1 {O(n)}
t₆, X₄: X₄ {O(n)}
t₇, X₁: 2⋅X₄+1 {O(n)}
t₇, X₂: 2⋅X₄+1 {O(n)}
t₇, X₃: X₄+1 {O(n)}
t₇, X₄: X₄ {O(n)}
t₉, X₁: 2⋅X₄+1 {O(n)}
t₉, X₂: 2⋅X₄+1 {O(n)}
t₉, X₃: X₄+1 {O(n)}
t₉, X₄: X₄ {O(n)}
t₁₀, X₁: 2⋅X₄+1 {O(n)}
t₁₀, X₂: 2⋅X₄+1 {O(n)}
t₁₀, X₃: X₄+1 {O(n)}
t₁₀, X₄: X₄ {O(n)}
t₁₁, X₁: 2⋅X₄+1 {O(n)}
t₁₁, X₂: 2⋅X₄+1 {O(n)}
t₁₁, X₃: X₄+1 {O(n)}
t₁₁, X₄: X₄ {O(n)}
t₁₂, X₁: 2⋅X₄+1 {O(n)}
t₁₂, X₂: 2⋅X₄+1 {O(n)}
t₁₂, X₃: X₄+1 {O(n)}
t₁₂, X₄: X₄ {O(n)}
t₁₃, X₁: 2⋅X₄+1 {O(n)}
t₁₃, X₂: 4⋅X₄+2 {O(n)}
t₁₃, X₃: 2⋅X₄+2 {O(n)}
t₁₃, X₄: X₄ {O(n)}
t₁₄, X₁: 2⋅X₄+1 {O(n)}
t₁₄, X₂: 4⋅X₄+2 {O(n)}
t₁₄, X₃: 0 {O(1)}
t₁₄, X₄: X₄ {O(n)}
t₁₅, X₁: 2⋅X₄+1 {O(n)}
t₁₅, X₂: 4⋅X₄+X₂+2 {O(n)}
t₁₅, X₃: X₃ {O(n)}
t₁₅, X₄: 2⋅X₄ {O(n)}