Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I, J, K
Locations: l0, l1, l2
Transitions:
t₄: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, X₃, X₄, X₅, H)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(H, X₁, X₂, I, 0, X₅, X₆) :|: X₀+1 ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(H, X₁, X₂, I, J, K, X₆) :|: J+1 ≤ 0 ∧ X₀+1 ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(H, X₁, X₂, I, J, K, X₆) :|: 1 ≤ J ∧ X₀+1 ≤ X₁
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(H, X₁, I, X₃, X₄, X₅, X₆) :|: X₁ ≤ X₀

Preprocessing

Eliminate variables {I,K,X₂,X₃,X₄,X₅,X₆} that do not contribute to the problem

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars: H, J
Locations: l0, l1, l2
Transitions:
t₁₁: l0(X₀, X₁) → l1(X₀, X₁)
t₁₃: l1(X₀, X₁) → l1(H, X₁) :|: X₀+1 ≤ X₁
t₁₄: l1(X₀, X₁) → l1(H, X₁) :|: J+1 ≤ 0 ∧ X₀+1 ≤ X₁
t₁₅: l1(X₀, X₁) → l1(H, X₁) :|: 1 ≤ J ∧ X₀+1 ≤ X₁
t₁₂: l1(X₀, X₁) → l2(H, X₁) :|: X₁ ≤ X₀

Analysing control-flow refined program

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}

Sizebounds

t₁₁, X₀: X₀ {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₂, X₁: 10⋅X₁ {O(n)}
t₁₃, X₁: 3⋅X₁ {O(n)}
t₁₄, X₁: 3⋅X₁ {O(n)}
t₁₅, X₁: 3⋅X₁ {O(n)}