Initial Problem

Start: f0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: f0, f13, f15, f17, f7
Transitions:
t₅: f0(X₀, X₁) → f7(C, 1)
t₂: f13(X₀, X₁) → f13(X₀, X₁)
t₃: f15(X₀, X₁) → f17(X₀, X₁)
t₄: f7(X₀, X₁) → f13(0, 1) :|: 0 ≤ X₀ ∧ X₀ ≤ 0
t₀: f7(X₀, X₁) → f7(C, X₁) :|: 1+X₀ ≤ 0
t₁: f7(X₀, X₁) → f7(C, X₁) :|: 1 ≤ X₀

Preprocessing

Cut unreachable locations [f15; f17] from the program graph

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

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

Problem after Preprocessing

Start: f0
Program_Vars: X₀
Temp_Vars: C
Locations: f0, f13, f7
Transitions:
t₁₁: f0(X₀) → f7(C)
t₁₂: f13(X₀) → f13(X₀) :|: 0 ≤ X₀ ∧ X₀ ≤ 0
t₁₃: f7(X₀) → f13(0) :|: 0 ≤ X₀ ∧ X₀ ≤ 0
t₁₄: f7(X₀) → f7(C) :|: 1+X₀ ≤ 0
t₁₅: f7(X₀) → f7(C) :|: 1 ≤ X₀

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

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

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

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: 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₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}

Sizebounds

t₁₂, X₀: 0 {O(1)}
t₁₃, X₀: 0 {O(1)}