/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, l18, true>
<l1, l2, ((0 + __rho_1_^0) <= 0)>
<l1, l2, (1 <= (0 + __rho_1_^0)) /\ (undef49 = 1), par{set^0 -> 0}>
<l3, l4, true>
<l5, l6, true>
<l7, l5, (1 <= (0 + __rho_1_^0))>
<l7, l5, ((0 + __rho_1_^0) <= 0) /\ (undef146 = 1), par{unset^0 -> 0}>
<l8, l7, true, par{num^0 -> 0}>
<l9, l8, true>
<l10, l9, ((1 + status^0) <= 2)>
<l10, l9, (3 <= (0 + status^0))>
<l10, l9, (2 <= (0 + status^0)) /\ ((0 + status^0) <= 2), par{a99^0 -> (0 + DName^0), num^0 -> (1 + num^0)}>
<l11, l10, true, par{Pdoi^0 -> 0}>
<l12, l13, (1 <= (0 + status^0)) /\ ((0 + status^0) <= 1), par{i^0 -> (1 + i^0)}>
<l12, l11, ((1 + status^0) <= 1)>
<l12, l11, (2 <= (0 + status^0))>
<l13, l14, true>
<l15, l12, ((0 + DName^0) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1), par{__rho_10_^0 -> undef391, a66^0 -> (0 + DName^0), a77^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice88^0 -> undef406, status^0 -> (0 + undef406)}>
<l15, l8, (1 <= (0 + DName^0))>
<l6, l16, true>
<l16, l6, true>
<l14, l15, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)), par{DName^0 -> (0 + undef504), __rho_9_^0 -> undef490, a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName55^0 -> undef504}>
<l14, l8, ((0 + Pdolen^0) <= (0 + i^0))>
<l2, l13, true>
<l17, l1, (undef579 = 0) /\ (undef561 = undef561), par{__rho_1_^0 -> undef561, set^0 -> (0 + undef579), unset^0 -> undef579}>
<l18, l17, true>

Fresh variables:
undef49, undef146, undef391, undef406, undef411, undef490, undef504, undef561, undef579, 

Undef variables:
undef49, undef146, undef391, undef406, undef411, undef490, undef504, undef561, undef579, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l13, (__rho_1_^0 = undef561) /\ (undef579 = 0) /\ (undef561 = undef561) /\ ((0 + undef561) <= 0)>
<l0, l13, (__rho_1_^0 = undef561) /\ (undef579 = 0) /\ (undef561 = undef561) /\ (1 <= (0 + undef561)) /\ (undef49 = 1)>
<l6, l6, true>
<l13, l13, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ (1 <= (0 + (0 + undef406))) /\ ((0 + (0 + undef406)) <= 1), par{i^0 -> (1 + i^0)}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ ((1 + (0 + undef406)) <= 1) /\ ((1 + (0 + undef406)) <= 2) /\ (1 <= (0 + __rho_1_^0)), par{Pdoi^0 -> 0, num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ ((1 + (0 + undef406)) <= 1) /\ ((1 + (0 + undef406)) <= 2) /\ ((0 + __rho_1_^0) <= 0) /\ (undef146 = 1), par{Pdoi^0 -> 0, num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ (2 <= (0 + (0 + undef406))) /\ (3 <= (0 + (0 + undef406))) /\ (1 <= (0 + __rho_1_^0)), par{Pdoi^0 -> 0, num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ (2 <= (0 + (0 + undef406))) /\ (3 <= (0 + (0 + undef406))) /\ ((0 + __rho_1_^0) <= 0) /\ (undef146 = 1), par{Pdoi^0 -> 0, num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ (2 <= (0 + (0 + undef406))) /\ (2 <= (0 + (0 + undef406))) /\ ((0 + (0 + undef406)) <= 2) /\ (1 <= (0 + __rho_1_^0)), par{Pdoi^0 -> 0, num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ ((0 + (0 + undef504)) <= 0) /\ (undef391 = undef391) /\ (undef406 = (0 + undef391)) /\ (undef411 = 1) /\ (2 <= (0 + (0 + undef406))) /\ (2 <= (0 + (0 + undef406))) /\ ((0 + (0 + undef406)) <= 2) /\ ((0 + __rho_1_^0) <= 0) /\ (undef146 = 1), par{Pdoi^0 -> 0, num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ (1 <= (0 + (0 + undef504))) /\ (1 <= (0 + __rho_1_^0)), par{num^0 -> 0}>
<l13, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef490 = undef490) /\ (undef504 = (0 + undef490)) /\ (1 <= (0 + (0 + undef504))) /\ ((0 + __rho_1_^0) <= 0) /\ (undef146 = 1), par{num^0 -> 0}>
<l13, l6, ((0 + Pdolen^0) <= (0 + i^0)) /\ (1 <= (0 + __rho_1_^0)), par{num^0 -> 0}>
<l13, l6, ((0 + Pdolen^0) <= (0 + i^0)) /\ ((0 + __rho_1_^0) <= 0) /\ (undef146 = 1), par{num^0 -> 0}>

Fresh variables:
undef49, undef146, undef391, undef406, undef411, undef490, undef504, undef561, undef579, 

Undef variables:
undef49, undef146, undef391, undef406, undef411, undef490, undef504, undef561, undef579, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l13, l13, undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef406 = 1 /\ undef411 = 1, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
Pdolen^0, i^0

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

Precedence: 
Graph 0

Graph 1
<l0, l13, undef561 <= 0 /\ __rho_1_^0 = undef561 /\ undef579 = 0, {all remain the same}>
<l0, l13, 1 <= undef561 /\ __rho_1_^0 = undef561 /\ undef579 = 0 /\ undef49 = 1, {all remain the same}>

Graph 2
<l13, l6, undef406 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l13, l6, __rho_1_^0 <= 0 /\ undef406 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef146 = 1 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l13, l6, undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ 3 <= undef406 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l13, l6, __rho_1_^0 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 3 <= undef406 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef146 = 1 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l13, l6, undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef411 = 1 /\ undef406 = 2, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l13, l6, __rho_1_^0 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef146 = 1 /\ undef411 = 1 /\ undef406 = 2, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l13, l6, 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ 1 <= undef504 /\ undef490 = undef504, {num^0 -> 0, rest remain the same}>
<l13, l6, __rho_1_^0 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= undef504 /\ undef490 = undef504 /\ undef146 = 1, {num^0 -> 0, rest remain the same}>
<l13, l6, Pdolen^0 <= i^0 /\ 1 <= __rho_1_^0, {num^0 -> 0, rest remain the same}>
<l13, l6, Pdolen^0 <= i^0 /\ __rho_1_^0 <= 0 /\ undef146 = 1, {num^0 -> 0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 6 , 2 )
( 13 , 1 )

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

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

Checking conditional termination of SCC {l13}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001285s
Ranking function: -1 + Pdolen^0 - i^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.003561

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l13, l6, undef406 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l13, l6, undef406 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest 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, l13, undef406 <= 0 /\ undef504 <= 0 /\ 1 <= __rho_1_^0 /\ 1 <= undef561 /\ __rho_1_^0 = undef561 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef579 = 0 /\ undef49 = 1 /\ undef411 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001135s

LOG: NarrowEntry size 1
It's unfeasible. Removing transition: 
<l13, l13, undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef406 = 1 /\ undef411 = 1, {i^0 -> 1 + i^0, rest remain the same}>
ENTRIES:
<l0, l13, 0 <= 0 /\ undef406 <= 0 /\ undef504 <= 0 /\ 1 <= __rho_1_^0 /\ 1 <= undef561 /\ __rho_1_^0 = undef561 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef579 = 0 /\ undef49 = 1 /\ undef411 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
END GRAPH:
EXIT: <l13, l6, undef406 <= 0 /\ undef504 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= __rho_1_^0 /\ undef391 = undef406 /\ undef490 = undef504 /\ undef411 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[62972 : 62973]
[62972 : 62974]
[62972 : 62975]

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

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

[62972 : 62976]
[62972 : 62977]
Successful child: 62976

Program does NOT terminate