*** 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 * 18 variable(s) and 4 locs(s) and 8 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 : 18 vars, 4 locations, 8 transitions * The initial state has label f300 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 36 vars, 9(9==9) transitions and 5 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * LRA with acceleration with delay = 1 main *Hum* A problem occured when accelerating the loops, now trying with -noaccel option * Name of model = main, Name of file = main.fst * 18 variable(s) and 4 locs(s) and 8 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 : 18 vars, 4 locations, 8 transitions * The initial state has label f300 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 36 vars, 9(9==9) transitions and 5 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * classical LRA (CH79) with delay = 4 main *** Results : * Invariants = f11 -----> {F>G, G>=1, E__o>=0, F<=G+1, A=A__o, E=E__o, H=M, H=L, H=J, H=I, N=P__o, F=F__o} f16 -----> {G>=1, F>G, H=I, H=J, A=A__o, B=B__o, C=C__o, D=D__o, E=E__o, F=F__o, K=K__o, L=L__o, M=M__o, N=P__o} f13 -----> {G>=0, F<=G+1, E=E__o, J=M, F=F__o, B=0, L=M, N=P__o, A=A__o} f300 -----> {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} ____f300 -----> {true} * Remember that we have no bad region * No accel has been applied * Stats = { time=0.037000; iterations=8; descendings=0; } print result in fast++ Finished !