*** 
Aspic by Laure Gonnord, version 3.4  
Binary compiled on vendredi  1 janvier 2016 
Input file = main.fst 
***
 Configuration of Aspic * (version 3.4) 
   * name of file : main.fst 
   * inputfile of type (real) Fast format 
   * PRINTING all stuff for compsys ranking method 
   * DEBUG : Only prints analysis steps in a separate .log file 
   * PRINTING STUFF : Infile+Invars 
   * ANALYSIS 
    * with acceleration 
   * delay of widening = 1 
   * steps of descending sequence = 0 
   * newpath heuristic = disabled 
   * Name of model = main, Name of file = main.fst 
   * 46 variable(s) and 7 locs(s) and 16 transitions(s) in the .fst
   * Searching objective in fast strategy 
       -> we suppose that we want to compute post*(init) with init a convex set
       or post*(init) and bad if the state bad exists and bad is convex
       -> Initial region "init" found
       -> Finding initial polyhedron. OK. 
       -> No bad region
INFO : 46 vars, 7 locations, 16 transitions 
   * The initial state has label f6 and the associated polyhedron is {
$>=0,1>0} 
   * There is/are 0 bad node(s)
   * Precomputing special stuff for ranking option
 92 vars, 17(17==17) transitions and 8 locs now 
  * Printing option = Infile+Invars 
   * Parsing OK, now analysing 
   * LRA with acceleration with delay =  1 
main
*** Results : 
   *  Invariants =  
f11 -----> {false} 

f17 -----> {false} 

f7 -----> {A<=0, G=N1__o, B__o=0, C=C__o, A=M1__o, D1=L1__o, B=K1__o, J1=J1__o, I1=I1__o, H1=H1__o, G1=G1__o, F1=F1__o, E1=T1__o, A1=S1__o, C1=R1__o, B1=Q1__o, Z=P1__o, Z__o=0, Y=Y__o, A__o=X__o, W=W__o, V=V__o, U=U__o, Q=0, T=T__o, S=S__o, R=R__o, Q__o=0, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, E=100, I=I__o, H=H__o, X=O1__o, F=F__o, D=D__o, E__o=100} 

f6 -----> {T1=T1__o, S1=S1__o, R1=R1__o, Q1=Q1__o, P1=P1__o, O1=O1__o, N1=N1__o, M1=M1__o, L1=L1__o, K1=K1__o, J1=J1__o, I1=I1__o, H1=H1__o, G1=G1__o, F1=F1__o, E1=E1__o, D1=D1__o, C1=C1__o, B1=B1__o, A1=A1__o, Z=Z__o, Y=Y__o, X=X__o, W=W__o, V=V__o, U=U__o, T=T__o, S=S__o, R=R__o, Q=Q__o, P=P__o, O=O__o, N=N__o, M=M__o, L=L__o, K=K__o, J=J__o, I=I__o, H=H__o, G=G__o, F=F__o, E=E__o, D=D__o, C=C__o, B=B__o, A=A__o} 

____f6 -----> {true} 

f15  -----> {false} 
 
f14  -----> {false} 
 
f13  -----> {false} 
    * Remember that we have no bad region 
   * Acceleration has been applied around 3 location(s)
   * Stats =  { time=0.046000; iterations=1; descendings=0; } 

  print result in fast++
 Finished !