/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, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)>
<l2, l3, (undef8 > ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}>
<l3, l3, (~(5) = arg1), par{arg1 -> ~(5), arg2 -> undef12}>
<l3, l3, (arg1 < 0) /\ (arg1 < ~(5)), par{arg1 -> (arg1 + 1), arg2 -> undef14}>
<l3, l3, (arg1 < 0) /\ (arg1 > ~(5)), par{arg1 -> (arg1 + 1), arg2 -> undef16}>
<l4, l1, true, par{arg1 -> undef17, arg2 -> undef18}>

Fresh variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 

Undef variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (arg1 = (0 - undef8)) /\ (undef3 > ~(1)) /\ (undef18 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef17 > 0) /\ (undef8 > ~(1)) /\ (undef18 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef17 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0)>
<l3, l3, (~(5) = arg1), par{arg1 -> ~(5)}>
<l3, l3, (arg1 < 0) /\ (arg1 < ~(5)), par{arg1 -> (arg1 + 1)}>
<l3, l3, (arg1 < 0) /\ (arg1 > ~(5)), par{arg1 -> (arg1 + 1)}>

Fresh variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 

Undef variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef17 /\ 2 <= undef18 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ arg1 + undef8 = 0 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.005163

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001101s
Ranking function: -6 - arg1
New Graphs: 
Transitions:
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>
<l3, l3, 1 + arg1 <= 0 /\ 0 <= 4 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000783s
Ranking function: -1 - arg1
New Graphs: 
Transitions:
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000354s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000987s
[44365 : 44366]
[44365 : 44367]
Successful child: 44366
[ 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: 
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 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): 
<l3, l3, 1 + arg1 <= 0 /\ 0 <= 4 + 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: 
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:0 <= 4 + arg1 - Process 1
* Exit transition: <l0, l3, 1 <= undef17 /\ 2 <= undef18 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ arg1 + undef8 = 0 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {all remain the same}>
* Postcondition  : 0 <= 4 + arg1

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000825s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: 0 <= 4 + arg1 , 
Narrowing transition: 
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l3, 1 + arg1 <= 0 /\ 0 <= 4 + arg1, {arg1 -> 1 + arg1, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>
<l3, l3, 6 + arg1 <= 0, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000811s
Ranking function: -5 - arg1
New Graphs: 
Transitions:
<l3, l3, 5 + arg1 = 0, {arg1 -> -5, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000364s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001037s
[44365 : 44371]
[44365 : 44372]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.392535s
Time used: 0.392276

[44365 : 44376]
[44365 : 44380]
Successful child: 44376

Program does NOT terminate