/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, l3, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
<l2, l2, (arg1 < 2) /\ (arg1 < ~(5)) /\ (arg1 < 0), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef4}>
<l2, l2, (arg1 < 2) /\ (arg1 < ~(5)) /\ (arg1 > 0), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef6}>
<l2, l2, (arg1 < 6) /\ (arg1 > ~(6)) /\ (arg1 < 0), par{arg1 -> 0, arg2 -> undef8}>
<l2, l2, (arg1 < 6) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef10}>
<l2, l2, (arg1 > 5), par{arg1 -> ((~(1) * arg1) - 1), arg2 -> undef12}>
<l3, l1, true, par{arg1 -> undef13, arg2 -> undef14}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef14) /\ (undef13 > 0) /\ (undef14 > ~(1))>
<l2, l2, (arg1 < 2) /\ (arg1 < ~(5)) /\ (arg1 < 0), par{arg1 -> ((~(1) * arg1) + 1)}>
<l2, l2, (arg1 < 6) /\ (arg1 > ~(6)) /\ (arg1 < 0), par{arg1 -> 0}>
<l2, l2, (arg1 < 6) /\ (arg1 > 0), par{arg1 -> 0}>
<l2, l2, (arg1 > 5), par{arg1 -> ((~(1) * arg1) - 1)}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 6 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
<l2, l2, 1 + arg1 <= 0 /\ 0 <= 5 + arg1, {arg1 -> 0, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 5, {arg1 -> 0, rest remain the same}>
<l2, l2, 6 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ arg1 = undef14, {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.005206

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001248s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.078406s
[4310 : 4311]
[4310 : 4312]
Successful child: 4311
[ 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, 6 + arg1 <= 0, {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, 1 + arg1 <= 0 /\ 0 <= 3 + arg1, {arg1 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= arg1 /\ arg1 <= 2, {arg1 -> 0, 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, 6 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 1 + arg1 <= 0 /\ 0 <= 3 + arg1, {arg1 -> 0, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 2, {arg1 -> 0, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000791s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009945s
[4310 : 4316]
[4310 : 4317]
Successful child: 4317
Ranking function: arg1
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 1 + arg1 <= 0 /\ 0 <= 3 + arg1, {arg1 -> 0, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000816s
Ranking function: -1 - arg1
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 2
It's unfeasible. Removing transition: 
<l2, l2, 1 + arg1 <= 0 /\ 0 <= 5 + arg1, {arg1 -> 0, rest remain the same}>
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ arg1 <= 5, {arg1 -> 0, rest remain the same}>
Narrowing transition: 
<l2, l2, 6 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 6 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
<l2, l2, 6 <= 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.000728s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008234s
[4310 : 4322]
[4310 : 4323]
Successful child: 4322
[ 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, 6 + arg1 <= 0, {arg1 -> 1 - arg1, 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, 6 <= 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, 6 + arg1 <= 0, {arg1 -> 1 - arg1, 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, 6 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:arg1 <= 5 - Process 2
* Exit transition: <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ 3 <= arg1 /\ arg1 = undef14, {all remain the same}>
* Postcondition  : arg1 <= 5

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000940s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg1 <= 5 , 0 <= 4 + arg1 , 
Narrowing transition: 
<l2, l2, 6 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>

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

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 6 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
<l2, l2, 6 <= 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.000757s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008332s
[4310 : 4327]
[4310 : 4328]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009059s
Time used: 0.008753

[4310 : 4332]
[4310 : 4336]
Successful child: 4332

Program does NOT terminate