/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, l4, true, par{p^0 -> 0}>
<l4, l5, (1 <= (0 + y_1^0)), par{y_1^0 -> (~(1) + y_1^0)}>
<l5, l4, true>
<l4, l1, ((0 + y_1^0) <= 0), par{p^0 -> ~(1)}>
<l6, l3, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l1, true>
<l4, l4, (1 <= (0 + y_1^0)), par{y_1^0 -> (~(1) + y_1^0)}>
<l4, l1, ((0 + y_1^0) <= 0)>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}>
Variables:
y_1^0

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

Precedence: 
Graph 0

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

Graph 2
<l4, l1, y_1^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000489s
Ranking function: -1 + y_1^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.00084

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l4, l1, y_1^0 <= 0, {all remain the same}>

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

LOG: Try proving POST

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000206s

LOG: NarrowEntry size 1
Narrowing transition: 
<l4, l4, 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l4, 0 <= 0, {all remain the same}>
END ENTRIES:
GRAPH:
<l4, l4, 0 <= 0 /\ 1 <= y_1^0, {y_1^0 -> -1 + y_1^0, rest remain the same}>
END GRAPH:
EXIT: <l4, l1, y_1^0 <= 0, {all remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[52209 : 52210]
[52209 : 52211]
[52209 : 52212]

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

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

[52209 : 52213]
[52209 : 52214]
Successful child: 52213

Program does NOT terminate