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₃) :|: X₀ < X₁
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃) → l1(0, 100, 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 1 ≤ 0 for location l5
Found invariant X₁ ≤ 100+X₀ ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l1
Found invariant 1 ≤ 0 for location l4
Found invariant X₁ ≤ 100+X₀ ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l3
Cut unsatisfiable transition t₁₄: l1→l4
Cut unsatisfiable transition t₁₇: l4→l5
Cut unreachable locations [l4; l5] from the program graph
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₂: l0(X₀, X₁) → l2(X₀, X₁)
t₁₃: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀ < X₁ ∧ X₁ ≤ 100+X₀ ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₅: l2(X₀, X₁) → l1(0, 100)
t₁₆: l3(X₀, X₁) → l1(X₀+1, X₁+1) :|: X₁ ≤ 100+X₀ ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 0 ≤ X₀
Found invariant X₁ ≤ 100+X₀ ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l1
Found invariant X₁ ≤ 100+X₀ ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l3
Found invariant X₁ ≤ 100 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 100 ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___3
Found invariant X₁ ≤ 100+X₀ ∧ 101 ≤ X₁ ∧ 102 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___2
Found invariant X₁ ≤ 100 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 100 ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₁ ≤ 100+X₀ ∧ 101 ≤ X₁ ∧ 102 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___1
Found invariant X₁ ≤ 100 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 100 ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l3___3
Found invariant X₁ ≤ 100+X₀ ∧ 101 ≤ X₁ ∧ 102 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___2
Found invariant X₁ ≤ 100 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 100 ∧ 100 ≤ X₁ ∧ 100 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₁ ≤ 100+X₀ ∧ 101 ≤ X₁ ∧ 102 ≤ X₀+X₁ ∧ 100+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
t₁₂, X₀: X₀ {O(n)}
t₁₂, X₁: X₁ {O(n)}
t₁₅, X₀: 0 {O(1)}
t₁₅, X₁: 100 {O(1)}