/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, l16, true>
<l1, l2, true>
<l3, l4, true>
<l5, l3, ((0 + ___rho_1_^0) <= 0)>
<l5, l3, (1 <= (0 + ___rho_1_^0)) /\ (undef105 = 1), par{unset^0 -> 0}>
<l6, l5, (undef110 = undef110), par{___rho_1_^0 -> undef110, num^0 -> 0}>
<l7, l6, true>
<l8, l7, ((1 + status^0) <= 2)>
<l8, l7, (3 <= (0 + status^0))>
<l8, l7, (2 <= (0 + status^0)) /\ ((0 + status^0) <= 2), par{a1111^0 -> (0 + DName^0), num^0 -> (1 + num^0)}>
<l9, l8, true, par{Pdoi^0 -> 0}>
<l10, l11, (1 <= (0 + status^0)) /\ ((0 + status^0) <= 1), par{i^0 -> (1 + i^0)}>
<l10, l9, ((1 + status^0) <= 1)>
<l10, l9, (2 <= (0 + status^0))>
<l11, l12, true>
<l13, l10, ((0 + DName^0) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1), par{___rho_3_^0 -> undef372, a77^0 -> (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef385, status^0 -> (0 + undef372), tmp99^0 -> undef390}>
<l13, l6, (1 <= (0 + DName^0))>
<l4, l14, true>
<l14, l4, true>
<l12, l13, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)), par{DName^0 -> (0 + undef476), ___rho_2_^0 -> undef476, a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef491, tmp55^0 -> undef494}>
<l12, l6, ((0 + Pdolen^0) <= (0 + i^0))>
<l15, l11, (undef548 = 0) /\ (undef549 = (0 + undef548)) /\ (undef550 = 1), par{set^0 -> 0, unset^0 -> undef548}>
<l16, l15, true>

Fresh variables:
undef105, undef110, undef372, undef385, undef390, undef392, undef476, undef491, undef494, undef548, undef549, undef550, 

Undef variables:
undef105, undef110, undef372, undef385, undef390, undef392, undef476, undef491, undef494, undef548, undef549, undef550, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l11, (undef548 = 0) /\ (undef549 = (0 + undef548)) /\ (undef550 = 1)>
<l4, l4, true>
<l11, l11, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ (1 <= (0 + (0 + undef372))) /\ ((0 + (0 + undef372)) <= 1), par{i^0 -> (1 + i^0)}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ ((1 + (0 + undef372)) <= 1) /\ ((1 + (0 + undef372)) <= 2) /\ (undef110 = undef110) /\ ((0 + undef110) <= 0), par{Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ ((1 + (0 + undef372)) <= 1) /\ ((1 + (0 + undef372)) <= 2) /\ (undef110 = undef110) /\ (1 <= (0 + undef110)) /\ (undef105 = 1), par{Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ (2 <= (0 + (0 + undef372))) /\ (3 <= (0 + (0 + undef372))) /\ (undef110 = undef110) /\ ((0 + undef110) <= 0), par{Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ (2 <= (0 + (0 + undef372))) /\ (3 <= (0 + (0 + undef372))) /\ (undef110 = undef110) /\ (1 <= (0 + undef110)) /\ (undef105 = 1), par{Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ (2 <= (0 + (0 + undef372))) /\ (2 <= (0 + (0 + undef372))) /\ ((0 + (0 + undef372)) <= 2) /\ (undef110 = undef110) /\ ((0 + undef110) <= 0), par{Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ ((0 + (0 + undef476)) <= 0) /\ (undef390 = undef390) /\ (undef385 = (0 + undef390)) /\ (undef372 = (0 + undef385)) /\ (undef392 = 1) /\ (2 <= (0 + (0 + undef372))) /\ (2 <= (0 + (0 + undef372))) /\ ((0 + (0 + undef372)) <= 2) /\ (undef110 = undef110) /\ (1 <= (0 + undef110)) /\ (undef105 = 1), par{Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ (1 <= (0 + (0 + undef476))) /\ (undef110 = undef110) /\ ((0 + undef110) <= 0), par{___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef494 = undef494) /\ (undef491 = (0 + undef494)) /\ (undef476 = (0 + undef491)) /\ (1 <= (0 + (0 + undef476))) /\ (undef110 = undef110) /\ (1 <= (0 + undef110)) /\ (undef105 = 1), par{___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((0 + Pdolen^0) <= (0 + i^0)) /\ (undef110 = undef110) /\ ((0 + undef110) <= 0), par{___rho_1_^0 -> undef110, num^0 -> 0}>
<l11, l4, ((0 + Pdolen^0) <= (0 + i^0)) /\ (undef110 = undef110) /\ (1 <= (0 + undef110)) /\ (undef105 = 1), par{___rho_1_^0 -> undef110, num^0 -> 0}>

Fresh variables:
undef105, undef110, undef372, undef385, undef390, undef392, undef476, undef491, undef494, undef548, undef549, undef550, 

Undef variables:
undef105, undef110, undef372, undef385, undef390, undef392, undef476, undef491, undef494, undef548, undef549, undef550, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l11, l11, undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef372 = 1 /\ undef392 = 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, l11, undef548 = 0 /\ undef548 = undef549 /\ undef550 = 1, {all remain the same}>

Graph 2
<l11, l4, undef110 <= 0 /\ undef372 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, undef372 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= undef110 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef105 = 1 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, undef110 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 3 <= undef372 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= undef110 /\ 3 <= undef372 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef105 = 1 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, undef110 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef392 = 1 /\ undef372 = 2, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= undef110 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef105 = 1 /\ undef392 = 1 /\ undef372 = 2, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, undef110 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ 1 <= undef476 /\ undef476 = undef491 /\ undef491 = undef494, {___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, 1 + i^0 <= Pdolen^0 /\ 1 <= undef110 /\ 1 <= undef476 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef105 = 1, {___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, Pdolen^0 <= i^0 /\ undef110 <= 0, {___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
<l11, l4, Pdolen^0 <= i^0 /\ 1 <= undef110 /\ undef105 = 1, {___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l11, l4, undef110 <= 0 /\ undef372 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l11, l4, undef110 <= 0 /\ undef372 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, 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, l11, undef110 <= 0 /\ undef372 <= 0 /\ undef476 <= 0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef548 = 0 /\ undef548 = undef549 /\ undef392 = 1 /\ undef550 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001242s

LOG: NarrowEntry size 1
It's unfeasible. Removing transition: 
<l11, l11, undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef372 = 1 /\ undef392 = 1, {i^0 -> 1 + i^0, rest remain the same}>
ENTRIES:
<l0, l11, 0 <= 0 /\ undef110 <= 0 /\ undef372 <= 0 /\ undef476 <= 0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef548 = 0 /\ undef548 = undef549 /\ undef392 = 1 /\ undef550 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
END GRAPH:
EXIT: <l11, l4, undef110 <= 0 /\ undef372 <= 0 /\ undef476 <= 0 /\ 1 + i^0 <= Pdolen^0 /\ undef372 = undef385 /\ undef385 = undef390 /\ undef476 = undef491 /\ undef491 = undef494 /\ undef392 = 1, {Pdoi^0 -> 0, ___rho_1_^0 -> undef110, num^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[21256 : 21257]
[21256 : 21258]
[21256 : 21259]

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

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

[21256 : 21260]
[21256 : 21261]
Successful child: 21260

Program does NOT terminate