Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 0 < X₂
t₁: l1(X₀, X₁, X₂) → l1(-2⋅X₀, 3⋅X₁-2⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ X₀ < 0
t₂: l1(X₀, X₁, X₂) → l1(-2⋅X₀, 3⋅X₁-2⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ 0 < X₀

Preprocessing

Found invariant 1 ≤ X₂ for location l1

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 0 < X₂
t₁: l1(X₀, X₁, X₂) → l1(-2⋅X₀, 3⋅X₁-2⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ X₀ < 0 ∧ 1 ≤ X₂
t₂: l1(X₀, X₁, X₂) → l1(-2⋅X₀, 3⋅X₁-2⋅(X₂)³, X₂) :|: (X₀)²+(X₂)⁵ < X₁ ∧ 0 < X₀ ∧ 1 ≤ X₂

Analysing control-flow refined program

Eliminate variables {NoDet0,X₁} that do not contribute to the problem

Found invariant 1 ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 2 ≤ X₀ for location n_l1___2

Found invariant 1 ≤ X₂ for location l1

Found invariant 1 ≤ X₂ ∧ 3+X₀ ≤ X₂ ∧ 2+X₀ ≤ 0 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}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: inf {Infinity}

Sizebounds

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)}