Initial Problem
Start: eval_twn14_start
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars:
Locations: eval_twn14_.critedge_in, eval_twn14_bb0_in, eval_twn14_bb1_in, eval_twn14_bb2_in, eval_twn14_bb3_in, eval_twn14_bb4_in, eval_twn14_bb5_in, eval_twn14_bb6_in, eval_twn14_start, eval_twn14_stop
Transitions:
t₁₂: eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb1_in(X₀-1, X₁, X₂, X₃, X₄, X₅, X₆, X₇)
t₁: eval_twn14_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb1_in(X₃, X₁, X₂, X₃, X₄, X₅, X₆, X₇)
t₂: eval_twn14_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀
t₃: eval_twn14_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb6_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₀ ≤ 0
t₅: eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₆ ≤ 0
t₄: eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb3_in(X₀, X₀, X₇, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₆
t₈: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 0 ≤ X₁ ∧ X₁ ≤ 0
t₆: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₁ ≤ 0
t₇: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₁
t₁₀: eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₂ ≤ (X₁)²+(X₆)⁵
t₉: eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+(X₁)²+(X₆)⁵ ≤ X₂
t₁₁: eval_twn14_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb3_in(X₀, -2⋅X₁, 3⋅X₂-(X₆)³, X₃, X₄, X₅, X₆, X₇)
t₁₃: eval_twn14_bb6_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_stop(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇)
t₀: eval_twn14_start(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_twn14_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇)
Preprocessing
Eliminate variables [X₄; X₅] that do not contribute to the problem
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_bb3_in
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_.critedge_in
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_bb2_in
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_bb5_in
Found invariant X₀ ≤ X₃ ∧ X₀ ≤ 0 for location eval_twn14_bb6_in
Found invariant X₀ ≤ X₃ ∧ X₀ ≤ 0 for location eval_twn14_stop
Found invariant X₀ ≤ X₃ for location eval_twn14_bb1_in
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_bb4_in
Problem after Preprocessing
Start: eval_twn14_start
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: eval_twn14_.critedge_in, eval_twn14_bb0_in, eval_twn14_bb1_in, eval_twn14_bb2_in, eval_twn14_bb3_in, eval_twn14_bb4_in, eval_twn14_bb5_in, eval_twn14_bb6_in, eval_twn14_start, eval_twn14_stop
Transitions:
t₂₇: eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb1_in(X₀-1, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃
t₂₈: eval_twn14_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb1_in(X₃, X₁, X₂, X₃, X₄, X₅)
t₂₉: eval_twn14_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀ ∧ X₀ ≤ X₃
t₃₀: eval_twn14_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb6_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 0 ∧ X₀ ≤ X₃
t₃₁: eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₄ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃
t₃₂: eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb3_in(X₀, X₀, X₅, X₃, X₄, X₅) :|: 1 ≤ X₄ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃
t₃₃: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₁ ∧ X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃
t₃₄: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1+X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃
t₃₅: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃
t₃₆: eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ (X₁)²+(X₄)⁵ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃
t₃₇: eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1+(X₁)²+(X₄)⁵ ≤ X₂ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃
t₃₈: eval_twn14_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb3_in(X₀, -2⋅X₁, 3⋅X₂-(X₄)³, X₃, X₄, X₅) :|: 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃
t₃₉: eval_twn14_bb6_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_stop(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 0 ∧ X₀ ≤ X₃
t₄₀: eval_twn14_start(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅)
MPRF for transition t₂₇: eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb1_in(X₀-1, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
• eval_twn14_.critedge_in: [X₀]
• eval_twn14_bb1_in: [X₀]
• eval_twn14_bb2_in: [X₀]
• eval_twn14_bb3_in: [X₀]
• eval_twn14_bb4_in: [X₀]
• eval_twn14_bb5_in: [X₀]
MPRF for transition t₂₉: eval_twn14_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
• eval_twn14_.critedge_in: [X₀-1]
• eval_twn14_bb1_in: [X₀]
• eval_twn14_bb2_in: [X₀-1]
• eval_twn14_bb3_in: [X₀-1]
• eval_twn14_bb4_in: [X₀-1]
• eval_twn14_bb5_in: [X₀-1]
MPRF for transition t₃₁: eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₄ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
• eval_twn14_.critedge_in: [X₀-1]
• eval_twn14_bb1_in: [X₀]
• eval_twn14_bb2_in: [X₀]
• eval_twn14_bb3_in: [X₀]
• eval_twn14_bb4_in: [X₀]
• eval_twn14_bb5_in: [X₀]
MPRF for transition t₃₂: eval_twn14_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_bb3_in(X₀, X₀, X₅, X₃, X₄, X₅) :|: 1 ≤ X₄ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
• eval_twn14_.critedge_in: [X₀-1]
• eval_twn14_bb1_in: [X₀]
• eval_twn14_bb2_in: [X₀]
• eval_twn14_bb3_in: [X₀-1]
• eval_twn14_bb4_in: [X₀-1]
• eval_twn14_bb5_in: [X₀-1]
MPRF for transition t₃₃: eval_twn14_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₁ ∧ X₁ ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
• eval_twn14_.critedge_in: [X₀-1]
• eval_twn14_bb1_in: [X₀]
• eval_twn14_bb2_in: [X₀]
• eval_twn14_bb3_in: [X₀]
• eval_twn14_bb4_in: [X₀]
• eval_twn14_bb5_in: [X₀]
MPRF for transition t₃₆: eval_twn14_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn14_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ (X₁)²+(X₄)⁵ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₄ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₀+X₄ ∧ 2 ≤ X₃+X₄ ∧ X₀ ≤ X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
• eval_twn14_.critedge_in: [X₀-1]
• eval_twn14_bb1_in: [X₀]
• eval_twn14_bb2_in: [X₀]
• eval_twn14_bb3_in: [X₀]
• eval_twn14_bb4_in: [X₀]
• eval_twn14_bb5_in: [X₀]
Cut unreachable locations [eval_twn14_bb4_in] from the program graph
Cut unsatisfiable transition [t₃₃: eval_twn14_bb3_in→eval_twn14_.critedge_in; t₇₆: eval_twn14_bb3_in→eval_twn14_bb4_in_v2; t₇₇: eval_twn14_bb3_in→eval_twn14_.critedge_in]
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location eval_twn14_bb4_in_v1
Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location eval_twn14_bb3_in
Found invariant 5+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 7 ≤ X₂+X₄ ∧ 3+X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 7 ≤ X₂+X₃ ∧ 3+X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 6 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 8+X₁ ≤ X₂ ∧ 7 ≤ X₀+X₂ ∧ 5+X₀ ≤ X₂ ∧ 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location eval_twn14_bb5_in_v1
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_.critedge_in
Found invariant 2+X₄ ≤ X₂ ∧ 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 4 ≤ X₂+X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location eval_twn14_bb5_in_v2
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 5 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 5 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 4 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 3+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location eval_twn14_bb3_in_v1
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 3+X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 3+X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location eval_twn14_bb3_in_v2
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location eval_twn14_bb2_in
Found invariant X₀ ≤ X₃ ∧ X₀ ≤ 0 for location eval_twn14_bb6_in
Found invariant X₀ ≤ X₃ ∧ X₀ ≤ 0 for location eval_twn14_stop
Found invariant X₀ ≤ X₃ for location eval_twn14_bb1_in
Found invariant 1 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 3+X₁ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ 1 ≤ X₃ ∧ 3+X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 2+X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 1+X₀+X₁ ≤ 0 ∧ 1 ≤ X₀ for location eval_twn14_bb4_in_v2
All Bounds
Timebounds
Overall timebound:inf {Infinity}
t₂₇: X₃ {O(n)}
t₂₈: 1 {O(1)}
t₂₉: X₃ {O(n)}
t₃₀: 1 {O(1)}
t₃₁: X₃ {O(n)}
t₃₂: X₃ {O(n)}
t₃₃: X₃ {O(n)}
t₃₄: inf {Infinity}
t₃₅: inf {Infinity}
t₃₆: X₃ {O(n)}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
t₃₉: 1 {O(1)}
t₄₀: 1 {O(1)}
Costbounds
Overall costbound: inf {Infinity}
t₂₇: X₃ {O(n)}
t₂₈: 1 {O(1)}
t₂₉: X₃ {O(n)}
t₃₀: 1 {O(1)}
t₃₁: X₃ {O(n)}
t₃₂: X₃ {O(n)}
t₃₃: X₃ {O(n)}
t₃₄: inf {Infinity}
t₃₅: inf {Infinity}
t₃₆: X₃ {O(n)}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
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₂: 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₀: 2⋅X₃ {O(n)}
t₃₀, X₃: 2⋅X₃ {O(n)}
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₃ {O(n)}
t₃₃, X₁: 0 {O(1)}
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₃ {O(n)}
t₃₈, X₄: X₄ {O(n)}
t₃₈, X₅: X₅ {O(n)}
t₃₉, X₀: 2⋅X₃ {O(n)}
t₃₉, X₃: 2⋅X₃ {O(n)}
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)}