/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, l4, true>
<l1, l2, (1 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0)), y^0 -> (1 + y^0)}>
<l2, l1, true>
<l3, l1, true>
<l4, l3, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l1, (1 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0)), y^0 -> (1 + y^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:
<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0

Precedence: 
Graph 0

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

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000683s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001649s
[14477 : 14483]
[14477 : 14484]
Successful child: 14483
[ 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: 
<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^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: 
<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000312s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000684s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001722s
[14477 : 14501]
[14477 : 14502]
Successful child: 14501
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= x^0 /\ 1 <= y^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^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): 
<l1, l1, 1 <= x^0 /\ 1 <= y^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
Ranking function: x^0
New Graphs: 

LOG: CALL check - Post:1 <= y^0 - Process 2
* Exit transition: <l0, l1, 1 <= x^0, {all remain the same}>
* Postcondition  : 1 <= y^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000397s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= y^0 , 
Narrowing transition: 
<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000836s
Ranking function: -y^0
New Graphs: 
Program Terminates