/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, l5, true>
<l1, l2, true>
<l2, l3, ((0 + x_13^0) <= 0), par{rt_11^0 -> (0 + st_14^0)}>
<l2, l4, (1 <= (0 + x_13^0)), par{x_13^0 -> ((0 + x_13^0) + y_15^0), y_15^0 -> (~(1) + y_15^0)}>
<l4, l2, true>
<l5, l1, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((0 + x_13^0) <= 0)>
<l2, l2, (1 <= (0 + x_13^0)), par{x_13^0 -> ((0 + x_13^0) + y_15^0), y_15^0 -> (~(1) + y_15^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_13^0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>
Variables:
x_13^0, y_15^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, x_13^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000466s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001433s
[49665 : 49666]
[49665 : 49667]
Successful child: 49666
[ 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 <= x_13^0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, 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 <= x_13^0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:x_13^0 <= 0 - Process 1
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : x_13^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000304s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: x_13^0 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= x_13^0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000472s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001493s
[49665 : 49671]
[49665 : 49672]
Successful child: 49671
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= x_13^0 /\ 1 + y_15^0 <= 0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= x_13^0 /\ 1 + y_15^0 <= 0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>
Ranking function: x_13^0
New Graphs: 

LOG: CALL check - Post:1 + y_15^0 <= 0 - Process 2
* Exit transition: <l0, l2, 1 <= x_13^0, {all remain the same}>
* Postcondition  : 1 + y_15^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000368s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_15^0 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= x_13^0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= y_15^0 /\ 1 <= x_13^0, {x_13^0 -> x_13^0 + y_15^0, y_15^0 -> -1 + y_15^0, rest remain the same}>
Variables:
x_13^0, y_15^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000687s
Ranking function: y_15^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l3}...
No cycles found.

Program Terminates