/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, l12, true>
<l1, l2, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
<l1, l3, (1 <= (0 + tmp^0))>
<l1, l3, ((1 + tmp^0) <= 0)>
<l4, l1, (undef23 = undef23), par{ret_foo5^0 -> undef23, tmp^0 -> (0 + undef23), x4^0 -> (0 + il^0)}>
<l5, l6, true>
<l7, l8, true, par{il^0 -> (1 + il^0)}>
<l9, l5, ((0 + tmp___0^0) <= 0) /\ (0 <= (0 + tmp___0^0))>
<l9, l7, (1 <= (0 + tmp___0^0))>
<l9, l7, ((1 + tmp___0^0) <= 0)>
<l8, l10, true>
<l10, l5, (10 <= (0 + il^0))>
<l10, l9, ((1 + il^0) <= 10) /\ (undef80 = undef80), par{ret_foo7^0 -> undef80, tmp___0^0 -> (0 + undef80), x6^0 -> (0 + il^0)}>
<l2, l8, true, par{il^0 -> 0}>
<l3, l2, (10 <= (0 + il^0))>
<l3, l4, ((1 + il^0) <= 10), par{il^0 -> (1 + il^0)}>
<l11, l4, true, par{il^0 -> 0}>
<l12, l11, true>

Fresh variables:
undef23, undef80, 

Undef variables:
undef23, undef80, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (il^0 = 0)>
<l4, l8, (undef23 = undef23) /\ ((0 + (0 + undef23)) <= 0) /\ (0 <= (0 + (0 + undef23))), par{il^0 -> 0}>
<l4, l8, (undef23 = undef23) /\ (1 <= (0 + (0 + undef23))) /\ (10 <= (0 + il^0)), par{il^0 -> 0}>
<l4, l4, (undef23 = undef23) /\ (1 <= (0 + (0 + undef23))) /\ ((1 + il^0) <= 10), par{il^0 -> (1 + il^0)}>
<l4, l8, (undef23 = undef23) /\ ((1 + (0 + undef23)) <= 0) /\ (10 <= (0 + il^0)), par{il^0 -> 0}>
<l4, l4, (undef23 = undef23) /\ ((1 + (0 + undef23)) <= 0) /\ ((1 + il^0) <= 10), par{il^0 -> (1 + il^0)}>
<l8, l6, (10 <= (0 + il^0))>
<l8, l6, ((1 + il^0) <= 10) /\ (undef80 = undef80) /\ ((0 + (0 + undef80)) <= 0) /\ (0 <= (0 + (0 + undef80)))>
<l8, l8, ((1 + il^0) <= 10) /\ (undef80 = undef80) /\ (1 <= (0 + (0 + undef80))), par{il^0 -> (1 + il^0)}>
<l8, l8, ((1 + il^0) <= 10) /\ (undef80 = undef80) /\ ((1 + (0 + undef80)) <= 0), par{il^0 -> (1 + il^0)}>

Fresh variables:
undef23, undef80, 

Undef variables:
undef23, undef80, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= undef23 /\ il^0 <= 9, {il^0 -> 1 + il^0, rest remain the same}>
<l4, l4, 1 + undef23 <= 0 /\ il^0 <= 9, {il^0 -> 1 + il^0, rest remain the same}>
Variables:
il^0

Graph 2:
Transitions:
<l8, l8, 1 <= undef80 /\ il^0 <= 9, {il^0 -> 1 + il^0, rest remain the same}>
<l8, l8, 1 + undef80 <= 0 /\ il^0 <= 9, {il^0 -> 1 + il^0, rest remain the same}>
Variables:
il^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, il^0 = 0, {all remain the same}>

Graph 2
<l4, l8, undef23 = 0, {il^0 -> 0, rest remain the same}>
<l4, l8, 1 <= undef23 /\ 10 <= il^0, {il^0 -> 0, rest remain the same}>
<l4, l8, 1 + undef23 <= 0 /\ 10 <= il^0, {il^0 -> 0, rest remain the same}>

Graph 3
<l8, l6, 10 <= il^0, {all remain the same}>
<l8, l6, il^0 <= 9 /\ undef80 = 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 1 )
( 6 , 3 )
( 8 , 2 )

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001034s
Ranking function: 9 - il^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002617

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001069s
Ranking function: 9 - il^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l6}...
No cycles found.

Program Terminates