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

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

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:
<l1, l1, 1 <= undef1 /\ 1000 + x^0 = undef1, {x^0 -> undef1, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {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.001404

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000528s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001773s
[44992 : 44993]
[44992 : 44994]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009355s
Time used: 0.009351

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000563s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002142s
[44992 : 45003]
[44992 : 45004]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004093s
Time used: 0.003801
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, true, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[44992 : 45013]
[44992 : 45014]
Successful child: 45014

Program does NOT terminate