Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁
Temp_Vars: M, N, O, P
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁)
t₅: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₅, X₃, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁)
t₆: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₅, X₃, X₃, X₃, X₅, X₅, M, N, M, N, X₁₀, X₁₁)
t₉: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₀+1, X₁, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁)
t₁₁: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₀, X₁+1, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁)
t₁: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁)
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁)
t₇: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l3(O, P, X₃, M, X₅, N, X₀, X₁, M, N, O, P)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l2(X₀, X₁, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁) :|: X₁+1 ≤ X₀
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l2(X₀, X₁, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁) :|: X₀+1 ≤ X₁
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l3(O, P, X₃, M, X₅, N, X₀, X₀, M, N, O, P) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₁₀: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₀+1, X₁, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁) :|: X₀+1 ≤ X₁
t₁₂: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → l1(X₀, X₁+1, X₃, X₃, X₅, X₅, X₀, X₁, X₈, X₉, X₁₀, X₁₁) :|: X₁ ≤ X₀

Preprocessing

Eliminate variables {X₂,X₄,X₆,X₇,X₈,X₉,X₁₀,X₁₁} that do not contribute to the problem

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₃, X₅
Temp_Vars: M, N, O, P
Locations: l0, l1, l2, l3
Transitions:
t₂₀: l0(X₀, X₁, X₃, X₅) → l1(X₀, X₁, X₃, X₅)
t₂₃: l0(X₀, X₁, X₃, X₅) → l1(X₅, X₃, X₃, X₅)
t₂₄: l0(X₀, X₁, X₃, X₅) → l1(X₅, X₃, X₃, X₅)
t₂₆: l0(X₀, X₁, X₃, X₅) → l1(X₀+1, X₁, X₃, X₅)
t₂₇: l0(X₀, X₁, X₃, X₅) → l1(X₀, X₁+1, X₃, X₅)
t₂₁: l0(X₀, X₁, X₃, X₅) → l2(X₀, X₁, X₃, X₅)
t₂₂: l0(X₀, X₁, X₃, X₅) → l3(X₀, X₁, X₃, X₅)
t₂₅: l0(X₀, X₁, X₃, X₅) → l3(O, P, M, N)
t₂₈: l1(X₀, X₁, X₃, X₅) → l2(X₀, X₁, X₃, X₅) :|: X₁+1 ≤ X₀
t₂₉: l1(X₀, X₁, X₃, X₅) → l2(X₀, X₁, X₃, X₅) :|: X₀+1 ≤ X₁
t₃₀: l1(X₀, X₁, X₃, X₅) → l3(O, P, M, N) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₃₁: l2(X₀, X₁, X₃, X₅) → l1(X₀+1, X₁, X₃, X₅) :|: X₀+1 ≤ X₁
t₃₂: l2(X₀, X₁, X₃, X₅) → l1(X₀, X₁+1, X₃, X₅) :|: X₁ ≤ X₀

MPRF for transition t₂₈: l1(X₀, X₁, X₃, X₅) → l2(X₀, X₁, X₃, X₅) :|: X₁+1 ≤ X₀ of depth 1:

new bound:

2⋅X₃+2⋅X₅+4⋅X₀+4⋅X₁+13 {O(n)}

MPRF:

l2 [X₀+1-X₁ ]
l1 [X₀+2-X₁ ]

MPRF for transition t₃₂: l2(X₀, X₁, X₃, X₅) → l1(X₀, X₁+1, X₃, X₅) :|: X₁ ≤ X₀ of depth 1:

new bound:

2⋅X₃+2⋅X₅+4⋅X₀+4⋅X₁+8 {O(n)}

MPRF:

l2 [X₀+1-X₁ ]
l1 [X₀+1-X₁ ]

MPRF for transition t₂₉: l1(X₀, X₁, X₃, X₅) → l2(X₀, X₁, X₃, X₅) :|: X₀+1 ≤ X₁ of depth 1:

new bound:

16⋅X₃⋅X₅+32⋅X₀⋅X₀+32⋅X₀⋅X₃+32⋅X₀⋅X₅+32⋅X₁⋅X₁+32⋅X₁⋅X₃+32⋅X₁⋅X₅+64⋅X₀⋅X₁+8⋅X₃⋅X₃+8⋅X₅⋅X₅+116⋅X₀+116⋅X₁+58⋅X₃+58⋅X₅+109 {O(n^2)}

MPRF:

l2 [X₁+1-X₀ ]
l1 [X₁+2-X₀ ]

MPRF for transition t₃₁: l2(X₀, X₁, X₃, X₅) → l1(X₀+1, X₁, X₃, X₅) :|: X₀+1 ≤ X₁ of depth 1:

new bound:

16⋅X₃⋅X₅+32⋅X₀⋅X₀+32⋅X₀⋅X₃+32⋅X₀⋅X₅+32⋅X₁⋅X₁+32⋅X₁⋅X₃+32⋅X₁⋅X₅+64⋅X₀⋅X₁+8⋅X₃⋅X₃+8⋅X₅⋅X₅+112⋅X₀+112⋅X₁+56⋅X₃+56⋅X₅+96 {O(n^2)}

MPRF:

l2 [X₁+1-X₀ ]
l1 [X₁+1-X₀ ]

Analysing control-flow refined program

Cut unsatisfiable transition t₁₁₆: n_l1___4→n_l2___5

Found invariant X₁ ≤ 1+X₀ for location n_l1___6

Found invariant 1+X₀ ≤ X₁ for location n_l2___7

Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location n_l1___4

Found invariant X₁ ≤ 1+X₀ ∧ 1+X₀ ≤ X₁ for location n_l2___5

Found invariant X₀ ≤ X₁ for location n_l1___3

Found invariant 1+X₅ ≤ X₃ ∧ 1+X₅ ≤ X₁ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₀ ≤ X₁ for location n_l2___1

Found invariant X₅ ≤ X₀ ∧ 1+X₃ ≤ X₅ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₁ ≤ X₃ ∧ 1+X₁ ≤ X₀ for location n_l2___2

Found invariant 1+X₁ ≤ X₀ for location n_l2___8

MPRF for transition t₁₁₅: n_l1___3(X₀, X₁, X₃, X₅) → n_l2___7(X₀, X₁, X₃, X₅) :|: X₀ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ X₁ of depth 1:

new bound:

4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+8 {O(n)}

MPRF:

n_l2___7 [X₁-X₀ ]
n_l1___3 [X₁+1-X₀ ]

MPRF for transition t₁₂₂: n_l2___7(X₀, X₁, X₃, X₅) → n_l1___3(X₀+1, X₁, X₃, X₅) :|: 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₁ of depth 1:

new bound:

4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+6 {O(n)}

MPRF:

n_l2___7 [X₁-X₀ ]
n_l1___3 [X₁-X₀ ]

MPRF for transition t₁₁₈: n_l1___6(X₀, X₁, X₃, X₅) → n_l2___8(X₀, X₁, X₃, X₅) :|: X₁ ≤ 1+X₀ ∧ 1+X₁ ≤ X₀ ∧ X₁ ≤ 1+X₀ of depth 1:

new bound:

4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+11 {O(n)}

MPRF:

n_l2___8 [X₀+1-X₁ ]
n_l1___6 [X₀+2-X₁ ]

MPRF for transition t₁₂₃: n_l2___8(X₀, X₁, X₃, X₅) → n_l1___6(X₀, X₁+1, X₃, X₅) :|: 1+X₁ ≤ X₀ ∧ X₁ ≤ X₀ ∧ 1+X₁ ≤ X₀ of depth 1:

new bound:

4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+9 {O(n)}

MPRF:

n_l2___8 [X₀+1-X₁ ]
n_l1___6 [X₀+1-X₁ ]

CFR: Improvement to new bound with the following program:

new bound:

16⋅X₃+16⋅X₅+28⋅X₀+28⋅X₁+34 {O(n)}

cfr-program:

Start: l0
Program_Vars: X₀, X₁, X₃, X₅
Temp_Vars: M, N, O, P
Locations: l0, l1, l2, l3, n_l1___3, n_l1___4, n_l1___6, n_l2___1, n_l2___2, n_l2___5, n_l2___7, n_l2___8
Transitions:
t₂₀: l0(X₀, X₁, X₃, X₅) → l1(X₀, X₁, X₃, X₅)
t₂₃: l0(X₀, X₁, X₃, X₅) → l1(X₅, X₃, X₃, X₅)
t₂₄: l0(X₀, X₁, X₃, X₅) → l1(X₅, X₃, X₃, X₅)
t₂₆: l0(X₀, X₁, X₃, X₅) → l1(X₀+1, X₁, X₃, X₅)
t₂₇: l0(X₀, X₁, X₃, X₅) → l1(X₀, X₁+1, X₃, X₅)
t₂₁: l0(X₀, X₁, X₃, X₅) → l2(X₀, X₁, X₃, X₅)
t₂₂: l0(X₀, X₁, X₃, X₅) → l3(X₀, X₁, X₃, X₅)
t₂₅: l0(X₀, X₁, X₃, X₅) → l3(O, P, M, N)
t₃₀: l1(X₀, X₁, X₃, X₅) → l3(O, P, M, N) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₁₁₁: l1(X₀, X₁, X₃, X₅) → n_l2___1(X₀, X₁, X₃, X₅) :|: X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1+X₀ ≤ X₁
t₁₁₂: l1(X₀, X₁, X₃, X₅) → n_l2___2(X₀, X₁, X₃, X₅) :|: X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1+X₁ ≤ X₀
t₁₁₃: l1(X₀, X₁, X₃, X₅) → n_l2___7(X₀, X₁, X₃, X₅) :|: 1+X₀ ≤ X₁
t₁₁₄: l1(X₀, X₁, X₃, X₅) → n_l2___8(X₀, X₁, X₃, X₅) :|: 1+X₁ ≤ X₀
t₁₂₄: l2(X₀, X₁, X₃, X₅) → n_l1___3(X₀+1, X₁, X₃, X₅) :|: 1+X₀ ≤ X₁
t₁₂₅: l2(X₀, X₁, X₃, X₅) → n_l1___6(X₀, X₁+1, X₃, X₅) :|: X₁ ≤ X₀
t₁₃₆: n_l1___3(X₀, X₁, X₃, X₅) → l3(O, P, M, N) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁₁₅: n_l1___3(X₀, X₁, X₃, X₅) → n_l2___7(X₀, X₁, X₃, X₅) :|: X₀ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ X₁
t₁₃₇: n_l1___4(X₀, X₁, X₃, X₅) → l3(O, P, M, N) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₁₃₈: n_l1___6(X₀, X₁, X₃, X₅) → l3(O, P, M, N) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₁ ≤ 1+X₀
t₁₁₇: n_l1___6(X₀, X₁, X₃, X₅) → n_l2___5(X₀, X₁, X₃, X₅) :|: X₁ ≤ 1+X₀ ∧ 1+X₀ ≤ X₁ ∧ X₁ ≤ 1+X₀
t₁₁₈: n_l1___6(X₀, X₁, X₃, X₅) → n_l2___8(X₀, X₁, X₃, X₅) :|: X₁ ≤ 1+X₀ ∧ 1+X₁ ≤ X₀ ∧ X₁ ≤ 1+X₀
t₁₁₉: n_l2___1(X₀, X₁, X₃, X₅) → n_l1___3(X₀+1, X₁, X₃, X₅) :|: 1+X₀ ≤ X₁ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₅ ≤ X₃ ∧ 1+X₅ ≤ X₁ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 1+X₀ ≤ X₃ ∧ 1+X₀ ≤ X₁
t₁₂₀: n_l2___2(X₀, X₁, X₃, X₅) → n_l1___6(X₀, X₁+1, X₃, X₅) :|: 1+X₁ ≤ X₀ ∧ X₀ ≤ X₅ ∧ X₅ ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₀ ∧ X₅ ≤ X₀ ∧ 1+X₃ ≤ X₅ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₁ ≤ X₃ ∧ 1+X₁ ≤ X₀
t₁₂₁: n_l2___5(X₀, X₁, X₃, X₅) → n_l1___4(X₀+1, X₁, X₃, X₅) :|: X₀+1 ≤ X₁ ∧ X₁ ≤ 1+X₀ ∧ 1+X₀ ≤ X₁ ∧ X₁ ≤ 1+X₀ ∧ 1+X₀ ≤ X₁
t₁₂₂: n_l2___7(X₀, X₁, X₃, X₅) → n_l1___3(X₀+1, X₁, X₃, X₅) :|: 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ 1+X₀ ≤ X₁
t₁₂₃: n_l2___8(X₀, X₁, X₃, X₅) → n_l1___6(X₀, X₁+1, X₃, X₅) :|: 1+X₁ ≤ X₀ ∧ X₁ ≤ X₀ ∧ 1+X₁ ≤ X₀

All Bounds

Timebounds

Overall timebound:16⋅X₃+16⋅X₅+28⋅X₀+28⋅X₁+56 {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₂₆: 1 {O(1)}
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₁₂₄: 1 {O(1)}
t₁₂₅: 1 {O(1)}
t₁₁₅: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+8 {O(n)}
t₁₃₆: 1 {O(1)}
t₁₃₇: 1 {O(1)}
t₁₁₇: 1 {O(1)}
t₁₁₈: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+11 {O(n)}
t₁₃₈: 1 {O(1)}
t₁₁₉: 1 {O(1)}
t₁₂₀: 1 {O(1)}
t₁₂₁: 1 {O(1)}
t₁₂₂: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+6 {O(n)}
t₁₂₃: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+9 {O(n)}

Costbounds

Overall costbound: 16⋅X₃+16⋅X₅+28⋅X₀+28⋅X₁+56 {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₂₆: 1 {O(1)}
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₁₂₄: 1 {O(1)}
t₁₂₅: 1 {O(1)}
t₁₁₅: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+8 {O(n)}
t₁₃₆: 1 {O(1)}
t₁₃₇: 1 {O(1)}
t₁₁₇: 1 {O(1)}
t₁₁₈: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+11 {O(n)}
t₁₃₈: 1 {O(1)}
t₁₁₉: 1 {O(1)}
t₁₂₀: 1 {O(1)}
t₁₂₁: 1 {O(1)}
t₁₂₂: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+6 {O(n)}
t₁₂₃: 4⋅X₃+4⋅X₅+7⋅X₀+7⋅X₁+9 {O(n)}

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₃: 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₅ {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₀: 2⋅X₅+3⋅X₀+1 {O(n)}
t₁₁₁, X₁: 2⋅X₃+3⋅X₁+1 {O(n)}
t₁₁₁, X₃: 5⋅X₃ {O(n)}
t₁₁₁, X₅: 5⋅X₅ {O(n)}
t₁₁₂, X₀: 2⋅X₅+3⋅X₀+1 {O(n)}
t₁₁₂, X₁: 2⋅X₃+3⋅X₁+1 {O(n)}
t₁₁₂, X₃: 5⋅X₃ {O(n)}
t₁₁₂, X₅: 5⋅X₅ {O(n)}
t₁₁₃, X₀: 2⋅X₅+3⋅X₀+1 {O(n)}
t₁₁₃, X₁: 2⋅X₃+3⋅X₁+1 {O(n)}
t₁₁₃, X₃: 5⋅X₃ {O(n)}
t₁₁₃, X₅: 5⋅X₅ {O(n)}
t₁₁₄, X₀: 2⋅X₅+3⋅X₀+1 {O(n)}
t₁₁₄, X₁: 2⋅X₃+3⋅X₁+1 {O(n)}
t₁₁₄, X₃: 5⋅X₃ {O(n)}
t₁₁₄, X₅: 5⋅X₅ {O(n)}
t₁₂₄, X₀: X₀+1 {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₃: X₃ {O(n)}
t₁₂₅, X₅: X₅ {O(n)}
t₁₁₅, X₀: 14⋅X₀+4⋅X₃+7⋅X₁+8⋅X₅+10 {O(n)}
t₁₁₅, X₁: 4⋅X₃+7⋅X₁+2 {O(n)}
t₁₁₅, X₃: 11⋅X₃ {O(n)}
t₁₁₅, X₅: 11⋅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₀: 4⋅X₅+7⋅X₀+2 {O(n)}
t₁₁₈, X₁: 14⋅X₁+4⋅X₅+7⋅X₀+8⋅X₃+13 {O(n)}
t₁₁₈, X₃: 11⋅X₃ {O(n)}
t₁₁₈, X₅: 11⋅X₅ {O(n)}
t₁₁₉, X₀: 2⋅X₅+3⋅X₀+2 {O(n)}
t₁₁₉, X₁: 2⋅X₃+3⋅X₁+1 {O(n)}
t₁₁₉, X₃: 5⋅X₃ {O(n)}
t₁₁₉, X₅: 5⋅X₅ {O(n)}
t₁₂₀, X₀: 2⋅X₅+3⋅X₀+1 {O(n)}
t₁₂₀, X₁: 2⋅X₃+3⋅X₁+2 {O(n)}
t₁₂₀, X₃: 5⋅X₃ {O(n)}
t₁₂₀, X₅: 5⋅X₅ {O(n)}
t₁₂₁, X₀: X₀+1 {O(n)}
t₁₂₁, X₁: X₁+1 {O(n)}
t₁₂₁, X₃: X₃ {O(n)}
t₁₂₁, X₅: X₅ {O(n)}
t₁₂₂, X₀: 14⋅X₀+4⋅X₃+7⋅X₁+8⋅X₅+10 {O(n)}
t₁₂₂, X₁: 4⋅X₃+7⋅X₁+2 {O(n)}
t₁₂₂, X₃: 11⋅X₃ {O(n)}
t₁₂₂, X₅: 11⋅X₅ {O(n)}
t₁₂₃, X₀: 4⋅X₅+7⋅X₀+2 {O(n)}
t₁₂₃, X₁: 14⋅X₁+4⋅X₅+7⋅X₀+8⋅X₃+13 {O(n)}
t₁₂₃, X₃: 11⋅X₃ {O(n)}
t₁₂₃, X₅: 11⋅X₅ {O(n)}