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