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_CircadianClock-PT-100000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193kn-qhx2-146444252300049
=====================================================================

--------------------
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 CircadianClock-PT-100000-CTLFireability-0
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-1
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-10
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-11
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-12
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-13
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-14
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-15
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-2
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-3
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-4
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-5
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-6
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-7
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-8
FORMULA_NAME CircadianClock-PT-100000-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1464833098327


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,1,0.02003,4144,2,15,4,30,6,0,75,14,0


Converting to forward existential form...Done !
original formula: (!((((!(r>=1) + (a>=1 * dr>=1)) * EF((dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))) + ((da_a>=1 * ma_cap>=1) + AG(EF((a>=1 * dr>=1)))))
=> equivalent forward existential formula: [(FwdU(((Init * !(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))))) * !((da_a>=1 * ma_cap>=1))),TRUE) * !(E(TRUE U (a>=1 * dr>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(((Init * !(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))))) * !((da_a>=1 * ma_cap>=1))),TRUE) * !(E(TRUE U (a>=1 * dr>=1))))] = FALSE
Checking (exact) 0 :(FwdU(((Init * !(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))))) * !((da_a>=1 * ma_cap>=1))),TRUE) * !(E(TRUE U (a>=1 * dr>=1))))
Checking (exact) 1 :!(E(TRUE U (a>=1 * dr>=1)))
Checking (exact) 1 :E(TRUE U (a>=1 * dr>=1))
Checking (exact) 1 :FwdU(((Init * !(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))))) * !((da_a>=1 * ma_cap>=1))),TRUE)
Checking (exact) 1 :((Init * !(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))))) * !((da_a>=1 * ma_cap>=1)))
Checking (exact) 1 :!((da_a>=1 * ma_cap>=1))
Checking (exact) 1 :(Init * !(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1)))))))
Checking (exact) 1 :!(!((((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))))
Checking (exact) 1 :(((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1))) * !(EG((ma>=1 * a_cap>=1))))
Checking (exact) 1 :!(EG((ma>=1 * a_cap>=1)))
Checking (exact) 1 :EG((ma>=1 * a_cap>=1))
Fast SCC detection found none.
Checking (exact) 1 :((!(r>=1) + (a>=1 * dr>=1)) * E(TRUE U (dr_a>=1 * mr_cap>=1)))
Checking (exact) 1 :E(TRUE U (dr_a>=1 * mr_cap>=1))
(forward)formula 0,1,0.02396,4468,1,0,4,30,30,0,178,14,7
FORMULA CircadianClock-PT-100000-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(((c>=1 * r_cap>=1) + (((ma>=1 * a_cap>=1) * ((c>=1 * r_cap>=1) + (da_a>=1 * a_cap>=1))) + !((mr>=1 * (c>=1 * r_cap>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((c>=1 * r_cap>=1) + (((ma>=1 * a_cap>=1) * ((c>=1 * r_cap>=1) + (da_a>=1 * a_cap>=1))) + !((mr>=1 * (c>=1 * r_cap>=1)))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(((c>=1 * r_cap>=1) + (((ma>=1 * a_cap>=1) * ((c>=1 * r_cap>=1) + (da_a>=1 * a_cap>=1))) + !((mr>=1 * (c>=1 * r_cap>=1)))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(((c>=1 * r_cap>=1) + (((ma>=1 * a_cap>=1) * ((c>=1 * r_cap>=1) + (da_a>=1 * a_cap>=1))) + !((mr>=1 * (c>=1 * r_cap>=1)))))))
(forward)formula 1,1,0.025897,4492,1,0,4,30,46,0,203,14,7
FORMULA CircadianClock-PT-100000-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(EF(AF(mr>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EG(!(mr>=1))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(EG(!(mr>=1))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(EG(!(mr>=1))))))
Checking (exact) 1 :!(E(TRUE U !(EG(!(mr>=1)))))
Checking (exact) 1 :E(TRUE U !(EG(!(mr>=1))))
Checking (exact) 1 :!(EG(!(mr>=1)))
Checking (exact) 1 :EG(!(mr>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 2,0,0.026654,4492,1,0,4,30,47,0,204,14,8
FORMULA CircadianClock-PT-100000-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((r>=1 * AX((((a>=1 * r>=1) * c_cap>=1) * (a>=1 * dr>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * r>=1) * !(EX(!((((a>=1 * r>=1) * c_cap>=1) * (a>=1 * dr>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * r>=1) * !(EX(!((((a>=1 * r>=1) * c_cap>=1) * (a>=1 * dr>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * r>=1) * !(EX(!((((a>=1 * r>=1) * c_cap>=1) * (a>=1 * dr>=1))))))
Checking (exact) 1 :!(EX(!((((a>=1 * r>=1) * c_cap>=1) * (a>=1 * dr>=1)))))
Checking (exact) 1 :EX(!((((a>=1 * r>=1) * c_cap>=1) * (a>=1 * dr>=1))))
Checking (exact) 1 :(FwdU(Init,TRUE) * r>=1)
Checking (exact) 1 :r>=1
(forward)formula 3,0,0.028346,4492,1,0,4,30,55,0,219,14,10
FORMULA CircadianClock-PT-100000-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(AG(!((((a>=1 * r>=1) * c_cap>=1) * (dr_a>=1 * mr_cap>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((((a>=1 * r>=1) * c_cap>=1) * (dr_a>=1 * mr_cap>=1)))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(!((((a>=1 * r>=1) * c_cap>=1) * (dr_a>=1 * mr_cap>=1)))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(!((((a>=1 * r>=1) * c_cap>=1) * (dr_a>=1 * mr_cap>=1)))))))
Checking (exact) 1 :!(E(TRUE U !(!((((a>=1 * r>=1) * c_cap>=1) * (dr_a>=1 * mr_cap>=1))))))
Checking (exact) 1 :E(TRUE U !(!((((a>=1 * r>=1) * c_cap>=1) * (dr_a>=1 * mr_cap>=1)))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 4,1,0.029787,4492,1,0,4,30,57,0,224,14,11
FORMULA CircadianClock-PT-100000-CTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(EF(EG((mr>=1 * r_cap>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG((mr>=1 * r_cap>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U EG((mr>=1 * r_cap>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U EG((mr>=1 * r_cap>=1)))))
Checking (exact) 1 :!(E(TRUE U EG((mr>=1 * r_cap>=1))))
Checking (exact) 1 :E(TRUE U EG((mr>=1 * r_cap>=1)))
Checking (exact) 1 :EG((mr>=1 * r_cap>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 5,0,0.030781,4492,1,0,4,30,59,0,226,14,12
FORMULA CircadianClock-PT-100000-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(EF(!(EF((dr>=1 * mr_cap>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (dr>=1 * mr_cap>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (dr>=1 * mr_cap>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (dr>=1 * mr_cap>=1))))
Checking (exact) 1 :!(E(TRUE U (dr>=1 * mr_cap>=1)))
Checking (exact) 1 :E(TRUE U (dr>=1 * mr_cap>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 6,0,0.031509,4492,1,0,4,30,61,0,228,14,13
FORMULA CircadianClock-PT-100000-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(!((dr_a>=1 * mr_cap>=1)) U ((ma>=1 * a_cap>=1) + (da>=1 * a>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!((dr_a>=1 * mr_cap>=1))) * ((ma>=1 * a_cap>=1) + (da>=1 * a>=1)))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!((dr_a>=1 * mr_cap>=1))) * ((ma>=1 * a_cap>=1) + (da>=1 * a>=1)))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((dr_a>=1 * mr_cap>=1))) * ((ma>=1 * a_cap>=1) + (da>=1 * a>=1)))
(forward)formula 7,0,0.03192,4492,1,0,4,30,65,0,231,14,13
FORMULA CircadianClock-PT-100000-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX(!(AG((da>=1 * ma_cap>=1)))) + !((EX(((dr_a>=1 * mr_cap>=1) * mr>=1)) * EG((ma>=1 + (a>=1 * dr>=1))))))
=> equivalent forward existential formula: [(EY((Init * !(!((EX(((dr_a>=1 * mr_cap>=1) * mr>=1)) * EG((ma>=1 + (a>=1 * dr>=1)))))))) * !(E(TRUE U !((da>=1 * ma_cap>=1)))))] = FALSE
Checking (exact) 0 :[(EY((Init * !(!((EX(((dr_a>=1 * mr_cap>=1) * mr>=1)) * EG((ma>=1 + (a>=1 * dr>=1)))))))) * !(E(TRUE U !((da>=1 * ma_cap>=1)))))] = FALSE
Checking (exact) 0 :(EY((Init * !(!((EX(((dr_a>=1 * mr_cap>=1) * mr>=1)) * EG((ma>=1 + (a>=1 * dr>=1)))))))) * !(E(TRUE U !((da>=1 * ma_cap>=1)))))
Checking (exact) 1 :!(E(TRUE U !((da>=1 * ma_cap>=1))))
Checking (exact) 1 :E(TRUE U !((da>=1 * ma_cap>=1)))
(forward)formula 8,1,0.032672,4492,1,0,4,30,68,0,236,14,14
FORMULA CircadianClock-PT-100000-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (da>=1 * a>=1)
=> equivalent forward existential formula: [(Init * (da>=1 * a>=1))] != FALSE
Checking (exact) 0 :[(Init * (da>=1 * a>=1))] != FALSE
Checking (exact) 0 :(Init * (da>=1 * a>=1))
(forward)formula 9,0,0.033525,4756,1,0,4,30,68,0,236,14,14
FORMULA CircadianClock-PT-100000-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E((mr>=1 * r_cap>=1) U (dr_a>=1 * mr_cap>=1))
=> equivalent forward existential formula: [(FwdU(Init,(mr>=1 * r_cap>=1)) * (dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,(mr>=1 * r_cap>=1)) * (dr_a>=1 * mr_cap>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,(mr>=1 * r_cap>=1)) * (dr_a>=1 * mr_cap>=1))
(forward)formula 10,0,0.033994,4760,1,0,4,30,68,0,236,14,14
FORMULA CircadianClock-PT-100000-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(AG((((ma>=1 * a_cap>=1) * ((a>=1 * r>=1) * c_cap>=1)) * !((c>=1 * r_cap>=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((ma>=1 * a_cap>=1) * ((a>=1 * r>=1) * c_cap>=1)) * !((c>=1 * r_cap>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(EY(Init),TRUE) * !((((ma>=1 * a_cap>=1) * ((a>=1 * r>=1) * c_cap>=1)) * !((c>=1 * r_cap>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(EY(Init),TRUE) * !((((ma>=1 * a_cap>=1) * ((a>=1 * r>=1) * c_cap>=1)) * !((c>=1 * r_cap>=1)))))
Checking (exact) 1 :!((((ma>=1 * a_cap>=1) * ((a>=1 * r>=1) * c_cap>=1)) * !((c>=1 * r_cap>=1))))
Checking (exact) 1 :FwdU(EY(Init),TRUE)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 11,1,0.035506,4760,1,0,4,30,74,0,247,14,16
FORMULA CircadianClock-PT-100000-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EX(AF(AG(r>=1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(r>=1)))))))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(EG(!(!(E(TRUE U !(r>=1)))))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(EG(!(!(E(TRUE U !(r>=1)))))))
Checking (exact) 1 :!(EG(!(!(E(TRUE U !(r>=1))))))
Checking (exact) 1 :EG(!(!(E(TRUE U !(r>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(r>=1))))
Checking (exact) 1 :E(TRUE U !(r>=1))
(forward)formula 12,0,0.036229,4760,1,0,4,30,74,0,247,14,17
FORMULA CircadianClock-PT-100000-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX((EG((ma>=1 + (da>=1 * a>=1))) * AX(r>=1)))
=> equivalent forward existential formula: ([(EY(Init) * !(EG((ma>=1 + (da>=1 * a>=1)))))] = FALSE * [(EY(EY(Init)) * !(r>=1))] = FALSE)
Checking (exact) 0 :([(EY(Init) * !(EG((ma>=1 + (da>=1 * a>=1)))))] = FALSE * [(EY(EY(Init)) * !(r>=1))] = FALSE)
Checking (exact) 1 :[(EY(EY(Init)) * !(r>=1))] = FALSE
Checking (exact) 0 :(EY(EY(Init)) * !(r>=1))
Checking (exact) 1 :!(r>=1)
Checking (exact) 1 :EY(EY(Init))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Checking (exact) 1 :[(EY(Init) * !(EG((ma>=1 + (da>=1 * a>=1)))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(EG((ma>=1 + (da>=1 * a>=1)))))
Checking (exact) 1 :!(EG((ma>=1 + (da>=1 * a>=1))))
Checking (exact) 1 :EG((ma>=1 + (da>=1 * a>=1)))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 13,1,0.037473,4760,1,0,4,30,75,0,248,14,18
FORMULA CircadianClock-PT-100000-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (((AF(!((dr_a>=1 * a_cap>=1))) * !(EX((ma>=1 * a_cap>=1)))) * AG(AF((dr>=1 * mr_cap>=1)))) + EX(AX(!((da>=1 * ma_cap>=1)))))
=> equivalent forward existential formula: (([FwdG((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),!(!((dr_a>=1 * a_cap>=1))))] = FALSE * [(EY((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1))))))))) * (ma>=1 * a_cap>=1))] = FALSE) * [FwdG(FwdU((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),TRUE),!((dr>=1 * mr_cap>=1)))] = FALSE)
Checking (exact) 0 :(([FwdG((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),!(!((dr_a>=1 * a_cap>=1))))] = FALSE * [(EY((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1))))))))) * (ma>=1 * a_cap>=1))] = FALSE) * [FwdG(FwdU((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),TRUE),!((dr>=1 * mr_cap>=1)))] = FALSE)
Checking (exact) 1 :[FwdG(FwdU((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),TRUE),!((dr>=1 * mr_cap>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),TRUE),!((dr>=1 * mr_cap>=1)))
Checking (exact) 1 :FwdU((Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))),TRUE)
Checking (exact) 1 :(Init * !(EX(!(EX(!(!((da>=1 * ma_cap>=1))))))))
Checking (exact) 1 :!(EX(!(EX(!(!((da>=1 * ma_cap>=1)))))))
Checking (exact) 1 :EX(!(EX(!(!((da>=1 * ma_cap>=1))))))
Checking (exact) 1 :!(EX(!(!((da>=1 * ma_cap>=1)))))
Checking (exact) 1 :EX(!(!((da>=1 * ma_cap>=1))))
Checking (exact) 1 :Init
(forward)formula 14,0,0.039066,4760,1,0,4,30,77,0,264,14,22
FORMULA CircadianClock-PT-100000-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ma>=1
=> equivalent forward existential formula: [(Init * ma>=1)] != FALSE
Checking (exact) 0 :[(Init * ma>=1)] != FALSE
Checking (exact) 0 :(Init * ma>=1)
(forward)formula 15,0,0.039219,4760,1,0,4,30,77,0,264,14,22
FORMULA CircadianClock-PT-100000-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1464833103945

--------------------
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 02, 2016 2:05:02 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2016 2:05:02 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 34 ms
Jun 02, 2016 2:05:02 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
Jun 02, 2016 2:05:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
Jun 02, 2016 2:05:03 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Jun 02, 2016 2:05:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 18 ms
Jun 02, 2016 2:05:03 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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_CircadianClock-PT-100000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/fko/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_CircadianClock-PT-100000.tgz
mv S_CircadianClock-PT-100000 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_CircadianClock-PT-100000, 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 r193kn-qhx2-146444252300049"
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 ;