Initial Problem

Start: f300
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M, N, O, P, Q, R
Locations: f1, f2, f300
Transitions:
t₁: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f1(X₀, L, M, X₃, X₄, X₅, N, X₇, X₈, X₉, X₁₀) :|: X₀ ≤ 1
t₀: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f2(X₀, L, M, N, X₅, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 2 ≤ X₀
t₃: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f1(X₀, L, M, X₃, N, P, O, X₇, Q, N, R) :|: X₇ ≤ 0
t₂: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → f2(X₀, L, M, N, O, O, X₆, X₇, P, Q, R) :|: 1 ≤ X₇

Preprocessing

Eliminate variables [L; M; N; O; P; Q; R; X₁; X₂; X₃; X₄; X₅; X₆; X₈; X₉; X₁₀] that do not contribute to the problem

Found invariant 1 ≤ X₁ for location f2

Problem after Preprocessing

Start: f300
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f1, f2, f300
Transitions:
t₆: f2(X₀, X₁) → f1(X₀, X₁) :|: X₀ ≤ 1 ∧ 1 ≤ X₁
t₇: f2(X₀, X₁) → f2(X₀, X₁) :|: 2 ≤ X₀ ∧ 1 ≤ X₁
t₈: f300(X₀, X₁) → f1(X₀, X₁) :|: X₁ ≤ 0
t₉: f300(X₀, X₁) → f2(X₀, X₁) :|: 1 ≤ X₁

Found invariant 1 ≤ X₁ for location f2

Found invariant 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location f2_v1

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₆: 1 {O(1)}
t₇: inf {Infinity}
t₈: 1 {O(1)}
t₉: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₆: 1 {O(1)}
t₇: inf {Infinity}
t₈: 1 {O(1)}
t₉: 1 {O(1)}

Sizebounds

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)}