/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, l3, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
<l2, l2, (3 = arg1), par{arg1 -> 3, arg2 -> undef4}>
<l2, l2, (arg1 < 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1), arg2 -> undef6}>
<l2, l2, (arg1 > 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1), arg2 -> undef8}>
<l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}>

Fresh variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Undef variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))>
<l2, l2, (3 = arg1), par{arg1 -> 3}>
<l2, l2, (arg1 < 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1)}>

Fresh variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Undef variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001112s
Ranking function: 10 - 5*arg1
New Graphs: 
Transitions:
<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000783s
Ranking function: 9 - arg1
New Graphs: 
Transitions:
<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000355s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000977s
[24286 : 24287]
[24286 : 24288]
Successful child: 24287
[ 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, arg1 = 3, {arg1 -> 3, 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, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, 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, arg1 = 3, {arg1 -> 3, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:4 <= arg1 - Process 1
* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
* Postcondition  : 4 <= arg1

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000598s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 4 <= arg1 , 
Narrowing transition: 
<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000801s
Ranking function: 3 - arg1
New Graphs: 
Transitions:
<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000369s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001049s
[24286 : 24292]
[24286 : 24293]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033637s
Time used: 0.033236

[24286 : 24297]
[24286 : 24301]
Successful child: 24297

Program does NOT terminate