/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 -> 0, arg2 -> 0, arg3 -> (10 * arg2)}>
<l2, l3, (arg3 < 10) /\ (arg3 > 1), par{arg2 -> arg3, arg3 -> arg2}>
<l2, l3, (arg3 > 10), par{arg2 -> arg3, arg3 -> arg2}>
<l3, l2, (arg1 < 2) /\ (arg2 > 1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg2 - 1)}>
<l2, l2, (arg1 < 2) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 2}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>
<l3, l2, (arg1 < 2) /\ (arg2 > 1) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg2 + 1)}>
<l4, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}>

Fresh variables:
undef22, undef23, undef24, 

Undef variables:
undef22, undef23, undef24, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = (10 * undef23)) /\ (undef22 > 0) /\ (undef23 > ~(1))>
<l2, l2, (arg3 < 10) /\ (arg3 > 1) /\ (arg1 < 2) /\ (arg3 > 1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg3 < 10) /\ (arg3 > 1) /\ (arg1 < 2) /\ (arg3 > 1) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg3 > 10) /\ (arg1 < 2) /\ (arg3 > 1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg3 > 10) /\ (arg1 < 2) /\ (arg3 > 1) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 < 2) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 2}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>

Fresh variables:
undef22, undef23, undef24, 

Undef variables:
undef22, undef23, undef24, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {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.752391

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007575s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.096249s
[26374 : 26375]
[26374 : 26376]
Successful child: 26375
[ 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 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, 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 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, 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 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, 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 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, 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 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, 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 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, 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 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, 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 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, 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 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, 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 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, 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 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, 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 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000983s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg3 <= 0 , 
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>

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

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

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002919s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.098220s
[26374 : 26488]
[26374 : 26489]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103755s
Time used: 4.10027

[26374 : 26493]
[26374 : 26497]
Successful child: 26493

Program does NOT terminate