Start: f0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M
Locations: f0, f12, f20, f5
Transitions:
t₁: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f12(M, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: L ≤ 15
t₀: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀)
t₄: f0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f5(X₀, X₁, X₂, 1, 1, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: M ≤ 15
t₂: f12(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f20(X₀, M, M, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 1+X₀ ≤ 0
t₃: f12(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f20(X₀, M, M, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 1 ≤ X₀
t₆: f12(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f5(0, X₁, X₂, 0, 0, X₅, X₆, M, M, 0, 0) :|: 0 ≤ X₀ ∧ X₀ ≤ 0
t₅: f20(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f12(X₀-1, X₁, X₂, X₃, X₄, 0, 0, X₇, X₈, X₉, X₁₀)
Eliminate variables [X₁; X₂; X₃; X₄; X₅; X₆; X₇; X₈; X₉; X₁₀] that do not contribute to the problem
Start: f0
Program_Vars: X₀
Temp_Vars: L, M
Locations: f0, f12, f20, f5
Transitions:
t₁₁: f0(X₀) → f12(M) :|: L ≤ 15
t₁₂: f0(X₀) → f5(X₀)
t₁₃: f0(X₀) → f5(X₀) :|: M ≤ 15
t₁₄: f12(X₀) → f20(X₀) :|: 1+X₀ ≤ 0
t₁₅: f12(X₀) → f20(X₀) :|: 1 ≤ X₀
t₁₆: f12(X₀) → f5(0) :|: 0 ≤ X₀ ∧ X₀ ≤ 0
t₁₇: f20(X₀) → f12(X₀-1)
Found invariant 0 ≤ X₀ for location f12_v2
Found invariant 1 ≤ X₀ for location f20_v1
Found invariant 2+X₀ ≤ 0 for location f12_v1
Found invariant 1+X₀ ≤ 0 for location f20_v2
Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
t₁₂, X₀: X₀ {O(n)}
t₁₃, X₀: X₀ {O(n)}
t₁₆, X₀: 0 {O(1)}