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