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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l15, true>
<l1, l2, true>
<l3, l4, (50 <= (0 + i^0))>
<l3, l5, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
<l6, l7, true>
<l8, l5, (50 <= (0 + i13^0)), par{i^0 -> 0}>
<l8, l9, ((1 + i13^0) <= 50), par{i13^0 -> (1 + i13^0)}>
<l10, l11, true>
<l12, l9, (50 <= (0 + i11^0)) /\ (undef57 = 0), par{i13^0 -> 0}>
<l12, l13, ((1 + i11^0) <= 50), par{i11^0 -> (1 + i11^0)}>
<l13, l12, true>
<l11, l13, (50 <= (0 + i^0)) /\ (undef79 = 0), par{i11^0 -> 0}>
<l11, l10, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
<l9, l8, true>
<l7, l10, (50 <= (0 + i9^0)), par{i^0 -> 0}>
<l7, l6, ((1 + i9^0) <= 50), par{i9^0 -> (1 + i9^0)}>
<l5, l3, true>
<l2, l6, (50 <= (0 + i7^0)) /\ (undef122 = 0), par{i9^0 -> 0}>
<l2, l1, ((1 + i7^0) <= 50), par{i7^0 -> (1 + i7^0)}>
<l14, l1, (undef135 = undef135) /\ (undef136 = undef136) /\ (undef137 = 0), par{i7^0 -> 0, i^0 -> 0, tmp^0 -> undef135, tmp___0^0 -> undef136}>
<l15, l14, true>

Fresh variables:
undef57, undef79, undef122, undef135, undef136, undef137, 

Undef variables:
undef57, undef79, undef122, undef135, undef136, undef137, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (i7^0 = 0) /\ (i^0 = 0) /\ (undef135 = undef135) /\ (undef136 = undef136) /\ (undef137 = 0)>
<l1, l6, (50 <= (0 + i7^0)) /\ (undef122 = 0), par{i9^0 -> 0}>
<l1, l1, ((1 + i7^0) <= 50), par{i7^0 -> (1 + i7^0)}>
<l5, l4, (50 <= (0 + i^0))>
<l5, l5, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
<l6, l10, (50 <= (0 + i9^0)), par{i^0 -> 0}>
<l6, l6, ((1 + i9^0) <= 50), par{i9^0 -> (1 + i9^0)}>
<l9, l5, (50 <= (0 + i13^0)), par{i^0 -> 0}>
<l9, l9, ((1 + i13^0) <= 50), par{i13^0 -> (1 + i13^0)}>
<l10, l13, (50 <= (0 + i^0)) /\ (undef79 = 0), par{i11^0 -> 0}>
<l10, l10, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
<l13, l9, (50 <= (0 + i11^0)) /\ (undef57 = 0), par{i13^0 -> 0}>
<l13, l13, ((1 + i11^0) <= 50), par{i11^0 -> (1 + i11^0)}>

Fresh variables:
undef57, undef79, undef122, undef135, undef136, undef137, 

Undef variables:
undef57, undef79, undef122, undef135, undef136, undef137, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, i7^0 <= 49, {i7^0 -> 1 + i7^0, rest remain the same}>
Variables:
i7^0

Graph 2:
Transitions:
<l6, l6, i9^0 <= 49, {i9^0 -> 1 + i9^0, rest remain the same}>
Variables:
i9^0

Graph 3:
Transitions:
<l10, l10, i^0 <= 49, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 4:
Transitions:
<l13, l13, i11^0 <= 49, {i11^0 -> 1 + i11^0, rest remain the same}>
Variables:
i11^0

Graph 5:
Transitions:
<l9, l9, i13^0 <= 49, {i13^0 -> 1 + i13^0, rest remain the same}>
Variables:
i13^0

Graph 6:
Transitions:
<l5, l5, i^0 <= 49, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 7:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, i7^0 = 0 /\ i^0 = 0 /\ undef137 = 0, {all remain the same}>

Graph 2
<l1, l6, 50 <= i7^0 /\ undef122 = 0, {i9^0 -> 0, rest remain the same}>

Graph 3
<l6, l10, 50 <= i9^0, {i^0 -> 0, rest remain the same}>

Graph 4
<l10, l13, 50 <= i^0 /\ undef79 = 0, {i11^0 -> 0, rest remain the same}>

Graph 5
<l13, l9, 50 <= i11^0 /\ undef57 = 0, {i13^0 -> 0, rest remain the same}>

Graph 6
<l9, l5, 50 <= i13^0, {i^0 -> 0, rest remain the same}>

Graph 7
<l5, l4, 50 <= i^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 1 , 1 )
( 4 , 7 )
( 5 , 6 )
( 6 , 2 )
( 9 , 5 )
( 10 , 3 )
( 13 , 4 )

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000581s
Ranking function: 49 - i7^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001203

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000580s
Ranking function: 49 - i9^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.001194

Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000624s
Ranking function: 49 - i^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.001174

Checking conditional termination of SCC {l13}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000646s
Ranking function: 49 - i11^0
New Graphs: 
Proving termination of subgraph 5
Checking unfeasibility...
Time used: 0.001172

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000658s
Ranking function: 49 - i13^0
New Graphs: 
Proving termination of subgraph 6
Checking unfeasibility...
Time used: 0.001172

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000676s
Ranking function: 49 - i^0
New Graphs: 
Proving termination of subgraph 7
Analyzing SCC {l4}...
No cycles found.

Program Terminates