Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃, X₄)
t₁: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀, 3⋅X₁-4⋅X₂, 4⋅X₁-3⋅X₂, 5⋅X₃, 5⋅X₄-(X₀)²) :|: 1 < (X₁)² ∧ 0 < X₀*X₂+2⋅X₀

Preprocessing

Eliminate variables {X₃,X₄} that do not contribute to the problem

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(X₀, 3⋅X₁-4⋅X₂, 4⋅X₁-3⋅X₂) :|: 1 < (X₁)² ∧ 0 < X₀*X₂+2⋅X₀

Solv. Size Bound: t₅: l1→l1 for X₁

cycle: [t₅: l1→l1]
loop: (1 < (X₁)² ∧ 0 < X₀*X₂+2⋅X₀,(X₁,X₂) -> (3⋅X₁-4⋅X₂,4⋅X₁-3⋅X₂)
overappr. closed-form: 12⋅7^(n)⋅X₁+12⋅7^(n)⋅X₂ {O(EXP)}
runtime bound: inf {Infinity}

Solv. Size Bound - Lifting for t₅: l1→l1 and X₁: inf {Infinity}

Solv. Size Bound: t₅: l1→l1 for X₂

cycle: [t₅: l1→l1]
loop: (1 < (X₁)² ∧ 0 < X₀*X₂+2⋅X₀,(X₁,X₂) -> (3⋅X₁-4⋅X₂,4⋅X₁-3⋅X₂)
overappr. closed-form: 13⋅7^(n)⋅X₂+6⋅7^(n)⋅X₁ {O(EXP)}
runtime bound: inf {Infinity}

Solv. Size Bound - Lifting for t₅: l1→l1 and X₂: inf {Infinity}

Solv. Size Bound - Lifting for t₅: l1→l1 and X₁: inf {Infinity}

Solv. Size Bound - Lifting for t₅: l1→l1 and X₂: inf {Infinity}

Analysing control-flow refined program

Eliminate variables {X₀,X₁,X₂} that do not contribute to the problem

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

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)}
t₄, X₂: X₂ {O(n)}
t₅, X₀: X₀ {O(n)}