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₃) :|: 0 < X₀ ∧ 0 < X₁
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₄: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀-X₁, X₁, X₂, X₃) :|: X₁ < X₀ ∧ X₁ < X₀
t₆: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃) :|: X₁ < X₀ ∧ X₀ ≤ X₁
t₇: l3(X₀, X₁, X₂, X₃) → l1(X₀-X₁, X₁-X₀, X₂, X₃) :|: X₀ ≤ X₁ ∧ X₁ < X₀
t₈: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁-X₀, X₂, X₃) :|: X₀ ≤ X₁ ∧ X₀ ≤ X₁
t₉: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Cut unsatisfiable transition t₆: l3→l1
Cut unsatisfiable transition t₇: l3→l1
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ for location l5
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ for location l1
Found invariant X₁ ≤ X₃ ∧ X₀ ≤ X₂ for location l4
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l3
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₃) :|: 0 < X₀ ∧ 0 < X₁ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₄: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ ≤ 0 ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀-X₁, X₁, X₂, X₃) :|: X₁ < X₀ ∧ X₁ < X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₈: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁-X₀, X₂, X₃) :|: X₀ ≤ X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₉: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂
new bound:
X₂+X₃+1 {O(n)}
new bound:
X₂+X₃+1 {O(n)}
new bound:
X₃ {O(n)}
Overall timebound:2⋅X₂+3⋅X₃+7 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₂+X₃+1 {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: X₂+X₃+1 {O(n)}
t₈: X₃ {O(n)}
t₉: 1 {O(1)}
Overall costbound: 2⋅X₂+3⋅X₃+7 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₂+X₃+1 {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: X₂+X₃+1 {O(n)}
t₈: X₃ {O(n)}
t₉: 1 {O(1)}
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₃: 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₃: 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₂ {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₀: 3⋅X₂ {O(n)}
t₉, X₁: 3⋅X₃ {O(n)}
t₉, X₂: 3⋅X₂ {O(n)}
t₉, X₃: 3⋅X₃ {O(n)}