/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, l5, true>
<l1, l2, true>
<l2, l3, ((0 + (~(1) * x_5^0)) <= 0)>
<l3, l2, true>
<l2, l4, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef7 = undef7), par{Result_4^0 -> undef7}>
<l5, l1, true>

Fresh variables:
undef7, 

Undef variables:
undef7, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l2, ((0 + (~(1) * x_5^0)) <= 0)>
<l2, l4, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef7 = undef7)>

Fresh variables:
undef7, 

Undef variables:
undef7, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 0 <= x_5^0, {all remain the same}>
Variables:
x_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l4, 1 + x_5^0 <= 0, {all remain the same}>

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

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal 1 + x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : 1 + x_5^0 <= 0
Postcodition moved up: 1 + x_5^0 <= 0

LOG: Try proving POST

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000252s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, 0 <= x_5^0, {all remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 0 <= x_5^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= x_5^0, {all remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: 1 + x_5^0 <= 0


LOG: Try proving POST
[26249 : 26253]
[26249 : 26254]
[26249 : 26255]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 4.118022s

[26249 : 26369]
[26249 : 26373]
Successful child: 26369

Program does NOT terminate