Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 1 < X₀ ∧ X₀ < 100
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ ≤ 1
t₄: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: 100 ≤ X₀
t₁: l2(X₀, X₁, X₂) → l1(X₂, X₁, X₂)
t₅: l3(X₀, X₁, X₂) → l1((X₀)², X₁, X₂)
t₆: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
Eliminate variables {X₁} that do not contribute to the problem
Found invariant X₀ ≤ 99 ∧ 2 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₄: l0(X₀, X₂) → l2(X₀, X₂)
t₁₅: l1(X₀, X₂) → l3(X₀, X₂) :|: 1 < X₀ ∧ X₀ < 100
t₁₆: l1(X₀, X₂) → l4(X₀, X₂) :|: X₀ ≤ 1
t₁₇: l1(X₀, X₂) → l4(X₀, X₂) :|: 100 ≤ X₀
t₁₈: l2(X₀, X₂) → l1(X₂, X₂)
t₁₉: l3(X₀, X₂) → l1((X₀)², X₂) :|: X₀ ≤ 99 ∧ 2 ≤ X₀
t₂₀: l4(X₀, X₂) → l5(X₀, X₂)
Found invariant X₂ ≤ 99 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 198 ∧ 2 ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₀ ≤ 99 ∧ 2 ≤ X₀ for location n_l3___3
Found invariant X₂ ≤ 99 ∧ 2 ≤ X₂ for location n_l1___2
Found invariant X₂ ≤ X₀ for location l5
Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1
Found invariant X₂ ≤ X₀ for location l4
Found invariant X₂ ≤ 99 ∧ X₂ ≤ 97+X₀ ∧ X₀+X₂ ≤ 198 ∧ 2 ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ 97+X₂ ∧ X₀ ≤ 99 ∧ 2 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: 1 {O(1)}
t₁₉: inf {Infinity}
t₂₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: 1 {O(1)}
t₁₉: inf {Infinity}
t₂₀: 1 {O(1)}
t₁₄, X₀: X₀ {O(n)}
t₁₄, X₂: X₂ {O(n)}
t₁₅, X₀: 99 {O(1)}
t₁₅, X₂: X₂ {O(n)}
t₁₆, X₀: X₂+9801 {O(n)}
t₁₆, X₂: 2⋅X₂ {O(n)}
t₁₇, X₀: X₂+9801 {O(n)}
t₁₇, X₂: 2⋅X₂ {O(n)}
t₁₈, X₀: X₂ {O(n)}
t₁₈, X₂: X₂ {O(n)}
t₁₉, X₀: 9801 {O(1)}
t₁₉, X₂: X₂ {O(n)}
t₂₀, X₀: 2⋅X₂+19602 {O(n)}
t₂₀, X₂: 4⋅X₂ {O(n)}