/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/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, (undef8 = undef8), par{p_7^0 -> (0 + undef8), x_5^0 -> undef8}>
<l2, l3, (undef19 = (0 + cnt_16^0)) /\ (((0 + (~(1) * undef19)) + y_6^0) <= 0) /\ (undef13 = undef13) /\ (undef10 = undef10), par{Result_4^0 -> undef10, lt_10^0 -> undef13}>
<l2, l4, (undef29 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef29)) + y_6^0)) /\ (undef23 = undef23) /\ (undef26 = undef26) /\ ((0 + undef26) <= 0) /\ (0 <= (0 + undef26)), par{lt_10^0 -> undef23, tmp_8^0 -> undef26}>
<l4, l2, true>
<l2, l5, (undef48 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef48)) + y_6^0)) /\ (undef42 = undef42) /\ (undef45 = undef45), par{lt_10^0 -> undef42, tmp_8^0 -> undef45}>
<l5, l6, (undef50 = __disjvr_0^0) /\ (__disjvr_0^0 = undef50), par{__disjvr_0^0 -> undef50}>
<l6, l7, (undef67 = (0 + cnt_16^0)) /\ (undef62 = undef62), par{lt_9^0 -> undef62}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Undef variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef8 = undef8)>
<l2, l3, (undef19 = (0 + cnt_16^0)) /\ (((0 + (~(1) * undef19)) + y_6^0) <= 0) /\ (undef13 = undef13) /\ (undef10 = undef10)>
<l2, l2, (undef29 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef29)) + y_6^0)) /\ (undef23 = undef23) /\ (undef26 = undef26) /\ ((0 + undef26) <= 0) /\ (0 <= (0 + undef26))>
<l2, l2, (undef48 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef48)) + y_6^0)) /\ (undef42 = undef42) /\ (undef45 = undef45) /\ (undef50 = __disjvr_0^0) /\ (__disjvr_0^0 = undef50) /\ (undef67 = (0 + cnt_16^0)) /\ (undef62 = undef62), par{__disjvr_0^0 -> undef50}>

Fresh variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Undef variables:
undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^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_6^0 <= undef19 /\ cnt_16^0 = undef19, {all 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.004245

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000801s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002632s
[11354 : 11355]
[11354 : 11356]
Successful child: 11355
[ 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 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all 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 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, 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 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000471s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_6^0 <= cnt_16^0 , 
Narrowing transition: 
<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000802s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003197s
[11354 : 11360]
[11354 : 11361]
Successful child: 11360
[ 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, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, 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, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000634s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: y_6^0 <= cnt_16^0 , 
Narrowing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
Variables:
cnt_16^0, y_6^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000783s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003129s
[11354 : 11365]
[11354 : 11366]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012252s
Time used: 0.011761

[11354 : 11370]
[11354 : 11371]
Successful child: 11371

Program does NOT terminate