Initial Problem

Start: f4
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H
Locations: f0, f2, f3, f4
Transitions:
t₂: f2(X₀, X₁, X₂, X₃, X₄, X₅) → f0(X₀, 0, 0, G, X₄, X₅)
t₀: f2(X₀, X₁, X₂, X₃, X₄, X₅) → f2(1+X₀, G, G, X₃, X₄, X₅) :|: 1 ≤ G ∧ 1 ≤ X₀
t₁: f2(X₀, X₁, X₂, X₃, X₄, X₅) → f2(1+X₀, G, G, X₃, X₄, X₅) :|: 1+G ≤ 0 ∧ 1 ≤ X₀
t₅: f3(X₀, X₁, X₂, X₃, X₄, X₅) → f0(X₀, 0, 0, G, X₄, X₅)
t₃: f3(X₀, X₁, X₂, X₃, X₄, X₅) → f2(1+X₀, G, G, X₃, X₄, X₅) :|: 1 ≤ G ∧ 1 ≤ X₀
t₄: f3(X₀, X₁, X₂, X₃, X₄, X₅) → f2(1+X₀, G, G, X₃, X₄, X₅) :|: 1+G ≤ 0 ∧ 1 ≤ X₀
t₈: f4(X₀, X₁, X₂, X₃, X₄, X₅) → f0(G, 0, 0, H, G, G)
t₆: f4(X₀, X₁, X₂, X₃, X₄, X₅) → f2(1+H, G, G, X₃, H, H) :|: 1 ≤ G ∧ 1 ≤ H
t₇: f4(X₀, X₁, X₂, X₃, X₄, X₅) → f2(1+H, G, G, X₃, H, H) :|: 1+G ≤ 0 ∧ 1 ≤ H

Preprocessing

Cut unreachable locations [f3] from the program graph

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

Found invariant 2 ≤ X₀ for location f2

Problem after Preprocessing

Start: f4
Program_Vars: X₀
Temp_Vars: G, H
Locations: f0, f2, f4
Transitions:
t₁₂: f2(X₀) → f0(X₀) :|: 2 ≤ X₀
t₁₃: f2(X₀) → f2(1+X₀) :|: 1 ≤ G ∧ 1 ≤ X₀ ∧ 2 ≤ X₀
t₁₄: f2(X₀) → f2(1+X₀) :|: 1+G ≤ 0 ∧ 1 ≤ X₀ ∧ 2 ≤ X₀
t₁₅: f4(X₀) → f0(G)
t₁₆: f4(X₀) → f2(1+H) :|: 1 ≤ G ∧ 1 ≤ H
t₁₇: f4(X₀) → f2(1+H) :|: 1+G ≤ 0 ∧ 1 ≤ H

Found invariant 2 ≤ X₀ for location f2

Found invariant 3 ≤ X₀ for location f2_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)}
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)}
t₁₇: 1 {O(1)}

Sizebounds