Start: f2
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars: I, J, K
Locations: f1, f2, f300
Transitions:
t₀: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → f1(X₀, X₁, J, I, K, X₅, X₆, X₇) :|: 1 ≤ I ∧ 1+X₁ ≤ X₀
t₁: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → f1(X₀, X₁, J, I, K, X₅, X₆, X₇) :|: 1+I ≤ 0 ∧ 1+X₁ ≤ X₀
t₂: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → f1(X₀, X₁, J, 0, X₄, X₅, X₆, X₇) :|: 1+X₁ ≤ X₀
t₃: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → f300(X₀, X₁, J, X₃, X₄, I, X₆, X₇) :|: X₀ ≤ X₁
t₄: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → f1(X₀, X₁, X₂, X₃, X₄, X₅, J, J)
Eliminate variables [J; K; X₂; X₃; X₄; X₅; X₆; X₇] that do not contribute to the problem
Found invariant X₀ ≤ X₁ for location f300
Start: f2
Program_Vars: X₀, X₁
Temp_Vars: I
Locations: f1, f2, f300
Transitions:
t₉: f1(X₀, X₁) → f1(X₀, X₁) :|: 1 ≤ I ∧ 1+X₁ ≤ X₀
t₁₀: f1(X₀, X₁) → f1(X₀, X₁) :|: 1+I ≤ 0 ∧ 1+X₁ ≤ X₀
t₁₁: f1(X₀, X₁) → f1(X₀, X₁) :|: 1+X₁ ≤ X₀
t₁₂: f1(X₀, X₁) → f300(X₀, X₁) :|: X₀ ≤ X₁
t₁₃: f2(X₀, X₁) → f1(X₀, X₁)
Found invariant X₀ ≤ X₁ for location f300
Found invariant 1+X₁ ≤ X₀ for location f1_v1
Overall timebound:inf {Infinity}
t₉: inf {Infinity}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: 1 {O(1)}
Overall costbound: inf {Infinity}
t₉: inf {Infinity}
t₁₀: inf {Infinity}
t₁₁: inf {Infinity}
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)}
t₁₃, X₀: X₀ {O(n)}
t₁₃, X₁: X₁ {O(n)}