Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D, E
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(0, X₁, X₂)
t₉: l1(X₀, X₁, X₂) → l1(X₀+1, X₀, X₂) :|: X₀ ≤ 0
t₁: l1(X₀, X₁, X₂) → l2(X₀, X₀, X₂) :|: X₀ ≤ 0 ∧ D ≤ 0
t₂: l1(X₀, X₁, X₂) → l2(X₀, X₀, X₂) :|: X₀ ≤ 0
t₁₂: l1(X₀, X₁, X₂) → l3(0, X₁, X₂) :|: 1 ≤ X₀
t₁₀: l2(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂)
t₁₁: l2(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂) :|: D+1 ≤ 0
t₅: l3(X₀, X₁, X₂) → l3(X₀+1, X₁, X₂) :|: X₀ ≤ 0
t₃: l3(X₀, X₁, X₂) → l4(X₀, X₁, D) :|: X₀ ≤ 0 ∧ E+1 ≤ 0
t₄: l3(X₀, X₁, X₂) → l4(X₀, X₁, D) :|: X₀ ≤ 0
t₈: l3(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: 1 ≤ X₀
t₆: l4(X₀, X₁, X₂) → l3(X₀+1, X₁, X₂)
t₇: l4(X₀, X₁, X₂) → l3(X₀+1, X₁, X₂) :|: D+1 ≤ 0
Eliminate variables {X₁,X₂} that do not contribute to the problem
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l5
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀
Temp_Vars: D, E
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₂₅: l0(X₀) → l1(0)
t₂₆: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₂₇: l1(X₀) → l2(X₀) :|: X₀ ≤ 0 ∧ D ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₂₈: l1(X₀) → l2(X₀) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₂₉: l1(X₀) → l3(0) :|: 1 ≤ X₀ ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₃₀: l2(X₀) → l1(X₀+1) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₃₁: l2(X₀) → l1(X₀+1) :|: D+1 ≤ 0 ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₃₂: l3(X₀) → l3(X₀+1) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₃₃: l3(X₀) → l4(X₀) :|: X₀ ≤ 0 ∧ E+1 ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₃₄: l3(X₀) → l4(X₀) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₃₅: l3(X₀) → l5(X₀) :|: 1 ≤ X₀ ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
t₃₆: l4(X₀) → l3(X₀+1) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₃₇: l4(X₀) → l3(X₀+1) :|: D+1 ≤ 0 ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₂₆: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₂₇: l1(X₀) → l2(X₀) :|: X₀ ≤ 0 ∧ D ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₂₈: l1(X₀) → l2(X₀) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 2 {O(1)} for transition t₃₀: l2(X₀) → l1(X₀+1) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 2 {O(1)} for transition t₃₁: l2(X₀) → l1(X₀+1) :|: D+1 ≤ 0 ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₃₂: l3(X₀) → l3(X₀+1) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₃₃: l3(X₀) → l4(X₀) :|: X₀ ≤ 0 ∧ E+1 ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₃₄: l3(X₀) → l4(X₀) :|: X₀ ≤ 0 ∧ X₀ ≤ 1 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 2 {O(1)} for transition t₃₆: l4(X₀) → l3(X₀+1) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
knowledge_propagation leads to new time bound 2 {O(1)} for transition t₃₇: l4(X₀) → l3(X₀+1) :|: D+1 ≤ 0 ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
Overall timebound:17 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 2 {O(1)}
t₃₁: 2 {O(1)}
t₃₂: 1 {O(1)}
t₃₃: 1 {O(1)}
t₃₄: 1 {O(1)}
t₃₅: 1 {O(1)}
t₃₆: 2 {O(1)}
t₃₇: 2 {O(1)}
Overall costbound: 17 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 2 {O(1)}
t₃₁: 2 {O(1)}
t₃₂: 1 {O(1)}
t₃₃: 1 {O(1)}
t₃₄: 1 {O(1)}
t₃₅: 1 {O(1)}
t₃₆: 2 {O(1)}
t₃₇: 2 {O(1)}
t₂₅, X₀: 0 {O(1)}
t₂₆, X₀: 1 {O(1)}
t₂₇, X₀: 0 {O(1)}
t₂₈, X₀: 0 {O(1)}
t₂₉, X₀: 0 {O(1)}
t₃₀, X₀: 1 {O(1)}
t₃₁, X₀: 1 {O(1)}
t₃₂, X₀: 1 {O(1)}
t₃₃, X₀: 0 {O(1)}
t₃₄, X₀: 0 {O(1)}
t₃₅, X₀: 1 {O(1)}
t₃₆, X₀: 1 {O(1)}
t₃₇, X₀: 1 {O(1)}