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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, true, par{p_14^0 -> (0 + x_13^0)}>
<l2, l3, ((0 + y_16^0) <= (0 + lt_15^0)) /\ (undef12 = undef12), par{lt_15^0 -> undef12, rt_11^0 -> (0 + st_17^0)}>
<l2, l4, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef22 = undef22) /\ (undef31 = undef31) /\ (undef27 = (0 + undef31)) /\ (undef24 = undef24) /\ (0 <= (0 + undef27)) /\ ((0 + undef27) <= 0), par{lt_15^0 -> undef22, nd_12^0 -> undef24, rv_18^0 -> undef27}>
<l4, l2, true>
<l2, l5, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef43 = undef43) /\ (undef52 = undef52) /\ (undef45 = undef45), par{lt_15^0 -> undef43, nd_12^0 -> undef45, rv_18^0 -> (0 + undef52)}>
<l5, l6, (undef53 = __disjvr_0^0) /\ (__disjvr_0^0 = undef53), par{__disjvr_0^0 -> undef53}>
<l6, l7, (undef65 = undef65), par{lt_19^0 -> undef65}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 

Undef variables:
undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((0 + y_16^0) <= (0 + lt_15^0)) /\ (undef12 = undef12), par{lt_15^0 -> undef12}>
<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef22 = undef22) /\ (undef31 = undef31) /\ (undef27 = (0 + undef31)) /\ (undef24 = undef24) /\ (0 <= (0 + undef27)) /\ ((0 + undef27) <= 0), par{lt_15^0 -> undef22}>
<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef43 = undef43) /\ (undef52 = undef52) /\ (undef45 = undef45) /\ (undef53 = __disjvr_0^0) /\ (__disjvr_0^0 = undef53) /\ (undef65 = undef65), par{__disjvr_0^0 -> undef53, lt_15^0 -> undef43}>

Fresh variables:
undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 

Undef variables:
undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
Variables:
lt_15^0, y_16^0, __disjvr_0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, y_16^0 <= lt_15^0, {lt_15^0 -> undef12, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001184s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004498s
[1682 : 1683]
[1682 : 1684]
Successful child: 1683
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + y_16^0 <= lt_15^0 - Process 1
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : 1 + y_16^0 <= lt_15^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000414s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000484s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_16^0 <= lt_15^0 , 
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
Variables:
lt_15^0, y_16^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001141s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004525s
[1682 : 1688]
[1682 : 1689]
Successful child: 1688
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:y_16^0 <= lt_15^0 - Process 2
* Exit transition: <l0, l2, lt_15^0 <= y_16^0, {all remain the same}>
* Postcondition  : y_16^0 <= lt_15^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000490s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000567s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: y_16^0 <= lt_15^0 , 
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
Variables:
lt_15^0, y_16^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001129s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004521s
[1682 : 1733]
[1682 : 1734]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016934s
Time used: 0.016199

[1682 : 1909]
[1682 : 1911]
Successful child: 1911

Program does NOT terminate