/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, (undef1 = (0 + x0^0)) /\ (undef3 = undef3), par{oldX0^0 -> undef1, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, x0^0 -> (1 + undef1), x1^0 -> (0 + undef3)}>
<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)}>
<l5, l6, (undef15 = undef15) /\ (undef16 = undef16), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef15, oldX3^0 -> undef16, x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (12 <= (0 + undef20)), 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 + undef26) <= 11), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l2, l5, (undef31 = (0 + x0^0)) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, x0^0 -> (0 + undef31), x1^0 -> (0 + undef33)}>
<l2, l4, (undef37 = (0 + x0^0)) /\ ((0 + undef37) <= 9), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef37), x1^0 -> 3}>
<l7, l2, (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, l6, true>
<l8, l1, true>
<l8, l3, true>
<l8, l5, true>
<l8, l4, true>
<l8, l2, true>
<l8, l7, true>
<l9, l8, true>

Fresh variables:
undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 

Undef variables:
undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef51 = undef51) /\ (undef52 = undef52) /\ (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
<l0, l6, true>
<l0, l6, (undef1 = (0 + x0^0)) /\ (undef3 = undef3) /\ (undef31 = (0 + (1 + undef1))) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)) /\ (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l4, (undef1 = (0 + x0^0)) /\ (undef3 = undef3) /\ (undef37 = (0 + (1 + undef1))) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
<l0, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{x0^0 -> (0 + undef7), x1^0 -> (1 + undef8)}>
<l0, l6, (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l4, true>
<l0, l6, (undef31 = (0 + x0^0)) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)) /\ (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l4, (undef37 = (0 + x0^0)) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
<l0, l4, (undef45 = undef45) /\ (undef37 = (0 + 0)) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
<l4, l6, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (12 <= (0 + undef20)) /\ (undef1 = (0 + (0 + undef19))) /\ (undef3 = undef3) /\ (undef31 = (0 + (1 + undef1))) /\ (undef33 = undef33) /\ (10 <= (0 + undef31)) /\ (undef15 = undef15) /\ (undef16 = undef16), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l4, l4, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (12 <= (0 + undef20)) /\ (undef1 = (0 + (0 + undef19))) /\ (undef3 = undef3) /\ (undef37 = (0 + (1 + undef1))) /\ ((0 + undef37) <= 9), par{x0^0 -> (0 + undef37), x1^0 -> 3}>
<l4, l4, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((0 + undef26) <= 11) /\ (undef7 = (0 + (0 + undef25))) /\ (undef8 = (0 + (0 + undef26))), par{x0^0 -> (0 + undef7), x1^0 -> (1 + undef8)}>

Fresh variables:
undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 

Undef variables:
undef1, undef3, undef7, undef8, undef15, undef16, undef19, undef20, undef25, undef26, undef31, undef33, undef37, undef45, undef51, undef52, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 12 <= undef20 /\ undef37 <= 9 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ undef1 = undef19 /\ 1 + undef1 = undef37, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
<l4, l4, undef26 <= 11 /\ x0^0 = undef25 /\ x1^0 = undef26 /\ undef7 = undef25 /\ undef8 = undef26, {x0^0 -> undef7, x1^0 -> 1 + undef8, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, undef37 = 0, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
<l0, l4, undef37 <= 9 /\ x0^0 = undef1 /\ 1 + undef1 = undef37, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
<l0, l4, x0^0 = undef7 /\ x1^0 = undef8, {x0^0 -> undef7, x1^0 -> 1 + undef8, rest remain the same}>
<l0, l4, true, {all remain the same}>
<l0, l4, undef37 <= 9 /\ x0^0 = undef37, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>
<l0, l4, undef37 = 0, {x0^0 -> undef37, x1^0 -> 3, rest remain the same}>

Graph 2
<l0, l6, true, {all remain the same}>
<l0, l6, 10 <= undef31 /\ x0^0 = undef1 /\ 1 + undef1 = undef31, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l6, true, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l6, 10 <= undef31 /\ x0^0 = undef31, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l4, l6, 12 <= undef20 /\ 10 <= undef31 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ undef1 = undef19 /\ 1 + undef1 = undef31, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002004s
Ranking function: 8 - x0^0
New Graphs: 
Transitions:
<l4, l4, undef26 <= 11 /\ x0^0 = undef25 /\ x1^0 = undef26 /\ undef7 = undef25 /\ undef8 = undef26, {x0^0 -> undef7, x1^0 -> 1 + undef8, rest remain the same}>
Variables:
x0^0, x1^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

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

Program Terminates