/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, l9, true>
<l1, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef4, oldX4^0 -> undef5, oldX5^0 -> undef6, x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l4, (undef10 = (0 + x0^0)) /\ (undef12 = (0 + x2^0)) /\ (undef13 = undef13), par{oldX0^0 -> undef10, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef12, oldX3^0 -> undef13, x0^0 -> (0 + undef10), x1^0 -> (0 + undef12), x2^0 -> (0 + undef13)}>
<l3, l5, (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ (undef23 = undef23), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef21, oldX3^0 -> undef22, oldX4^0 -> undef23, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22), x2^0 -> (0 + undef23)}>
<l4, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ ((~(1) + undef29) <= 0), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (~(1) + undef29)}>
<l4, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ (1 <= (~(1) + undef38)), par{oldX0^0 -> undef37, oldX1^0 -> undef38, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (~(1) + undef38)}>
<l6, l4, (undef46 = (0 + x0^0)) /\ (undef49 = undef49), par{oldX0^0 -> undef46, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef49, x0^0 -> (0 + undef46), x1^0 -> (0 + undef46), x2^0 -> (0 + undef49)}>
<l5, l6, (undef55 = (0 + x0^0)) /\ (undef58 = undef58) /\ (undef59 = undef59), par{oldX0^0 -> undef55, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef58, oldX4^0 -> undef59, x0^0 -> (0 + undef55), x1^0 -> (0 + undef58), x2^0 -> (0 + undef59)}>
<l7, l8, (undef67 = undef67) /\ (undef68 = undef68) /\ (undef69 = undef69), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef67, oldX4^0 -> undef68, oldX5^0 -> undef69, x0^0 -> (0 + undef67), x1^0 -> (0 + undef68), x2^0 -> (0 + undef69)}>
<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:
undef4, undef5, undef6, undef10, undef12, undef13, undef21, undef22, undef23, undef28, undef29, undef37, undef38, undef46, undef49, undef55, undef58, undef59, undef67, undef68, undef69, 

Undef variables:
undef4, undef5, undef6, undef10, undef12, undef13, undef21, undef22, undef23, undef28, undef29, undef37, undef38, undef46, undef49, undef55, undef58, undef59, undef67, undef68, undef69, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l8, (undef67 = undef67) /\ (undef68 = undef68) /\ (undef69 = undef69), par{x0^0 -> (0 + undef67), x1^0 -> (0 + undef68), x2^0 -> (0 + undef69)}>
<l0, l8, true>
<l0, l2, true>
<l0, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, true>
<l0, l2, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ ((~(1) + undef29) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ (1 <= (~(1) + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (~(1) + undef38)}>
<l0, l2, (undef46 = (0 + x0^0)) /\ (undef49 = undef49) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef46))) /\ ((~(1) + undef29) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef46 = (0 + x0^0)) /\ (undef49 = undef49) /\ (undef37 = (0 + (0 + undef46))) /\ (undef38 = (0 + (0 + undef46))) /\ (1 <= (~(1) + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (~(1) + undef38)}>
<l0, l2, (undef55 = (0 + x0^0)) /\ (undef58 = undef58) /\ (undef59 = undef59) /\ (undef46 = (0 + (0 + undef55))) /\ (undef49 = undef49) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef46))) /\ ((~(1) + undef29) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef55 = (0 + x0^0)) /\ (undef58 = undef58) /\ (undef59 = undef59) /\ (undef46 = (0 + (0 + undef55))) /\ (undef49 = undef49) /\ (undef37 = (0 + (0 + undef46))) /\ (undef38 = (0 + (0 + undef46))) /\ (1 <= (~(1) + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (~(1) + undef38)}>
<l3, l2, (undef10 = (0 + x0^0)) /\ (undef12 = (0 + x2^0)) /\ (undef13 = undef13) /\ (undef28 = (0 + (0 + undef10))) /\ (undef29 = (0 + (0 + undef12))) /\ ((~(1) + undef29) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l3, (undef10 = (0 + x0^0)) /\ (undef12 = (0 + x2^0)) /\ (undef13 = undef13) /\ (undef37 = (0 + (0 + undef10))) /\ (undef38 = (0 + (0 + undef12))) /\ (1 <= (~(1) + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (~(1) + undef38)}>
<l3, l2, (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ (undef23 = undef23) /\ (undef55 = (0 + (0 + undef21))) /\ (undef58 = undef58) /\ (undef59 = undef59) /\ (undef46 = (0 + (0 + undef55))) /\ (undef49 = undef49) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef46))) /\ ((~(1) + undef29) <= 0) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l3, (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ (undef23 = undef23) /\ (undef55 = (0 + (0 + undef21))) /\ (undef58 = undef58) /\ (undef59 = undef59) /\ (undef46 = (0 + (0 + undef55))) /\ (undef49 = undef49) /\ (undef37 = (0 + (0 + undef46))) /\ (undef38 = (0 + (0 + undef46))) /\ (1 <= (~(1) + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (~(1) + undef38)}>

Fresh variables:
undef4, undef5, undef6, undef10, undef12, undef13, undef21, undef22, undef23, undef28, undef29, undef37, undef38, undef46, undef49, undef55, undef58, undef59, undef67, undef68, undef69, 

Undef variables:
undef4, undef5, undef6, undef10, undef12, undef13, undef21, undef22, undef23, undef28, undef29, undef37, undef38, undef46, undef49, undef55, undef58, undef59, undef67, undef68, undef69, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 2 <= undef38 /\ x0^0 = undef10 /\ x2^0 = undef12 /\ undef10 = undef37 /\ undef12 = undef38, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> -1 + undef38, rest remain the same}>
<l3, l3, 2 <= undef38 /\ x2^0 = undef21 /\ undef21 = undef55 /\ undef37 = undef46 /\ undef38 = undef46 /\ undef46 = undef55, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> -1 + undef38, rest remain the same}>
Variables:
x0^0, x1^0, x2^0

Graph 2:
Transitions:
Variables:

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, true, {all remain the same}>
<l0, l3, 2 <= undef38 /\ x0^0 = undef37 /\ x1^0 = undef38, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> -1 + undef38, rest remain the same}>
<l0, l3, 2 <= undef38 /\ x0^0 = undef46 /\ undef37 = undef46 /\ undef38 = undef46, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> -1 + undef38, rest remain the same}>
<l0, l3, 2 <= undef38 /\ x0^0 = undef55 /\ undef37 = undef46 /\ undef38 = undef46 /\ undef46 = undef55, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> -1 + undef38, rest remain the same}>

Graph 2
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef29 <= 1 /\ x0^0 = undef28 /\ x1^0 = undef29, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef29 <= 1 /\ x0^0 = undef46 /\ undef28 = undef46 /\ undef29 = undef46, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef29 <= 1 /\ x0^0 = undef55 /\ undef28 = undef46 /\ undef29 = undef46 /\ undef46 = undef55, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l3, l2, undef29 <= 1 /\ x0^0 = undef10 /\ x2^0 = undef12 /\ undef10 = undef28 /\ undef12 = undef29, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l3, l2, undef29 <= 1 /\ x2^0 = undef21 /\ undef21 = undef55 /\ undef28 = undef46 /\ undef29 = undef46 /\ undef46 = undef55, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>

Graph 3
<l0, l8, true, {x0^0 -> undef67, x1^0 -> undef68, x2^0 -> undef69, 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.006258

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002101s
Ranking function: -2 + x2^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