/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, 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, (undef120 = (0 + ret_foo18^0)), par{k^0 -> (0 + undef120), tmp___1^0 -> undef120}>
<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, (undef281 = (0 + ret_foo14^0)), par{i17^0 -> 0, j^0 -> (0 + undef281), tmp___0^0 -> undef281, x15^0 -> 3, y16^0 -> ~(6)}>
<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, (undef460 = (0 + ret_foo10^0)), par{i13^0 -> 0, i^0 -> (0 + undef460), tmp^0 -> undef460, 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:
undef120, undef281, undef460, 

Undef variables:
undef120, undef281, undef460, 

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)) /\ (undef460 = (0 + (0 + 3))) /\ ((1 + ~(3)) <= (0 + 4)), par{i13^0 -> 0, i^0 -> (0 + undef460), x11^0 -> ~(3), y12^0 -> 4}>
<l9, l5, ((1 + x15^0) <= (0 + i17^0)) /\ (undef120 = (0 + (0 + y16^0))) /\ ((0 + i^0) <= 4)>
<l9, l5, ((1 + x15^0) <= (0 + i17^0)) /\ (undef120 = (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)) /\ (undef281 = (0 + (0 + y12^0))) /\ ((1 + ~(6)) <= (0 + 3)), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> ~(6)}>
<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:
undef120, undef281, undef460, 

Undef variables:
undef120, undef281, undef460, 

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 /\ undef460 = 3, {i13^0 -> 0, i^0 -> undef460, x11^0 -> -3, y12^0 -> 4, rest remain the same}>

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

Graph 3
<l9, l5, 1 + x15^0 <= i17^0 /\ i^0 <= 4 /\ y16^0 = undef120, {all remain the same}>
<l9, l5, 1 + x15^0 <= i17^0 /\ 5 <= i^0 /\ y16^0 = undef120, {all 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.005445
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.002735
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.5e-05

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

Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.005673
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.002421

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000760s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001969s
[36376 : 36377]
[36376 : 36378]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028313s
Time used: 0.028309

LOG: SAT solveNonLinear - Elapsed time: 0.038411s
Cost: 1; Total time: 0.03804
Termination implied by a set of invariant(s):
Invariant at l9: 0 <= 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, {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, {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 /\ 50001 <= x15^0 + 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.000655s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002802s
[36376 : 36382]
[36376 : 36383]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025236s
Time used: 0.025232

LOG: SAT solveNonLinear - Elapsed time: 0.035816s
Cost: 1; Total time: 0.035361
Quasi-ranking function: 50000 - i17^0 + 50000*x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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.000776s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003904s
[36376 : 36387]
[36376 : 36388]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021711s
Time used: 0.021708

LOG: SAT solveNonLinear - Elapsed time: 0.034424s
Cost: 1; Total time: 0.033905
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, {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 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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.000861s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003817s
[36376 : 36392]
[36376 : 36393]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033225s
Time used: 0.03322

LOG: SAT solveNonLinear - Elapsed time: 0.045982s
Cost: 1; Total time: 0.045437
Termination implied by a set of invariant(s):
Invariant at l9: 0 <= 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, {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 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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.000982s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004787s
[36376 : 36397]
[36376 : 36398]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027771s
Time used: 0.027767

LOG: SAT solveNonLinear - Elapsed time: 0.041074s
Cost: 1; Total time: 0.040507
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, {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 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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.001086s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004613s
[36376 : 36498]
[36376 : 36499]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026488s
Time used: 0.026484

LOG: SAT solveNonLinear - Elapsed time: 0.038948s
Cost: 1; Total time: 0.038351
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, {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 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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 /\ 50001 + i17^0 + x15^0 <= y16^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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.001182s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005307s
[36376 : 36503]
[36376 : 36504]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032426s
Time used: 0.032421

LOG: SAT solveNonLinear - Elapsed time: 0.046910s
Cost: 1; Total time: 0.046297
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, {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 /\ 50001 + i17^0 + x15^0 <= y16^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 <= x15^0 + 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 /\ 50001 + i17^0 + x15^0 <= y16^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + 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.001267s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005803s
[36376 : 36508]
[36376 : 36509]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035885s
Time used: 0.035881

LOG: SAT solveNonLinear - Elapsed time: 0.048423s
Cost: 1; Total time: 0.047776
Quasi-ranking function: 50000 + i17^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 50001 + i17^0 + x15^0 <= y16^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + 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.001351s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006252s
[36376 : 36513]
[36376 : 36514]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035055s
Time used: 0.035051

LOG: SAT solveNonLinear - Elapsed time: 0.049918s
Cost: 1; Total time: 0.049237
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, {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 /\ 50001 + i17^0 + x15^0 <= y16^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^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 /\ 50001 + i17^0 + x15^0 <= y16^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50000*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.001438s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008266s
[36376 : 36518]
[36376 : 36519]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l14, l9, 1 + x11^0 <= i13^0 /\ y12^0 = undef281, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -6, 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, y8^0 = 3 /\ undef460 = 3 /\ undef281 = 4, {i13^0 -> 0, i^0 -> undef460, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001027s

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


LOG: Try proving POST
[36376 : 36523]
[36376 : 36524]
[36376 : 36525]

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

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

[36376 : 36526]
[36376 : 36530]
Successful child: 36526

Program does NOT terminate