/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, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
<l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{tmp_7^0 -> undef6, y_6^0 -> (1 + y_6^0)}>
<l3, l1, true>
<l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14), par{tmp_7^0 -> undef14}>
<l4, l5, ((1 + tmp_7^0) <= 0)>
<l4, l5, (1 <= (0 + tmp_7^0))>
<l5, l6, true, par{x_5^0 -> (1 + x_5^0)}>
<l6, l1, true>
<l7, l1, true>
<l8, l7, true>

Fresh variables:
undef1, undef6, undef14, 

Undef variables:
undef1, undef6, undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)>
<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{y_6^0 -> (1 + y_6^0)}>
<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ ((1 + undef14) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)), par{x_5^0 -> (1 + x_5^0)}>

Fresh variables:
undef1, undef6, undef14, 

Undef variables:
undef1, undef6, undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l2, y_6^0 <= x_5^0, {all 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.004733

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001512s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016765s
[41052 : 41054]
[41052 : 41055]
Successful child: 41054
[ 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: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, 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: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001469s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016905s
[41052 : 41068]
[41052 : 41069]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026739s
Time used: 0.025959
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061173s
Time used: 0.061164

LOG: SAT solveNonLinear - Elapsed time: 0.087912s
Cost: 1; Total time: 0.087123
Quasi-ranking function: 50000 - x_5^0
New Graphs: 
Transitions:
<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001591s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019959s
[41052 : 41222]
[41052 : 41223]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028007s
Time used: 0.026772
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066948s
Time used: 0.066927

LOG: SAT solveNonLinear - Elapsed time: 0.094955s
Cost: 1; Total time: 0.093699
Termination implied by a set of invariant(s):
Invariant at l1: x_5^0 <= 1 + y_6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, 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): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Quasi-ranking function: 50000 - y_6^0
New Graphs: 
Transitions:
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 50001 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001472s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.025023s
[41052 : 41227]
[41052 : 41228]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025945s
Time used: 0.024516
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.054759s
Time used: 0.05475

LOG: SAT solveNonLinear - Elapsed time: 0.080705s
Cost: 1; Total time: 0.079266
Termination implied by a set of invariant(s):
Invariant at l1: x_5^0 <= y_6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {x_5^0 -> 1 + x_5^0, 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): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 50001 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14 /\ 50001 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Quasi-ranking function: 50000 - x_5^0 - y_6^0
New Graphs: 
Transitions:
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 50001 <= x_5^0 + y_6^0 /\ 50001 <= y_6^0 /\ undef6 = 0, {y_6^0 -> 1 + y_6^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0 /\ 50001 <= x_5^0 /\ 50001 <= x_5^0 + y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14 /\ 50001 <= x_5^0 /\ 50001 <= x_5^0 + y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001900s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.050115s
[41052 : 41232]
[41052 : 41233]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026685s
Time used: 0.025253

[41052 : 41644]
[41052 : 41648]
Successful child: 41648

Program does NOT terminate