/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, l6, true>
<l1, l2, true>
<l2, l3, ((0 + (~(1) * x_5^0)) <= 0) /\ ((0 + x_5^0) <= 0) /\ (undef3 = undef3), par{Result_4^0 -> undef3}>
<l2, l4, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef7 = undef7), par{x_5^0 -> (2 + undef7)}>
<l4, l2, true>
<l2, l5, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef12 = undef12), par{x_5^0 -> (~(2) + undef12)}>
<l5, l2, true>
<l6, l1, true>

Fresh variables:
undef3, undef7, undef12, 

Undef variables:
undef3, undef7, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((0 + (~(1) * x_5^0)) <= 0) /\ ((0 + x_5^0) <= 0) /\ (undef3 = undef3)>
<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef7 = undef7), par{x_5^0 -> (2 + undef7)}>
<l2, l2, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef12 = undef12), par{x_5^0 -> (~(2) + undef12)}>

Fresh variables:
undef3, undef7, undef12, 

Undef variables:
undef3, undef7, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_5^0, {x_5^0 -> 2 + undef7, rest remain the same}>
<l2, l2, 1 + x_5^0 <= 0, {x_5^0 -> -2 + undef12, rest remain the same}>
Variables:
x_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l3, x_5^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.00233

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000707s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002643s
[27738 : 27739]
[27738 : 27740]
Successful child: 27739
[ 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 <= x_5^0, {x_5^0 -> 2 + undef7, 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 + x_5^0 <= 0, {x_5^0 -> -2 + undef12, 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 <= x_5^0, {x_5^0 -> 2 + undef7, 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 + x_5^0 <= 0, {x_5^0 -> -2 + undef12, rest remain the same}>
New Graphs: 
[27738 : 27744]
[27738 : 27745]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: x_5^0 <= 0 , 0 <= x_5^0 , 
Narrowing transition: 
<l2, l2, 1 <= x_5^0, {x_5^0 -> 2 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 + x_5^0 <= 0, {x_5^0 -> -2 + undef12, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= x_5^0, {x_5^0 -> 2 + undef7, rest remain the same}>
<l2, l2, 1 + x_5^0 <= 0, {x_5^0 -> -2 + undef12, rest remain the same}>
Variables:
x_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000688s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002743s
[27738 : 27746]
[27738 : 27747]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009344s
Time used: 0.009007

[27738 : 27751]
[27738 : 27755]
Successful child: 27755

Program does NOT terminate