/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, 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_100^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_100^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_100^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.001768

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000487s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001392s
[11785 : 11786]
[11785 : 11787]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010937s
Time used: 0.010933

LOG: SAT solveNonLinear - Elapsed time: 0.016372s
Cost: 1; Total time: 0.016073
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.000546s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001977s
[11785 : 11791]
[11785 : 11792]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010720s
Time used: 0.010715

LOG: SAT solveNonLinear - Elapsed time: 0.016654s
Cost: 1; Total time: 0.016263
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.000635s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002398s
[11785 : 11796]
[11785 : 11797]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010908s
Time used: 0.010904

LOG: SAT solveNonLinear - Elapsed time: 0.016973s
Cost: 1; Total time: 0.01654
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.000708s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002708s
[11785 : 11801]
[11785 : 11802]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

[11785 : 11806]
[11785 : 11807]
Successful child: 11806

Program does NOT terminate