/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, l13, true>
<l1, l2, ((0 + got_SIGHUP^0) <= 0)>
<l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)), par{__rho_2_^0 -> undef21, a33^0 -> 1, got_SIGHUP^0 -> 0, ret_XLogArchivingActive44^0 -> undef29, tmp2^0 -> undef32, tt1^0 -> (0 + undef32)}>
<l4, l5, true>
<l6, l7, true>
<l8, l6, (undef76 = undef76), par{__rho_4_^0 -> undef76}>
<l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= (0 + __const_1000^0))>
<l9, l8, ((0 + __const_1000^0) <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}>
<l10, l8, (1 <= (0 + wakend^0))>
<l10, l9, ((0 + wakend^0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)), par{a88^0 -> 0, curtime^0 -> (0 + undef156), ret_time1010^0 -> undef156, tmp99^0 -> undef160}>
<l2, l10, ((0 + wakend^0) <= 0)>
<l2, l10, (1 <= (0 + wakend^0)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)), par{a55^0 -> 0, last_copy_time^0 -> (0 + undef193), ret_time77^0 -> undef193, tmp66^0 -> undef195, wakend^0 -> 0}>
<l7, l11, true>
<l11, l7, true>
<l3, l2, (1 <= (0 + tt1^0))>
<l3, l6, ((0 + tt1^0) <= 0)>
<l12, l1, (undef289 = 1) /\ (undef272 = undef272), par{__rho_1_^0 -> undef272, got_SIGHUP^0 -> (0 + __rho_2_^0), wakend^0 -> 1}>
<l13, l12, true>

Fresh variables:
undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 

Undef variables:
undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ ((0 + (0 + __rho_2_^0)) <= 0) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ (((1 + (0 + undef156)) + (~(1) * (0 + undef193))) <= (0 + __const_1000^0)) /\ (undef76 = undef76), par{last_copy_time^0 -> (0 + undef193)}>
<l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ ((0 + (0 + __rho_2_^0)) <= 0) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef156)) + (~(1) * (0 + undef193)))) /\ (undef76 = undef76), par{last_copy_time^0 -> (0 + undef193)}>
<l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ (1 <= (0 + (0 + __rho_2_^0))) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)) /\ (1 <= (0 + (0 + undef32))) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ (((1 + (0 + undef156)) + (~(1) * (0 + undef193))) <= (0 + __const_1000^0)) /\ (undef76 = undef76), par{__rho_2_^0 -> undef21, last_copy_time^0 -> (0 + undef193)}>
<l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ (1 <= (0 + (0 + __rho_2_^0))) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)) /\ (1 <= (0 + (0 + undef32))) /\ (1 <= (0 + 1)) /\ (undef195 = undef195) /\ (undef193 = (0 + undef195)) /\ ((0 + 0) <= 0) /\ (undef160 = undef160) /\ (undef156 = (0 + undef160)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef156)) + (~(1) * (0 + undef193)))) /\ (undef76 = undef76), par{__rho_2_^0 -> undef21, last_copy_time^0 -> (0 + undef193)}>
<l0, l7, (undef289 = 1) /\ (undef272 = undef272) /\ (1 <= (0 + (0 + __rho_2_^0))) /\ (undef21 = undef21) /\ (undef29 = (0 + undef21)) /\ (undef32 = (0 + undef29)) /\ ((0 + (0 + undef32)) <= 0), par{__rho_2_^0 -> undef21}>
<l7, l7, true>

Fresh variables:
undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 

Undef variables:
undef21, undef29, undef32, undef76, undef156, undef160, undef193, undef195, undef272, undef289, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l7, __rho_2_^0 <= 0 /\ 1 + undef156 <= __const_1000^0 + undef193 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {last_copy_time^0 -> undef193, rest remain the same}>
<l0, l7, __const_1000^0 + undef193 <= undef156 /\ __rho_2_^0 <= 0 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {last_copy_time^0 -> undef193, rest remain the same}>
<l0, l7, 1 + undef156 <= __const_1000^0 + undef193 /\ 1 <= __rho_2_^0 /\ 1 <= undef32 /\ undef21 = undef29 /\ undef29 = undef32 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {__rho_2_^0 -> undef21, last_copy_time^0 -> undef193, rest remain the same}>
<l0, l7, __const_1000^0 + undef193 <= undef156 /\ 1 <= __rho_2_^0 /\ 1 <= undef32 /\ undef21 = undef29 /\ undef29 = undef32 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {__rho_2_^0 -> undef21, last_copy_time^0 -> undef193, rest remain the same}>
<l0, l7, undef32 <= 0 /\ 1 <= __rho_2_^0 /\ undef21 = undef29 /\ undef29 = undef32 /\ undef289 = 1, {__rho_2_^0 -> undef21, rest remain the same}>

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

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l7, __rho_2_^0 <= 0 /\ 1 + undef156 <= __const_1000^0 + undef193 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {last_copy_time^0 -> undef193, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l7, __rho_2_^0 <= 0 /\ 1 + undef156 <= __const_1000^0 + undef193 /\ undef156 = undef160 /\ undef193 = undef195 /\ undef289 = 1, {last_copy_time^0 -> undef193, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[5502 : 5503]
[5502 : 5504]
Successful child: 5503

Program does NOT terminate