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₂ ≤ X₀
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ < X₂
t₆: l2(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
t₂: l3(X₀, X₁, X₂, X₃) → l1(2, X₁, X₂, X₃) :|: 0 ≤ X₂
t₁: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₂ < 0
t₅: l4(X₀, X₁, X₂, X₃) → l1((X₀)², X₁, X₂, X₃)
Eliminate variables {X₁,X₃} that do not contribute to the problem
Found invariant 0 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location l1
Found invariant 2 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀ for location l4
Start: l0
Program_Vars: X₀, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₄: l0(X₀, X₂) → l3(X₀, X₂)
t₁₆: l1(X₀, X₂) → l2(X₀, X₂) :|: X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₀
t₁₅: l1(X₀, X₂) → l4(X₀, X₂) :|: X₀ < X₂ ∧ 0 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 0 ≤ X₀
t₁₇: l2(X₀, X₂) → l5(X₀, X₂)
t₁₉: l3(X₀, X₂) → l1(2, X₂) :|: 0 ≤ X₂
t₁₈: l3(X₀, X₂) → l2(X₀, X₂) :|: X₂ < 0
t₂₀: l4(X₀, X₂) → l1((X₀)², X₂) :|: 2 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀
Found invariant 3 ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l4___3
Found invariant 3 ≤ X₂ for location n_l1___2
Found invariant 3 ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l4___1
Found invariant 0 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ 2+X₂ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location l1
Overall timebound:inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: 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₁₅: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: 1 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: inf {Infinity}
t₁₄, X₀: X₀ {O(n)}
t₁₄, X₂: X₂ {O(n)}
t₁₅, X₂: X₂ {O(n)}
t₁₆, X₂: 2⋅X₂ {O(n)}
t₁₇, X₂: 3⋅X₂ {O(n)}
t₁₈, X₀: X₀ {O(n)}
t₁₈, X₂: X₂ {O(n)}
t₁₉, X₀: 2 {O(1)}
t₁₉, X₂: X₂ {O(n)}
t₂₀, X₂: X₂ {O(n)}