Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 1+X₁ ≤ X₀
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < X₁+1
t₁: l2(X₀, X₁, X₂, X₃) → l1(10000, 1, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁+1, X₂, X₃)
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Eliminate variables {X₂,X₃} that do not contribute to the problem
Found invariant X₀+X₁ ≤ 10001 ∧ 5001 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 5000 for location l5
Found invariant X₀+X₁ ≤ 10001 ∧ 1 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ X₀ ≤ 9999+X₁ ∧ X₀ ≤ 10000 for location l1
Found invariant X₀+X₁ ≤ 10001 ∧ 5001 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 5000 for location l4
Found invariant X₁ ≤ 5000 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 10001 ∧ 1 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ X₀ ≤ 9999+X₁ ∧ X₀ ≤ 10000 ∧ 5001 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₁: l0(X₀, X₁) → l2(X₀, X₁)
t₁₂: l1(X₀, X₁) → l3(X₀, X₁) :|: 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 10001 ∧ 1 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ X₀ ≤ 9999+X₁ ∧ X₀ ≤ 10000
t₁₃: l1(X₀, X₁) → l4(X₀, X₁) :|: X₀ < X₁+1 ∧ X₀+X₁ ≤ 10001 ∧ 1 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ X₀ ≤ 9999+X₁ ∧ X₀ ≤ 10000
t₁₄: l2(X₀, X₁) → l1(10000, 1)
t₁₅: l3(X₀, X₁) → l1(X₀-1, X₁+1) :|: X₁ ≤ 5000 ∧ 1+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 10001 ∧ 1 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ X₀ ≤ 9999+X₁ ∧ X₀ ≤ 10000 ∧ 5001 ≤ X₀
t₁₆: l4(X₀, X₁) → l5(X₀, X₁) :|: X₀+X₁ ≤ 10001 ∧ 5001 ≤ X₁ ∧ 10001 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 5000
new bound:
30001 {O(1)}
new bound:
5002 {O(1)}
Overall timebound:35007 {O(1)}
t₁₁: 1 {O(1)}
t₁₂: 30001 {O(1)}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 5002 {O(1)}
t₁₆: 1 {O(1)}
Overall costbound: 35007 {O(1)}
t₁₁: 1 {O(1)}
t₁₂: 30001 {O(1)}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 5002 {O(1)}
t₁₆: 1 {O(1)}
t₁₁, X₀: X₀ {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₂, X₀: 10000 {O(1)}
t₁₂, X₁: 5003 {O(1)}
t₁₃, X₀: 10000 {O(1)}
t₁₃, X₁: 5003 {O(1)}
t₁₄, X₀: 10000 {O(1)}
t₁₄, X₁: 1 {O(1)}
t₁₅, X₀: 10000 {O(1)}
t₁₅, X₁: 5003 {O(1)}
t₁₆, X₀: 10000 {O(1)}
t₁₆, X₁: 5003 {O(1)}