Initial Problem

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(4⋅X₀-X₁, 2⋅X₀+X₁) :|: 1+X₁ ≤ 2⋅X₀ ∧ 1+3⋅X₀ ≤ 2⋅X₁

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(4⋅X₀-X₁, 2⋅X₀+X₁) :|: 1+X₁ ≤ 2⋅X₀ ∧ 1+3⋅X₀ ≤ 2⋅X₁

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}