/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, l10, true>
<l1, l2, true>
<l2, l3, ((1 + a_13^0) <= 1), par{result_11^0 -> (0 + temp0_14^0)}>
<l2, l4, (1 <= (0 + a_13^0)) /\ (undef19 = undef19) /\ (undef18 = (0 + undef19)) /\ (undef15 = undef15) /\ ((0 + a_13^0) <= (0 + (2 * undef18))) /\ ((0 + (2 * undef18)) <= (0 + a_13^0)) /\ (undef13 = (0 + undef18)) /\ ((0 + undef13) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef13)) /\ (1 <= (0 + (2 * undef18))), par{a_13^0 -> undef13, nondet_12^0 -> undef15, x_15^0 -> undef18}>
<l4, l2, true>
<l2, l5, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28), par{a_21^0 -> undef27, nondet_12^0 -> undef28, x_15^0 -> (0 + undef32)}>
<l5, l6, ((1 + a_13^0) <= (0 + (2 * x_15^0)))>
<l5, l6, ((1 + (2 * x_15^0)) <= (0 + a_13^0))>
<l6, l7, (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * a_21^0))) /\ ((1 + (3 * a_21^0)) <= (0 + undef45)), par{a_13^0 -> undef45}>
<l7, l8, ((1 + a_21^0) <= (0 + (2 * x_15^0)))>
<l7, l8, ((1 + (2 * x_15^0)) <= (0 + a_21^0))>
<l8, l9, (1 <= (0 + a_21^0))>
<l9, l2, true>
<l10, l1, true>

Fresh variables:
undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 

Undef variables:
undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((1 + a_13^0) <= 1)>
<l2, l2, (1 <= (0 + a_13^0)) /\ (undef19 = undef19) /\ (undef18 = (0 + undef19)) /\ (undef15 = undef15) /\ ((0 + a_13^0) <= (0 + (2 * undef18))) /\ ((0 + (2 * undef18)) <= (0 + a_13^0)) /\ (undef13 = (0 + undef18)) /\ ((0 + undef13) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef13)) /\ (1 <= (0 + (2 * undef18))), par{a_13^0 -> undef13}>
<l2, l2, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28) /\ ((1 + a_13^0) <= (0 + (2 * (0 + undef32)))) /\ (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * undef27))) /\ ((1 + (3 * undef27)) <= (0 + undef45)) /\ ((1 + undef27) <= (0 + (2 * (0 + undef32)))) /\ (1 <= (0 + undef27)), par{a_13^0 -> undef45}>
<l2, l2, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28) /\ ((1 + (2 * (0 + undef32))) <= (0 + a_13^0)) /\ (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * undef27))) /\ ((1 + (3 * undef27)) <= (0 + undef45)) /\ ((1 + (2 * (0 + undef32))) <= (0 + undef27)) /\ (1 <= (0 + undef27)), par{a_13^0 -> undef45}>

Fresh variables:
undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 

Undef variables:
undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
Variables:
a_13^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, a_13^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002082s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020233s
[39106 : 39107]
[39106 : 39108]
Successful child: 39107
[ 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: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:a_13^0 <= 0 - Process 1
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : a_13^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000505s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: a_13^0 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
Variables:
a_13^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002071s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019194s
[39106 : 39112]
[39106 : 39113]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020737s
Time used: 0.019433

[39106 : 39117]
[39106 : 39118]
Successful child: 39117

Program does NOT terminate