Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_Parking-PT-104, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444112701165
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-104-CTLFireability-0
FORMULA_NAME Parking-PT-104-CTLFireability-1
FORMULA_NAME Parking-PT-104-CTLFireability-10
FORMULA_NAME Parking-PT-104-CTLFireability-11
FORMULA_NAME Parking-PT-104-CTLFireability-12
FORMULA_NAME Parking-PT-104-CTLFireability-13
FORMULA_NAME Parking-PT-104-CTLFireability-14
FORMULA_NAME Parking-PT-104-CTLFireability-15
FORMULA_NAME Parking-PT-104-CTLFireability-2
FORMULA_NAME Parking-PT-104-CTLFireability-3
FORMULA_NAME Parking-PT-104-CTLFireability-4
FORMULA_NAME Parking-PT-104-CTLFireability-5
FORMULA_NAME Parking-PT-104-CTLFireability-6
FORMULA_NAME Parking-PT-104-CTLFireability-7
FORMULA_NAME Parking-PT-104-CTLFireability-8
FORMULA_NAME Parking-PT-104-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1464744470540


its-ctl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,31745,0.037012,4796,88,54,663,367,174,805,65,1061,0


Converting to forward existential form...Done !
original formula: EF(u11.p36>=1)
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * u11.p36>=1)] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * u11.p36>=1)] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * u11.p36>=1)
Checking (exact) 1 :u11.p36>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 0,1,0.038082,5056,1,0,663,367,177,805,67,1061,16
FORMULA Parking-PT-104-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (!(EF(EX(u10.p28>=1))) + ((u9.p20>=1 + AG(((u10.p32>=1 * u14.p59>=1) + u7.p14>=1))) * !((u11.p36>=1 * u15.p61>=1))))
=> equivalent forward existential formula: ([(FwdU(((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * !(u9.p20>=1)),TRUE) * !(((u10.p32>=1 * u14.p59>=1) + u7.p14>=1)))] = FALSE * [((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * (u11.p36>=1 * u15.p61>=1))] = FALSE)
Checking (exact) 0 :([(FwdU(((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * !(u9.p20>=1)),TRUE) * !(((u10.p32>=1 * u14.p59>=1) + u7.p14>=1)))] = FALSE * [((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * (u11.p36>=1 * u15.p61>=1))] = FALSE)
Checking (exact) 1 :[((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * (u11.p36>=1 * u15.p61>=1))] = FALSE
Checking (exact) 0 :((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * (u11.p36>=1 * u15.p61>=1))
Checking (exact) 1 :[(FwdU(((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * !(u9.p20>=1)),TRUE) * !(((u10.p32>=1 * u14.p59>=1) + u7.p14>=1)))] = FALSE
Checking (exact) 0 :(FwdU(((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * !(u9.p20>=1)),TRUE) * !(((u10.p32>=1 * u14.p59>=1) + u7.p14>=1)))
Checking (exact) 1 :!(((u10.p32>=1 * u14.p59>=1) + u7.p14>=1))
Checking (exact) 1 :FwdU(((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * !(u9.p20>=1)),TRUE)
Checking (exact) 1 :((Init * !(!(E(TRUE U EX(u10.p28>=1))))) * !(u9.p20>=1))
Checking (exact) 1 :!(u9.p20>=1)
Checking (exact) 1 :(Init * !(!(E(TRUE U EX(u10.p28>=1)))))
Checking (exact) 1 :!(!(E(TRUE U EX(u10.p28>=1))))
Checking (exact) 1 :E(TRUE U EX(u10.p28>=1))
Checking (exact) 1 :EX(u10.p28>=1)
Checking (exact) 1 :Init
(forward)formula 1,0,0.105601,6220,1,0,2831,852,956,4311,269,2911,10921
FORMULA Parking-PT-104-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(u11.p36>=1)
=> equivalent forward existential formula: [FwdG(Init,!(u11.p36>=1))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(u11.p36>=1))] = FALSE
Checking (exact) 0 :FwdG(Init,!(u11.p36>=1))
Checking (exact) 1 :Init
(forward)formula 2,0,0.120897,6480,1,0,3301,924,987,5193,269,3479,11912
FORMULA Parking-PT-104-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AG(!(((u10.p28>=1 + u12.p44>=1) * ((u10.p29>=1 * u15.p64>=1) + (u10.p32>=1 * u14.p59>=1))))) + E(!((u12.p41>=1 * u14.p60>=1)) U (u3.p5>=1 * u13.p55>=1)))
=> equivalent forward existential formula: [(FwdU((Init * !(E(!((u12.p41>=1 * u14.p60>=1)) U (u3.p5>=1 * u13.p55>=1)))),TRUE) * ((u10.p28>=1 + u12.p44>=1) * ((u10.p29>=1 * u15.p64>=1) + (u10.p32>=1 * u14.p59>=1))))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(E(!((u12.p41>=1 * u14.p60>=1)) U (u3.p5>=1 * u13.p55>=1)))),TRUE) * ((u10.p28>=1 + u12.p44>=1) * ((u10.p29>=1 * u15.p64>=1) + (u10.p32>=1 * u14.p59>=1))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(E(!((u12.p41>=1 * u14.p60>=1)) U (u3.p5>=1 * u13.p55>=1)))),TRUE) * ((u10.p28>=1 + u12.p44>=1) * ((u10.p29>=1 * u15.p64>=1) + (u10.p32>=1 * u14.p59>=1))))
(forward)formula 3,1,0.121889,6752,1,0,3302,924,998,5194,269,3479,11916
FORMULA Parking-PT-104-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !((AF(u12.p44>=1) * AF((u7.p13>=1 * u13.p57>=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(u12.p44>=1))] != FALSE + [FwdG(Init,!((u7.p13>=1 * u13.p57>=1)))] != FALSE)
Checking (exact) 0 :([FwdG(Init,!(u12.p44>=1))] != FALSE + [FwdG(Init,!((u7.p13>=1 * u13.p57>=1)))] != FALSE)
Checking (exact) 0 :[FwdG(Init,!(u12.p44>=1))] != FALSE
Checking (exact) 0 :FwdG(Init,!(u12.p44>=1))
Checking (exact) 1 :Init
(forward)formula 4,1,0.123382,6756,1,0,3337,929,1008,5244,269,3500,12111
FORMULA Parking-PT-104-CTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EG(!(AG(u1.p2>=1))) * E(!(((u2.p4>=1 * u13.p50>=1) + u12.p44>=1)) U AG((u10.p32>=1 * u14.p59>=1))))
=> equivalent forward existential formula: [(FwdU((Init * EG(!(!(E(TRUE U !(u1.p2>=1)))))),!(((u2.p4>=1 * u13.p50>=1) + u12.p44>=1))) * !(E(TRUE U !((u10.p32>=1 * u14.p59>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * EG(!(!(E(TRUE U !(u1.p2>=1)))))),!(((u2.p4>=1 * u13.p50>=1) + u12.p44>=1))) * !(E(TRUE U !((u10.p32>=1 * u14.p59>=1)))))] != FALSE
Checking (exact) 0 :(FwdU((Init * EG(!(!(E(TRUE U !(u1.p2>=1)))))),!(((u2.p4>=1 * u13.p50>=1) + u12.p44>=1))) * !(E(TRUE U !((u10.p32>=1 * u14.p59>=1)))))
Checking (exact) 1 :!(E(TRUE U !((u10.p32>=1 * u14.p59>=1))))
Checking (exact) 1 :E(TRUE U !((u10.p32>=1 * u14.p59>=1)))
(forward)formula 5,0,0.125904,6788,1,0,3351,929,1009,5319,269,3517,12385
FORMULA Parking-PT-104-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(((((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1)) + AF(u12.p45>=1)) * AF(!(u16.p0>=1))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1)))),!(u12.p45>=1))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(u16.p0>=1)))] = FALSE)
Checking (exact) 0 :([FwdG((FwdU(Init,TRUE) * !(((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1)))),!(u12.p45>=1))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(u16.p0>=1)))] = FALSE)
Checking (exact) 1 :[FwdG(FwdU(Init,TRUE),!(!(u16.p0>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(!(u16.p0>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG((FwdU(Init,TRUE) * !(((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1)))),!(u12.p45>=1))] = FALSE
Checking (exact) 0 :FwdG((FwdU(Init,TRUE) * !(((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1)))),!(u12.p45>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * !(((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1))))
Checking (exact) 1 :!(((u1.p1>=1 * u13.p54>=1) * (u3.p6>=1 * u12.p44>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 6,0,0.136599,6788,1,0,3841,932,1056,5681,273,3571,14094
FORMULA Parking-PT-104-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(!((((u11.p36>=1 + u6.p12>=1) + (u7.p14>=1 * (u13.p58>=1 * u14.p59>=1))) * (u10.p25>=1 * u14.p60>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((u11.p36>=1 + u6.p12>=1) + (u7.p14>=1 * (u13.p58>=1 * u14.p59>=1))) * (u10.p25>=1 * u14.p60>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (((u11.p36>=1 + u6.p12>=1) + (u7.p14>=1 * (u13.p58>=1 * u14.p59>=1))) * (u10.p25>=1 * u14.p60>=1)))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (((u11.p36>=1 + u6.p12>=1) + (u7.p14>=1 * (u13.p58>=1 * u14.p59>=1))) * (u10.p25>=1 * u14.p60>=1)))
Checking (exact) 1 :(((u11.p36>=1 + u6.p12>=1) + (u7.p14>=1 * (u13.p58>=1 * u14.p59>=1))) * (u10.p25>=1 * u14.p60>=1))
Checking (exact) 1 :(u10.p25>=1 * u14.p60>=1)
Checking (exact) 1 :u14.p60>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 7,0,0.139291,6844,1,0,3865,932,1074,5724,273,3571,14205
FORMULA Parking-PT-104-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((AF((u12.p44>=1 + u11.p36>=1)) * !((u4.p8>=1 * u13.p51>=1))) + (((!(((u1.p2>=1 * u9.p19>=1) * (u3.p5>=1 * u13.p55>=1))) * (u1.p2>=1 * u9.p18>=1)) * (((u11.p36>=1 * (u10.p29>=1 * u15.p64>=1)) * ((u15.p64>=1 * u12.p46>=1) + (u10.p29>=1 * u15.p64>=1))) * AX(u15.p61>=1))) * A((u11.p36>=1 + u4.p8>=1) U u10.p28>=1)))
=> equivalent forward existential formula: (([((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))) * !((!(((u1.p2>=1 * u9.p19>=1) * (u3.p5>=1 * u13.p55>=1))) * (u1.p2>=1 * u9.p18>=1))))] = FALSE * ([((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))) * !(((u11.p36>=1 * (u10.p29>=1 * u15.p64>=1)) * ((u15.p64>=1 * u12.p46>=1) + (u10.p29>=1 * u15.p64>=1)))))] = FALSE * [(EY((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1)))))) * !(u15.p61>=1))] = FALSE)) * ([(FwdU((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1)) * (!((u11.p36>=1 + u4.p8>=1)) * !(u10.p28>=1)))] = FALSE * [FwdG((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1))] = FALSE))
Checking (exact) 0 :(([((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))) * !((!(((u1.p2>=1 * u9.p19>=1) * (u3.p5>=1 * u13.p55>=1))) * (u1.p2>=1 * u9.p18>=1))))] = FALSE * ([((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))) * !(((u11.p36>=1 * (u10.p29>=1 * u15.p64>=1)) * ((u15.p64>=1 * u12.p46>=1) + (u10.p29>=1 * u15.p64>=1)))))] = FALSE * [(EY((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1)))))) * !(u15.p61>=1))] = FALSE)) * ([(FwdU((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1)) * (!((u11.p36>=1 + u4.p8>=1)) * !(u10.p28>=1)))] = FALSE * [FwdG((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1))] = FALSE))
Checking (exact) 1 :([(FwdU((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1)) * (!((u11.p36>=1 + u4.p8>=1)) * !(u10.p28>=1)))] = FALSE * [FwdG((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1))] = FALSE)
Checking (exact) 1 :[FwdG((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1))] = FALSE
Checking (exact) 0 :FwdG((Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))),!(u10.p28>=1))
Checking (exact) 1 :(Init * !((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1)))))
Checking (exact) 1 :!((!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1))))
Checking (exact) 1 :(!(EG(!((u12.p44>=1 + u11.p36>=1)))) * !((u4.p8>=1 * u13.p51>=1)))
Checking (exact) 1 :!((u4.p8>=1 * u13.p51>=1))
Checking (exact) 1 :!(EG(!((u12.p44>=1 + u11.p36>=1))))
Checking (exact) 1 :EG(!((u12.p44>=1 + u11.p36>=1)))
Checking (exact) 1 :Init
(forward)formula 8,0,0.294618,11828,1,0,14225,1633,1127,20761,273,7845,37562
FORMULA Parking-PT-104-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(AF(u3.p6>=1) U u9.p20>=1)
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(u3.p6>=1)))) * u9.p20>=1)] != FALSE
Checking (exact) 0 :[(FwdU(Init,!(EG(!(u3.p6>=1)))) * u9.p20>=1)] != FALSE
Checking (exact) 0 :(FwdU(Init,!(EG(!(u3.p6>=1)))) * u9.p20>=1)
Checking (exact) 1 :u9.p20>=1
Checking (exact) 1 :FwdU(Init,!(EG(!(u3.p6>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG(!(u3.p6>=1)))
Checking (exact) 1 :EG(!(u3.p6>=1))
(forward)formula 9,1,0.519033,19492,1,0,31690,2128,1167,44081,274,11679,69509
FORMULA Parking-PT-104-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG((AF((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1))) + AF((u9.p20>=1 * u11.p36>=1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1))))) + !(EG(!((u9.p20>=1 * u11.p36>=1))))))] != FALSE
Checking (exact) 0 :[FwdG(Init,(!(EG(!((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1))))) + !(EG(!((u9.p20>=1 * u11.p36>=1))))))] != FALSE
Checking (exact) 0 :FwdG(Init,(!(EG(!((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1))))) + !(EG(!((u9.p20>=1 * u11.p36>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :(!(EG(!((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1))))) + !(EG(!((u9.p20>=1 * u11.p36>=1)))))
Checking (exact) 1 :!(EG(!((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1)))))
Checking (exact) 1 :EG(!((u11.p36>=1 * (u8.p16>=1 * u13.p53>=1))))
Checking (exact) 1 :!(EG(!((u9.p20>=1 * u11.p36>=1))))
Checking (exact) 1 :EG(!((u9.p20>=1 * u11.p36>=1)))
(forward)formula 10,0,0.567687,21168,1,0,34762,2132,1180,48174,274,11723,76553
FORMULA Parking-PT-104-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(A(u12.p44>=1 U (u10.p30>=1 * u15.p63>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((u10.p30>=1 * u15.p63>=1)) U (!(u12.p44>=1) * !((u10.p30>=1 * u15.p63>=1)))) + EG(!((u10.p30>=1 * u15.p63>=1)))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!((E(!((u10.p30>=1 * u15.p63>=1)) U (!(u12.p44>=1) * !((u10.p30>=1 * u15.p63>=1)))) + EG(!((u10.p30>=1 * u15.p63>=1)))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!((E(!((u10.p30>=1 * u15.p63>=1)) U (!(u12.p44>=1) * !((u10.p30>=1 * u15.p63>=1)))) + EG(!((u10.p30>=1 * u15.p63>=1)))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!((E(!((u10.p30>=1 * u15.p63>=1)) U (!(u12.p44>=1) * !((u10.p30>=1 * u15.p63>=1)))) + EG(!((u10.p30>=1 * u15.p63>=1))))))
Checking (exact) 1 :(E(!((u10.p30>=1 * u15.p63>=1)) U (!(u12.p44>=1) * !((u10.p30>=1 * u15.p63>=1)))) + EG(!((u10.p30>=1 * u15.p63>=1))))
Checking (exact) 1 :E(!((u10.p30>=1 * u15.p63>=1)) U (!(u12.p44>=1) * !((u10.p30>=1 * u15.p63>=1))))
Checking (exact) 1 :EG(!((u10.p30>=1 * u15.p63>=1)))
(forward)formula 11,0,0.750299,25900,1,0,45815,2161,1215,63006,274,12107,102625
FORMULA Parking-PT-104-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(!((u4.p8>=1 * u13.p51>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (u4.p8>=1 * u13.p51>=1))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (u4.p8>=1 * u13.p51>=1))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (u4.p8>=1 * u13.p51>=1))
Checking (exact) 1 :(u4.p8>=1 * u13.p51>=1)
Checking (exact) 1 :u13.p51>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 12,0,0.751399,26168,1,0,45824,2161,1215,63068,274,12107,102733
FORMULA Parking-PT-104-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A((EF(u10.p28>=1) * EF(u9.p20>=1)) U E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))
=> equivalent forward existential formula: [((Init * !(EG(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))) * !(E(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)) U (!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))) * !(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))) * !(E(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)) U (!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))) * !(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))) * !(E(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)) U (!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))) * !(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))))
Checking (exact) 1 :!(E(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)) U (!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))) * !(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)))))
Checking (exact) 1 :E(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)) U (!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))) * !(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))
Checking (exact) 1 :!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))
Checking (exact) 1 :E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)
Checking (exact) 1 :(!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))) * !(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)))
Checking (exact) 1 :!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))
Checking (exact) 1 :E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)
Checking (exact) 1 :!((E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1)))
Checking (exact) 1 :(E(TRUE U u10.p28>=1) * E(TRUE U u9.p20>=1))
Checking (exact) 1 :E(TRUE U u9.p20>=1)
Checking (exact) 1 :E(TRUE U u10.p28>=1)
Checking (exact) 1 :(Init * !(EG(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)))))
Checking (exact) 1 :!(EG(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))))
Checking (exact) 1 :EG(!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)))
Checking (exact) 1 :!(E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1))
Checking (exact) 1 :E((u6.p11>=1 * u11.p39>=1) U u12.p44>=1)
Checking (exact) 1 :Init
(forward)formula 13,0,0.855394,29004,1,0,51811,2251,1249,74659,274,12976,117737
FORMULA Parking-PT-104-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AF((!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1))) * !(((u15.p64>=1 * u12.p46>=1) * u15.p64>=1)))
=> equivalent forward existential formula: ([FwdG(Init,!((!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1))))] = FALSE * [(Init * ((u15.p64>=1 * u12.p46>=1) * u15.p64>=1))] = FALSE)
Checking (exact) 0 :([FwdG(Init,!((!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1))))] = FALSE * [(Init * ((u15.p64>=1 * u12.p46>=1) * u15.p64>=1))] = FALSE)
Checking (exact) 1 :[(Init * ((u15.p64>=1 * u12.p46>=1) * u15.p64>=1))] = FALSE
Checking (exact) 0 :(Init * ((u15.p64>=1 * u12.p46>=1) * u15.p64>=1))
Checking (exact) 1 :[FwdG(Init,!((!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1))))] = FALSE
Checking (exact) 0 :FwdG(Init,!((!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!((!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1)))
Checking (exact) 1 :(!(((u4.p8>=1 * u13.p51>=1) + (u8.p15>=1 * u12.p47>=1))) * EG(u10.p28>=1))
Checking (exact) 1 :EG(u10.p28>=1)
Fast SCC detection found none.
(forward)formula 14,0,0.860187,29272,1,0,52073,2252,1275,74865,276,12976,118808
FORMULA Parking-PT-104-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (E(AX((u15.p64>=1 * u12.p46>=1)) U EX(u16.p0>=1)) + ((AF(!(u12.p45>=1)) + (!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1))))) * !(EF(((u11.p33>=1 * u14.p60>=1) * u10.p28>=1)))))
=> equivalent forward existential formula: ([FwdG(((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))) * !((!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1)))))),!(!(u12.p45>=1)))] = FALSE * [(FwdU((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))),TRUE) * ((u11.p33>=1 * u14.p60>=1) * u10.p28>=1))] = FALSE)
Checking (exact) 0 :([FwdG(((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))) * !((!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1)))))),!(!(u12.p45>=1)))] = FALSE * [(FwdU((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))),TRUE) * ((u11.p33>=1 * u14.p60>=1) * u10.p28>=1))] = FALSE)
Checking (exact) 1 :[(FwdU((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))),TRUE) * ((u11.p33>=1 * u14.p60>=1) * u10.p28>=1))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))),TRUE) * ((u11.p33>=1 * u14.p60>=1) * u10.p28>=1))
Checking (exact) 1 :[FwdG(((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))) * !((!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1)))))),!(!(u12.p45>=1)))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))) * !((!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1)))))),!(!(u12.p45>=1)))
Checking (exact) 1 :((Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))) * !((!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1))))))
Checking (exact) 1 :!((!((u4.p8>=1 * u13.p51>=1)) + (!(u15.p64>=1) * ((u12.p48>=1 * u14.p59>=1) + (u10.p30>=1 * u15.p63>=1)))))
Checking (exact) 1 :(Init * !(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1))))
Checking (exact) 1 :!(E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1)))
Checking (exact) 1 :E(!(EX(!((u15.p64>=1 * u12.p46>=1)))) U EX(u16.p0>=1))
Checking (exact) 1 :!(EX(!((u15.p64>=1 * u12.p46>=1))))
Checking (exact) 1 :EX(!((u15.p64>=1 * u12.p46>=1)))
Checking (exact) 1 :EX(u16.p0>=1)
Checking (exact) 1 :Init
(forward)formula 15,1,0.865401,29272,1,0,52096,2260,1303,74935,277,13020,118956
FORMULA Parking-PT-104-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1464744476141

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 65 places.
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 97 transitions.
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 71 ms
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 31 ms
Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[p1, p2, ],[p3, p4, ],[p5, p6, ],[p7, p8, ],[p9, p10, ],[p11, p12, ],[p13, p14, ],[p15, p16, ],[p17, p18, p19, p20, p21, p22, p23, p24, ],[p25, p26, p27, p28, p29, p30, p31, p32, ],[p33, p34, p35, p36, p37, p38, p39, p40, ],[p41, p42, p43, p44, p45, p46, p47, p48, ],[p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, ],[p59, p60, ],[p61, p62, p63, p64, ],[p0, ],

Jun 01, 2016 1:27:54 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
Jun 01, 2016 1:27:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 162 ms
Jun 01, 2016 1:27:55 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Parking-PT-104"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_Parking-PT-104.tgz
mv S_Parking-PT-104 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_Parking-PT-104, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181kn-smll-146444112701165"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;