Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₄: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀, X₁+1) :|: X₁+1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀, X₁+1) :|: X₀+1 ≤ X₁ ∧ X₁+1 ≤ X₀
t₂: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₁+1 ≤ X₀ ∧ X₀ ≤ X₁
t₃: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₀+1 ≤ X₁ ∧ X₀ ≤ X₁
Cut unsatisfiable transition t₁: l1→l1
Cut unsatisfiable transition t₂: l1→l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₄: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀, X₁+1) :|: X₁+1 ≤ X₀
t₃: l1(X₀, X₁) → l1(X₀+1, X₁) :|: X₀+1 ≤ X₁ ∧ X₀ ≤ X₁
Termination: true
Formula:
relevant size-bounds w.r.t. t₄:
X₀: X₀ {O(n)}
X₁: X₁ {O(n)}
Runtime-bound of t₄: 1 {O(1)}
Results in: 2⋅X₀+2⋅X₁+4 {O(n)}
Termination: true
Formula:
relevant size-bounds w.r.t. t₄:
X₀: X₀ {O(n)}
X₁: X₁ {O(n)}
Runtime-bound of t₄: 1 {O(1)}
Results in: 4⋅X₀+4⋅X₁+6 {O(n)}
Overall timebound:6⋅X₀+6⋅X₁+11 {O(n)}
t₄: 1 {O(1)}
t₀: 2⋅X₀+2⋅X₁+4 {O(n)}
t₃: 4⋅X₀+4⋅X₁+6 {O(n)}
Overall costbound: 6⋅X₀+6⋅X₁+11 {O(n)}
t₄: 1 {O(1)}
t₀: 2⋅X₀+2⋅X₁+4 {O(n)}
t₃: 4⋅X₀+4⋅X₁+6 {O(n)}
t₄, X₀: X₀ {O(n)}
t₄, X₁: X₁ {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: 2⋅X₀+3⋅X₁+4 {O(n)}
t₃, X₀: 4⋅X₁+5⋅X₀+6 {O(n)}
t₃, X₁: X₁ {O(n)}