Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀) :|: 1 ≤ X₀
t₁: l0(X₀) → l1(100) :|: X₀ ≤ 100 ∧ 100 ≤ X₀
t₂: l1(X₀) → l1(X₀-1) :|: 1 ≤ X₀
Found invariant 0 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀) :|: 1 ≤ X₀
t₁: l0(X₀) → l1(100) :|: X₀ ≤ 100 ∧ 100 ≤ X₀
t₂: l1(X₀) → l1(X₀-1) :|: 1 ≤ X₀ ∧ 0 ≤ X₀
Found invariant X₀ ≤ 100 ∧ 0 ≤ X₀ for location l1
Found invariant 0 ≤ X₀ for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₁:
X₀: 100 {O(1)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 204 {O(1)}
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₀: X₀ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 2⋅X₀+4 {O(n)}
Overall timebound:2⋅X₀+210 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 2⋅X₀+208 {O(n)}
Overall costbound: 2⋅X₀+210 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 2⋅X₀+208 {O(n)}
t₀, X₀: X₀ {O(n)}
t₁, X₀: 100 {O(1)}
t₂, X₀: X₀+100 {O(n)}