About the Execution of ITS-Tools for S_MAPK-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3144.870 | 661874.00 | 666819.00 | 399.60 | FTTTFTFFFTFFFFFT | 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 S_MAPK-PT-020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157kn-blw3-146416412800310
=====================================================================
--------------------
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-020-CTLFireability-0
FORMULA_NAME MAPK-PT-020-CTLFireability-1
FORMULA_NAME MAPK-PT-020-CTLFireability-10
FORMULA_NAME MAPK-PT-020-CTLFireability-11
FORMULA_NAME MAPK-PT-020-CTLFireability-12
FORMULA_NAME MAPK-PT-020-CTLFireability-13
FORMULA_NAME MAPK-PT-020-CTLFireability-14
FORMULA_NAME MAPK-PT-020-CTLFireability-15
FORMULA_NAME MAPK-PT-020-CTLFireability-2
FORMULA_NAME MAPK-PT-020-CTLFireability-3
FORMULA_NAME MAPK-PT-020-CTLFireability-4
FORMULA_NAME MAPK-PT-020-CTLFireability-5
FORMULA_NAME MAPK-PT-020-CTLFireability-6
FORMULA_NAME MAPK-PT-020-CTLFireability-7
FORMULA_NAME MAPK-PT-020-CTLFireability-8
FORMULA_NAME MAPK-PT-020-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1464187587304
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,8.81258e+10,2.77102,71580,2,40643,5,394539,6,0,121,395362,0
Converting to forward existential form...Done !
original formula: EF(!((EF(Raf_RasGTP>=1) + (!(MEKP_RafP>=1) + (ERKPP_Phase3>=1 * MEKP_Phase2>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((!(MEKP_RafP>=1) + (ERKPP_Phase3>=1 * MEKP_Phase2>=1)))) * !(E(TRUE U Raf_RasGTP>=1)))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !((!(MEKP_RafP>=1) + (ERKPP_Phase3>=1 * MEKP_Phase2>=1)))) * !(E(TRUE U Raf_RasGTP>=1)))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !((!(MEKP_RafP>=1) + (ERKPP_Phase3>=1 * MEKP_Phase2>=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)
(forward)formula 0,0,6.91259,112392,1,0,6,489134,14,0,786,500601,5
FORMULA MAPK-PT-020-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (ERK_MEKPP>=1 + AG(!(AG(RafP_Phase1>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(ERK_MEKPP>=1)),TRUE) * !(E(TRUE U !(RafP_Phase1>=1))))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(ERK_MEKPP>=1)),TRUE) * !(E(TRUE U !(RafP_Phase1>=1))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(ERK_MEKPP>=1)),TRUE) * !(E(TRUE U !(RafP_Phase1>=1))))
Checking (exact) 1 :!(E(TRUE U !(RafP_Phase1>=1)))
Checking (exact) 1 :E(TRUE U !(RafP_Phase1>=1))
(forward)formula 1,1,7.01065,116412,1,0,7,491465,16,0,787,503818,8
FORMULA MAPK-PT-020-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(AG(EF(!((Phase3>=1 * ERKPP>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((Phase3>=1 * ERKPP>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !((Phase3>=1 * ERKPP>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !((Phase3>=1 * ERKPP>=1)))))
Checking (exact) 1 :!(E(TRUE U !((Phase3>=1 * ERKPP>=1))))
Checking (exact) 1 :E(TRUE U !((Phase3>=1 * ERKPP>=1)))
(forward)formula 2,0,8.06539,132780,1,0,8,568155,21,0,792,572986,11
FORMULA MAPK-PT-020-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(E(!(ERK_MEKPP>=1) U ((ERKP_MEKPP>=1 * MEKP_Phase2>=1) * (ERKP_MEKPP>=1 * MEKPP_Phase2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(ERK_MEKPP>=1)) * ((ERKP_MEKPP>=1 * MEKP_Phase2>=1) * (ERKP_MEKPP>=1 * MEKPP_Phase2>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(Init,!(ERK_MEKPP>=1)) * ((ERKP_MEKPP>=1 * MEKP_Phase2>=1) * (ERKP_MEKPP>=1 * MEKPP_Phase2>=1)))] = FALSE
Checking (exact) 0 :(FwdU(Init,!(ERK_MEKPP>=1)) * ((ERKP_MEKPP>=1 * MEKP_Phase2>=1) * (ERKP_MEKPP>=1 * MEKPP_Phase2>=1)))
Checking (exact) 1 :((ERKP_MEKPP>=1 * MEKP_Phase2>=1) * (ERKP_MEKPP>=1 * MEKPP_Phase2>=1))
Checking (exact) 1 :(ERKP_MEKPP>=1 * MEKPP_Phase2>=1)
Checking (exact) 1 :MEKPP_Phase2>=1
Checking (exact) 1 :FwdU(Init,!(ERK_MEKPP>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 27/0/3
(forward)formula 3,1,8.47079,144920,1,0,16,645582,38,3,856,679277,17
FORMULA MAPK-PT-020-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: E(!((!(MEK_RafP>=1) * (ERKPP_Phase3>=1 + (MEK>=1 * RafP>=1)))) U ((!((MEKPP>=1 * Phase2>=1)) + !(MEKP_RafP>=1)) * RafP_Phase1>=1))
=> equivalent forward existential formula: [(FwdU(Init,!((!(MEK_RafP>=1) * (ERKPP_Phase3>=1 + (MEK>=1 * RafP>=1))))) * ((!((MEKPP>=1 * Phase2>=1)) + !(MEKP_RafP>=1)) * RafP_Phase1>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!((!(MEK_RafP>=1) * (ERKPP_Phase3>=1 + (MEK>=1 * RafP>=1))))) * ((!((MEKPP>=1 * Phase2>=1)) + !(MEKP_RafP>=1)) * RafP_Phase1>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((!(MEK_RafP>=1) * (ERKPP_Phase3>=1 + (MEK>=1 * RafP>=1))))) * ((!((MEKPP>=1 * Phase2>=1)) + !(MEKP_RafP>=1)) * RafP_Phase1>=1))
Checking (exact) 1 :((!((MEKPP>=1 * Phase2>=1)) + !(MEKP_RafP>=1)) * RafP_Phase1>=1)
Checking (exact) 1 :RafP_Phase1>=1
Checking (exact) 1 :FwdU(Init,!((!(MEK_RafP>=1) * (ERKPP_Phase3>=1 + (MEK>=1 * RafP>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 17/0/13
(forward)formula 4,0,8.64172,150352,1,0,22,659164,65,5,912,697540,22
FORMULA MAPK-PT-020-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: E(!(((Phase2>=1 * MEKP>=1) + RafP_Phase1>=1)) U !((ERKP_MEKPP>=1 + !(ERKP_MEKPP>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(((Phase2>=1 * MEKP>=1) + RafP_Phase1>=1))) * !((ERKP_MEKPP>=1 + !(ERKP_MEKPP>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!(((Phase2>=1 * MEKP>=1) + RafP_Phase1>=1))) * !((ERKP_MEKPP>=1 + !(ERKP_MEKPP>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,!(((Phase2>=1 * MEKP>=1) + RafP_Phase1>=1))) * !((ERKP_MEKPP>=1 + !(ERKP_MEKPP>=1))))
(forward)formula 5,0,8.65128,150812,1,0,22,660044,68,5,915,698596,22
FORMULA MAPK-PT-020-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: E((EX(Raf_RasGTP>=1) + EX((Phase2>=1 * MEKP>=1))) U AG(MEKP_RafP>=1))
=> equivalent forward existential formula: [(FwdU(Init,(EX(Raf_RasGTP>=1) + EX((Phase2>=1 * MEKP>=1)))) * !(E(TRUE U !(MEKP_RafP>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,(EX(Raf_RasGTP>=1) + EX((Phase2>=1 * MEKP>=1)))) * !(E(TRUE U !(MEKP_RafP>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,(EX(Raf_RasGTP>=1) + EX((Phase2>=1 * MEKP>=1)))) * !(E(TRUE U !(MEKP_RafP>=1))))
Checking (exact) 1 :!(E(TRUE U !(MEKP_RafP>=1)))
Checking (exact) 1 :E(TRUE U !(MEKP_RafP>=1))
(forward)formula 6,0,8.66283,151216,1,0,23,661089,68,5,915,699628,25
FORMULA MAPK-PT-020-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(((!(((MEKPP>=1 * Phase2>=1) + (MEKPP>=1 * ERKP>=1))) + !(Raf_RasGTP>=1)) * AG(!((Phase2>=1 * MEKP>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(((MEKPP>=1 * Phase2>=1) + (MEKPP>=1 * ERKP>=1))) + !(Raf_RasGTP>=1))) * !(E(TRUE U !(!((Phase2>=1 * MEKP>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * (!(((MEKPP>=1 * Phase2>=1) + (MEKPP>=1 * ERKP>=1))) + !(Raf_RasGTP>=1))) * !(E(TRUE U !(!((Phase2>=1 * MEKP>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * (!(((MEKPP>=1 * Phase2>=1) + (MEKPP>=1 * ERKP>=1))) + !(Raf_RasGTP>=1))) * !(E(TRUE U !(!((Phase2>=1 * MEKP>=1))))))
Checking (exact) 1 :!(E(TRUE U !(!((Phase2>=1 * MEKP>=1)))))
Checking (exact) 1 :E(TRUE U !(!((Phase2>=1 * MEKP>=1))))
(forward)formula 7,0,8.96959,156960,1,0,24,678308,71,5,917,748624,28
FORMULA MAPK-PT-020-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(AG(RafP_Phase1>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(RafP_Phase1>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(RafP_Phase1>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(RafP_Phase1>=1))))
Checking (exact) 1 :!(E(TRUE U !(RafP_Phase1>=1)))
Checking (exact) 1 :E(TRUE U !(RafP_Phase1>=1))
(forward)formula 8,0,8.96998,157220,1,0,24,678308,71,5,917,748624,28
FORMULA MAPK-PT-020-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (EF((AX(MEKPP_Phase2>=1) * MEK_RafP>=1)) * (EF((MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1)))) * EF(!(((Phase2>=1 * MEKP>=1) * MEKP_Phase2>=1)))))
=> equivalent forward existential formula: [(FwdU(((Init * E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1))) * E(TRUE U (MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1))))),TRUE) * !(((Phase2>=1 * MEKP>=1) * MEKP_Phase2>=1)))] != FALSE
Checking (exact) 0 :[(FwdU(((Init * E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1))) * E(TRUE U (MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1))))),TRUE) * !(((Phase2>=1 * MEKP>=1) * MEKP_Phase2>=1)))] != FALSE
Checking (exact) 0 :(FwdU(((Init * E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1))) * E(TRUE U (MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1))))),TRUE) * !(((Phase2>=1 * MEKP>=1) * MEKP_Phase2>=1)))
Checking (exact) 1 :!(((Phase2>=1 * MEKP>=1) * MEKP_Phase2>=1))
Checking (exact) 1 :FwdU(((Init * E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1))) * E(TRUE U (MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1))))),TRUE)
Checking (exact) 1 :((Init * E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1))) * E(TRUE U (MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1)))))
Checking (exact) 1 :E(TRUE U (MEKP_RafP>=1 * (ERK_MEKPP>=1 + (Raf>=1 * RasGTP>=1))))
Checking (exact) 1 :(Init * E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1)))
Checking (exact) 1 :E(TRUE U (!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1))
Checking (exact) 1 :(!(EX(!(MEKPP_Phase2>=1))) * MEK_RafP>=1)
Checking (exact) 1 :MEK_RafP>=1
Checking (exact) 1 :!(EX(!(MEKPP_Phase2>=1)))
Checking (exact) 1 :EX(!(MEKPP_Phase2>=1))
Checking (exact) 1 :Init
(forward)formula 9,1,23.7718,462248,1,0,33,2.06067e+06,83,10,943,2.63224e+06,39
FORMULA MAPK-PT-020-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AG((EF((MEKP_Phase2>=1 * ERK_MEKPP>=1)) + (MEKPP_Phase2>=1 + (((ERKP>=1 * Phase3>=1) * Raf_RasGTP>=1) * (MEKPP_Phase2>=1 * (Phase2>=1 * MEKP>=1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((MEKPP_Phase2>=1 + (((ERKP>=1 * Phase3>=1) * Raf_RasGTP>=1) * (MEKPP_Phase2>=1 * (Phase2>=1 * MEKP>=1)))))) * !(E(TRUE U (MEKP_Phase2>=1 * ERK_MEKPP>=1))))] = FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !((MEKPP_Phase2>=1 + (((ERKP>=1 * Phase3>=1) * Raf_RasGTP>=1) * (MEKPP_Phase2>=1 * (Phase2>=1 * MEKP>=1)))))) * !(E(TRUE U (MEKP_Phase2>=1 * ERK_MEKPP>=1))))] = FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !((MEKPP_Phase2>=1 + (((ERKP>=1 * Phase3>=1) * Raf_RasGTP>=1) * (MEKPP_Phase2>=1 * (Phase2>=1 * MEKP>=1)))))) * !(E(TRUE U (MEKP_Phase2>=1 * ERK_MEKPP>=1))))
Checking (exact) 1 :!(E(TRUE U (MEKP_Phase2>=1 * ERK_MEKPP>=1)))
Checking (exact) 1 :E(TRUE U (MEKP_Phase2>=1 * ERK_MEKPP>=1))
(forward)formula 10,1,24.0081,464092,1,0,34,2.08263e+06,85,10,945,2.65439e+06,42
FORMULA MAPK-PT-020-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AG((EF(!((Raf>=1 * RasGTP>=1))) + EX(!(ERKPP_Phase3>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(ERKPP_Phase3>=1)))) * !(E(TRUE U !((Raf>=1 * RasGTP>=1)))))] = FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(EX(!(ERKPP_Phase3>=1)))) * !(E(TRUE U !((Raf>=1 * RasGTP>=1)))))] = FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(EX(!(ERKPP_Phase3>=1)))) * !(E(TRUE U !((Raf>=1 * RasGTP>=1)))))
Checking (exact) 1 :!(E(TRUE U !((Raf>=1 * RasGTP>=1))))
Checking (exact) 1 :E(TRUE U !((Raf>=1 * RasGTP>=1)))
(forward)formula 11,1,24.0415,464584,1,0,35,2.08744e+06,86,10,948,2.6587e+06,45
FORMULA MAPK-PT-020-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (((!(AF(MEK_RafP>=1)) * AF(MEKP_Phase2>=1)) * Raf_RasGTP>=1) + ((A(ERKPP_Phase3>=1 U (Phase3>=1 * ERKPP>=1)) + EX(MEKPP_Phase2>=1)) * ((EX(MEKPP_Phase2>=1) + AX(ERKP_Phase3>=1)) + AG(ERKP_MEKPP>=1))))
=> equivalent forward existential formula: (([(FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !(EX(MEKPP_Phase2>=1))),!((Phase3>=1 * ERKPP>=1))) * (!(ERKPP_Phase3>=1) * !((Phase3>=1 * ERKPP>=1))))] = FALSE * [FwdG(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !(EX(MEKPP_Phase2>=1))),!((Phase3>=1 * ERKPP>=1)))] = FALSE) * [(FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1)))))),TRUE) * !(ERKP_MEKPP>=1))] = FALSE)
Checking (exact) 0 :(([(FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !(EX(MEKPP_Phase2>=1))),!((Phase3>=1 * ERKPP>=1))) * (!(ERKPP_Phase3>=1) * !((Phase3>=1 * ERKPP>=1))))] = FALSE * [FwdG(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !(EX(MEKPP_Phase2>=1))),!((Phase3>=1 * ERKPP>=1)))] = FALSE) * [(FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1)))))),TRUE) * !(ERKP_MEKPP>=1))] = FALSE)
Checking (exact) 1 :[(FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1)))))),TRUE) * !(ERKP_MEKPP>=1))] = FALSE
Checking (exact) 0 :(FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1)))))),TRUE) * !(ERKP_MEKPP>=1))
Checking (exact) 1 :!(ERKP_MEKPP>=1)
Checking (exact) 1 :FwdU(((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1)))))),TRUE)
Checking (exact) 1 :((Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))) * !((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1))))))
Checking (exact) 1 :!((EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1)))))
Checking (exact) 1 :(EX(MEKPP_Phase2>=1) + !(EX(!(ERKP_Phase3>=1))))
Checking (exact) 1 :EX(MEKPP_Phase2>=1)
Checking (exact) 1 :!(EX(!(ERKP_Phase3>=1)))
Checking (exact) 1 :EX(!(ERKP_Phase3>=1))
Checking (exact) 1 :(Init * !(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1)))
Checking (exact) 1 :!(((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1))
Checking (exact) 1 :((!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1)))) * Raf_RasGTP>=1)
Checking (exact) 1 :Raf_RasGTP>=1
Checking (exact) 1 :(!(!(EG(!(MEK_RafP>=1)))) * !(EG(!(MEKP_Phase2>=1))))
Checking (exact) 1 :!(EG(!(MEKP_Phase2>=1)))
Checking (exact) 1 :EG(!(MEKP_Phase2>=1))
Checking (exact) 1 :!(!(EG(!(MEK_RafP>=1))))
Checking (exact) 1 :EG(!(MEK_RafP>=1))
Checking (exact) 1 :Init
(forward)formula 12,0,32.4364,611252,1,0,49,2.80567e+06,103,21,967,3.74235e+06,54
FORMULA MAPK-PT-020-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (MEK_RafP>=1 + !((EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1))) * ((Phase3>=1 * ERKPP>=1) + AF((Raf>=1 * RasGTP>=1))))))
=> equivalent forward existential formula: ([(Init * MEK_RafP>=1)] != FALSE + ([(Init * !(EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1)))))] != FALSE + [FwdG((Init * !((Phase3>=1 * ERKPP>=1))),!((Raf>=1 * RasGTP>=1)))] != FALSE))
Checking (exact) 0 :([(Init * MEK_RafP>=1)] != FALSE + ([(Init * !(EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1)))))] != FALSE + [FwdG((Init * !((Phase3>=1 * ERKPP>=1))),!((Raf>=1 * RasGTP>=1)))] != FALSE))
Checking (exact) 0 :[(Init * MEK_RafP>=1)] != FALSE
Checking (exact) 0 :(Init * MEK_RafP>=1)
Checking (exact) 0 :([(Init * !(EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1)))))] != FALSE + [FwdG((Init * !((Phase3>=1 * ERKPP>=1))),!((Raf>=1 * RasGTP>=1)))] != FALSE)
Checking (exact) 0 :[(Init * !(EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1)))))] != FALSE
Checking (exact) 0 :(Init * !(EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1)))))
Checking (exact) 1 :!(EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1))))
Checking (exact) 1 :EG((ERKP_MEKPP>=1 * (Phase1>=1 * RafP>=1)))
Checking (exact) 1 :Init
(forward)formula 13,1,32.6815,615836,1,0,52,2.8275e+06,114,23,975,3.76342e+06,57
FORMULA MAPK-PT-020-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AF((E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1)) * MEK_RafP>=1))
=> equivalent forward existential formula: [FwdG(Init,!((E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1)) * MEK_RafP>=1)))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1)) * MEK_RafP>=1)))] = FALSE
Checking (exact) 0 :FwdG(Init,!((E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1)) * MEK_RafP>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :!((E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1)) * MEK_RafP>=1))
Checking (exact) 1 :(E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1)) * MEK_RafP>=1)
Checking (exact) 1 :MEK_RafP>=1
Checking (exact) 1 :E(MEKP_Phase2>=1 U (MEKPP>=1 * Phase2>=1))
Hit Full ! (commute/partial/dont) 27/0/3
(forward)formula 14,0,658.144,2731632,1,0,210,1.23779e+07,10,184,591,1.97574e+07,134
FORMULA MAPK-PT-020-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (ERK>=1 * MEKPP>=1)
=> equivalent forward existential formula: [(Init * (ERK>=1 * MEKPP>=1))] != FALSE
Checking (exact) 0 :[(Init * (ERK>=1 * MEKPP>=1))] != FALSE
Checking (exact) 0 :(Init * (ERK>=1 * MEKPP>=1))
(forward)formula 15,0,658.144,2731632,1,0,210,1.23779e+07,14,184,593,1.97574e+07,135
FORMULA MAPK-PT-020-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
BK_STOP 1464188249178
--------------------
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 25, 2016 2:46:29 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2016 2:46:29 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 24 ms
May 25, 2016 2:46:29 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 places.
May 25, 2016 2:46:29 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 transitions.
May 25, 2016 2:46:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 31 ms
May 25, 2016 2:46:29 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 8 ms
May 25, 2016 2:46:29 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="S_MAPK-PT-020"
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/S_MAPK-PT-020.tgz
mv S_MAPK-PT-020 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_MAPK-PT-020, 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 r157kn-blw3-146416412800310"
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 ;