/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, l4, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg3 -> arg2, arg4 -> undef4}>
<l2, l2, (arg1 >= arg2) /\ (arg1 > 1) /\ (arg2 > 4) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg1 - 1), arg4 -> undef8}>
<l2, l3, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) >= (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3), par{arg3 -> (arg1 + 1), arg4 -> (arg2 + 1)}>
<l2, l3, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) < (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3), par{arg3 -> (arg1 + 1), arg4 -> (arg2 - 1)}>
<l3, l2, (arg1 > 0) /\ (arg2 > 1) /\ (arg3 > 1) /\ (arg4 > 0) /\ (arg2 > arg1) /\ (arg2 >= arg3) /\ (arg1 <= arg4), par{arg1 -> arg3, arg2 -> arg4, arg4 -> undef20}>
<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) <= 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 2), arg3 -> (arg1 - 1), arg4 -> undef24}>
<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) > 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> undef28}>
<l4, l1, true, par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>

Fresh variables:
undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 

Undef variables:
undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef30) /\ (arg2 = undef30) /\ (arg3 = undef30) /\ (undef29 > 0) /\ (undef30 > ~(1))>
<l2, l2, (arg1 >= arg2) /\ (arg1 > 1) /\ (arg2 > 4) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg1 - 1)}>
<l2, l2, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) < (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3) /\ (arg1 > 0) /\ (arg2 > 1) /\ ((arg1 + 1) > 1) /\ ((arg2 - 1) > 0) /\ (arg2 > arg1) /\ (arg2 >= (arg1 + 1)) /\ (arg1 <= (arg2 - 1)), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 1), arg3 -> (arg1 + 1)}>
<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) <= 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 2), arg3 -> (arg1 - 1)}>
<l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) > 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg2 -> (arg2 + 1), arg3 -> arg1}>

Fresh variables:
undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 

Undef variables:
undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg2 <= arg1 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}>
<l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ 5 + arg2 <= arg1 /\ arg2 <= 4 /\ arg1 = arg3, {arg2 -> 1 + arg2, arg3 -> arg1, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {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.022044
Some transition disabled by a set of invariant(s):
Invariant at l2: arg3 <= 1 + arg2

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ 5 + arg2 <= arg1 /\ arg2 <= 4 /\ arg1 = arg3, {arg2 -> 1 + arg2, arg3 -> arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg2 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -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 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 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, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg3 <= 1 + arg2 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}>
Checking unfeasibility...
Time used: 0.103614

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002760s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.389912s
[5309 : 5310]
[5309 : 5311]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102238s
Time used: 4.10006
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.021581s
Cannot prove unreachability

[5309 : 5337]
[5309 : 5341]
Successful child: 5341

Program does NOT terminate