/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, true>
<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + undef7), x1^0 -> (3 + undef8)}>
<l4, l1, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ (21 <= (0 + undef14)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (0 + undef14)}>
<l4, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 20), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l6, (undef25 = (0 + x0^0)) /\ (undef27 = undef27), par{oldX0^0 -> undef25, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef27, x0^0 -> (1 + undef25), x1^0 -> (0 + undef27)}>
<l6, l4, (undef31 = (0 + x0^0)) /\ (100 <= (0 + undef31)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef31), x1^0 -> 5}>
<l6, l5, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l7, l6, (undef45 = undef45), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, x0^0 -> 0, x1^0 -> (0 + undef45)}>
<l8, l7, (undef51 = undef51) /\ (undef52 = undef52), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef51, oldX3^0 -> undef52, x0^0 -> (0 + undef51), x1^0 -> (0 + undef52)}>
<l8, l2, true>
<l8, l1, true>
<l8, l3, true>
<l8, l4, true>
<l8, l5, true>
<l8, l6, true>
<l8, l7, true>
<l9, l8, true>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (undef51 = undef51) /\ (undef52 = undef52) /\ (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l0, l2, true>
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, true>
<l0, l2, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ (21 <= (0 + undef14)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l0, l5, true>
<l0, l3, (undef31 = (0 + x0^0)) /\ (100 <= (0 + undef31)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 5)) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l0, l5, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l0, l5, (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef13 = (0 + (0 + undef7))) /\ (undef14 = (0 + (3 + undef8))) /\ (21 <= (0 + undef14)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef7))) /\ (undef20 = (0 + (3 + undef8))) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l3, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef31 = (0 + (1 + undef25))) /\ (100 <= (0 + undef31)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 5)) /\ ((0 + undef20) <= 20), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l5, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef37 = (0 + (1 + undef25))) /\ (undef39 = undef39) /\ ((0 + undef37) <= 99), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, undef37 <= 99 /\ x0^0 = undef25 /\ 1 + undef25 = undef37, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
<l3, l3, undef20 <= 20 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef19 /\ 3 + undef8 = undef20, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
Variables:
x0^0, x1^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, undef37 = 0, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
<l0, l5, true, {all remain the same}>
<l0, l5, undef37 <= 99 /\ x0^0 = undef37, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
<l0, l5, undef37 = 0, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>

Graph 2
<l0, l3, true, {all remain the same}>
<l0, l3, undef20 <= 20 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
<l0, l3, 100 <= undef31 /\ x0^0 = undef31 /\ undef19 = undef31 /\ undef20 = 5, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
<l5, l3, 100 <= undef31 /\ x0^0 = undef25 /\ undef19 = undef31 /\ 1 + undef25 = undef31 /\ undef20 = 5, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>

Graph 3
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 21 <= undef14 /\ x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l3, l2, 21 <= undef14 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef13 /\ 3 + undef8 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 3 )
( 3 , 2 )
( 5 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.002371

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000853s
Ranking function: 98 - x0^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002653

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001122s
Ranking function: (17 / 3) + (~(1) / 3)*x1^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l2}...
No cycles found.

Program Terminates