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

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (x^0 = (0 + __const_300^0))>
<l1, l1, (undef5 = __disjvr_0^0) /\ (__disjvr_0^0 = undef5), par{__disjvr_0^0 -> undef5, x^0 -> (~(1) + x^0)}>

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

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

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000490s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001390s
[6054 : 6055]
[6054 : 6056]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010777s
Time used: 0.010772

LOG: SAT solveNonLinear - Elapsed time: 0.016255s
Cost: 1; Total time: 0.015951
Quasi-ranking function: 50000 - __disjvr_0^0 + x^0
New Graphs: 
Transitions:
<l1, l1, 50001 + x^0 <= __disjvr_0^0 /\ __disjvr_0^0 = undef5, {__disjvr_0^0 -> undef5, x^0 -> -1 + x^0, rest remain the same}>
Variables:
__disjvr_0^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000541s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001978s
[6054 : 6060]
[6054 : 6061]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010680s
Time used: 0.010675

LOG: SAT solveNonLinear - Elapsed time: 0.016653s
Cost: 1; Total time: 0.016255
Quasi-ranking function: 50000 + x^0
New Graphs: 
Transitions:
<l1, l1, 50001 + x^0 <= __disjvr_0^0 /\ 50001 + x^0 <= 0 /\ __disjvr_0^0 = undef5, {__disjvr_0^0 -> undef5, x^0 -> -1 + x^0, rest remain the same}>
Variables:
__disjvr_0^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000633s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002410s
[6054 : 6065]
[6054 : 6066]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010891s
Time used: 0.010886

LOG: SAT solveNonLinear - Elapsed time: 0.017029s
Cost: 1; Total time: 0.01659
Quasi-ranking function: 50000 + __disjvr_0^0 + x^0
New Graphs: 
Transitions:
<l1, l1, 50001 + __disjvr_0^0 + x^0 <= 0 /\ 50001 + x^0 <= __disjvr_0^0 /\ 50001 + x^0 <= 0 /\ __disjvr_0^0 = undef5, {__disjvr_0^0 -> undef5, x^0 -> -1 + x^0, rest remain the same}>
Variables:
__disjvr_0^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000712s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002750s
[6054 : 6070]
[6054 : 6071]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

[6054 : 6075]
[6054 : 6076]
Successful child: 6075

Program does NOT terminate