/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, l5, true>
<l1, l2, ((10 + (~(1) * x_6^0)) <= 0) /\ (undef3 = 0) /\ (undef2 = (0 + undef3)), par{Result_4^0 -> (0 + undef2), ___cil_tmp4_8^0 -> undef2, ___retres3_7^0 -> undef3}>
<l1, l2, (0 <= (9 + (~(1) * x_6^0))) /\ ((~(100) + i_5^0) <= 0) /\ (undef8 = 0) /\ (undef7 = (0 + undef8)), par{Result_4^0 -> (0 + undef7), ___cil_tmp4_8^0 -> undef7, ___retres3_7^0 -> undef8}>
<l1, l3, (0 <= (9 + (~(1) * x_6^0))) /\ (0 <= (~(101) + i_5^0)), par{i_5^0 -> (~(1) + i_5^0)}>
<l3, l1, true>
<l4, l1, true, par{i_5^0 -> 1000}>
<l5, l4, true>

Fresh variables:
undef2, undef3, undef7, undef8, 

Undef variables:
undef2, undef3, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (i_5^0 = 1000)>
<l1, l2, ((10 + (~(1) * x_6^0)) <= 0) /\ (undef3 = 0) /\ (undef2 = (0 + undef3))>
<l1, l2, (0 <= (9 + (~(1) * x_6^0))) /\ ((~(100) + i_5^0) <= 0) /\ (undef8 = 0) /\ (undef7 = (0 + undef8))>
<l1, l1, (0 <= (9 + (~(1) * x_6^0))) /\ (0 <= (~(101) + i_5^0)), par{i_5^0 -> (~(1) + i_5^0)}>

Fresh variables:
undef2, undef3, undef7, undef8, 

Undef variables:
undef2, undef3, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 101 <= i_5^0 /\ x_6^0 <= 9, {i_5^0 -> -1 + i_5^0, rest remain the same}>
Variables:
i_5^0, x_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, i_5^0 = 1000, {all remain the same}>

Graph 2
<l1, l2, 10 <= x_6^0 /\ undef2 = undef3 /\ undef3 = 0, {all remain the same}>
<l1, l2, i_5^0 <= 100 /\ x_6^0 <= 9 /\ undef7 = undef8 /\ undef8 = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001559s
Ranking function: -101 + i_5^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates