Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂+1 ≤ X₃
t₆: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₂
t₇: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃-1) :|: E+1 ≤ 0
t₈: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃-1) :|: E+1 ≤ 0 ∧ 1 ≤ E
t₉: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃-1) :|: 1 ≤ E
t₁₀: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: 1 ≤ 0
t₁₁: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: 1 ≤ 0
t₁₂: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃-1) :|: 1 ≤ 0
t₁₃: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃-1) :|: 1 ≤ 0
t₁₄: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃)
t₁₅: l3(X₀, X₁, X₂, X₃) → l5(X₀+1, X₃, X₂, X₃)
t₄: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₀+1, X₁)
t₂: l5(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀+1 ≤ X₁
t₃: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀
t₁₆: l6(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃)
t₁: l7(X₀, X₁, X₂, X₃) → l5(0, X₀, X₂, X₃)

Preprocessing

Cut unsatisfiable transition t₈: l2→l1

Cut unsatisfiable transition t₁₀: l2→l1

Cut unsatisfiable transition t₁₁: l2→l1

Cut unsatisfiable transition t₁₂: l2→l1

Cut unsatisfiable transition t₁₃: l2→l1

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

Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l6

Found invariant 0 ≤ X₀ for location l5

Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l8

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

Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l4

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

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₅: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂+1 ≤ X₃ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₆: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₇: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃-1) :|: E+1 ≤ 0 ∧ X₃ ≤ X₁ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₉: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃-1) :|: 1 ≤ E ∧ X₃ ≤ X₁ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₄: l2(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃) :|: X₃ ≤ X₁ ∧ 2 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₅: l3(X₀, X₁, X₂, X₃) → l5(X₀+1, X₃, X₂, X₃) :|: X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₄: l4(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₀+1, X₁) :|: 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₂: l5(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀+1 ≤ X₁ ∧ 0 ≤ X₀
t₃: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ 0 ≤ X₀
t₁₆: l6(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ 0 ≤ X₀
t₁: l7(X₀, X₁, X₂, X₃) → l5(0, X₀, X₂, X₃)

Analysing control-flow refined program

Cut unsatisfiable transition t₅₂₁: n_l5___5→l6

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

Found invariant 1+X₃ ≤ X₁ ∧ 3 ≤ X₃ ∧ 5 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 7 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ 3+X₀ ≤ X₃ ∧ 2+X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 6 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 4 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___7

Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l6

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

Found invariant X₃ ≤ X₁ ∧ 2 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___11

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

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

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

Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l4___16

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

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

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l5

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

Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l8

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

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

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

Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 2 ≤ X₃ ∧ 4 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 2+X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___1

Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 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 n_l5___3

Cut unsatisfiable transition t₅₀₃: n_l5___3→n_l4___4

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₉: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}
t₄: inf {Infinity}
t₂: inf {Infinity}
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₁: 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₃: 4⋅X₀ {O(n)}
t₄, X₁: X₀ {O(n)}
t₄, X₃: X₀ {O(n)}
t₂, X₁: X₀ {O(n)}
t₂, X₃: 4⋅X₀+X₃ {O(n)}
t₃, X₁: 2⋅X₀ {O(n)}
t₃, X₃: 4⋅X₀+X₃ {O(n)}
t₁₆, X₁: 2⋅X₀ {O(n)}
t₁₆, X₃: 4⋅X₀+X₃ {O(n)}
t₁, X₀: 0 {O(1)}
t₁, X₁: X₀ {O(n)}
t₁, X₂: X₂ {O(n)}
t₁, X₃: X₃ {O(n)}