Initial Problem

Start: f0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: F
Locations: f0, f10, f16, f25, f27, f30
Transitions:
t₆: f0(X₀, X₁, X₂, X₃, X₄) → f10(F, 0, X₂, 0, F)
t₀: f10(X₀, X₁, X₂, X₃, X₄) → f16(X₀, 0, F, X₃, X₄) :|: 1 ≤ F ∧ X₀ ≤ 0
t₅: f10(X₀, X₁, X₂, X₃, X₄) → f25(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ X₀
t₄: f16(X₀, X₁, X₂, X₃, X₄) → f10(F, X₁, X₂, 0, F) :|: X₂ ≤ 0
t₁: f16(X₀, X₁, X₂, X₃, X₄) → f16(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ X₂
t₂: f25(X₀, X₁, X₂, X₃, X₄) → f25(X₀, X₁, X₂, X₃, X₄)
t₃: f27(X₀, X₁, X₂, X₃, X₄) → f30(X₀, X₁, X₂, X₃, X₄)

Preprocessing

Cut unreachable locations [f27; f30] from the program graph

Cut unsatisfiable transition [t₄: f16→f10]

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

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

Found invariant 1 ≤ X₀ for location f25

Problem after Preprocessing

Start: f0
Program_Vars: X₀, X₁
Temp_Vars: F
Locations: f0, f10, f16, f25
Transitions:
t₁₅: f0(X₀, X₁) → f10(F, X₁)
t₁₆: f10(X₀, X₁) → f16(X₀, F) :|: 1 ≤ F ∧ X₀ ≤ 0
t₁₇: f10(X₀, X₁) → f25(X₀, X₁) :|: 1 ≤ X₀
t₁₈: f16(X₀, X₁) → f16(X₀, X₁) :|: 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0
t₁₉: f25(X₀, X₁) → f25(X₀, X₁) :|: 1 ≤ X₀

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

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

Found invariant 1 ≤ X₀ for location f25

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

Found invariant 1 ≤ X₀ for location f25_v1

Found invariant 1 ≤ X₀ for location f25

All Bounds

Timebounds

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

Costbounds

Overall costbound: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: 1 {O(1)}
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)}