Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₁-1, X₁-1, E, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ E ∧ 1 ≤ X₁+X₀
t₂: l1(X₀, X₁, X₂, X₃) → l1(X₁-1, X₁-1, E, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ E+1 ≤ 0 ∧ 1 ≤ X₁+X₀
t₃: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, X₀-2, 0, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₁+X₀ ∧ 1 ≤ X₁
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, E) :|: 1 ≤ X₀ ∧ X₁+X₀ ≤ 0 ∧ 1 ≤ X₁
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, E) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, E) :|: X₁ ≤ 0
Preprocessing
Cut unsatisfiable transition t₄: l1→l2
Eliminate variables {X₂,X₃} that do not contribute to the problem
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: E
Locations: l0, l1, l2
Transitions:
t₂₀: l0(X₀, X₁) → l1(X₀, X₁)
t₂₁: l1(X₀, X₁) → l1(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ E ∧ 1 ≤ X₁+X₀
t₂₂: l1(X₀, X₁) → l1(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ E+1 ≤ 0 ∧ 1 ≤ X₁+X₀
t₂₃: l1(X₀, X₁) → l1(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ 1 ≤ X₁+X₀ ∧ 1 ≤ X₁
t₂₄: l1(X₀, X₁) → l2(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₂₅: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
Analysing control-flow refined program
Found invariant 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀ for location n_l1___2
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___3
Found invariant 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀ for location n_l1___1
MPRF for transition t₉₁: n_l1___1(X₀, X₁) → n_l1___1(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀ {O(n)}
MPRF for transition t₉₂: n_l1___1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+5 {O(n)}
MPRF for transition t₉₃: n_l1___1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+5 {O(n)}
MPRF for transition t₉₄: n_l1___2(X₀, X₁) → n_l1___1(X₀-1, X₀-2) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+1 {O(n)}
MPRF for transition t₉₅: n_l1___2(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+2 {O(n)}
MPRF for transition t₉₆: n_l1___2(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+2 {O(n)}
MPRF for transition t₉₇: n_l1___3(X₀, X₁) → n_l1___2(X₀-1, X₀-2) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+2 {O(n)}
MPRF for transition t₉₈: n_l1___3(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+2 {O(n)}
MPRF for transition t₉₉: n_l1___3(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ of depth 1:
new bound:
2⋅X₁+X₀+2 {O(n)}
CFR: Improvement to new bound with the following program:
new bound:
Infinite
cfr-program:
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, n_l1___1, n_l1___2, n_l1___3
Transitions:
t₂₀: l0(X₀, X₁) → l1(X₀, X₁)
t₂₄: l1(X₀, X₁) → l2(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₂₅: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
t₁₀₀: l1(X₀, X₁) → n_l1___2(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₁₀₁: l1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₁₀₂: l1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₁₁₈: n_l1___1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₉₁: n_l1___1(X₀, X₁) → n_l1___1(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₉₂: n_l1___1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₉₃: n_l1___1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₁₁₉: n_l1___2(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₉₄: n_l1___2(X₀, X₁) → n_l1___1(X₀-1, X₀-2) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₉₅: n_l1___2(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₉₆: n_l1___2(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₁₂₀: n_l1___3(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉₇: n_l1___3(X₀, X₁) → n_l1___2(X₀-1, X₀-2) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉₈: n_l1___3(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉₉: n_l1___3(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
CFR: Improvement to new bound with the following program:
new bound:
18⋅X₁+9⋅X₀+21 {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, n_l1___1, n_l1___2, n_l1___3
Transitions:
t₂₀: l0(X₀, X₁) → l1(X₀, X₁)
t₂₄: l1(X₀, X₁) → l2(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₂₅: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
t₁₀₀: l1(X₀, X₁) → n_l1___2(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₁₀₁: l1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₁₀₂: l1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₁₁₈: n_l1___1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₉₁: n_l1___1(X₀, X₁) → n_l1___1(X₀-1, X₀-2) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₉₂: n_l1___1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₉₃: n_l1___1(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 1 ≤ X₀
t₁₁₉: n_l1___2(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₉₄: n_l1___2(X₀, X₁) → n_l1___1(X₀-1, X₀-2) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₉₅: n_l1___2(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₉₆: n_l1___2(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀
t₁₂₀: n_l1___3(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉₇: n_l1___3(X₀, X₁) → n_l1___2(X₀-1, X₀-2) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉₈: n_l1___3(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉₉: n_l1___3(X₀, X₁) → n_l1___3(X₁-1, X₁-1) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀
All Bounds
Timebounds
Overall timebound:18⋅X₁+9⋅X₀+30 {O(n)}
t₂₀: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₉₁: 2⋅X₁+X₀ {O(n)}
t₉₂: 2⋅X₁+X₀+5 {O(n)}
t₉₃: 2⋅X₁+X₀+5 {O(n)}
t₉₄: 2⋅X₁+X₀+1 {O(n)}
t₉₅: 2⋅X₁+X₀+2 {O(n)}
t₉₆: 2⋅X₁+X₀+2 {O(n)}
t₉₇: 2⋅X₁+X₀+2 {O(n)}
t₉₈: 2⋅X₁+X₀+2 {O(n)}
t₉₉: 2⋅X₁+X₀+2 {O(n)}
t₁₀₀: 1 {O(1)}
t₁₀₁: 1 {O(1)}
t₁₀₂: 1 {O(1)}
t₁₁₈: 1 {O(1)}
t₁₁₉: 1 {O(1)}
t₁₂₀: 1 {O(1)}
Costbounds
Overall costbound: 18⋅X₁+9⋅X₀+30 {O(n)}
t₂₀: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₉₁: 2⋅X₁+X₀ {O(n)}
t₉₂: 2⋅X₁+X₀+5 {O(n)}
t₉₃: 2⋅X₁+X₀+5 {O(n)}
t₉₄: 2⋅X₁+X₀+1 {O(n)}
t₉₅: 2⋅X₁+X₀+2 {O(n)}
t₉₆: 2⋅X₁+X₀+2 {O(n)}
t₉₇: 2⋅X₁+X₀+2 {O(n)}
t₉₈: 2⋅X₁+X₀+2 {O(n)}
t₉₉: 2⋅X₁+X₀+2 {O(n)}
t₁₀₀: 1 {O(1)}
t₁₀₁: 1 {O(1)}
t₁₀₂: 1 {O(1)}
t₁₁₈: 1 {O(1)}
t₁₁₉: 1 {O(1)}
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₀: 2⋅X₁+X₀ {O(n)}
t₉₁, X₁: 2⋅X₀+4⋅X₁ {O(n)}
t₉₂, X₀: 2⋅X₁+X₀ {O(n)}
t₉₂, X₁: 4⋅X₀+6⋅X₁ {O(n)}
t₉₃, X₀: 2⋅X₁+X₀ {O(n)}
t₉₃, X₁: 4⋅X₀+6⋅X₁ {O(n)}
t₉₄, X₀: 2⋅X₁+X₀ {O(n)}
t₉₄, X₁: 2⋅X₀+2⋅X₁ {O(n)}
t₉₅, X₀: 2⋅X₁+X₀ {O(n)}
t₉₅, X₁: 14⋅X₁+7⋅X₀ {O(n)}
t₉₆, X₀: 2⋅X₁+X₀ {O(n)}
t₉₆, X₁: 14⋅X₁+7⋅X₀ {O(n)}
t₉₇, X₀: 2⋅X₁+X₀ {O(n)}
t₉₇, X₁: 14⋅X₁+6⋅X₀ {O(n)}
t₉₈, X₀: 2⋅X₁+X₀ {O(n)}
t₉₈, X₁: 22⋅X₀+42⋅X₁ {O(n)}
t₉₉, X₀: 2⋅X₁+X₀ {O(n)}
t₉₉, X₁: 22⋅X₀+42⋅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₀: 1 {O(1)}
t₁₁₈, X₁: 0 {O(1)}
t₁₁₉, X₀: 1 {O(1)}
t₁₁₉, X₁: 1 {O(1)}
t₁₂₀, X₀: 0 {O(1)}
t₁₂₀, X₁: 0 {O(1)}