Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(2⋅X₀, X₁+1) :|: 1 ≤ X₀ ∧ X₀ ≤ X₁+1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(2⋅X₀, X₁+1) :|: 1 ≤ X₀ ∧ X₀ ≤ X₁+1
new bound:
16⋅X₀+8⋅X₁+25 {O(n)}
Overall timebound:16⋅X₀+8⋅X₁+26 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+25 {O(n)}
Overall costbound: 16⋅X₀+8⋅X₁+26 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+25 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 2^(16⋅X₀+8⋅X₁+25)⋅X₀ {O(EXP)}
t₁, X₁: 16⋅X₀+9⋅X₁+25 {O(n)}