Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(2⋅X₀+X₁, X₁+1, X₂) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₂
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(2⋅X₀+X₁, X₁+1, X₂) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₂
new bound:
16⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
MPRF:
l1 [1-X₀-X₁ ; X₂-X₀ ]
Overall timebound:16⋅X₀+8⋅X₁+8⋅X₂+10 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
Overall costbound: 16⋅X₀+8⋅X₁+8⋅X₂+10 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+8⋅X₂+9 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 144⋅2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅X₁⋅X₂+152⋅2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅X₂+172⋅2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅X₁+256⋅2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅X₀⋅X₀+256⋅2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅X₀⋅X₂+288⋅2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅X₀⋅X₁+2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅305⋅X₀+2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅64⋅X₂⋅X₂+2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅80⋅X₁⋅X₁+2^(16⋅X₀+8⋅X₁+8⋅X₂+9)⋅90 {O(EXP)}
t₁, X₁: 16⋅X₀+8⋅X₂+9⋅X₁+9 {O(n)}
t₁, X₂: X₂ {O(n)}