/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, l3, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}>
<l2, l2, true, par{arg1 -> undef3, arg2 -> undef4}>
<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef5 > 0) /\ (undef6 > ~(1))>
<l2, l2, true>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef6 /\ 1 <= undef5, {all remain the same}>

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

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, 0 <= undef6 /\ 1 <= undef5, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, 0 <= undef6 /\ 1 <= undef5, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[61218 : 61219]
[61218 : 61220]
Successful child: 61219

Program does NOT terminate