/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> (0 - undef4), arg2 -> (0 - undef3)}>
<l2, l2, (arg2 < arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + arg1)}>
<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>

Fresh variables:
undef3, undef4, undef7, undef8, 

Undef variables:
undef3, undef4, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = (0 - undef4)) /\ (arg2 = (0 - undef3)) /\ (undef3 > ~(1)) /\ (undef8 > 1) /\ (undef4 > ~(1)) /\ (undef7 > 0)>
<l2, l2, (arg2 < arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + arg1)}>

Fresh variables:
undef3, undef4, undef7, undef8, 

Undef variables:
undef3, undef4, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
Variables:
arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef7 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef8 /\ arg1 + undef4 = 0 /\ arg2 + undef3 = 0, {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.00223

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000594s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001694s
[49020 : 49026]
[49020 : 49027]
Successful child: 49026
[ 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, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, 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, 1 + arg2 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:arg1 <= arg2 - Process 1
* Exit transition: <l0, l2, 1 <= undef7 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef8 /\ arg1 + undef4 = 0 /\ arg2 + undef3 = 0, {all remain the same}>
* Postcondition  : arg1 <= arg2

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000534s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001791s
[49020 : 49115]
[49020 : 49116]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007577s
Time used: 0.007226
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001685s
Time used: 1.00039

LOG: SAT solveNonLinear - Elapsed time: 1.009262s
Cost: 1; Total time: 1.00762
Quasi-ranking function: 50000 - arg1
New Graphs: 
Transitions:
<l2, l2, 1 + arg2 <= arg1 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> arg1 + arg2, rest remain the same}>
Variables:
arg1, arg2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000751s
Ranking function: (~(1) / 50000) + (1 / 50000)*arg1 + (~(1) / 50000)*arg2
New Graphs: 
Program Terminates