Initial Problem

Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: eval_foo_.critedge5_in, eval_foo_.critedge_in, eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_bb4_in, eval_foo_bb5_in, eval_foo_start, eval_foo_stop
Transitions:
t₁₀: eval_foo_.critedge5_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₁ ∧ X₁ ≤ 0
t₁₁: eval_foo_.critedge5_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1+X₁ ≤ 0
t₁₂: eval_foo_.critedge5_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₁
t₁₅: eval_foo_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_stop(X₀, X₁, X₂, X₃, X₄, X₅)
t₁: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(X₃, X₄, X₂, X₃, X₄, X₅)
t₃: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₄ ≤ 0
t₂: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₄
t₅: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1+X₁ ≤ 0
t₆: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₁
t₄: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 ≤ X₁ ∧ X₁ ≤ 0
t₇: eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_.critedge5_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₈: eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ 0
t₉: eval_foo_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_.critedge_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 0
t₁₃: eval_foo_bb4_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(X₀, X₄, X₂, X₃, X₄, X₅)
t₁₄: eval_foo_bb5_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb1_in(1+X₀, X₁-1, X₂, X₃, X₄, X₅)
t₀: eval_foo_start(X₀, X₁, X₂, X₃, X₄, X₅) → eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅)

Preprocessing

Cut unsatisfiable transition [t₁₀: eval_foo_.critedge5_in→eval_foo_bb4_in; t₁₁: eval_foo_.critedge5_in→eval_foo_bb5_in]

Eliminate variables [X₂; X₅] that do not contribute to the problem

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

Found invariant X₁ ≤ X₃ ∧ X₂ ≤ X₀ for location eval_foo_stop

Found invariant 1 ≤ X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ for location eval_foo_bb3_in

Found invariant 1 ≤ X₃ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ for location eval_foo_bb2_in

Found invariant X₁ ≤ X₃ ∧ X₂ ≤ X₀ for location eval_foo_bb1_in

Found invariant X₁ ≤ X₃ ∧ X₂ ≤ X₀ for location eval_foo_.critedge_in

Found invariant 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location eval_foo_.critedge5_in

Found invariant 1 ≤ X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ 0 ∧ 0 ≤ X₁ for location eval_foo_bb4_in

Problem after Preprocessing

Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_foo_.critedge5_in, eval_foo_.critedge_in, eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_bb4_in, eval_foo_bb5_in, eval_foo_start, eval_foo_stop
Transitions:
t₃₂: eval_foo_.critedge5_in(X₀, X₁, X₂, X₃) → eval_foo_bb5_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₃₃: eval_foo_.critedge_in(X₀, X₁, X₂, X₃) → eval_foo_stop(X₀, X₁, X₂, X₃) :|: X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₃₄: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(X₂, X₃, X₂, X₃)
t₃₅: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_.critedge_in(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0 ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₃₆: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₃₇: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 1+X₁ ≤ 0 ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₃₈: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₁ ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₃₉: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb4_in(X₀, X₁, X₂, X₃) :|: 0 ≤ X₁ ∧ X₁ ≤ 0 ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₄₀: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_.critedge5_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₄₁: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_.critedge_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ 0 ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₄₂: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_.critedge_in(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0 ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₄₃: eval_foo_bb4_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(X₀, X₃, X₂, X₃) :|: 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₃ ∧ X₂ ≤ X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ 0
t₄₄: eval_foo_bb5_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(1+X₀, X₁-1, X₂, X₃) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₃
t₄₅: eval_foo_start(X₀, X₁, X₂, X₃) → eval_foo_bb0_in(X₀, X₁, X₂, X₃)

Cut unreachable locations [eval_foo_bb3_in] from the program graph

Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location eval_foo_bb4_in_v2

Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location eval_foo_bb1_in_v1

Found invariant 1 ≤ 0 for location eval_foo_bb1_in_v3

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

Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location eval_foo_stop

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location eval_foo_.critedge5_in_v3

Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location eval_foo_.critedge5_in_v1

Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location eval_foo_bb2_in_v2

Found invariant 1 ≤ 0 for location eval_foo_.critedge5_in_v4

Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location eval_foo_bb1_in

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

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

Found invariant 1 ≤ 0 for location eval_foo_bb4_in_v1

Found invariant 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 3 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 4 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location eval_foo_.critedge5_in_v2

Found invariant X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location eval_foo_.critedge_in

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

Found invariant 1 ≤ 0 for location eval_foo_bb3_in_v2

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

Found invariant 1 ≤ 0 for location eval_foo_bb2_in_v4

Found invariant 1 ≤ 0 for location eval_foo_bb3_in_v5

Found invariant 1 ≤ 0 for location eval_foo_bb5_in_v4

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

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

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

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

Cut unsatisfiable transition [t₈₃: eval_foo_bb2_in_v1→eval_foo_bb4_in_v1; t₈₅: eval_foo_bb2_in_v1→eval_foo_bb3_in_v2; t₈₆: eval_foo_bb3_in_v2→eval_foo_.critedge_in; t₈₇: eval_foo_bb3_in_v2→eval_foo_.critedge_in; t₁₀₄: eval_foo_bb4_in_v1→eval_foo_bb1_in_v3; t₁₀₅: eval_foo_bb1_in_v3→eval_foo_bb2_in_v4; t₁₀₆: eval_foo_bb2_in_v4→eval_foo_bb3_in_v5; t₁₀₇: eval_foo_bb3_in_v5→eval_foo_.critedge_in; t₁₀₈: eval_foo_bb3_in_v5→eval_foo_.critedge5_in_v4; t₁₀₉: eval_foo_.critedge5_in_v4→eval_foo_bb5_in_v4; t₁₁₀: eval_foo_bb5_in_v4→eval_foo_bb1_in_v1]

Cut unreachable locations [eval_foo_.critedge5_in_v4; eval_foo_bb1_in_v3; eval_foo_bb2_in_v4; eval_foo_bb3_in_v2; eval_foo_bb3_in_v5; eval_foo_bb4_in_v1; eval_foo_bb5_in_v4] from the program graph

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₃₂: inf {Infinity}
t₃₃: 1 {O(1)}
t₃₄: 1 {O(1)}
t₃₅: 1 {O(1)}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
t₃₉: inf {Infinity}
t₄₀: inf {Infinity}
t₄₁: 1 {O(1)}
t₄₂: 1 {O(1)}
t₄₃: inf {Infinity}
t₄₄: inf {Infinity}
t₄₅: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₃₂: inf {Infinity}
t₃₃: 1 {O(1)}
t₃₄: 1 {O(1)}
t₃₅: 1 {O(1)}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
t₃₉: inf {Infinity}
t₄₀: inf {Infinity}
t₄₁: 1 {O(1)}
t₄₂: 1 {O(1)}
t₄₃: inf {Infinity}
t₄₄: inf {Infinity}
t₄₅: 1 {O(1)}

Sizebounds

t₃₂, X₁: 2⋅X₃ {O(n)}
t₃₂, X₂: X₂ {O(n)}
t₃₂, X₃: X₃ {O(n)}
t₃₃, X₁: 7⋅X₃ {O(n)}
t₃₃, X₂: 4⋅X₂ {O(n)}
t₃₃, X₃: 4⋅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₂: X₂ {O(n)}
t₃₆, X₃: X₃ {O(n)}
t₃₇, X₁: 2⋅X₃ {O(n)}
t₃₇, X₂: X₂ {O(n)}
t₃₇, X₃: X₃ {O(n)}
t₃₈, X₁: 2⋅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₁: 2⋅X₃ {O(n)}
t₄₀, X₂: X₂ {O(n)}
t₄₀, X₃: X₃ {O(n)}
t₄₁, X₁: 2⋅X₃ {O(n)}
t₄₁, X₂: X₂ {O(n)}
t₄₁, X₃: X₃ {O(n)}
t₄₂, X₁: 4⋅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₁: 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)}