About the Execution of ITS-Tools for MAPK-PT-008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
357.400 | 4513.00 | 8134.00 | 127.60 | TTTFTTFTTFFFTTTT | normal |
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 MAPK-PT-008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r061kn-blw3-146358895500301
=====================================================================
--------------------
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 MAPK-PT-008-CTLFireability-0
FORMULA_NAME MAPK-PT-008-CTLFireability-1
FORMULA_NAME MAPK-PT-008-CTLFireability-10
FORMULA_NAME MAPK-PT-008-CTLFireability-11
FORMULA_NAME MAPK-PT-008-CTLFireability-12
FORMULA_NAME MAPK-PT-008-CTLFireability-13
FORMULA_NAME MAPK-PT-008-CTLFireability-14
FORMULA_NAME MAPK-PT-008-CTLFireability-15
FORMULA_NAME MAPK-PT-008-CTLFireability-2
FORMULA_NAME MAPK-PT-008-CTLFireability-3
FORMULA_NAME MAPK-PT-008-CTLFireability-4
FORMULA_NAME MAPK-PT-008-CTLFireability-5
FORMULA_NAME MAPK-PT-008-CTLFireability-6
FORMULA_NAME MAPK-PT-008-CTLFireability-7
FORMULA_NAME MAPK-PT-008-CTLFireability-8
FORMULA_NAME MAPK-PT-008-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1463956091361
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,6.11064e+06,0.109463,8336,2,2639,5,23385,6,0,121,23413,0
Converting to forward existential form...Done !
original formula: EF(AX(AF(ERK_MEKPP>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!(ERK_MEKPP>=1)))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!(!(EG(!(ERK_MEKPP>=1)))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!(!(EG(!(ERK_MEKPP>=1)))))))
Checking (exact) 1 :!(EX(!(!(EG(!(ERK_MEKPP>=1))))))
Checking (exact) 1 :EX(!(!(EG(!(ERK_MEKPP>=1)))))
Checking (exact) 1 :!(!(EG(!(ERK_MEKPP>=1))))
Checking (exact) 1 :EG(!(ERK_MEKPP>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 0,1,0.307717,12340,1,0,8,36405,19,2,638,33819,7
FORMULA MAPK-PT-008-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AF((EF((ERKP_MEKPP>=1 * ERKPP_Phase3>=1)) * EF(!(ERKPP_Phase3>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (ERKP_MEKPP>=1 * ERKPP_Phase3>=1)) * E(TRUE U !(ERKPP_Phase3>=1)))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((E(TRUE U (ERKP_MEKPP>=1 * ERKPP_Phase3>=1)) * E(TRUE U !(ERKPP_Phase3>=1)))))] = FALSE
Checking (exact) 0 :FwdG(Init,!((E(TRUE U (ERKP_MEKPP>=1 * ERKPP_Phase3>=1)) * E(TRUE U !(ERKPP_Phase3>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!((E(TRUE U (ERKP_MEKPP>=1 * ERKPP_Phase3>=1)) * E(TRUE U !(ERKPP_Phase3>=1))))
Checking (exact) 1 :(E(TRUE U (ERKP_MEKPP>=1 * ERKPP_Phase3>=1)) * E(TRUE U !(ERKPP_Phase3>=1)))
Checking (exact) 1 :E(TRUE U !(ERKPP_Phase3>=1))
Checking (exact) 1 :E(TRUE U (ERKP_MEKPP>=1 * ERKPP_Phase3>=1))
(forward)formula 1,1,0.650916,22652,1,0,10,92283,32,2,668,91174,13
FORMULA MAPK-PT-008-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (AG(EF(((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1))) * !(ERK_MEKPP>=1))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1))))] = FALSE * [(Init * ERK_MEKPP>=1)] = FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * !(E(TRUE U ((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1))))] = FALSE * [(Init * ERK_MEKPP>=1)] = FALSE)
Checking (exact) 1 :[(Init * ERK_MEKPP>=1)] = FALSE
Checking (exact) 0 :(Init * ERK_MEKPP>=1)
Checking (exact) 1 :[(FwdU(Init,TRUE) * !(E(TRUE U ((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U ((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1))))
Checking (exact) 1 :!(E(TRUE U ((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1)))
Checking (exact) 1 :E(TRUE U ((MEKPP>=1 * ERKP>=1) * Raf_RasGTP>=1))
(forward)formula 2,1,0.678073,23424,1,0,12,95227,39,2,672,94217,17
FORMULA MAPK-PT-008-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (ERKPP_Phase3>=1 + (EF(AG((MEKPP>=1 * Phase2>=1))) * !(MEKP_Phase2>=1)))
=> equivalent forward existential formula: ([(Init * ERKPP_Phase3>=1)] != FALSE + [(FwdU((Init * !(MEKP_Phase2>=1)),TRUE) * !(E(TRUE U !((MEKPP>=1 * Phase2>=1)))))] != FALSE)
Checking (exact) 0 :([(Init * ERKPP_Phase3>=1)] != FALSE + [(FwdU((Init * !(MEKP_Phase2>=1)),TRUE) * !(E(TRUE U !((MEKPP>=1 * Phase2>=1)))))] != FALSE)
Checking (exact) 0 :[(Init * ERKPP_Phase3>=1)] != FALSE
Checking (exact) 0 :(Init * ERKPP_Phase3>=1)
Checking (exact) 0 :[(FwdU((Init * !(MEKP_Phase2>=1)),TRUE) * !(E(TRUE U !((MEKPP>=1 * Phase2>=1)))))] != FALSE
Checking (exact) 0 :(FwdU((Init * !(MEKP_Phase2>=1)),TRUE) * !(E(TRUE U !((MEKPP>=1 * Phase2>=1)))))
Checking (exact) 1 :!(E(TRUE U !((MEKPP>=1 * Phase2>=1))))
Checking (exact) 1 :E(TRUE U !((MEKPP>=1 * Phase2>=1)))
(forward)formula 3,0,0.68475,23700,1,0,14,95743,43,2,677,94448,21
FORMULA MAPK-PT-008-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: E(!((!(ERKP_MEKPP>=1) * (Raf_RasGTP>=1 * ERKP_MEKPP>=1))) U AG((ERKP_Phase3>=1 + Raf_RasGTP>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!((!(ERKP_MEKPP>=1) * (Raf_RasGTP>=1 * ERKP_MEKPP>=1)))) * !(E(TRUE U !((ERKP_Phase3>=1 + Raf_RasGTP>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!((!(ERKP_MEKPP>=1) * (Raf_RasGTP>=1 * ERKP_MEKPP>=1)))) * !(E(TRUE U !((ERKP_Phase3>=1 + Raf_RasGTP>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((!(ERKP_MEKPP>=1) * (Raf_RasGTP>=1 * ERKP_MEKPP>=1)))) * !(E(TRUE U !((ERKP_Phase3>=1 + Raf_RasGTP>=1)))))
Checking (exact) 1 :!(E(TRUE U !((ERKP_Phase3>=1 + Raf_RasGTP>=1))))
Checking (exact) 1 :E(TRUE U !((ERKP_Phase3>=1 + Raf_RasGTP>=1)))
(forward)formula 4,0,0.819548,25936,1,0,15,109028,46,2,681,106917,24
FORMULA MAPK-PT-008-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(A(ERKPP_Phase3>=1 U !(ERKPP_Phase3>=1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(!(ERKPP_Phase3>=1))) * (!(ERKPP_Phase3>=1) * !(!(ERKPP_Phase3>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(ERKPP_Phase3>=1)))] = FALSE)
Checking (exact) 0 :([(FwdU(FwdU(Init,TRUE),!(!(ERKPP_Phase3>=1))) * (!(ERKPP_Phase3>=1) * !(!(ERKPP_Phase3>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(ERKPP_Phase3>=1)))] = FALSE)
Checking (exact) 1 :[FwdG(FwdU(Init,TRUE),!(!(ERKPP_Phase3>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(!(ERKPP_Phase3>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 27/0/3
(forward)formula 5,0,0.893544,28412,1,0,16,117263,52,2,714,124930,28
FORMULA MAPK-PT-008-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(EF(AG(((ERKP>=1 * Phase3>=1) * ERKPP_Phase3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((ERKP>=1 * Phase3>=1) * ERKPP_Phase3>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(((ERKP>=1 * Phase3>=1) * ERKPP_Phase3>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(((ERKP>=1 * Phase3>=1) * ERKPP_Phase3>=1)))))
Checking (exact) 1 :!(E(TRUE U !(((ERKP>=1 * Phase3>=1) * ERKPP_Phase3>=1))))
Checking (exact) 1 :E(TRUE U !(((ERKP>=1 * Phase3>=1) * ERKPP_Phase3>=1)))
(forward)formula 6,1,0.903054,28824,1,0,17,118102,58,2,722,125525,31
FORMULA MAPK-PT-008-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EX(AG(EF((MEKP>=1 * RafP>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (MEKP>=1 * RafP>=1))))))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(E(TRUE U !(E(TRUE U (MEKP>=1 * RafP>=1))))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(E(TRUE U !(E(TRUE U (MEKP>=1 * RafP>=1))))))
Checking (exact) 1 :!(E(TRUE U !(E(TRUE U (MEKP>=1 * RafP>=1)))))
Checking (exact) 1 :E(TRUE U !(E(TRUE U (MEKP>=1 * RafP>=1))))
Checking (exact) 1 :!(E(TRUE U (MEKP>=1 * RafP>=1)))
Checking (exact) 1 :E(TRUE U (MEKP>=1 * RafP>=1))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 7,1,0.911557,29092,1,0,19,118785,62,3,724,126312,35
FORMULA MAPK-PT-008-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF((ERKP_Phase3>=1 * ((((Raf>=1 * RasGTP>=1) * ERKP_MEKPP>=1) * (Phase3>=1 * ERKPP>=1)) * (((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (ERKP_Phase3>=1 * ((((Raf>=1 * RasGTP>=1) * ERKP_MEKPP>=1) * (Phase3>=1 * ERKPP>=1)) * (((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (ERKP_Phase3>=1 * ((((Raf>=1 * RasGTP>=1) * ERKP_MEKPP>=1) * (Phase3>=1 * ERKPP>=1)) * (((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (ERKP_Phase3>=1 * ((((Raf>=1 * RasGTP>=1) * ERKP_MEKPP>=1) * (Phase3>=1 * ERKPP>=1)) * (((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1)))))
Checking (exact) 1 :(ERKP_Phase3>=1 * ((((Raf>=1 * RasGTP>=1) * ERKP_MEKPP>=1) * (Phase3>=1 * ERKPP>=1)) * (((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1))))
Checking (exact) 1 :((((Raf>=1 * RasGTP>=1) * ERKP_MEKPP>=1) * (Phase3>=1 * ERKPP>=1)) * (((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1)))
Checking (exact) 1 :(((MEKP>=1 * RafP>=1) * MEKP_RafP>=1) + (MEK_RafP>=1 * ERKP_Phase3>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 8,1,0.928092,29620,1,0,26,121157,84,7,748,130209,39
FORMULA MAPK-PT-008-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: E(EG(ERKP_Phase3>=1) U EF(((Phase3>=1 * ERKPP>=1) * MEKP_RafP>=1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EG(ERKP_Phase3>=1)),TRUE) * ((Phase3>=1 * ERKPP>=1) * MEKP_RafP>=1))] != FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,EG(ERKP_Phase3>=1)),TRUE) * ((Phase3>=1 * ERKPP>=1) * MEKP_RafP>=1))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,EG(ERKP_Phase3>=1)),TRUE) * ((Phase3>=1 * ERKPP>=1) * MEKP_RafP>=1))
Checking (exact) 1 :((Phase3>=1 * ERKPP>=1) * MEKP_RafP>=1)
Checking (exact) 1 :MEKP_RafP>=1
Checking (exact) 1 :FwdU(FwdU(Init,EG(ERKP_Phase3>=1)),TRUE)
Checking (exact) 1 :FwdU(Init,EG(ERKP_Phase3>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :EG(ERKP_Phase3>=1)
(forward)formula 9,1,1.07202,33448,1,0,30,139520,97,10,777,154326,47
FORMULA MAPK-PT-008-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: ((EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))) * (EX((ERKP_Phase3>=1 + MEK_RafP>=1)) + (MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1))))) + ((EG(ERK_MEKPP>=1) + !((MEKPP>=1 * ERKP>=1))) + EF(!((ERK>=1 * MEKPP>=1)))))
=> equivalent forward existential formula: (([(EY((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))) * (ERKP_Phase3>=1 + MEK_RafP>=1))] != FALSE + [((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))) * (MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1))))] != FALSE) + (([FwdG(Init,ERK_MEKPP>=1)] != FALSE + [(Init * !((MEKPP>=1 * ERKP>=1)))] != FALSE) + [(FwdU(Init,TRUE) * !((ERK>=1 * MEKPP>=1)))] != FALSE))
Checking (exact) 0 :(([(EY((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))) * (ERKP_Phase3>=1 + MEK_RafP>=1))] != FALSE + [((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))) * (MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1))))] != FALSE) + (([FwdG(Init,ERK_MEKPP>=1)] != FALSE + [(Init * !((MEKPP>=1 * ERKP>=1)))] != FALSE) + [(FwdU(Init,TRUE) * !((ERK>=1 * MEKPP>=1)))] != FALSE))
Checking (exact) 0 :([(EY((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))) * (ERKP_Phase3>=1 + MEK_RafP>=1))] != FALSE + [((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))) * (MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1))))] != FALSE)
Checking (exact) 0 :[(EY((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))) * (ERKP_Phase3>=1 + MEK_RafP>=1))] != FALSE
Checking (exact) 0 :(EY((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))) * (ERKP_Phase3>=1 + MEK_RafP>=1))
Checking (exact) 1 :(ERKP_Phase3>=1 + MEK_RafP>=1)
Checking (exact) 1 :EY((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))))
Checking (exact) 1 :(Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))
Checking (exact) 1 :EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))
Checking (exact) 1 :Init
Checking (exact) 0 :[((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))) * (MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1))))] != FALSE
Checking (exact) 0 :((Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))) * (MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1))))
Checking (exact) 1 :(MEKP_Phase2>=1 + ((RafP_Phase1>=1 * (ERK>=1 * MEKPP>=1)) + !(Raf_RasGTP>=1)))
Checking (exact) 1 :(Init * EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1))))
Checking (exact) 1 :EG(!((RafP_Phase1>=1 + ERKP_MEKPP>=1)))
Checking (exact) 1 :Init
(forward)formula 10,1,1.10416,34396,1,0,38,142959,116,15,793,164203,52
FORMULA MAPK-PT-008-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AG(AF(!((Raf>=1 * RasGTP>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!((Raf>=1 * RasGTP>=1))))] = FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),!(!((Raf>=1 * RasGTP>=1))))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(!((Raf>=1 * RasGTP>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 26/2/4
(forward)formula 11,0,1.10516,34448,1,0,39,142961,122,15,815,164218,56
FORMULA MAPK-PT-008-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !((AG(ERKPP_Phase3>=1) * !(ERKP_Phase3>=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(ERKPP_Phase3>=1))] != FALSE + [(Init * ERKP_Phase3>=1)] != FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * !(ERKPP_Phase3>=1))] != FALSE + [(Init * ERKP_Phase3>=1)] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(ERKPP_Phase3>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(ERKPP_Phase3>=1))
Checking (exact) 1 :!(ERKPP_Phase3>=1)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 12,1,1.11108,34448,1,0,40,142975,122,17,815,167407,56
FORMULA MAPK-PT-008-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (MEK_RafP>=1 + E(EF((Phase1>=1 * RafP>=1)) U (MEKP_RafP>=1 + ((MEK>=1 * RafP>=1) * Raf_RasGTP>=1))))
=> equivalent forward existential formula: ([(Init * MEK_RafP>=1)] != FALSE + [(FwdU(Init,E(TRUE U (Phase1>=1 * RafP>=1))) * (MEKP_RafP>=1 + ((MEK>=1 * RafP>=1) * Raf_RasGTP>=1)))] != FALSE)
Checking (exact) 0 :([(Init * MEK_RafP>=1)] != FALSE + [(FwdU(Init,E(TRUE U (Phase1>=1 * RafP>=1))) * (MEKP_RafP>=1 + ((MEK>=1 * RafP>=1) * Raf_RasGTP>=1)))] != FALSE)
Checking (exact) 0 :[(Init * MEK_RafP>=1)] != FALSE
Checking (exact) 0 :(Init * MEK_RafP>=1)
Checking (exact) 0 :[(FwdU(Init,E(TRUE U (Phase1>=1 * RafP>=1))) * (MEKP_RafP>=1 + ((MEK>=1 * RafP>=1) * Raf_RasGTP>=1)))] != FALSE
Checking (exact) 0 :(FwdU(Init,E(TRUE U (Phase1>=1 * RafP>=1))) * (MEKP_RafP>=1 + ((MEK>=1 * RafP>=1) * Raf_RasGTP>=1)))
Checking (exact) 1 :(MEKP_RafP>=1 + ((MEK>=1 * RafP>=1) * Raf_RasGTP>=1))
Checking (exact) 1 :FwdU(Init,E(TRUE U (Phase1>=1 * RafP>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :E(TRUE U (Phase1>=1 * RafP>=1))
(forward)formula 13,1,1.11581,34644,1,0,44,143277,131,19,822,167822,61
FORMULA MAPK-PT-008-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: A(EG((MEKPP>=1 * Phase2>=1)) U ((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))) * !(E(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))) U (!(EG((MEKPP>=1 * Phase2>=1))) * !(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))) * !(E(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))) U (!(EG((MEKPP>=1 * Phase2>=1))) * !(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))) * !(E(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))) U (!(EG((MEKPP>=1 * Phase2>=1))) * !(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))))
Checking (exact) 1 :!(E(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))) U (!(EG((MEKPP>=1 * Phase2>=1))) * !(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))))))
Checking (exact) 1 :E(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))) U (!(EG((MEKPP>=1 * Phase2>=1))) * !(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))
Checking (exact) 1 :(!(EG((MEKPP>=1 * Phase2>=1))) * !(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))))
Checking (exact) 1 :!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))
Checking (exact) 1 :!(EG((MEKPP>=1 * Phase2>=1)))
Checking (exact) 1 :EG((MEKPP>=1 * Phase2>=1))
Hit Full ! (commute/partial/dont) 7/0/23
Checking (exact) 1 :(Init * !(EG(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))))))
Checking (exact) 1 :!(EG(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1))))))
Checking (exact) 1 :EG(!(((MEKP_Phase2>=1 + (Phase1>=1 * RafP>=1)) * (!((Phase3>=1 * ERKPP>=1)) + !(MEKPP_Phase2>=1)))))
Checking (exact) 1 :Init
(forward)formula 14,0,1.69961,47836,1,0,48,200896,152,24,868,252073,68
FORMULA MAPK-PT-008-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((!(AX((MEK_RafP>=1 + MEKP_Phase2>=1))) + ((MEKPP_Phase2>=1 + AF((MEKPP>=1 * Phase2>=1))) * AG((MEKP_Phase2>=1 * ERKP_MEKPP>=1)))) + EX((ERKP_Phase3>=1 + AG(Raf_RasGTP>=1))))
=> equivalent forward existential formula: ([FwdG((((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))) * !(MEKPP_Phase2>=1)),!((MEKPP>=1 * Phase2>=1)))] = FALSE * [(FwdU(((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))),TRUE) * !((MEKP_Phase2>=1 * ERKP_MEKPP>=1)))] = FALSE)
Checking (exact) 0 :([FwdG((((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))) * !(MEKPP_Phase2>=1)),!((MEKPP>=1 * Phase2>=1)))] = FALSE * [(FwdU(((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))),TRUE) * !((MEKP_Phase2>=1 * ERKP_MEKPP>=1)))] = FALSE)
Checking (exact) 1 :[(FwdU(((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))),TRUE) * !((MEKP_Phase2>=1 * ERKP_MEKPP>=1)))] = FALSE
Checking (exact) 0 :(FwdU(((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))),TRUE) * !((MEKP_Phase2>=1 * ERKP_MEKPP>=1)))
Checking (exact) 1 :!((MEKP_Phase2>=1 * ERKP_MEKPP>=1))
Checking (exact) 1 :FwdU(((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))),TRUE)
Checking (exact) 1 :((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1)))))))
Checking (exact) 1 :!(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))
Checking (exact) 1 :!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))
Checking (exact) 1 :EX(!((MEK_RafP>=1 + MEKP_Phase2>=1)))
Checking (exact) 1 :(Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1)))))))
Checking (exact) 1 :!(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))
Checking (exact) 1 :EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1)))))
Checking (exact) 1 :(ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))
Checking (exact) 1 :!(E(TRUE U !(Raf_RasGTP>=1)))
Checking (exact) 1 :E(TRUE U !(Raf_RasGTP>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG((((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))) * !(MEKPP_Phase2>=1)),!((MEKPP>=1 * Phase2>=1)))] = FALSE
Checking (exact) 0 :FwdG((((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))) * !(MEKPP_Phase2>=1)),!((MEKPP>=1 * Phase2>=1)))
Checking (exact) 1 :(((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))) * !(MEKPP_Phase2>=1))
Checking (exact) 1 :!(MEKPP_Phase2>=1)
Checking (exact) 1 :((Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))) * !(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1)))))))
Checking (exact) 1 :!(!(!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))))
Checking (exact) 1 :!(EX(!((MEK_RafP>=1 + MEKP_Phase2>=1))))
Checking (exact) 1 :EX(!((MEK_RafP>=1 + MEKP_Phase2>=1)))
Checking (exact) 1 :(Init * !(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1)))))))
Checking (exact) 1 :!(EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))))
Checking (exact) 1 :EX((ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1)))))
Checking (exact) 1 :(ERKP_Phase3>=1 + !(E(TRUE U !(Raf_RasGTP>=1))))
Checking (exact) 1 :!(E(TRUE U !(Raf_RasGTP>=1)))
Checking (exact) 1 :E(TRUE U !(Raf_RasGTP>=1))
Checking (exact) 1 :Init
(forward)formula 15,1,1.83329,50228,1,0,59,212839,162,30,876,270242,76
FORMULA MAPK-PT-008-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
BK_STOP 1463956095874
--------------------
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
May 22, 2016 10:28:13 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 22, 2016 10:28:13 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 25 ms
May 22, 2016 10:28:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 places.
May 22, 2016 10:28:13 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 transitions.
May 22, 2016 10:28:13 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
May 22, 2016 10:28:13 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 8 ms
May 22, 2016 10:28:13 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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="MAPK-PT-008"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/hulinhub/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/MAPK-PT-008.tgz
mv MAPK-PT-008 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 MAPK-PT-008, 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 r061kn-blw3-146358895500301"
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 '
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 ;