Initial Problem

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(1+X₀, X₂, X₂) :|: 1+X₀ ≤ X₁

Preprocessing

Problem after Preprocessing

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(1+X₀, X₂, X₂) :|: 1+X₀ ≤ X₁

MPRF for transition t₁: l1(X₀, X₁, X₂) → l1(1+X₀, X₂, X₂) :|: 1+X₀ ≤ X₁ of depth 2:

new bound:

16⋅X₀+8⋅X₁+8⋅X₂+7 {O(n)}

• l1: [X₂-1-X₀; X₁-X₀]

All Bounds

Timebounds

Overall timebound:16⋅X₀+8⋅X₁+8⋅X₂+8 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+8⋅X₂+7 {O(n)}

Costbounds

Overall costbound: 16⋅X₀+8⋅X₁+8⋅X₂+8 {O(n)}
t₀: 1 {O(1)}
t₁: 16⋅X₀+8⋅X₁+8⋅X₂+7 {O(n)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 17⋅X₀+8⋅X₁+8⋅X₂+7 {O(n)}
t₁, X₁: 2⋅X₂ {O(n)}
t₁, X₂: X₂ {O(n)}