/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, l8, true>
<l1, l2, ((0 + conditional^0) <= 1)>
<l1, l3, (2 <= (0 + conditional^0)), par{num^0 -> (1 + num^0)}>
<l4, l3, ((0 + conditional^0) <= 1), par{IoCreateDevice^0 -> 0, i^0 -> (1 + i^0), status^0 -> 1}>
<l4, l1, (2 <= (0 + conditional^0)) /\ (undef37 = undef37), par{IoCreateDevice^0 -> 0, Pdo^0 -> 0, conditional^0 -> undef37}>
<l2, l5, true, par{PPBunlockInits^0 -> 1, num^0 -> 0}>
<l6, l2, ((0 + DName^0) <= 0)>
<l6, l4, (1 <= (0 + DName^0)) /\ (undef67 = undef67), par{IoCreateDevice^0 -> 1, conditional^0 -> undef67}>
<l3, l2, ((0 + Pdolen^0) <= (0 + i^0)), par{status^0 -> 0}>
<l3, l6, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef81 = undef81), par{DName^0 -> undef81, PPBlockInits^0 -> 1, status^0 -> 0}>
<l7, l3, (undef98 = undef98) /\ (undef96 = undef96), par{IoCreateDevice^0 -> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef96, i^0 -> undef98, status^0 -> 0}>
<l8, l7, true>

Fresh variables:
undef37, undef67, undef81, undef96, undef98, 

Undef variables:
undef37, undef67, undef81, undef96, undef98, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (Pdolen^0 = undef96) /\ (i^0 = undef98) /\ (undef98 = undef98) /\ (undef96 = undef96)>
<l3, l5, ((0 + Pdolen^0) <= (0 + i^0)), par{num^0 -> 0}>
<l3, l5, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef81 = undef81) /\ ((0 + undef81) <= 0), par{num^0 -> 0}>
<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef81 = undef81) /\ (1 <= (0 + undef81)) /\ (undef67 = undef67) /\ ((0 + undef67) <= 1), par{i^0 -> (1 + i^0)}>
<l3, l5, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef81 = undef81) /\ (1 <= (0 + undef81)) /\ (undef67 = undef67) /\ (2 <= (0 + undef67)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 1), par{num^0 -> 0}>
<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef81 = undef81) /\ (1 <= (0 + undef81)) /\ (undef67 = undef67) /\ (2 <= (0 + undef67)) /\ (undef37 = undef37) /\ (2 <= (0 + undef37)), par{num^0 -> (1 + num^0)}>

Fresh variables:
undef37, undef67, undef81, undef96, undef98, 

Undef variables:
undef37, undef67, undef81, undef96, undef98, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, Pdolen^0 = undef96 /\ i^0 = undef98, {all remain the same}>

Graph 2
<l3, l5, Pdolen^0 <= i^0, {num^0 -> 0, rest remain the same}>
<l3, l5, undef81 <= 0 /\ 1 + i^0 <= Pdolen^0, {num^0 -> 0, rest remain the same}>
<l3, l5, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef67 /\ undef37 <= 1, {num^0 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001595s
Ranking function: -6 + 6*Pdolen^0 - 6*i^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000703s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002792s
[24187 : 24197]
[24187 : 24198]
Successful child: 24197
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 1
* Exit transition: <l0, l3, Pdolen^0 = undef96 /\ i^0 = undef98, {all remain the same}>
* Postcondition  : Pdolen^0 <= i^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000733s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: Pdolen^0 <= i^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001682s
Ranking function: -6 + 6*Pdolen^0 - 6*i^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000716s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002882s
[24187 : 24218]
[24187 : 24219]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012701s
Time used: 0.012247
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020965s
Time used: 0.020961

LOG: SAT solveNonLinear - Elapsed time: 0.033666s
Cost: 1; Total time: 0.033208
Termination implied by a set of invariant(s):
Invariant at l3: i^0 <= 1 + Pdolen^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
Quasi-ranking function: 50000 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000800s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003208s
[24187 : 24466]
[24187 : 24467]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012934s
Time used: 0.012369
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021657s
Time used: 0.021653

LOG: SAT solveNonLinear - Elapsed time: 0.034591s
Cost: 1; Total time: 0.034022
Termination implied by a set of invariant(s):
Invariant at l3: i^0 <= 1 + Pdolen^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Quasi-ranking function: 50000 - Pdolen^0 + i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000933s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003993s
[24187 : 24472]
[24187 : 24473]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013277s
Time used: 0.012722
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013903s
Time used: 0.013899

LOG: SAT solveNonLinear - Elapsed time: 0.027180s
Cost: 1; Total time: 0.026621
Termination implied by a set of invariant(s):
Invariant at l3: i^0 <= Pdolen^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ undef67 <= 1, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67, {num^0 -> 1 + num^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Quasi-ranking function: 50000 + Pdolen^0 - i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001027s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004229s
[24187 : 24477]
[24187 : 24478]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012875s
Time used: 0.01221
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017724s
Time used: 0.017721

LOG: SAT solveNonLinear - Elapsed time: 0.030599s
Cost: 1; Total time: 0.029931
Quasi-ranking function: 50000 - Pdolen^0 - 50001*i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001156s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005912s
[24187 : 24721]
[24187 : 24722]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014689s
Time used: 0.013997
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018553s
Time used: 0.01855

LOG: SAT solveNonLinear - Elapsed time: 0.033243s
Cost: 1; Total time: 0.032547
Quasi-ranking function: 50000 + 50004*Pdolen^0 + i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001260s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011093s
[24187 : 24901]
[24187 : 24902]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014898s
Time used: 0.014171
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018199s
Time used: 0.018195

LOG: SAT solveNonLinear - Elapsed time: 0.033097s
Cost: 1; Total time: 0.032366
Quasi-ranking function: 50000 - i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001373s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009071s
[24187 : 24906]
[24187 : 24907]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014706s
Time used: 0.01397
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019602s
Time used: 0.019598

LOG: SAT solveNonLinear - Elapsed time: 0.034308s
Cost: 1; Total time: 0.033568
Quasi-ranking function: 50000 + i^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001446s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011200s
[24187 : 24911]
[24187 : 24912]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016090s
Time used: 0.015304
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018928s
Time used: 0.018924

LOG: SAT solveNonLinear - Elapsed time: 0.035018s
Cost: 1; Total time: 0.034228
Quasi-ranking function: 50000 + Pdolen^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001626s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008377s
[24187 : 25308]
[24187 : 25309]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015564s
Time used: 0.014749
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018276s
Time used: 0.018272

LOG: SAT solveNonLinear - Elapsed time: 0.033841s
Cost: 1; Total time: 0.033021
Quasi-ranking function: 50000 - Pdolen^0 - num^0
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef81 /\ 2 <= undef37 /\ 2 <= undef67 /\ 50001 + Pdolen^0 <= i^0 + num^0 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 + i^0 <= Pdolen^0 + num^0 /\ 50001 <= Pdolen^0 + 50001*i^0 + num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 + 50004*Pdolen^0 + i^0 <= num^0 /\ 50001 + i^0 <= num^0 /\ 50001 <= i^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
Variables:
Pdolen^0, i^0, num^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001666s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019196s
[24187 : 25318]
[24187 : 25319]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015166s
Time used: 0.014003

[24187 : 25323]
[24187 : 25327]
Successful child: 25327

Program does NOT terminate