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