Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(400, 0, 0, X₃, X₄, X₅)
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, 1+X₁, G, H, X₄, G) :|: 1+X₁ ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₂, X₂, X₅) :|: 1 ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₂, X₂, X₅) :|: X₂+1 ≤ 0
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, 0, 0, 0, X₅) :|: X₀ ≤ X₁ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, 1+X₁, G, H, X₄, G)
t₅: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, 1+X₁, G, H, X₄, G)
Cut unreachable locations [l4; l5] from the program graph
Eliminate variables {H,X₃,X₄,X₅} that do not contribute to the problem
Found invariant X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location l2
Found invariant X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location l1
Found invariant X₂ ≤ 0 ∧ 400+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 400 ∧ 400+X₂ ≤ X₀ ∧ X₀+X₂ ≤ 400 ∧ 0 ≤ X₂ ∧ 400 ≤ X₁+X₂ ∧ X₁ ≤ 400+X₂ ∧ 400 ≤ X₀+X₂ ∧ X₀ ≤ 400+X₂ ∧ X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 400 ≤ X₁ ∧ 800 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: G
Locations: l0, l1, l2, l3
Transitions:
t₁₃: l0(X₀, X₁, X₂) → l1(400, 0, 0)
t₁₇: l1(X₀, X₁, X₂) → l1(X₀, 1+X₁, G) :|: 1+X₁ ≤ X₀ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀
t₁₅: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 1 ≤ X₂ ∧ X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀
t₁₆: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₂+1 ≤ 0 ∧ X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀
t₁₄: l1(X₀, X₁, X₂) → l3(X₀, X₁, 0) :|: X₀ ≤ X₁ ∧ X₂ ≤ 0 ∧ 0 ≤ X₂ ∧ X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀
Cut unsatisfiable transition t₁₄: l1→l3
Cut unsatisfiable transition t₁₅: l1→l2
Cut unsatisfiable transition t₁₆: l1→l2
Cut unsatisfiable transition t₅₅: n_l1___2→l3
Found invariant X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 1 ≤ X₁ ∧ 401 ≤ X₀+X₁ ∧ X₀ ≤ 399+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location l2
Found invariant X₁ ≤ 1 ∧ 399+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 401 ∧ 1 ≤ X₁ ∧ 401 ≤ X₀+X₁ ∧ X₀ ≤ 399+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location n_l1___2
Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 0 ∧ 400+X₂ ≤ X₀ ∧ X₀+X₂ ≤ 400 ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 400 ≤ X₀+X₂ ∧ X₀ ≤ 400+X₂ ∧ X₁ ≤ 0 ∧ 400+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 400 ∧ 0 ≤ X₁ ∧ 400 ≤ X₀+X₁ ∧ X₀ ≤ 400+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location l1
Found invariant X₂ ≤ 0 ∧ 400+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 400 ∧ 400+X₂ ≤ X₀ ∧ X₀+X₂ ≤ 400 ∧ 0 ≤ X₂ ∧ 400 ≤ X₁+X₂ ∧ X₁ ≤ 400+X₂ ∧ 400 ≤ X₀+X₂ ∧ X₀ ≤ 400+X₂ ∧ X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 400 ≤ X₁ ∧ 800 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location l3
Found invariant X₁ ≤ 400 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 800 ∧ 2 ≤ X₁ ∧ 402 ≤ X₀+X₁ ∧ X₀ ≤ 398+X₁ ∧ X₀ ≤ 400 ∧ 400 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: 1 {O(1)}
t₁₇: inf {Infinity}
t₁₃, X₀: 400 {O(1)}
t₁₃, X₁: 0 {O(1)}
t₁₃, X₂: 0 {O(1)}
t₁₄, X₀: 400 {O(1)}
t₁₄, X₁: 400 {O(1)}
t₁₄, X₂: 0 {O(1)}
t₁₅, X₀: 400 {O(1)}
t₁₅, X₁: 400 {O(1)}
t₁₆, X₀: 400 {O(1)}
t₁₆, X₁: 400 {O(1)}
t₁₇, X₀: 400 {O(1)}
t₁₇, X₁: 400 {O(1)}