/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)) /\ (undef25 = undef25) /\ (undef24 = (0 + undef25)) /\ (undef21 = undef21) /\ ((0 + a_13^0) <= (0 + (2 * undef24))) /\ ((0 + (2 * undef24)) <= (0 + a_13^0)) /\ (undef19 = (0 + undef24)) /\ ((0 + undef19) <= (0 + undef24)) /\ ((0 + undef24) <= (0 + undef19)) /\ (1 <= (0 + (2 * undef24))), par{a_13^0 -> undef19, nondet_12^0 -> undef21, x_15^0 -> undef24}>
<l4, l2, true>
<l2, l5, (undef37 = undef37) /\ (1 <= (0 + a_13^0)) /\ (undef42 = undef42) /\ (undef38 = undef38), par{a_21^0 -> undef37, nondet_12^0 -> undef38, x_15^0 -> (0 + undef42)}>
<l5, l6, (undef43 = __disjvr_0^0) /\ (__disjvr_0^0 = undef43), par{__disjvr_0^0 -> undef43}>
<l6, l7, (undef53 = (1 + (3 * a_13^0))) /\ ((0 + undef53) <= (1 + (3 * a_21^0))) /\ ((1 + (3 * a_21^0)) <= (0 + undef53)), par{a_13^0 -> undef53}>
<l7, l8, (undef60 = __disjvr_1^0) /\ (__disjvr_1^0 = undef60), par{__disjvr_1^0 -> undef60}>
<l8, l9, (1 <= (0 + a_21^0))>
<l9, l2, true>
<l10, l1, true>

Fresh variables:
undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 

Undef variables:
undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 

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)) /\ (undef25 = undef25) /\ (undef24 = (0 + undef25)) /\ (undef21 = undef21) /\ ((0 + a_13^0) <= (0 + (2 * undef24))) /\ ((0 + (2 * undef24)) <= (0 + a_13^0)) /\ (undef19 = (0 + undef24)) /\ ((0 + undef19) <= (0 + undef24)) /\ ((0 + undef24) <= (0 + undef19)) /\ (1 <= (0 + (2 * undef24))), par{a_13^0 -> undef19}>
<l2, l2, (undef37 = undef37) /\ (1 <= (0 + a_13^0)) /\ (undef42 = undef42) /\ (undef38 = undef38) /\ (undef43 = __disjvr_0^0) /\ (__disjvr_0^0 = undef43) /\ (undef53 = (1 + (3 * a_13^0))) /\ ((0 + undef53) <= (1 + (3 * undef37))) /\ ((1 + (3 * undef37)) <= (0 + undef53)) /\ (undef60 = __disjvr_1^0) /\ (__disjvr_1^0 = undef60) /\ (1 <= (0 + undef37)), par{__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53}>

Fresh variables:
undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 

Undef variables:
undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, 

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 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
Variables:
a_13^0, __disjvr_0^0, __disjvr_1^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.004341

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001610s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009873s
[19362 : 19363]
[19362 : 19364]
Successful child: 19363
[ 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 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, 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 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, 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 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
Variables:
a_13^0, __disjvr_0^0, __disjvr_1^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001589s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009457s
[19362 : 19368]
[19362 : 19369]
Successful child: 19368
[ 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 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, 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 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, 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: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, 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 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= a_13^0 /\ 1 <= undef24 /\ a_13^0 = 2*undef24 /\ undef19 = undef24 /\ undef24 = undef25, {a_13^0 -> undef19, rest remain the same}>
<l2, l2, 1 <= a_13^0 /\ 1 <= undef37 /\ 1 + 3*a_13^0 = undef53 /\ 1 + 3*undef37 = undef53 /\ __disjvr_0^0 = undef43 /\ __disjvr_1^0 = undef60, {__disjvr_0^0 -> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}>
Variables:
a_13^0, __disjvr_0^0, __disjvr_1^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001651s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009724s
[19362 : 19373]
[19362 : 19374]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018664s
Time used: 0.017468

[19362 : 19380]
[19362 : 19381]
Successful child: 19380

Program does NOT terminate