/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, l6, true>
<l1, l2, true>
<l2, l1, true>
<l3, l1, ((0 + n^0) <= 0) /\ (undef7 = 0), par{x^0 -> 1}>
<l3, l4, (1 <= (0 + n^0))>
<l4, l3, true>
<l5, l3, (undef12 = undef12), par{n^0 -> undef12, x^0 -> 1}>
<l6, l5, true>

Fresh variables:
undef7, undef12, 

Undef variables:
undef7, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (n^0 = undef12) /\ (undef12 = undef12)>
<l1, l1, true>
<l3, l1, ((0 + n^0) <= 0) /\ (undef7 = 0)>
<l3, l3, (1 <= (0 + n^0))>

Fresh variables:
undef7, undef12, 

Undef variables:
undef7, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
<l1, l1, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, n^0 = undef12, {all remain the same}>

Graph 2
<l3, l1, n^0 <= 0 /\ undef7 = 0, {all remain the same}>

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

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

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

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

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

LOG: Try proving POST

LOG: CALL check - Post:n^0 <= 0 - Process 2
* Exit transition: <l0, l3, n^0 = undef12, {all remain the same}>
* Postcondition  : n^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000353s

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

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 1 <= n^0 /\ n^0 = undef12, {all remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 1 <= n^0, {all remain the same}>
END GRAPH:
EXIT: <l3, l3, true, {all remain the same}>
POST: n^0 <= 0


LOG: Try proving POST
[26845 : 26846]
[26845 : 26847]
[26845 : 26848]

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

LOG: RETURN check - Elapsed time: 4.111985s

[26845 : 26853]
[26845 : 26857]
Successful child: 26853

Program does NOT terminate