/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, l20, true>
<l1, l2, ((1 + y8^0) <= (0 + x7^0))>
<l1, l2, ((1 + x7^0) <= (0 + y8^0))>
<l1, l3, ((0 + x7^0) <= (0 + y8^0)) /\ ((0 + y8^0) <= (0 + x7^0)), par{ret_foo10^0 -> (0 + x7^0)}>
<l4, l5, true>
<l6, l4, ((0 + i^0) <= 4)>
<l6, l4, (5 <= (0 + i^0))>
<l7, l6, (undef127 = (0 + ret_foo18^0)), par{k^0 -> (0 + undef127), tmp___1^0 -> undef127}>
<l8, l9, ((0 + x15^0) <= 0)>
<l8, l9, (1 <= (0 + x15^0)), par{y16^0 -> ((0 + x15^0) + y16^0)}>
<l10, l7, ((1 + x15^0) <= (0 + i17^0)), par{ret_foo18^0 -> (0 + y16^0)}>
<l10, l8, ((0 + i17^0) <= (0 + x15^0))>
<l2, l11, true>
<l12, l9, ((1 + y16^0) <= (0 + x15^0))>
<l12, l9, ((1 + x15^0) <= (0 + y16^0))>
<l12, l7, ((0 + x15^0) <= (0 + y16^0)) /\ ((0 + y16^0) <= (0 + x15^0)), par{ret_foo18^0 -> (0 + x15^0)}>
<l13, l12, (undef297 = (0 + ret_foo14^0)), par{i17^0 -> 0, j^0 -> (0 + undef297), tmp___0^0 -> undef297, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l15, true>
<l16, l14, ((0 + x11^0) <= 0)>
<l16, l14, (1 <= (0 + x11^0)), par{y12^0 -> ((0 + x11^0) + y12^0)}>
<l15, l13, ((1 + x11^0) <= (0 + i13^0)), par{ret_foo14^0 -> (0 + y12^0)}>
<l15, l16, ((0 + i13^0) <= (0 + x11^0))>
<l17, l14, ((1 + y12^0) <= (0 + x11^0))>
<l17, l14, ((1 + x11^0) <= (0 + y12^0))>
<l17, l13, ((0 + x11^0) <= (0 + y12^0)) /\ ((0 + y12^0) <= (0 + x11^0)), par{ret_foo14^0 -> (0 + x11^0)}>
<l9, l10, true>
<l3, l17, (undef486 = (0 + ret_foo10^0)), par{i13^0 -> 0, i^0 -> (0 + undef486), tmp^0 -> undef486, x11^0 -> ~(3), y12^0 -> 4}>
<l18, l2, ((0 + x7^0) <= 0)>
<l18, l2, (1 <= (0 + x7^0)), par{y8^0 -> ((0 + x7^0) + y8^0)}>
<l11, l3, ((1 + x7^0) <= (0 + i9^0)), par{ret_foo10^0 -> (0 + y8^0)}>
<l11, l18, ((0 + i9^0) <= (0 + x7^0))>
<l19, l1, true, par{i9^0 -> 0, x7^0 -> 3, y8^0 -> 3}>
<l20, l19, true>

Fresh variables:
undef127, undef297, undef486, 

Undef variables:
undef127, undef297, undef486, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l14, (0 = 0) /\ (3 = 3) /\ (y8^0 = 3) /\ ((0 + 3) <= (0 + 3)) /\ ((0 + 3) <= (0 + 3)) /\ (undef486 = (0 + (0 + 3))) /\ ((1 + ~(3)) <= (0 + 4)), par{i13^0 -> 0, i^0 -> (0 + undef486), x11^0 -> ~(3), y12^0 -> 4}>
<l9, l5, ((1 + x15^0) <= (0 + i17^0)) /\ (undef127 = (0 + (0 + y16^0))) /\ ((0 + i^0) <= 4)>
<l9, l5, ((1 + x15^0) <= (0 + i17^0)) /\ (undef127 = (0 + (0 + y16^0))) /\ (5 <= (0 + i^0))>
<l9, l9, ((0 + i17^0) <= (0 + x15^0)) /\ ((0 + x15^0) <= 0)>
<l9, l9, ((0 + i17^0) <= (0 + x15^0)) /\ (1 <= (0 + x15^0)), par{y16^0 -> ((0 + x15^0) + y16^0)}>
<l14, l9, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((1 + (0 + (~(1) * __const_6^0))) <= (0 + 3)), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l9, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((1 + 3) <= (0 + (0 + (~(1) * __const_6^0)))), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l5, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((0 + 3) <= (0 + (0 + (~(1) * __const_6^0)))) /\ ((0 + (0 + (~(1) * __const_6^0))) <= (0 + 3)) /\ (undef127 = (0 + (0 + 3))) /\ ((0 + i^0) <= 4), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l5, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((0 + 3) <= (0 + (0 + (~(1) * __const_6^0)))) /\ ((0 + (0 + (~(1) * __const_6^0))) <= (0 + 3)) /\ (undef127 = (0 + (0 + 3))) /\ (5 <= (0 + i^0)), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l14, ((0 + i13^0) <= (0 + x11^0)) /\ ((0 + x11^0) <= 0)>
<l14, l14, ((0 + i13^0) <= (0 + x11^0)) /\ (1 <= (0 + x11^0)), par{y12^0 -> ((0 + x11^0) + y12^0)}>

Fresh variables:
undef127, undef297, undef486, 

Undef variables:
undef127, undef297, undef486, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l14, l14, i13^0 <= x11^0 /\ x11^0 <= 0, {all remain the same}>
<l14, l14, 1 <= x11^0 /\ i13^0 <= x11^0, {y12^0 -> x11^0 + y12^0, rest remain the same}>
Variables:
i13^0, x11^0, y12^0

Graph 2:
Transitions:
<l9, l9, i17^0 <= x15^0 /\ x15^0 <= 0, {all remain the same}>
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l14, y8^0 = 3 /\ undef486 = 3, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>

Graph 2
<l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
<l14, l9, 1 + x11^0 <= i13^0 /\ 4 + __const_6^0 <= 0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>

Graph 3
<l9, l5, 1 + x15^0 <= i17^0 /\ i^0 <= 4 /\ y16^0 = undef127, {all remain the same}>
<l9, l5, 1 + x15^0 <= i17^0 /\ 5 <= i^0 /\ y16^0 = undef127, {all remain the same}>
<l14, l5, 1 + x11^0 <= i13^0 /\ i^0 <= 4 /\ y12^0 = undef297 /\ 3 + __const_6^0 = 0 /\ undef127 = 3, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
<l14, l5, 1 + x11^0 <= i13^0 /\ 5 <= i^0 /\ y12^0 = undef297 /\ 3 + __const_6^0 = 0 /\ undef127 = 3, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.005338
Some transition disabled by a set of invariant(s):
Invariant at l14: 1 + x11^0 <= 0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l14, 1 <= x11^0 /\ i13^0 <= x11^0, {y12^0 -> x11^0 + y12^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + x11^0 <= 0 /\ i13^0 <= x11^0, {all remain the same}>
Checking unfeasibility...
Time used: 0.002748
Some transition disabled by a set of invariant(s):
Invariant at l14: 0 <= i13^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l14, 1 + x11^0 <= 0 /\ i13^0 <= x11^0, {all remain the same}>
Checking unfeasibility...
Time used: 4.7e-05

Analyzing SCC {l14}...
No cycles found.

Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.00519
Some transition disabled by a set of invariant(s):
Invariant at l9: 1 <= x15^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l9, l9, i17^0 <= x15^0 /\ x15^0 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.002658

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000745s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001967s
[16909 : 16910]
[16909 : 16911]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019216s
Time used: 0.019212

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^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): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000705s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002831s
[16909 : 16915]
[16909 : 16916]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017056s
Time used: 0.017053

LOG: SAT solveNonLinear - Elapsed time: 0.027469s
Cost: 1; Total time: 0.026973
Quasi-ranking function: 50000 + i17^0 + 50001*x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000835s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004351s
[16909 : 17028]
[16909 : 17029]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017429s
Time used: 0.017426

LOG: SAT solveNonLinear - Elapsed time: 0.027971s
Cost: 1; Total time: 0.027477
Quasi-ranking function: 50000 - i17^0 + 100003*x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000955s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003675s
[16909 : 17033]
[16909 : 17034]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017118s
Time used: 0.017115

LOG: SAT solveNonLinear - Elapsed time: 0.029697s
Cost: 1; Total time: 0.02912
Quasi-ranking function: 50000 + i17^0 - x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001066s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007265s
[16909 : 17072]
[16909 : 17073]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019269s
Time used: 0.019266

LOG: SAT solveNonLinear - Elapsed time: 0.031710s
Cost: 1; Total time: 0.031081
Termination implied by a set of invariant(s):
Invariant at l9: i17^0 <= x15^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^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): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - i17^0 - x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001162s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008152s
[16909 : 17077]
[16909 : 17078]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017627s
Time used: 0.017624

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^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): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001255s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007443s
[16909 : 17082]
[16909 : 17083]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027341s
Time used: 0.027339

LOG: SAT solveNonLinear - Elapsed time: 0.039654s
Cost: 1; Total time: 0.038982
Quasi-ranking function: 50000 + x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001347s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009028s
[16909 : 17087]
[16909 : 17088]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018548s
Time used: 0.018545

LOG: SAT solveNonLinear - Elapsed time: 0.031189s
Cost: 1; Total time: 0.030508
Termination implied by a set of invariant(s):
Invariant at l9: 1 <= x15^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^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): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 + i17^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001441s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011555s
[16909 : 17469]
[16909 : 17470]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021870s
Time used: 0.021866

LOG: SAT solveNonLinear - Elapsed time: 0.034579s
Cost: 1; Total time: 0.033852
Quasi-ranking function: 50000 - i17^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 100003*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001530s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011917s
[16909 : 17474]
[16909 : 17475]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012551s
Time used: 0.011987
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l0, l14, 0 <= 2 + __const_6^0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001110s

LOG: NarrowEntry size 1
ENTRIES:
<l0, l14, 0 <= 0 /\ 0 <= 2 + __const_6^0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
END ENTRIES:
GRAPH:
END GRAPH:
EXIT: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[16909 : 17479]
[16909 : 17480]
[16909 : 17481]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.021223s
Cannot prove unreachability

[16909 : 17482]
[16909 : 17486]
Successful child: 17482

Program does NOT terminate