Start: f300
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M, N, O, P, Q, R, S
Locations: f1, f2, f300
Transitions:
t₀: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f2(X₀, X₂, X₂, L, M, N, X₆, X₇, X₈, X₉, X₁₀) :|: 1 ≤ X₀
t₁: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f1(X₀, L, N, P, Q, X₅, X₆, L, M, O, R) :|: X₆ ≤ 0
t₃: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f1(X₀, N, N, P, Q, R, X₆, L, M, O, S) :|: 1 ≤ X₆ ∧ X₀ ≤ 0
t₂: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f2(X₀, N, N, P, Q, R, X₆, L, M, O, X₁₀) :|: 1 ≤ X₀ ∧ 1 ≤ X₆
Eliminate variables [L; M; N; O; P; Q; R; S; X₁; X₂; X₃; X₄; X₅; X₇; X₈; X₉; X₁₀] that do not contribute to the problem
Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location f2
Start: f300
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f1, f2, f300
Transitions:
t₅: f2(X₀, X₁) → f2(X₀, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁
t₆: f300(X₀, X₁) → f1(X₀, X₁) :|: X₁ ≤ 0
t₇: f300(X₀, X₁) → f1(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₈: f300(X₀, X₁) → f2(X₀, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location f2
Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location f2_v1
Overall timebound:inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
Overall costbound: inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₅, X₀: X₀ {O(n)}
t₅, X₁: X₁ {O(n)}
t₆, X₀: X₀ {O(n)}
t₆, X₁: X₁ {O(n)}
t₇, X₀: X₀ {O(n)}
t₇, X₁: X₁ {O(n)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}