/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, l5, true>
<l1, l2, ((1 + y^0) <= (0 + x^0))>
<l1, l3, true, par{x^0 -> (1 + x^0), y^0 -> (1 + y^0)}>
<l3, l1, true>
<l4, l1, ((0 + y^0) <= (0 + x^0)) /\ ((0 + x^0) <= (0 + y^0))>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, ((0 + y^0) <= (0 + x^0)) /\ ((0 + x^0) <= (0 + y^0))>
<l1, l2, ((1 + y^0) <= (0 + x^0))>
<l1, l1, true, par{x^0 -> (1 + x^0), y^0 -> (1 + y^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, true, {x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, x^0 = y^0, {all remain the same}>

Graph 2
<l1, l2, 1 + y^0 <= x^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.001652

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000371s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000971s
[59341 : 59343]
[59341 : 59344]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013375s
Time used: 0.01337

LOG: SAT solveNonLinear - Elapsed time: 0.019881s
Cost: 1; Total time: 0.019603
Termination implied by a set of invariant(s):
Invariant at l1: x^0 <= 1 + y^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, x^0 <= 1 + y^0, {x^0 -> 1 + x^0, y^0 -> 1 + y^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, x^0 <= 1 + y^0, {x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*x^0 + y^0
New Graphs: 
Transitions:
<l1, l1, x^0 <= 1 + y^0 /\ 50001 + y^0 <= 2*x^0, {x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000575s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002015s
[59341 : 60286]
[59341 : 60287]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018663s
Time used: 0.018657

LOG: SAT solveNonLinear - Elapsed time: 0.026227s
Cost: 1; Total time: 0.025849
Termination implied by a set of invariant(s):
Invariant at l1: x^0 <= 1 + y^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, x^0 <= 1 + y^0, {x^0 -> 1 + x^0, y^0 -> 1 + y^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, x^0 <= 1 + y^0 /\ 50001 + y^0 <= 2*x^0, {x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Quasi-ranking function: 50000 - x^0
New Graphs: 
Transitions:
<l1, l1, x^0 <= 1 + y^0 /\ 50001 <= x^0 /\ 50001 + y^0 <= 2*x^0, {x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000637s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002500s
[59341 : 61217]
[59341 : 61218]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.100738s
Time used: 4.10004
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, x^0 = y^0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[59341 : 63074]
[59341 : 63075]
Successful child: 63074

Program does NOT terminate