/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, l7, true>
<l1, l2, true>
<l1, l3, (undef12 = undef12), par{fvalue3^0 -> undef12, up5^0 -> (~(1) + low6^0)}>
<l1, l2, true>
<l4, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef33 = (0 + fvalue3^0)), par{ret_binary_search7^0 -> undef33, tmp^0 -> (0 + undef33)}>
<l4, l1, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{mid4^0 -> undef41}>
<l3, l4, true>
<l2, l3, true, par{low6^0 -> (1 + mid4^0)}>
<l2, l3, true, par{up5^0 -> (~(1) + mid4^0)}>
<l6, l3, true, par{fvalue3^0 -> ~(1), low6^0 -> 0, up5^0 -> (0 + __const_14^0), x2^0 -> (0 + __const_8^0)}>
<l7, l6, true>

Fresh variables:
undef12, undef33, undef41, 

Undef variables:
undef12, undef33, undef41, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (fvalue3^0 = ~(1)) /\ (low6^0 = 0) /\ (up5^0 = (0 + __const_14^0))>
<l3, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef33 = (0 + fvalue3^0))>
<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{low6^0 -> (1 + undef41)}>
<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{up5^0 -> (~(1) + undef41)}>
<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41) /\ (undef12 = undef12), par{fvalue3^0 -> undef12, up5^0 -> (~(1) + low6^0)}>
<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{low6^0 -> (1 + undef41)}>
<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{up5^0 -> (~(1) + undef41)}>

Fresh variables:
undef12, undef33, undef41, 

Undef variables:
undef12, undef33, undef41, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^0, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
Variables:
low6^0, up5^0, fvalue3^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}>

Graph 2
<l3, l5, 1 + up5^0 <= low6^0 /\ fvalue3^0 = undef33, {all 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.012269

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002015s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008016s
Piecewise ranking function: min(1 - 3*low6^0 + 3*up5^0,0)
New Graphs: 
Transitions:
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
Variables:
low6^0, up5^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001138s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006034s
[54264 : 54265]
[54264 : 54266]
Successful child: 54265
[ 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, low6^0 <= up5^0, {low6^0 -> 1 + undef41, 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, low6^0 <= up5^0, {up5^0 -> -1 + undef41, 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, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^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, low6^0 <= up5^0, {low6^0 -> 1 + undef41, 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, low6^0 <= up5^0, {up5^0 -> -1 + undef41, 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, low6^0 <= up5^0, {low6^0 -> 1 + undef41, 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, low6^0 <= up5^0, {up5^0 -> -1 + undef41, 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, low6^0 <= up5^0, {low6^0 -> 1 + undef41, 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, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000815s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + up5^0 <= low6^0 , 
Narrowing transition: 
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^0, rest remain the same}>
Narrowing transition: 
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
Variables:
low6^0, up5^0, fvalue3^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001201s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006341s
[54264 : 54270]
[54264 : 54271]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037034s
Time used: 0.036205

[54264 : 54276]
[54264 : 54280]
Successful child: 54280

Program does NOT terminate