/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, l5, true>
<l1, l2, true>
<l2, l3, (undef5 = ((0 + x_5^0) + y_6^0)) /\ ((0 + (~(1) * undef5)) <= 0), par{x_5^0 -> undef5}>
<l3, l2, true>
<l2, l4, (undef11 = ((0 + x_5^0) + y_6^0)) /\ (0 <= (~(1) + (~(1) * undef11))) /\ (undef10 = undef10), par{Result_4^0 -> undef10, x_5^0 -> undef11}>
<l5, l1, true>

Fresh variables:
undef5, undef10, undef11, 

Undef variables:
undef5, undef10, undef11, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l2, (undef5 = ((0 + x_5^0) + y_6^0)) /\ ((0 + (~(1) * undef5)) <= 0), par{x_5^0 -> undef5}>
<l2, l4, (undef11 = ((0 + x_5^0) + y_6^0)) /\ (0 <= (~(1) + (~(1) * undef11))) /\ (undef10 = undef10), par{x_5^0 -> undef11}>

Fresh variables:
undef5, undef10, undef11, 

Undef variables:
undef5, undef10, undef11, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
Variables:
x_5^0, y_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l4, 1 + undef11 <= 0 /\ x_5^0 + y_6^0 = undef11, {x_5^0 -> undef11, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000529s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001736s
[23038 : 23039]
[23038 : 23040]
Successful child: 23039
[ 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, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000360s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + x_5^0 + y_6^0 <= 0 , 
Narrowing transition: 
<l2, l2, 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000610s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002106s
[23038 : 23044]
[23038 : 23045]
Successful child: 23044
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ 1 + y_6^0 <= 0 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ 1 + y_6^0 <= 0 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
Ranking function: 2*x_5^0 + y_6^0
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000417s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_6^0 <= 0 , 
Narrowing transition: 
<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= x_5^0 + y_6^0 /\ 0 <= y_6^0 /\ 0 <= undef5 /\ x_5^0 + y_6^0 = undef5, {x_5^0 -> undef5, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000665s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002241s
[23038 : 23049]
[23038 : 23050]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006261s
Time used: 0.005895

[23038 : 23054]
[23038 : 23058]
Successful child: 23054

Program does NOT terminate