Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(2⋅X₀+X₁, X₂, 1+X₂, X₃) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(2⋅X₀+X₁, X₂, 1+X₂, X₃) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃

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

new bound:

54⋅X₀+54⋅X₃+82 {O(n)}

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

All Bounds

Timebounds

Overall timebound:54⋅X₀+54⋅X₃+83 {O(n)}
t₀: 1 {O(1)}
t₁: 54⋅X₀+54⋅X₃+82 {O(n)}

Costbounds

Overall costbound: 54⋅X₀+54⋅X₃+83 {O(n)}
t₀: 1 {O(1)}
t₁: 54⋅X₀+54⋅X₃+82 {O(n)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₀, X₃: X₃ {O(n)}
t₁, X₀: 14100910759985034693772836864⋅2^(54⋅X₀)⋅2^(54⋅X₃)⋅X₀⋅X₀+14100910759985034693772836864⋅2^(54⋅X₀)⋅2^(54⋅X₃)⋅X₃⋅X₃+261127977036759901736534016⋅2^(54⋅X₀)⋅2^(54⋅X₃)⋅X₀⋅X₁+261127977036759901736534016⋅2^(54⋅X₀)⋅2^(54⋅X₃)⋅X₁⋅X₃+28201821519970069387545673728⋅2^(54⋅X₀)⋅2^(54⋅X₃)⋅X₀⋅X₃+2^(54⋅X₀)⋅2^(54⋅X₃)⋅32911796513188664652200935424+2^(54⋅X₀)⋅2^(54⋅X₃)⋅401363372112056886002450432⋅X₁+2^(54⋅X₀)⋅2^(54⋅X₃)⋅43086116211065383786528112640⋅X₃+2^(54⋅X₀)⋅2^(54⋅X₃)⋅43090951914343842303226937344⋅X₀+2^(54⋅X₀)⋅2^(54⋅X₃)⋅522255954073519803473068032⋅X₀⋅X₂+2^(54⋅X₀)⋅2^(54⋅X₃)⋅522255954073519803473068032⋅X₂⋅X₃+2^(54⋅X₀)⋅2^(54⋅X₃)⋅802726744224113772004900864⋅X₂ {O(EXP)}
t₁, X₁: 2⋅X₂+54⋅X₀+54⋅X₃+82 {O(n)}
t₁, X₂: 54⋅X₀+54⋅X₃+X₂+82 {O(n)}
t₁, X₃: X₃ {O(n)}