/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 -> (~(1) + undef8)}>
<l3, l5, (undef14 = (0 + x1^0)) /\ (undef15 = undef15), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef14, oldX2^0 -> undef15, x0^0 -> (0 + undef14), x1^0 -> (0 + undef15)}>
<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((1 + undef20) <= 0), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l4, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (0 <= (0 + undef26)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l6, l4, (undef31 = (0 + x0^0)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef31), x1^0 -> (~(1) + undef31)}>
<l5, l6, (undef37 = (0 + x0^0)) /\ (undef39 = undef39), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l7, l8, (undef45 = undef45) /\ (undef46 = undef46), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, oldX3^0 -> undef46, x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
<l7, l8, true>
<l7, l2, true>
<l7, l1, true>
<l7, l3, true>
<l7, l4, true>
<l7, l6, true>
<l7, l5, true>
<l9, l7, true>

Fresh variables:
undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 

Undef variables:
undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l8, (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
<l0, l8, true>
<l0, l2, true>
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, true>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l0, l2, (undef31 = (0 + x0^0)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + (~(1) + undef31))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef31 = (0 + x0^0)) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + (~(1) + undef31))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l0, l2, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + (~(1) + undef31))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + (~(1) + undef31))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef7))) /\ (undef20 = (0 + (~(1) + undef8))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef25 = (0 + (0 + undef7))) /\ (undef26 = (0 + (~(1) + undef8))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l3, l2, (undef14 = (0 + x1^0)) /\ (undef15 = undef15) /\ (undef37 = (0 + (0 + undef14))) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + (~(1) + undef31))) /\ ((1 + undef20) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l3, (undef14 = (0 + x1^0)) /\ (undef15 = undef15) /\ (undef37 = (0 + (0 + undef14))) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + (~(1) + undef31))) /\ (0 <= (0 + undef26)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>

Fresh variables:
undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 

Undef variables:
undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 0 <= undef26 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ undef8 = 1 + undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
<l3, l3, 0 <= undef26 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef31 = undef37 /\ 1 + undef26 = undef31, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, true, {all remain the same}>
<l0, l3, 0 <= undef26 /\ x0^0 = undef25 /\ x1^0 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
<l0, l3, 0 <= undef26 /\ x0^0 = undef31 /\ undef25 = undef31 /\ 1 + undef26 = undef31, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
<l0, l3, 0 <= undef26 /\ x0^0 = undef37 /\ undef25 = undef31 /\ undef31 = undef37 /\ 1 + undef26 = undef31, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>

Graph 2
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 1 + undef20 <= 0 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 1 + undef20 <= 0 /\ x0^0 = undef31 /\ undef19 = undef31 /\ 1 + undef20 = undef31, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 1 + undef20 <= 0 /\ x0^0 = undef37 /\ undef19 = undef31 /\ undef31 = undef37 /\ 1 + undef20 = undef31, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l3, l2, 1 + undef20 <= 0 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef19 /\ undef8 = 1 + undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l3, l2, 1 + undef20 <= 0 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef19 = undef31 /\ undef31 = undef37 /\ 1 + undef20 = undef31, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>

Graph 3
<l0, l8, true, {x0^0 -> undef45, x1^0 -> undef46, rest remain the same}>
<l0, l8, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Proving termination of subgraph 3
Analyzing SCC {l8}...
No cycles found.

Program Terminates