/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, l13, true>
<l1, l2, ((0 + got_SIGHUP^0) <= 0)>
<l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef14 = undef14), par{__rho_3_^0 -> undef14, a22^0 -> 1, got_SIGHUP^0 -> 0, tt1^0 -> (0 + undef14)}>
<l4, l5, true>
<l6, l7, true>
<l8, l6, (undef49 = undef49), par{__rho_5_^0 -> undef49}>
<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) /\ (undef95 = undef95), par{curtime^0 -> undef95}>
<l7, l11, true>
<l11, l7, true>
<l2, l10, ((0 + wakend^0) <= 0)>
<l2, l10, (1 <= (0 + wakend^0)) /\ (undef136 = undef136), par{__rho_4_^0 -> undef136, last_copy_time^0 -> (0 + undef136), wakend^0 -> 0}>
<l3, l2, (1 <= (0 + tt1^0))>
<l3, l6, ((0 + tt1^0) <= 0)>
<l12, l1, (undef177 = 1) /\ (undef167 = undef167), par{__rho_2_^0 -> undef167, got_SIGHUP^0 -> (0 + undef167), wakend^0 -> 1}>
<l13, l12, true>

Fresh variables:
undef14, undef49, undef95, undef136, undef167, undef177, 

Undef variables:
undef14, undef49, undef95, undef136, undef167, undef177, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ ((0 + (0 + undef167)) <= 0) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ (((1 + undef95) + (~(1) * (0 + undef136))) <= (0 + __const_1000^0)) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}>
<l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ ((0 + (0 + undef167)) <= 0) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ ((0 + __const_1000^0) <= ((0 + undef95) + (~(1) * (0 + undef136)))) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}>
<l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ (1 <= (0 + (0 + undef167))) /\ (undef14 = undef14) /\ (1 <= (0 + (0 + undef14))) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ (((1 + undef95) + (~(1) * (0 + undef136))) <= (0 + __const_1000^0)) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}>
<l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ (1 <= (0 + (0 + undef167))) /\ (undef14 = undef14) /\ (1 <= (0 + (0 + undef14))) /\ (1 <= (0 + 1)) /\ (undef136 = undef136) /\ ((0 + 0) <= 0) /\ (undef95 = undef95) /\ ((0 + __const_1000^0) <= ((0 + undef95) + (~(1) * (0 + undef136)))) /\ (undef49 = undef49), par{last_copy_time^0 -> (0 + undef136)}>
<l0, l7, (undef177 = 1) /\ (undef167 = undef167) /\ (1 <= (0 + (0 + undef167))) /\ (undef14 = undef14) /\ ((0 + (0 + undef14)) <= 0)>
<l7, l7, true>

Fresh variables:
undef14, undef49, undef95, undef136, undef167, undef177, 

Undef variables:
undef14, undef49, undef95, undef136, undef167, undef177, 

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, undef167 <= 0 /\ 1 + undef95 <= __const_1000^0 + undef136 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}>
<l0, l7, __const_1000^0 + undef136 <= undef95 /\ undef167 <= 0 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}>
<l0, l7, 1 + undef95 <= __const_1000^0 + undef136 /\ 1 <= undef14 /\ 1 <= undef167 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}>
<l0, l7, __const_1000^0 + undef136 <= undef95 /\ 1 <= undef14 /\ 1 <= undef167 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}>
<l0, l7, undef14 <= 0 /\ 1 <= undef167 /\ undef177 = 1, {all 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.001724

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

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l7, undef167 <= 0 /\ 1 + undef95 <= __const_1000^0 + undef136 /\ undef177 = 1, {last_copy_time^0 -> undef136, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[41102 : 41103]
[41102 : 41104]
Successful child: 41103

Program does NOT terminate