Initial Problem

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

Preprocessing

Found invariant X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location l2

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

Found invariant X₂ ≤ 1+X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location l4

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

Problem after Preprocessing

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

Analysing control-flow refined program

Found invariant X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location n_l2___7

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

Found invariant X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location n_l3___6

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

Found invariant X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location n_l1___5

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

Found invariant X₂ ≤ 1+X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location l4

Found invariant X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₁ for location n_l1___1

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₄: 1 {O(1)}
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₄: 1 {O(1)}
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₁: X₁ {O(n)}
t₄, X₁: 2⋅X₁ {O(n)}
t₁₀, X₁: 3⋅X₁ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: 1 {O(1)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₂, X₂: X₂ {O(n)}