/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, l14, true>
<l1, l2, true>
<l3, l4, (undef31 = undef31), par{__rho_1_^0 -> undef31, num^0 -> 0}>
<l5, l3, true>
<l6, l5, ((1 + status^0) <= 2)>
<l6, l5, (3 <= (0 + status^0))>
<l6, l5, (2 <= (0 + status^0)) /\ ((0 + status^0) <= 2), par{a1111^0 -> (0 + DName^0), num^0 -> (1 + num^0)}>
<l7, l6, true, par{Pdoi^0 -> 0}>
<l8, l9, (1 <= (0 + status^0)) /\ ((0 + status^0) <= 1), par{i^0 -> (1 + i^0)}>
<l8, l7, ((1 + status^0) <= 1)>
<l8, l7, (2 <= (0 + status^0))>
<l9, l10, true>
<l11, l8, ((0 + DName^0) <= 0) /\ (undef311 = undef311) /\ (undef306 = (0 + undef311)) /\ (undef293 = (0 + undef306)) /\ (undef313 = 1), par{__rho_3_^0 -> undef293, a77^0 -> (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef306, status^0 -> (0 + undef293), tmp99^0 -> undef311}>
<l11, l3, (1 <= (0 + DName^0))>
<l4, l12, true>
<l12, l4, true>
<l10, l11, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef415 = undef415) /\ (undef412 = (0 + undef415)) /\ (undef397 = (0 + undef412)), par{DName^0 -> (0 + undef397), __rho_2_^0 -> undef397, a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef412, tmp55^0 -> undef415}>
<l10, l3, ((0 + Pdolen^0) <= (0 + i^0))>
<l13, l9, (undef469 = 0) /\ (undef470 = (0 + undef469)) /\ (undef471 = 1), par{set^0 -> 0, unset^0 -> undef469}>
<l14, l13, true>

Fresh variables:
undef31, undef293, undef306, undef311, undef313, undef397, undef412, undef415, undef469, undef470, undef471, 

Undef variables:
undef31, undef293, undef306, undef311, undef313, undef397, undef412, undef415, undef469, undef470, undef471, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l9, (undef469 = 0) /\ (undef470 = (0 + undef469)) /\ (undef471 = 1)>
<l4, l4, true>
<l9, l9, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef415 = undef415) /\ (undef412 = (0 + undef415)) /\ (undef397 = (0 + undef412)) /\ ((0 + (0 + undef397)) <= 0) /\ (undef311 = undef311) /\ (undef306 = (0 + undef311)) /\ (undef293 = (0 + undef306)) /\ (undef313 = 1) /\ (1 <= (0 + (0 + undef293))) /\ ((0 + (0 + undef293)) <= 1), par{i^0 -> (1 + i^0)}>
<l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef415 = undef415) /\ (undef412 = (0 + undef415)) /\ (undef397 = (0 + undef412)) /\ ((0 + (0 + undef397)) <= 0) /\ (undef311 = undef311) /\ (undef306 = (0 + undef311)) /\ (undef293 = (0 + undef306)) /\ (undef313 = 1) /\ ((1 + (0 + undef293)) <= 1) /\ ((1 + (0 + undef293)) <= 2) /\ (undef31 = undef31), par{Pdoi^0 -> 0, num^0 -> 0}>
<l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef415 = undef415) /\ (undef412 = (0 + undef415)) /\ (undef397 = (0 + undef412)) /\ ((0 + (0 + undef397)) <= 0) /\ (undef311 = undef311) /\ (undef306 = (0 + undef311)) /\ (undef293 = (0 + undef306)) /\ (undef313 = 1) /\ (2 <= (0 + (0 + undef293))) /\ (3 <= (0 + (0 + undef293))) /\ (undef31 = undef31), par{Pdoi^0 -> 0, num^0 -> 0}>
<l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef415 = undef415) /\ (undef412 = (0 + undef415)) /\ (undef397 = (0 + undef412)) /\ ((0 + (0 + undef397)) <= 0) /\ (undef311 = undef311) /\ (undef306 = (0 + undef311)) /\ (undef293 = (0 + undef306)) /\ (undef313 = 1) /\ (2 <= (0 + (0 + undef293))) /\ (2 <= (0 + (0 + undef293))) /\ ((0 + (0 + undef293)) <= 2) /\ (undef31 = undef31), par{Pdoi^0 -> 0, num^0 -> 0}>
<l9, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef415 = undef415) /\ (undef412 = (0 + undef415)) /\ (undef397 = (0 + undef412)) /\ (1 <= (0 + (0 + undef397))) /\ (undef31 = undef31), par{num^0 -> 0}>
<l9, l4, ((0 + Pdolen^0) <= (0 + i^0)) /\ (undef31 = undef31), par{num^0 -> 0}>

Fresh variables:
undef31, undef293, undef306, undef311, undef313, undef397, undef412, undef415, undef469, undef470, undef471, 

Undef variables:
undef31, undef293, undef306, undef311, undef313, undef397, undef412, undef415, undef469, undef470, undef471, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l9, l9, undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef293 = 1 /\ undef313 = 1, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
Pdolen^0, i^0

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

Precedence: 
Graph 0

Graph 1
<l0, l9, undef469 = 0 /\ undef469 = undef470 /\ undef471 = 1, {all remain the same}>

Graph 2
<l9, l4, undef293 <= 0 /\ undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef313 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l9, l4, undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 3 <= undef293 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef313 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l9, l4, undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef313 = 1 /\ undef293 = 2, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
<l9, l4, 1 + i^0 <= Pdolen^0 /\ 1 <= undef397 /\ undef397 = undef412 /\ undef412 = undef415, {num^0 -> 0, rest remain the same}>
<l9, l4, Pdolen^0 <= i^0, {num^0 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l9, l4, undef293 <= 0 /\ undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef313 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l9, l4, undef293 <= 0 /\ undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef313 = 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, l9, undef293 <= 0 /\ undef397 <= 0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef469 = 0 /\ undef469 = undef470 /\ undef313 = 1 /\ undef471 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001159s

LOG: NarrowEntry size 1
It's unfeasible. Removing transition: 
<l9, l9, undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef293 = 1 /\ undef313 = 1, {i^0 -> 1 + i^0, rest remain the same}>
ENTRIES:
<l0, l9, 0 <= 0 /\ undef293 <= 0 /\ undef397 <= 0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef469 = 0 /\ undef469 = undef470 /\ undef313 = 1 /\ undef471 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
END GRAPH:
EXIT: <l9, l4, undef293 <= 0 /\ undef397 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef293 = undef306 /\ undef306 = undef311 /\ undef397 = undef412 /\ undef412 = undef415 /\ undef313 = 1, {Pdoi^0 -> 0, num^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[16352 : 16353]
[16352 : 16354]
[16352 : 16355]

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

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

[16352 : 16356]
[16352 : 16357]
Successful child: 16356

Program does NOT terminate