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

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (2 <= (0 + x^0))>
<l1, l1, (undef3 = undef3) /\ (2 <= (0 + ((0 + x^0) + (~(1) * y^0)))), par{x^0 -> ((0 + x^0) + (~(1) * y^0)), z^0 -> undef3}>
<l1, l1, (2 <= (0 + z^0)), par{y^0 -> (1 + y^0), z^0 -> (~(1) + z^0)}>

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
<l1, l1, 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 2 <= x^0, {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.004355

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001040s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003615s
[18576 : 18586]
[18576 : 18587]
Successful child: 18586
[ 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, 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 <= y^0 /\ 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 <= y^0 /\ 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
New Graphs: 
Transitions:
<l1, l1, x^0 <= y^0 /\ 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000866s
Ranking function: -2 + z^0
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001074s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006274s
[18576 : 18640]
[18576 : 18641]
Successful child: 18640
[ 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, 0 <= y^0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 0 <= y^0 /\ 1 + y^0 <= x^0 /\ 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
Ranking function: x^0 - y^0
New Graphs: 
Transitions:
<l1, l1, 0 <= y^0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000735s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002183s
[18576 : 18646]
[18576 : 18647]
Successful child: 18646
[ 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 <= y^0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, 1 + y^0 <= x^0 /\ 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002537s
Ranking function: -1 - 2*y^0
New Graphs: 
Transitions:
<l1, l1, 2 + y^0 <= x^0 /\ y^0 = 0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
<l1, l1, 1 + y^0 <= 0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
<l1, l1, 1 + y^0 <= x^0 /\ 2 <= z^0 /\ y^0 = 0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001850s
Ranking function: -y^0
New Graphs: 
Transitions:
<l1, l1, 2 + y^0 <= x^0 /\ y^0 = 0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
<l1, l1, 1 + y^0 <= 0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001085s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004115s
[18576 : 18652]
[18576 : 18653]
Successful child: 18652
[ 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, 2 + y^0 <= x^0 /\ y^0 = 0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + y^0 <= 0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= x^0 /\ 2 <= z^0 /\ y^0 = 0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= z^0, {y^0 -> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + y^0 <= 0 /\ 2 + y^0 <= x^0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 2 + y^0 <= x^0 /\ y^0 = 0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
New Graphs: 
Transitions:
<l1, l1, 2 + y^0 <= x^0 /\ y^0 = 0, {x^0 -> x^0 - y^0, z^0 -> undef3, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000716s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002074s
[18576 : 18660]
[18576 : 18661]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010781s
Time used: 0.010452

[18576 : 18811]
[18576 : 18815]
Successful child: 18815

Program does NOT terminate