Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄)
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, 1, X₃, X₄) :|: 0 ≤ X₀ ∧ 0 < X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ < 0
t₄: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃, X₄) → l1(X₃, X₄, X₂, X₃, X₄)
t₆: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₂
t₇: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₂ ≤ 0
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: X₂ < X₀ ∧ 0 < X₂
t₁₀: l4(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄)
t₉: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀-1, X₂, X₂, X₃, X₄)
t₈: l6(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, 2⋅X₂, X₃, X₄)
Preprocessing
Found invariant 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l6
Found invariant X₀ ≤ X₃ for location l7
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l5
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ for location l4
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3
Cut unsatisfiable transition t₇: l3→l5
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄)
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, 1, X₃, X₄) :|: 0 ≤ X₀ ∧ 0 < X₁ ∧ X₀ ≤ X₃
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ < 0 ∧ X₀ ≤ X₃
t₄: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ 0 ∧ X₀ ≤ X₃
t₁: l2(X₀, X₁, X₂, X₃, X₄) → l1(X₃, X₄, X₂, X₃, X₄)
t₆: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: X₂ < X₀ ∧ 0 < X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₀: l4(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₃
t₉: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀-1, X₂, X₂, X₃, X₄) :|: 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₈: l6(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, 2⋅X₂, X₃, X₄) :|: 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀
MPRF for transition t₂: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, 1, X₃, X₄) :|: 0 ≤ X₀ ∧ 0 < X₁ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃+1 {O(n)}
MPRF:
l5 [X₀ ]
l1 [X₀+1 ]
l6 [X₀ ]
l3 [X₀ ]
MPRF for transition t₆: l3(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
X₃+1 {O(n)}
MPRF:
l5 [X₀ ]
l1 [X₀+1 ]
l6 [X₀+1 ]
l3 [X₀+1 ]
MPRF for transition t₉: l5(X₀, X₁, X₂, X₃, X₄) → l1(X₀-1, X₂, X₂, X₃, X₄) :|: 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
X₃+1 {O(n)}
MPRF:
l5 [X₀+1 ]
l1 [X₀+1 ]
l6 [X₀+1 ]
l3 [X₀+1 ]
Found invariant 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l6
Found invariant X₀ ≤ X₃ for location l7
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l5
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ for location l4
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3
Found invariant 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l6
Found invariant X₀ ≤ X₃ for location l7
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l5
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ for location l4
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3
MPRF for transition t₅: l3(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: X₂ < X₀ ∧ 0 < X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
X₃⋅X₃+3⋅X₃+1 {O(n^2)}
MPRF:
l1 [X₀ ]
l5 [X₀-X₂ ]
l6 [X₀-2⋅X₂ ]
l3 [X₀-X₂ ]
MPRF for transition t₈: l6(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, 2⋅X₂, X₃, X₄) :|: 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ of depth 1:
new bound:
X₃⋅X₃+2⋅X₃ {O(n^2)}
MPRF:
l1 [X₃ ]
l5 [X₃-X₂ ]
l6 [X₃-X₂ ]
l3 [X₃-X₂ ]
Analysing control-flow refined program
Found invariant 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l6___3
Found invariant 3 ≤ X₃ ∧ 5 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 6 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l6___1
Found invariant X₀ ≤ X₃ for location l7
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l5
Found invariant 2 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l3___2
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ for location l4
Found invariant 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ X₂ ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l3
knowledge_propagation leads to new time bound X₃+1 {O(n)} for transition t₁₁₃: l3(X₀, X₁, X₂, X₃, X₄) → n_l6___3(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁ ∧ X₂ < X₀ ∧ X₀ ≤ X₃ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ X₂ ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound X₃+1 {O(n)} for transition t₁₁₅: n_l6___3(X₀, X₁, X₂, X₃, X₄) → n_l3___2(X₀, X₁, 2⋅X₂, X₃, X₄) :|: X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ X₂ < X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ 1 ∧ X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀
MPRF for transition t₁₁₂: n_l3___2(X₀, X₁, X₂, X₃, X₄) → n_l6___1(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₂ ∧ 2+X₂ ≤ 2⋅X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁ ∧ X₂ < X₀ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ of depth 1:
new bound:
2⋅X₃⋅X₃+6⋅X₃+2 {O(n^2)}
MPRF:
l1 [2⋅X₀ ]
l3 [2⋅X₀ ]
l5 [2⋅X₀-X₂ ]
n_l6___1 [2⋅X₀-2⋅X₂ ]
n_l6___3 [2⋅X₀-2⋅X₂ ]
n_l3___2 [2⋅X₀-X₂ ]
MPRF for transition t₁₁₉: n_l3___2(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₂ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 2 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ of depth 1:
new bound:
X₃+1 {O(n)}
MPRF:
l3 [X₀+1 ]
l1 [X₀+1 ]
l5 [X₀ ]
n_l6___1 [X₀+1 ]
n_l6___3 [X₀+1 ]
n_l3___2 [X₀+1 ]
MPRF for transition t₁₁₄: n_l6___1(X₀, X₁, X₂, X₃, X₄) → n_l3___2(X₀, X₁, 2⋅X₂, X₃, X₄) :|: X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ X₂ < X₀ ∧ 2 ≤ X₂ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ X₀ ≤ X₃ ∧ 3 ≤ X₃ ∧ 5 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 6 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ of depth 1:
new bound:
X₃⋅X₃+2⋅X₃ {O(n^2)}
MPRF:
l1 [X₃ ]
l3 [X₃ ]
l5 [X₃-X₂ ]
n_l6___1 [X₃-X₂ ]
n_l6___3 [X₃-2⋅X₂ ]
n_l3___2 [X₃-X₂ ]
CFR did not improve the program. Rolling back
All Bounds
Timebounds
Overall timebound:2⋅X₃⋅X₃+8⋅X₃+9 {O(n^2)}
t₀: 1 {O(1)}
t₂: X₃+1 {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₁: 1 {O(1)}
t₅: X₃⋅X₃+3⋅X₃+1 {O(n^2)}
t₆: X₃+1 {O(n)}
t₁₀: 1 {O(1)}
t₉: X₃+1 {O(n)}
t₈: X₃⋅X₃+2⋅X₃ {O(n^2)}
Costbounds
Overall costbound: 2⋅X₃⋅X₃+8⋅X₃+9 {O(n^2)}
t₀: 1 {O(1)}
t₂: X₃+1 {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₁: 1 {O(1)}
t₅: X₃⋅X₃+3⋅X₃+1 {O(n^2)}
t₆: X₃+1 {O(n)}
t₁₀: 1 {O(1)}
t₉: X₃+1 {O(n)}
t₈: X₃⋅X₃+2⋅X₃ {O(n^2)}
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₃+1 {O(n)}
t₂, X₁: 2^(X₃⋅X₃+2⋅X₃)+X₄+1 {O(EXP)}
t₂, X₂: 1 {O(1)}
t₂, X₃: X₃ {O(n)}
t₂, X₄: X₄ {O(n)}
t₃, X₀: 2⋅X₃+1 {O(n)}
t₃, X₁: 2^(X₃⋅X₃+2⋅X₃)+X₄+1 {O(EXP)}
t₃, X₂: 2^(X₃⋅X₃+2⋅X₃)+X₂+1 {O(EXP)}
t₃, X₃: 2⋅X₃ {O(n)}
t₃, X₄: 2⋅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₃+1 {O(n)}
t₅, X₁: 2^(X₃⋅X₃+2⋅X₃)+X₄+1 {O(EXP)}
t₅, X₂: 2^(X₃⋅X₃+2⋅X₃) {O(EXP)}
t₅, X₃: X₃ {O(n)}
t₅, X₄: X₄ {O(n)}
t₆, X₀: X₃+1 {O(n)}
t₆, X₁: 2⋅2^(X₃⋅X₃+2⋅X₃)+2⋅X₄+2 {O(EXP)}
t₆, X₂: 2^(X₃⋅X₃+2⋅X₃)+1 {O(EXP)}
t₆, X₃: X₃ {O(n)}
t₆, X₄: X₄ {O(n)}
t₁₀, X₀: 3⋅X₃+1 {O(n)}
t₁₀, X₁: 2^(X₃⋅X₃+2⋅X₃)+2⋅X₄+1 {O(EXP)}
t₁₀, X₂: 2^(X₃⋅X₃+2⋅X₃)+2⋅X₂+1 {O(EXP)}
t₁₀, X₃: 3⋅X₃ {O(n)}
t₁₀, X₄: 3⋅X₄ {O(n)}
t₉, X₀: X₃+1 {O(n)}
t₉, X₁: 2^(X₃⋅X₃+2⋅X₃)+1 {O(EXP)}
t₉, X₂: 2^(X₃⋅X₃+2⋅X₃)+1 {O(EXP)}
t₉, X₃: X₃ {O(n)}
t₉, X₄: X₄ {O(n)}
t₈, X₀: X₃+1 {O(n)}
t₈, X₁: 2^(X₃⋅X₃+2⋅X₃)+X₄+1 {O(EXP)}
t₈, X₂: 2^(X₃⋅X₃+2⋅X₃) {O(EXP)}
t₈, X₃: X₃ {O(n)}
t₈, X₄: X₄ {O(n)}