Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H
Locations: l0, l1, l2, l3, l4
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(4, 0, 0, X₃, X₄, X₅)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, 1+X₁, G, H, X₄, G)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₂, X₂, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, 1+X₁, G, H, X₄, G)
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, 1+X₁, G, H, X₄, G)

Preprocessing

Cut unreachable locations [l3; l4] from the program graph

Eliminate variables {G,H,X₀,X₁,X₂,X₃,X₄,X₅} that do not contribute to the problem

Problem after Preprocessing

Start: l0
Program_Vars:
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0 → l1
t₉: l1 → l1
t₁₀: l1 → l2

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}

Costbounds

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

Sizebounds