/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, l7, 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)}>
<l1, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (~(1) + undef7), x1^0 -> (~(1) + undef8)}>
<l4, l2, (undef13 = (0 + x0^0)) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{oldX0^0 -> undef13, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef15, oldX3^0 -> undef16, x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l4, l2, (undef19 = (0 + x0^0)) /\ (undef21 = undef21) /\ (undef22 = undef22) /\ (1 <= (0 + undef19)), par{oldX0^0 -> undef19, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l4, l2, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{oldX0^0 -> undef25, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef27, oldX3^0 -> undef28, x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l5, l1, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef31)) /\ (1 <= (0 + undef32)), par{oldX0^0 -> undef31, oldX1^0 -> undef32, x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
<l5, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0), par{oldX0^0 -> undef37, oldX1^0 -> undef38, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38)}>
<l5, l4, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0), par{oldX0^0 -> undef43, oldX1^0 -> undef44, x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l3, l5, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)), par{oldX0^0 -> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}>
<l6, l2, true>
<l6, l1, true>
<l6, l4, true>
<l6, l5, true>
<l6, l3, true>
<l7, l6, true>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l0, l1, true>
<l0, l2, (undef13 = (0 + x0^0)) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef21 = undef21) /\ (undef22 = undef22) /\ (1 <= (0 + undef19)), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l2, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l0, l1, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef31)) /\ (1 <= (0 + undef32)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
<l0, l2, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef13 = (0 + (0 + undef37))) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l2, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef19 = (0 + (0 + undef37))) /\ (undef21 = undef21) /\ (undef22 = undef22) /\ (1 <= (0 + undef19)), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l2, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l0, l2, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef13 = (0 + (0 + undef43))) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l2, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l0, l1, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef31)) /\ (1 <= (0 + undef32)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef13 = (0 + (0 + undef37))) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef19 = (0 + (0 + undef37))) /\ (undef21 = undef21) /\ (undef22 = undef22) /\ (1 <= (0 + undef19)), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef49))) /\ (undef44 = (0 + (0 + undef50))) /\ ((0 + undef43) <= 0) /\ (undef13 = (0 + (0 + undef43))) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef49))) /\ (undef44 = (0 + (0 + undef50))) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l1, l1, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef49 = (0 + (~(1) + undef7))) /\ (undef50 = (0 + (~(1) + undef8))) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef31)) /\ (1 <= (0 + undef32)), par{x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef49 = (0 + (~(1) + undef7))) /\ (undef50 = (0 + (~(1) + undef8))) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef13 = (0 + (0 + undef37))) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef49 = (0 + (~(1) + undef7))) /\ (undef50 = (0 + (~(1) + undef8))) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef19 = (0 + (0 + undef37))) /\ (undef21 = undef21) /\ (undef22 = undef22) /\ (1 <= (0 + undef19)), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef49 = (0 + (~(1) + undef7))) /\ (undef50 = (0 + (~(1) + undef8))) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef49 = (0 + (~(1) + undef7))) /\ (undef50 = (0 + (~(1) + undef8))) /\ (undef43 = (0 + (0 + undef49))) /\ (undef44 = (0 + (0 + undef50))) /\ ((0 + undef43) <= 0) /\ (undef13 = (0 + (0 + undef43))) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ ((0 + undef13) <= 0) /\ (0 <= (0 + undef13)), par{x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l1, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef49 = (0 + (~(1) + undef7))) /\ (undef50 = (0 + (~(1) + undef8))) /\ (undef43 = (0 + (0 + undef49))) /\ (undef44 = (0 + (0 + undef50))) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef27 = undef27) /\ (undef28 = undef28) /\ ((1 + undef25) <= 0), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef15, undef16, undef19, undef21, undef22, undef25, undef27, undef28, undef31, undef32, undef37, undef38, undef43, undef44, undef49, undef50, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 <= undef31 /\ 1 <= undef32 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef31 = undef49 /\ undef32 = undef50 /\ undef7 = 1 + undef49 /\ undef8 = 1 + undef50, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>
<l0, l1, 1 <= undef31 /\ 1 <= undef32 /\ x0^0 = undef31 /\ x1^0 = undef32, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>
<l0, l1, 1 <= undef31 /\ 1 <= undef32 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef31 = undef49 /\ undef32 = undef50, {x0^0 -> undef31, x1^0 -> undef32, rest remain the same}>

Graph 2
<l0, l2, true, {all remain the same}>
<l0, l2, x0^0 = undef13 /\ undef13 = 0, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l2, 1 <= undef19 /\ x0^0 = undef19, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l2, 1 + undef25 <= 0 /\ x0^0 = undef25, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l0, l2, undef38 <= 0 /\ x0^0 = undef37 /\ x1^0 = undef38 /\ undef13 = 0 /\ undef13 = undef37, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l2, undef38 <= 0 /\ 1 <= undef19 /\ x0^0 = undef37 /\ x1^0 = undef38 /\ undef19 = undef37, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l2, undef38 <= 0 /\ 1 + undef25 <= 0 /\ x0^0 = undef37 /\ x1^0 = undef38 /\ undef25 = undef37, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l0, l2, undef43 <= 0 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef13 = 0 /\ undef13 = undef43, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l2, undef43 <= 0 /\ 1 + undef25 <= 0 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef25 = undef43, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l0, l2, undef38 <= 0 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef13 = 0 /\ undef13 = undef37 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l2, undef38 <= 0 /\ 1 <= undef19 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef19 = undef37 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l2, undef38 <= 0 /\ 1 + undef25 <= 0 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef25 = undef37 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l0, l2, undef43 <= 0 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef13 = 0 /\ undef13 = undef43 /\ undef43 = undef49 /\ undef44 = undef50, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l0, l2, undef43 <= 0 /\ 1 + undef25 <= 0 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef25 = undef43 /\ undef43 = undef49 /\ undef44 = undef50, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l1, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l1, l2, undef38 <= 0 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef13 = 0 /\ undef13 = undef37 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef7 = 1 + undef49 /\ undef8 = 1 + undef50, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l1, l2, undef38 <= 0 /\ 1 <= undef19 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef19 = undef37 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef7 = 1 + undef49 /\ undef8 = 1 + undef50, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l1, l2, undef38 <= 0 /\ 1 + undef25 <= 0 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef25 = undef37 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef7 = 1 + undef49 /\ undef8 = 1 + undef50, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l1, l2, undef43 <= 0 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef13 = 0 /\ undef13 = undef43 /\ undef43 = undef49 /\ undef44 = undef50 /\ undef7 = 1 + undef49 /\ undef8 = 1 + undef50, {x0^0 -> undef15, x1^0 -> undef16, rest remain the same}>
<l1, l2, undef43 <= 0 /\ 1 + undef25 <= 0 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef25 = undef43 /\ undef43 = undef49 /\ undef44 = undef50 /\ undef7 = 1 + undef49 /\ undef8 = 1 + undef50, {x0^0 -> undef27, x1^0 -> undef28, rest 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.002815

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

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

Program Terminates