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₀+X₁, X₁-X₂, X₂+1) :|: 1 ≤ X₀
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₀+X₁, X₁-X₂, X₂+1) :|: 1 ≤ X₀
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₀: X₀ {O(n)}
X₁: X₁ {O(n)}
X₂: X₂ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 12⋅X₀+12⋅X₁+6⋅X₂+12 {O(n)}
Overall timebound:12⋅X₀+12⋅X₁+6⋅X₂+13 {O(n)}
t₀: 1 {O(1)}
t₁: 12⋅X₀+12⋅X₁+6⋅X₂+12 {O(n)}
Overall costbound: 12⋅X₀+12⋅X₁+6⋅X₂+13 {O(n)}
t₀: 1 {O(1)}
t₁: 12⋅X₀+12⋅X₁+6⋅X₂+12 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 1584⋅X₀⋅X₂⋅X₂+1584⋅X₁⋅X₂⋅X₂+1728⋅X₀⋅X₀⋅X₀+1728⋅X₁⋅X₁⋅X₁+288⋅X₂⋅X₂⋅X₂+2880⋅X₀⋅X₀⋅X₂+2880⋅X₁⋅X₁⋅X₂+5184⋅X₀⋅X₀⋅X₁+5184⋅X₀⋅X₁⋅X₁+5760⋅X₀⋅X₁⋅X₂+10968⋅X₀⋅X₁+1680⋅X₂⋅X₂+5472⋅X₀⋅X₀+5496⋅X₁⋅X₁+6096⋅X₀⋅X₂+6108⋅X₁⋅X₂+3224⋅X₂+5773⋅X₀+5798⋅X₁+2028 {O(n^3)}
t₁, X₁: 144⋅X₀⋅X₀+144⋅X₁⋅X₁+168⋅X₀⋅X₂+168⋅X₁⋅X₂+288⋅X₀⋅X₁+48⋅X₂⋅X₂+176⋅X₂+300⋅X₀+301⋅X₁+156 {O(n^2)}
t₁, X₂: 12⋅X₀+12⋅X₁+7⋅X₂+12 {O(n)}