Remove ltl2tgba_lacim and all supporting classes.

This translator algorithm is seldom used in practice because we work
with explicit automata everywhere, and this is only useful to build
symbolic automata.  Furthermore, the symbolic automata produced by this
algorithm are larger (when looked at explicitly) than those produced by
ltl2tgba_fm or other explicit translators.

The nice side effect of this removal is that we can also remove a lot of
supporting classes, that were relying a lot on BDDs.

* src/tgba/public.hh, src/tgba/statebdd.cc, src/tgba/statebdd.hh,
src/tgba/succiterconcrete.cc, src/tgba/succiterconcrete.hh,
src/tgba/tgbabddconcrete.cc, src/tgba/tgbabddconcrete.hh,
src/tgba/tgbabddconcretefactory.cc, src/tgba/tgbabddconcretefactory.hh,
src/tgba/tgbabddconcreteproduct.cc, src/tgba/tgbabddconcreteproduct.hh,
src/tgba/tgbabddcoredata.cc, src/tgba/tgbabddcoredata.hh,
src/tgba/tgbabddfactory.hh, src/tgbaalgos/ltl2tgba_lacim.cc,
src/tgbaalgos/ltl2tgba_lacim.hh, src/tgbatest/bddprod.test,
src/tgbatest/mixprod.cc, src/tgbatest/mixprod.test: Delete all these
files.
* bench/ltlcounter/Makefile.am, bench/ltlcounter/README,
bench/ltlcounter/plot.gnu, bench/ltlcounter/run, src/tgba/Makefile.am,
src/tgbaalgos/Makefile.am, src/tgbatest/Makefile.am,
src/tgbatest/cycles.test, src/tgbatest/dupexp.test,
src/tgbatest/emptchk.test, src/tgbatest/ltl2tgba.cc,
src/tgbatest/ltl2tgba.test, src/tgbatest/ltlcross.test,
src/tgbatest/ltlprod.cc, src/tgbatest/spotlbtt.test,
src/tgbatest/wdba.test, src/tgbatest/wdba2.test,
src/tgba/tgbaexplicit.hh, wrap/python/ajax/ltl2tgba.html,
wrap/python/ajax/spot.in, wrap/python/spot.i,
wrap/python/tests/interdep.py, wrap/python/tests/ltl2tgba.py,
wrap/python/tests/ltl2tgba.test: Adjust.

wrap/python/ajax/ltl2tgba.html

@@ -565,7 +565,6 @@ an identifier: <span class="formula">aUb</span> is an atomic proposition, unlike
 	    <ul class="head">
 	      <li>Translator Algorithm:</li>
 	      <li><a href="#tabs-tfm" class="btip" title="A tableau construction that uses BDDs to symbolically represent each state of the automaton.  This is the best algorithm of the three, and the only one that has been extended to support PSL operators.">Couvreur/FM</a></li>
-	      <li><a href="#tabs-tla" class="btip" title="Builds a purely symbolic automaton, using BDDs to encode the transition relation.  The translation itself is fast (it uses a number of BDD operations that is linear in the size of the formula), but the resulting symbolic encoding is better used symbolically.  If you develop it explicitly (e.g. to draw it, as on this page) the result can easily have an exponential number of states.">Couvreur/LaCIM</a></li>
 	      <li><a href="#tabs-tta" class="btip" title="An implementation of Heikki Tauriainen's Ph.D. thesis algorithm to translate LTL formulas via very weak alternating automata with transition-based generalized acceptance conditions.">Tauriainen/TAA</a></li>
 	      <li><a href="#tabs-tl3" class="btip" title="An improved version of LTL2BA, overhauled by Tomáš Babiak during his Ph.D., and described at TACAS'12.<br>LTL3BA is not part of Spot.  Options in this tab correspond to options offered by LTL3BA, and have some overlap with the options offered by Spot upstream and downstream.">LTL3BA</a></li>
 	      <li><a href="#tabs-tcs" class="btip" title="Compositionnal suspension.<br>To be presented at Spin'13. Suspendable formulas are formulas such as <span class='formula'>GFa</span> or <span class='formula'>FGb</span> whose verification can always be postponed by a finite number of step.  In this approach, we extract all suspendable subformulas, translate them separately from the main, skeleton automaton, only to merge them back in the accepting SCC.">Comp.Susp.</a></li>
@@ -591,12 +590,6 @@ an identifier: <span class="formula">aUb</span> is an atomic proposition, unlike
 		  fair-loop approximations
 		</label><br>
 	      </div>
-	      <div id="tabs-tla">
-		<label class="rtip" title="The automaton built by Couvreur/LaCIM is represented symbolically using BDDs.  Useless SCCs can be removed using a series of fix-point operations.  You may want to disable the <b>prune unaccepting SCCs</b> automaton simplification.">
-		  <INPUT type="checkbox" name="la" value="sp" checked>
-		  symbolically prune unaccepting SCCs
-		</label><br>
-	      </div>
 	      <div id="tabs-tta">
 		<label class="rtip" title="Enable a refined set of translation rules, based on language inclusion between subformulas.  Because language inclusion between formula is tested using automata operations on translations for subformulas, this option can be slow.">
 		  <INPUT type="checkbox" name="ta" value="lc" checked>

wrap/python/ajax/spot.in

@@ -1,6 +1,6 @@
 #!@PYTHON@
 # -*- mode: python; coding: utf-8 -*-
-# Copyright (C) 2011, 2012, 2013 Laboratoire de Recherche et
+# Copyright (C) 2011, 2012, 2013, 2014 Laboratoire de Recherche et
 # Développement de l'Epita (LRDE).
 #
 # This file is part of Spot, a model checking library.
@@ -518,10 +518,6 @@ if translator == 'fm':
     automaton = spot.ltl_to_tgba_fm(f, dict,
                                     exprop, symb_merge,
                                     branching_postponement, fair_loop_approx)
-elif translator == 'la':
-    automaton = spot.ltl_to_tgba_lacim(f, dict)
-    if form.getfirst('la', '') == 'sp':
-        automaton.delete_unaccepting_scc()
 elif translator == 'ta':
     refined_rules = False
     if form.getfirst('ta', '') == 'lc':
@@ -594,6 +590,9 @@ elif translator == 'cs':
 
     automaton = spot.compsusp(f, dict, cs_nowdba, cs_nosimul,
                               cs_early_start, donot_inject)
+else:
+    unbufprint('''<div class="error">unsupported translator</div>''')
+    finish()
 
 # Monitor output
 if output_type == 'm':