/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, l8, true>
<l1, l2, ((1 + n_promoted_1^0) <= (0 + __const_1024^0)) /\ (undef5 = undef5), par{tmp___0^0 -> undef5}>
<l1, l2, ((0 + __const_1024^0) <= (0 + n_promoted_1^0))>
<l2, l3, true, par{i5^0 -> 0}>
<l4, l1, (1 <= (0 + n_promoted_1^0))>
<l4, l2, ((0 + n_promoted_1^0) <= 0)>
<l3, l5, true>
<l5, l6, true>
<l5, l3, true, par{i5^0 -> (1 + i5^0)}>
<l7, l4, (undef44 = undef44), par{n_promoted_1^0 -> (0 + undef44), tmp^0 -> undef44}>
<l8, l7, true>

Fresh variables:
undef5, undef44, 

Undef variables:
undef5, undef44, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i5^0 = 0) /\ (undef44 = undef44) /\ (1 <= (0 + (0 + undef44))) /\ ((1 + (0 + undef44)) <= (0 + __const_1024^0)) /\ (undef5 = undef5)>
<l0, l3, (i5^0 = 0) /\ (undef44 = undef44) /\ (1 <= (0 + (0 + undef44))) /\ ((0 + __const_1024^0) <= (0 + (0 + undef44)))>
<l0, l3, (i5^0 = 0) /\ (undef44 = undef44) /\ ((0 + (0 + undef44)) <= 0)>
<l3, l6, true>
<l3, l3, true, par{i5^0 -> (1 + i5^0)}>

Fresh variables:
undef5, undef44, 

Undef variables:
undef5, undef44, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
Variables:
i5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1 <= undef44 /\ __const_1024^0 <= undef44 /\ i5^0 = 0, {all remain the same}>
<l0, l3, undef44 <= 0 /\ i5^0 = 0, {all remain the same}>

Graph 2
<l3, l6, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000472s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000862s
[24493 : 24494]
[24493 : 24495]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000461s
Time used: 1.00033

LOG: SAT solveNonLinear - Elapsed time: 1.004912s
Cost: 1; Total time: 1.0045
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= i5^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, 0 <= i5^0, {i5^0 -> 1 + i5^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, 0 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
Quasi-ranking function: 50000 - i5^0
New Graphs: 
Transitions:
<l3, l3, 50001 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
Variables:
i5^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000404s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001185s
[24493 : 24500]
[24493 : 24501]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102102s
Time used: 4.10181
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l3, 1 + undef44 <= __const_1024^0 /\ 1 <= undef44 /\ i5^0 = 0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[24493 : 24505]
[24493 : 24506]
Successful child: 24505

Program does NOT terminate