*** 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 * 4 variable(s) and 7 locs(s) and 14 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 : 4 vars, 7 locations, 14 transitions * The initial state has label start0 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 8 vars, 15(15==15) transitions and 8 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 * 4 variable(s) and 7 locs(s) and 14 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 : 4 vars, 7 locations, 14 transitions * The initial state has label start0 and the associated polyhedron is { $>=0,1>0} * There is/are 0 bad node(s) * Precomputing special stuff for ranking option 8 vars, 15(15==15) transitions and 8 locs now * Printing option = Infile+Invars * Parsing OK, now analysing * classical LRA (CH79) with delay = 4 main *** Results : * Invariants = start -----> {B=C, B=C__o, A=D, A=A__o} stop -----> {B<=C__o, A>=D, A=A__o, C=C__o} lbl6 -----> {A>0, B<=0, B=C, B=C__o, A=D, A=A__o} cut -----> {A>=B, B>0, B<=C, C=C__o, B=D, A=A__o} lbl101 -----> {D>0, B+D<=C, B>0, A>=D, A=A__o, C=C__o} lbl111 -----> {D>0, B>0, A>=B+D, B<=C, A=A__o, C=C__o} start0 -----> {B=B__o, A=A__o, C=C__o, D=D__o} ____start0 -----> {true} * Remember that we have no bad region * No accel has been applied * Stats = { time=0.006000; iterations=6; descendings=0; } print result in fast++ Finished !