Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(X₀+X₁, X₁, X₂) :|: 0 ≤ X₀+X₁
t₂: l1(X₀, X₁, X₂) → l2(X₀+X₁, X₁, D) :|: 1+X₀+X₁ ≤ 0
Preprocessing
Eliminate variables {D,X₂} that do not contribute to the problem
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₆: l0(X₀, X₁) → l1(X₀, X₁)
t₇: l1(X₀, X₁) → l1(X₀+X₁, X₁) :|: 0 ≤ X₀+X₁
t₈: l1(X₀, X₁) → l2(X₀+X₁, X₁) :|: 1+X₀+X₁ ≤ 0
Solv. Size Bound: t₇: l1→l1 for X₀
cycle: [t₇: l1→l1]
loop: (0 ≤ X₀+X₁,(X₀,X₁) -> (X₀+X₁,X₁)
overappr. closed-form: X₁⋅n+X₀ {O(n^2)}
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}
Analysing control-flow refined program
Solv. Size Bound: t₂₈: n_l1___1→n_l1___1 for X₀
cycle: [t₂₈: n_l1___1→n_l1___1]
loop: (0 ≤ X₀ ∧ 0 ≤ X₀+X₁,(X₀,X₁) -> (X₀+X₁,X₁)
overappr. closed-form: X₁⋅n+X₀ {O(n^2)}
runtime bound: inf {Infinity}
Solv. Size Bound - Lifting for t₂₈: n_l1___1→n_l1___1 and X₀: inf {Infinity}
Solv. Size Bound - Lifting for t₂₈: n_l1___1→n_l1___1 and X₀: inf {Infinity}
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}
t₈: 1 {O(1)}
Costbounds
Overall costbound: inf {Infinity}
t₆: 1 {O(1)}
t₇: inf {Infinity}
t₈: 1 {O(1)}
Sizebounds
t₆, X₀: X₀ {O(n)}
t₆, X₁: X₁ {O(n)}
t₇, X₁: X₁ {O(n)}
t₈, X₁: 2⋅X₁ {O(n)}