/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, l4, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
<l2, l3, (arg1 < 50) /\ (arg1 > 19), par{arg2 -> undef4}>
<l2, l3, (arg1 < 20) /\ (arg1 < 50) /\ (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
<l3, l2, (arg1 < 30) /\ (arg1 < 11), par{arg2 -> undef8}>
<l3, l2, (arg1 < 29) /\ (arg1 > 10), par{arg1 -> (arg1 + 1), arg2 -> undef10}>
<l3, l2, (arg1 > 39), par{arg1 -> (arg1 + 1), arg2 -> undef12}>
<l3, l2, (arg1 < 40) /\ (arg1 > 28), par{arg2 -> undef14}>
<l4, l1, true, par{arg1 -> undef15, arg2 -> undef16}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))>
<l2, l2, (arg1 < 50) /\ (arg1 > 19) /\ (arg1 < 29) /\ (arg1 > 10), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 < 50) /\ (arg1 > 19) /\ (arg1 > 39), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 < 50) /\ (arg1 > 19) /\ (arg1 < 40) /\ (arg1 > 28)>
<l2, l2, (arg1 < 20) /\ (arg1 < 50) /\ (arg1 > 0) /\ ((arg1 - 1) < 30) /\ ((arg1 - 1) < 11), par{arg1 -> (arg1 - 1)}>
<l2, l2, (arg1 < 20) /\ (arg1 < 50) /\ (arg1 > 0) /\ ((arg1 - 1) < 29) /\ ((arg1 - 1) > 10), par{arg1 -> ((arg1 - 1) + 1)}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 20 <= arg1 /\ arg1 <= 28, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 40 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 29 <= arg1 /\ arg1 <= 39, {all remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 11, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, arg1 <= 19 /\ 12 <= arg1, {all remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = undef16, {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.007365

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001273s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.037860s
Piecewise ranking function: min(370,-37 + 37*arg1)
New Graphs: 
Transitions:
<l2, l2, 20 <= arg1 /\ arg1 <= 28, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 40 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 29 <= arg1 /\ arg1 <= 39, {all remain the same}>
<l2, l2, arg1 <= 19 /\ 12 <= arg1, {all remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001008s
Ranking function: 98 - 2*arg1
New Graphs: 
Transitions:
<l2, l2, 29 <= arg1 /\ arg1 <= 39, {all remain the same}>
<l2, l2, arg1 <= 19 /\ 12 <= arg1, {all remain the same}>
Variables:
arg1
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal 40 <= arg1 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:40 <= arg1 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : 40 <= arg1
Quasi-invariants: 
Location 2: 40 <= arg1 ; 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000587s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, 20 <= arg1 /\ arg1 <= 28, {arg1 -> 1 + arg1, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, 40 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
Narrowing transition: 
<l2, l2, 29 <= arg1 /\ arg1 <= 39, {all remain the same}>

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

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 19 /\ 12 <= arg1, {all remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 <= 39 /\ arg1 = undef16, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 20 <= arg1 /\ arg1 <= 28, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 29 <= arg1 /\ arg1 <= 39, {all remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 11, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, arg1 <= 19 /\ 12 <= arg1, {all remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: 40 <= arg1


LOG: Try proving POST
[39040 : 39041]
[39040 : 39042]
[39040 : 39043]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 1.136432s

[39040 : 39179]
[39040 : 39183]
Successful child: 39179

Program does NOT terminate