Initial Problem

Start: f1
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: f1, f2, f3
Transitions:
t₀: f1(X₀, X₁, X₂) → f2(X₀, X₁, 1+X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀
t₁: f2(X₀, X₁, X₂) → f3(X₀, X₁, X₂) :|: 1+X₂ ≤ X₁
t₂: f2(X₀, X₁, X₂) → f3(X₀, X₁, X₂) :|: 1+X₁ ≤ X₂
t₃: f3(X₀, X₁, X₂) → f2(X₀, X₁, 0) :|: 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₂
t₄: f3(X₀, X₁, X₂) → f2(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀

Preprocessing

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

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

Problem after Preprocessing

Start: f1
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: f1, f2, f3
Transitions:
t₀: f1(X₀, X₁, X₂) → f2(X₀, X₁, 1+X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀
t₁: f2(X₀, X₁, X₂) → f3(X₀, X₁, X₂) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₂: f2(X₀, X₁, X₂) → f3(X₀, X₁, X₂) :|: 1+X₁ ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₃: f3(X₀, X₁, X₂) → f2(X₀, X₁, 0) :|: 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₄: f3(X₀, X₁, X₂) → f2(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂

Cut unsatisfiable transition [t₂₉: f2→f3_v2]

Cut unreachable locations [f2_v1; f3_v2; f3_v3] from the program graph

Found invariant 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 5 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 3 ≤ X₁ ∧ 6 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location f3_v4

Found invariant X₂ ≤ 1+X₀ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location f2_v3

Found invariant X₂ ≤ 1+X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location f2

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

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

Found invariant X₂ ≤ 1+X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location f3_v1

Found invariant X₂ ≤ 1+X₀ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location f3_v7

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location f2_v2

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

Found invariant X₂ ≤ 1 ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location f3_v6

Analysing control-flow refined program

MPRF for transition t₄₁: f2_v3(X₀, X₁, X₂) → f3_v7(X₀, X₁, X₂) :|: 1+X₁ ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₂ of depth 1:

new bound:

X₀+X₁+4 {O(n)}

• f2_v3: [2+X₀-X₂]
• f3_v7: [1+X₀-X₂]

MPRF for transition t₄₂: f3_v7(X₀, X₁, X₂) → f2_v3(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂ of depth 1:

new bound:

X₀+X₁+3 {O(n)}

• f2_v3: [1+X₀-X₂]
• f3_v7: [1+X₀-X₂]

MPRF for transition t₃₃: f2_v2(X₀, X₁, X₂) → f3_v4(X₀, X₁, X₂) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ of depth 1:

new bound:

2⋅X₁+3 {O(n)}

• f2_v2: [1+X₁-X₂]
• f3_v4: [X₁-X₂]

MPRF for transition t₃₄: f3_v4(X₀, X₁, X₂) → f2_v2(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₂ ∧ 5 ≤ X₁+X₂ ∧ 6 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂ of depth 1:

new bound:

2⋅X₀+3 {O(n)}

• f2_v2: [1+X₀-X₂]
• f3_v4: [1+X₀-X₂]

CFR: Improvement to new bound with the following program:

method: PartialEvaluation new bound:

O(n)

Start: f1
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: f1, f2, f2_v2, f2_v3, f2_v4, f2_v5, f3_v1, f3_v4, f3_v5, f3_v6, f3_v7
Transitions:
t₀: f1(X₀, X₁, X₂) → f2(X₀, X₁, 1+X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₀
t₂₈: f2(X₀, X₁, X₂) → f3_v1(X₀, X₁, X₂) :|: 1+X₁ ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₃₃: f2_v2(X₀, X₁, X₂) → f3_v4(X₀, X₁, X₂) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₀+X₁ ∧ 4 ≤ X₀+X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂
t₄₁: f2_v3(X₀, X₁, X₂) → f3_v7(X₀, X₁, X₂) :|: 1+X₁ ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2+X₁ ≤ X₂ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₂
t₃₇: f2_v4(X₀, X₁, X₂) → f3_v5(X₀, X₁, X₂) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ X₂ ≤ 0
t₃₉: f2_v5(X₀, X₁, X₂) → f3_v6(X₀, X₁, X₂) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ X₂ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₂ ≤ X₁ ∧ 0 ≤ X₂
t₃₅: f3_v1(X₀, X₁, X₂) → f2_v3(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₃₆: f3_v1(X₀, X₁, X₂) → f2_v4(X₀, X₁, 0) :|: 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1+X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₃₄: f3_v4(X₀, X₁, X₂) → f2_v2(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₂ ∧ 3 ≤ X₀ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₂ ∧ 5 ≤ X₁+X₂ ∧ 6 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₃₈: f3_v5(X₀, X₁, X₂) → f2_v5(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂ ∧ X₂ ≤ 0
t₄₀: f3_v6(X₀, X₁, X₂) → f2_v2(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ X₂ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₂ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₄₂: f3_v7(X₀, X₁, X₂) → f2_v3(X₀, X₁, 1+X₂) :|: 0 ≤ 1+X₂ ∧ X₂ ≤ X₀ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂
t₄₃: f3_v7(X₀, X₁, X₂) → f2_v4(X₀, X₁, 0) :|: 0 ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₁ ∧ 2+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 5 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₂

All Bounds

Timebounds

Overall timebound:4⋅X₀+4⋅X₁+22 {O(n)}
t₀: 1 {O(1)}
t₂₈: 1 {O(1)}
t₃₃: 2⋅X₁+3 {O(n)}
t₃₄: 2⋅X₀+3 {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)}
t₄₁: X₀+X₁+4 {O(n)}
t₄₂: X₀+X₁+3 {O(n)}
t₄₃: 1 {O(1)}

Costbounds

Overall costbound: 4⋅X₀+4⋅X₁+22 {O(n)}
t₀: 1 {O(1)}
t₂₈: 1 {O(1)}
t₃₃: 2⋅X₁+3 {O(n)}
t₃₄: 2⋅X₀+3 {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)}
t₄₁: X₀+X₁+4 {O(n)}
t₄₂: X₀+X₁+3 {O(n)}
t₄₃: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₁+1 {O(n)}
t₂₈, X₀: X₀ {O(n)}
t₂₈, X₁: X₁ {O(n)}
t₂₈, X₂: X₁+1 {O(n)}
t₃₃, X₀: 2⋅X₀ {O(n)}
t₃₃, X₁: 2⋅X₁ {O(n)}
t₃₃, X₂: 2⋅X₀+5 {O(n)}
t₃₄, X₀: 2⋅X₀ {O(n)}
t₃₄, X₁: 2⋅X₁ {O(n)}
t₃₄, X₂: 2⋅X₀+5 {O(n)}
t₃₅, X₀: X₀ {O(n)}
t₃₅, X₁: X₁ {O(n)}
t₃₅, X₂: X₁+2 {O(n)}
t₃₆, X₀: X₀ {O(n)}
t₃₆, X₁: X₁ {O(n)}
t₃₆, X₂: 0 {O(1)}
t₃₇, X₀: 2⋅X₀ {O(n)}
t₃₇, X₁: 2⋅X₁ {O(n)}
t₃₇, X₂: 0 {O(1)}
t₃₈, X₀: 2⋅X₀ {O(n)}
t₃₈, X₁: 2⋅X₁ {O(n)}
t₃₈, X₂: 1 {O(1)}
t₃₉, X₀: 2⋅X₀ {O(n)}
t₃₉, X₁: 2⋅X₁ {O(n)}
t₃₉, X₂: 1 {O(1)}
t₄₀, X₀: 2⋅X₀ {O(n)}
t₄₀, X₁: 2⋅X₁ {O(n)}
t₄₀, X₂: 2 {O(1)}
t₄₁, X₀: X₀ {O(n)}
t₄₁, X₁: X₁ {O(n)}
t₄₁, X₂: 2⋅X₁+X₀+5 {O(n)}
t₄₂, X₀: X₀ {O(n)}
t₄₂, X₁: X₁ {O(n)}
t₄₂, X₂: 2⋅X₁+X₀+5 {O(n)}
t₄₃, X₀: X₀ {O(n)}
t₄₃, X₁: X₁ {O(n)}
t₄₃, X₂: 0 {O(1)}