/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, l6, true>
<l1, l2, ((20 + (~(1) * x_5^0)) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
<l1, l3, (0 <= (19 + (~(1) * x_5^0)))>
<l4, l1, true>
<l3, l1, ((30 + (~(1) * y_6^0)) <= 0), par{x_5^0 -> (~(1) + x_5^0)}>
<l3, l5, (0 <= (29 + (~(1) * y_6^0))), par{x_5^0 -> (~(1) + x_5^0)}>
<l5, l3, true>
<l6, l4, true>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, ((20 + (~(1) * x_5^0)) <= 0) /\ (undef1 = undef1)>
<l0, l3, (0 <= (19 + (~(1) * x_5^0)))>
<l3, l2, ((30 + (~(1) * y_6^0)) <= 0) /\ ((20 + (~(1) * (~(1) + x_5^0))) <= 0) /\ (undef1 = undef1), par{x_5^0 -> (~(1) + x_5^0)}>
<l3, l3, ((30 + (~(1) * y_6^0)) <= 0) /\ (0 <= (19 + (~(1) * (~(1) + x_5^0)))), par{x_5^0 -> (~(1) + x_5^0)}>
<l3, l3, (0 <= (29 + (~(1) * y_6^0))), par{x_5^0 -> (~(1) + x_5^0)}>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 30 <= y_6^0 /\ x_5^0 <= 20, {x_5^0 -> -1 + x_5^0, rest remain the same}>
<l3, l3, y_6^0 <= 29, {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, l3, x_5^0 <= 19, {all remain the same}>

Graph 2
<l0, l2, 20 <= x_5^0, {all remain the same}>
<l3, l2, 30 <= y_6^0 /\ 21 <= x_5^0, {x_5^0 -> -1 + x_5^0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000818s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003598s
[32961 : 32969]
[32961 : 32970]
Successful child: 32969
[ 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: 
<l3, l3, 30 <= y_6^0 /\ x_5^0 <= 20, {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): 
<l3, l3, y_6^0 <= 15, {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: 
<l3, l3, 30 <= y_6^0 /\ x_5^0 <= 20, {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): 
<l3, l3, y_6^0 <= 15, {x_5^0 -> -1 + x_5^0, rest remain the same}>
New Graphs: 
Transitions:
<l3, l3, y_6^0 <= 15, {x_5^0 -> -1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000471s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001466s
[32961 : 33019]
[32961 : 33020]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013000s
Time used: 0.012996

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000505s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001822s
[32961 : 33103]
[32961 : 33104]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012721s
Time used: 0.012716

LOG: SAT solveNonLinear - Elapsed time: 0.018799s
Cost: 1; Total time: 0.018406
Quasi-ranking function: 50000 + x_5^0 - y_6^0
New Graphs: 
Transitions:
<l3, l3, y_6^0 <= 15 /\ 50001 + x_5^0 <= 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 {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000605s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002200s
[32961 : 33136]
[32961 : 33137]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013426s
Time used: 0.013423

LOG: SAT solveNonLinear - Elapsed time: 0.019971s
Cost: 1; Total time: 0.019533
Quasi-ranking function: 50000 + x_5^0 + y_6^0
New Graphs: 
Transitions:
<l3, l3, y_6^0 <= 15 /\ 50001 + x_5^0 <= 0 /\ 50001 + x_5^0 + y_6^0 <= 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 {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000692s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002577s
[32961 : 33147]
[32961 : 33148]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006325s
Time used: 0.005965
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, x_5^0 <= 19, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[32961 : 33152]
[32961 : 33156]
Successful child: 33156

Program does NOT terminate