Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: f0, f15, f23, f25, f28, f9
Transitions:
t₆: f0(X₀, X₁, X₂, X₃) → f9(E, 0, X₂, 0)
t₁: f15(X₀, X₁, X₂, X₃) → f15(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂
t₄: f15(X₀, X₁, X₂, X₃) → f9(E, X₁, X₂, 0) :|: X₂ ≤ 0
t₂: f23(X₀, X₁, X₂, X₃) → f23(X₀, X₁, X₂, X₃)
t₃: f25(X₀, X₁, X₂, X₃) → f28(X₀, X₁, X₂, X₃)
t₀: f9(X₀, X₁, X₂, X₃) → f15(X₀, 0, E, X₃) :|: 1 ≤ E ∧ X₀ ≤ 0
t₅: f9(X₀, X₁, X₂, X₃) → f23(X₀, X₁, X₂, X₃) :|: 1 ≤ X₀

Preprocessing

Cut unreachable locations [f25; f28] from the program graph

Cut unsatisfiable transition [t₄: f15→f9]

Eliminate variables [X₁; X₃] that do not contribute to the problem

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

Found invariant 1 ≤ X₀ for location f23

Problem after Preprocessing

Start: f0
Program_Vars: X₀, X₁
Temp_Vars: E
Locations: f0, f15, f23, f9
Transitions:
t₁₃: f0(X₀, X₁) → f9(E, X₁)
t₁₄: f15(X₀, X₁) → f15(X₀, X₁) :|: 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0
t₁₅: f23(X₀, X₁) → f23(X₀, X₁) :|: 1 ≤ X₀
t₁₆: f9(X₀, X₁) → f15(X₀, E) :|: 1 ≤ E ∧ X₀ ≤ 0
t₁₇: f9(X₀, X₁) → f23(X₀, X₁) :|: 1 ≤ X₀

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

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

Found invariant 1 ≤ X₀ for location f23

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

Found invariant 1 ≤ X₀ for location f23

Found invariant 1 ≤ X₀ for location f23_v1

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

t₁₃, X₁: X₁ {O(n)}
t₁₅, X₁: X₁ {O(n)}
t₁₇, X₁: X₁ {O(n)}