Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆
Temp_Vars: R, S
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₇: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l1(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, R, X₁₀, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₁₀ ≤ 0
t₈: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l1(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, S, R, 0, 1, S, S, S) :|: 1 ≤ S ∧ 1 ≤ X₁₀
t₉: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, S, R, 0, 1, S, S, S) :|: S ≤ 0 ∧ 1 ≤ X₁₀
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₀ ≤ 0
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l3(0, X₁, R, X₃, X₄, X₅, X₆, 0, R, R, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 1 ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆)
t₃: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(X₀, R, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 1 ≤ X₀
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(X₀, S, X₂, 0, R, R, R, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₀ ≤ 0 ∧ R ≤ 999+X₂
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(1, S, X₂, 0, R, R, R, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₀ ≤ 0 ∧ X₂+1000 ≤ R
t₂: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆)
Cut unreachable locations [l4; l5] from the program graph
Cut unsatisfiable transition t₀: l1→l3
Cut unsatisfiable transition t₃: l3→l2
Eliminate variables {X₁,X₃,X₄,X₅,X₆,X₇,X₈,X₉,X₁₁,X₁₂,X₁₃,X₁₄,X₁₅,X₁₆} that do not contribute to the problem
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₂, X₁₀
Temp_Vars: R, S
Locations: l0, l1, l2, l3
Transitions:
t₁₉: l0(X₀, X₂, X₁₀) → l1(1, X₂, X₁₀) :|: X₁₀ ≤ 0
t₂₀: l0(X₀, X₂, X₁₀) → l1(1, X₂, S) :|: 1 ≤ S ∧ 1 ≤ X₁₀
t₂₁: l0(X₀, X₂, X₁₀) → l2(1, X₂, S) :|: S ≤ 0 ∧ 1 ≤ X₁₀
t₂₂: l1(X₀, X₂, X₁₀) → l3(0, R, X₁₀) :|: 1 ≤ X₀ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₂₃: l2(X₀, X₂, X₁₀) → l2(X₀, X₂, X₁₀) :|: X₀ ≤ 1 ∧ 0 ≤ X₀
t₂₄: l3(X₀, X₂, X₁₀) → l2(X₀, X₂, X₁₀) :|: X₀ ≤ 0 ∧ R ≤ 999+X₂ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₅: l3(X₀, X₂, X₁₀) → l2(1, X₂, X₁₀) :|: X₀ ≤ 0 ∧ X₂+1000 ≤ R ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Overall timebound:inf {Infinity}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: 1 {O(1)}
t₂₃: inf {Infinity}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: 1 {O(1)}
t₂₃: inf {Infinity}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₁₉, X₀: 1 {O(1)}
t₁₉, X₂: X₂ {O(n)}
t₁₉, X₁₀: X₁₀ {O(n)}
t₂₀, X₀: 1 {O(1)}
t₂₀, X₂: X₂ {O(n)}
t₂₁, X₀: 1 {O(1)}
t₂₁, X₂: X₂ {O(n)}
t₂₂, X₀: 0 {O(1)}
t₂₃, X₀: 1 {O(1)}
t₂₄, X₀: 0 {O(1)}
t₂₅, X₀: 1 {O(1)}