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₂) :|: 1 ≤ 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₂) :|: 1 ≤ X₀ ∧ X₀ ≤ X₂
new bound:
8⋅X₀+8⋅X₁+8⋅X₂+1 {O(n)}
MPRF:
l1 [-X₁ ; X₂-X₀ ]
Overall timebound:8⋅X₀+8⋅X₁+8⋅X₂+2 {O(n)}
t₀: 1 {O(1)}
t₁: 8⋅X₀+8⋅X₁+8⋅X₂+1 {O(n)}
Overall costbound: 8⋅X₀+8⋅X₁+8⋅X₂+2 {O(n)}
t₀: 1 {O(1)}
t₁: 8⋅X₀+8⋅X₁+8⋅X₂+1 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 128⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅X₀⋅X₂+144⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅X₀⋅X₁+144⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅X₁⋅X₂+2⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)+24⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅X₂+25⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅X₀+28⋅2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅X₁+2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅64⋅X₀⋅X₀+2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅64⋅X₂⋅X₂+2^(8⋅X₀+8⋅X₁+8⋅X₂+1)⋅80⋅X₁⋅X₁ {O(EXP)}
t₁, X₁: 8⋅X₀+8⋅X₂+9⋅X₁+1 {O(n)}
t₁, X₂: X₂ {O(n)}