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