About the Execution of ITS-Tools for S_Kanban-PT-0050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2592.610 | 222410.00 | 226344.00 | 206.50 | FTTTFTFTFFTFFFFF | 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_Kanban-PT-0050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157kn-blw3-146416412400130
=====================================================================
--------------------
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 Kanban-PT-0050-CTLFireability-0
FORMULA_NAME Kanban-PT-0050-CTLFireability-1
FORMULA_NAME Kanban-PT-0050-CTLFireability-10
FORMULA_NAME Kanban-PT-0050-CTLFireability-11
FORMULA_NAME Kanban-PT-0050-CTLFireability-12
FORMULA_NAME Kanban-PT-0050-CTLFireability-13
FORMULA_NAME Kanban-PT-0050-CTLFireability-14
FORMULA_NAME Kanban-PT-0050-CTLFireability-15
FORMULA_NAME Kanban-PT-0050-CTLFireability-2
FORMULA_NAME Kanban-PT-0050-CTLFireability-3
FORMULA_NAME Kanban-PT-0050-CTLFireability-4
FORMULA_NAME Kanban-PT-0050-CTLFireability-5
FORMULA_NAME Kanban-PT-0050-CTLFireability-6
FORMULA_NAME Kanban-PT-0050-CTLFireability-7
FORMULA_NAME Kanban-PT-0050-CTLFireability-8
FORMULA_NAME Kanban-PT-0050-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1464172401353
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.04259e+16,8.25814,168900,2,667,5,1.18867e+06,6,0,83,1.22088e+06,0
Converting to forward existential form...Done !
original formula: !(AG(EF((Pm4>=1 + Pm2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pm2>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pm2>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pm2>=1))))
Checking (exact) 1 :!(E(TRUE U (Pm4>=1 + Pm2>=1)))
Checking (exact) 1 :E(TRUE U (Pm4>=1 + Pm2>=1))
(forward)formula 0,0,8.45668,168964,1,0,6,1.18867e+06,16,0,1132,1.22088e+06,5
FORMULA Kanban-PT-0050-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (EF((AX(((P2>=1 * Pout4>=1) * P3>=1)) * !((P4>=1 + Pback2>=1)))) * (Pm4>=1 + !(A(((Pout2>=1 * Pout3>=1) * P1>=1) U Pback4>=1))))
=> equivalent forward existential formula: ([((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))) * Pm4>=1)] != FALSE + ([(FwdU((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1)) * (!(((Pout2>=1 * Pout3>=1) * P1>=1)) * !(Pback4>=1)))] != FALSE + [FwdG((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1))] != FALSE))
Checking (exact) 0 :([((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))) * Pm4>=1)] != FALSE + ([(FwdU((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1)) * (!(((Pout2>=1 * Pout3>=1) * P1>=1)) * !(Pback4>=1)))] != FALSE + [FwdG((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1))] != FALSE))
Checking (exact) 0 :[((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))) * Pm4>=1)] != FALSE
Checking (exact) 0 :((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))) * Pm4>=1)
Checking (exact) 1 :Pm4>=1
Checking (exact) 1 :(Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1)))))
Checking (exact) 1 :E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))
Checking (exact) 1 :(!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1)))
Checking (exact) 1 :!((P4>=1 + Pback2>=1))
Checking (exact) 1 :!(EX(!(((P2>=1 * Pout4>=1) * P3>=1))))
Checking (exact) 1 :EX(!(((P2>=1 * Pout4>=1) * P3>=1)))
Checking (exact) 1 :Init
Checking (exact) 0 :([(FwdU((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1)) * (!(((Pout2>=1 * Pout3>=1) * P1>=1)) * !(Pback4>=1)))] != FALSE + [FwdG((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1))] != FALSE)
Checking (exact) 0 :[(FwdU((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1)) * (!(((Pout2>=1 * Pout3>=1) * P1>=1)) * !(Pback4>=1)))] != FALSE
Checking (exact) 0 :(FwdU((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1)) * (!(((Pout2>=1 * Pout3>=1) * P1>=1)) * !(Pback4>=1)))
Checking (exact) 1 :(!(((Pout2>=1 * Pout3>=1) * P1>=1)) * !(Pback4>=1))
Checking (exact) 1 :!(Pback4>=1)
Checking (exact) 1 :FwdU((Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))),!(Pback4>=1))
Checking (exact) 1 :(Init * E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1)))))
Checking (exact) 1 :E(TRUE U (!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1))))
Checking (exact) 1 :(!(EX(!(((P2>=1 * Pout4>=1) * P3>=1)))) * !((P4>=1 + Pback2>=1)))
Checking (exact) 1 :!((P4>=1 + Pback2>=1))
Checking (exact) 1 :!(EX(!(((P2>=1 * Pout4>=1) * P3>=1))))
Checking (exact) 1 :EX(!(((P2>=1 * Pout4>=1) * P3>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 14/0/2
(forward)formula 1,1,15.4426,192720,1,0,20,1.32686e+06,46,8,1191,1.35648e+06,16
FORMULA Kanban-PT-0050-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(AG(!(((Pm4>=1 * Pout1>=1) * !(Pm4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((Pm4>=1 * Pout1>=1) * !(Pm4>=1)))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * ((Pm4>=1 * Pout1>=1) * !(Pm4>=1)))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * ((Pm4>=1 * Pout1>=1) * !(Pm4>=1)))
(forward)formula 2,0,15.4476,193136,1,0,20,1.32835e+06,52,8,1196,1.35781e+06,16
FORMULA Kanban-PT-0050-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(AG(Pm3>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(Pm3>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(Pm3>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(Pm3>=1))))
Checking (exact) 1 :!(E(TRUE U !(Pm3>=1)))
Checking (exact) 1 :E(TRUE U !(Pm3>=1))
(forward)formula 3,0,15.5049,194156,1,0,21,1.33194e+06,54,8,1197,1.36011e+06,19
FORMULA Kanban-PT-0050-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (AG(EF((Pm4>=1 + Pback3>=1))) * !(AX(Pback3>=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pback3>=1))))] = FALSE * [(Init * !(EX(!(Pback3>=1))))] = FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pback3>=1))))] = FALSE * [(Init * !(EX(!(Pback3>=1))))] = FALSE)
Checking (exact) 1 :[(Init * !(EX(!(Pback3>=1))))] = FALSE
Checking (exact) 0 :(Init * !(EX(!(Pback3>=1))))
Checking (exact) 1 :!(EX(!(Pback3>=1)))
Checking (exact) 1 :EX(!(Pback3>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pback3>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (Pm4>=1 + Pback3>=1))))
Checking (exact) 1 :!(E(TRUE U (Pm4>=1 + Pback3>=1)))
Checking (exact) 1 :E(TRUE U (Pm4>=1 + Pback3>=1))
(forward)formula 4,1,15.5574,195324,1,0,25,1.33931e+06,57,10,1199,1.36757e+06,24
FORMULA Kanban-PT-0050-CTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF(AG(Pback3>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(Pback3>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(Pback3>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(Pback3>=1))))
Checking (exact) 1 :!(E(TRUE U !(Pback3>=1)))
Checking (exact) 1 :E(TRUE U !(Pback3>=1))
(forward)formula 5,0,15.5652,195596,1,0,25,1.33968e+06,57,10,1199,1.36776e+06,26
FORMULA Kanban-PT-0050-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(AG(P4>=1))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),TRUE) * !(P4>=1))] = FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),TRUE) * !(P4>=1))] = FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),TRUE) * !(P4>=1))
Checking (exact) 1 :!(P4>=1)
Checking (exact) 1 :FwdU(FwdU(Init,TRUE),TRUE)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 6,0,15.5718,195732,1,0,28,1.33983e+06,59,12,1200,1.3682e+06,29
FORMULA Kanban-PT-0050-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (AG(EX(P4>=1)) + EX(AX(!(Pm4>=1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(!(EX(!(!(Pm4>=1))))))),TRUE) * !(EX(P4>=1)))] = FALSE
Checking (exact) 0 :[(FwdU((Init * !(EX(!(EX(!(!(Pm4>=1))))))),TRUE) * !(EX(P4>=1)))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(EX(!(EX(!(!(Pm4>=1))))))),TRUE) * !(EX(P4>=1)))
Checking (exact) 1 :!(EX(P4>=1))
Checking (exact) 1 :EX(P4>=1)
Checking (exact) 1 :FwdU((Init * !(EX(!(EX(!(!(Pm4>=1))))))),TRUE)
Checking (exact) 1 :(Init * !(EX(!(EX(!(!(Pm4>=1)))))))
Checking (exact) 1 :!(EX(!(EX(!(!(Pm4>=1))))))
Checking (exact) 1 :EX(!(EX(!(!(Pm4>=1)))))
Checking (exact) 1 :!(EX(!(!(Pm4>=1))))
Checking (exact) 1 :EX(!(!(Pm4>=1)))
Checking (exact) 1 :Init
(forward)formula 7,0,15.607,196176,1,0,33,1.34237e+06,59,17,1200,1.37116e+06,34
FORMULA Kanban-PT-0050-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((!((!(Pback1>=1) * Pback4>=1)) + AX((P4>=1 * Pm1>=1))) * EF(AG((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1)))))
=> equivalent forward existential formula: ([(EY((Init * !(!((!(Pback1>=1) * Pback4>=1))))) * !((P4>=1 * Pm1>=1)))] = FALSE * [(Init * !(E(TRUE U !(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1))))))))] = FALSE)
Checking (exact) 0 :([(EY((Init * !(!((!(Pback1>=1) * Pback4>=1))))) * !((P4>=1 * Pm1>=1)))] = FALSE * [(Init * !(E(TRUE U !(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1))))))))] = FALSE)
Checking (exact) 1 :[(Init * !(E(TRUE U !(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1))))))))] = FALSE
Checking (exact) 0 :(Init * !(E(TRUE U !(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1))))))))
Checking (exact) 1 :!(E(TRUE U !(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1)))))))
Checking (exact) 1 :E(TRUE U !(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1))))))
Checking (exact) 1 :!(E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1)))))
Checking (exact) 1 :E(TRUE U !((Pback2>=1 * ((Pout2>=1 * Pout3>=1) * P1>=1))))
Checking (exact) 1 :Init
(forward)formula 8,0,16.2854,209840,1,0,34,1.4225e+06,62,17,1205,1.44618e+06,37
FORMULA Kanban-PT-0050-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((A((Pback1>=1 * Pm3>=1) U Pm2>=1) + AG(P4>=1)) * EF(E(Pm2>=1 U Pm1>=1)))
=> equivalent forward existential formula: ([(FwdU((Init * !(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))))),TRUE) * !(P4>=1))] = FALSE * [(Init * !(E(TRUE U E(Pm2>=1 U Pm1>=1))))] = FALSE)
Checking (exact) 0 :([(FwdU((Init * !(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))))),TRUE) * !(P4>=1))] = FALSE * [(Init * !(E(TRUE U E(Pm2>=1 U Pm1>=1))))] = FALSE)
Checking (exact) 1 :[(Init * !(E(TRUE U E(Pm2>=1 U Pm1>=1))))] = FALSE
Checking (exact) 0 :(Init * !(E(TRUE U E(Pm2>=1 U Pm1>=1))))
Checking (exact) 1 :!(E(TRUE U E(Pm2>=1 U Pm1>=1)))
Checking (exact) 1 :E(TRUE U E(Pm2>=1 U Pm1>=1))
Checking (exact) 1 :E(Pm2>=1 U Pm1>=1)
Hit Full ! (commute/partial/dont) 12/0/4
Checking (exact) 1 :[(FwdU((Init * !(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))))),TRUE) * !(P4>=1))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))))),TRUE) * !(P4>=1))
Checking (exact) 1 :!(P4>=1)
Checking (exact) 1 :FwdU((Init * !(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))))),TRUE)
Checking (exact) 1 :(Init * !(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1))))))
Checking (exact) 1 :!(!((E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))))
Checking (exact) 1 :(E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1))) + EG(!(Pm2>=1)))
Checking (exact) 1 :E(!(Pm2>=1) U (!((Pback1>=1 * Pm3>=1)) * !(Pm2>=1)))
Hit Full ! (commute/partial/dont) 12/0/4
Checking (exact) 1 :EG(!(Pm2>=1))
Checking (exact) 1 :Init
(forward)formula 9,0,18.0155,242664,1,0,40,1.59891e+06,85,19,1256,1.60612e+06,50
FORMULA Kanban-PT-0050-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !((E(!(P4>=1) U !(Pm1>=1)) * Pm4>=1))
=> equivalent forward existential formula: ([(Init * !(E(!(P4>=1) U !(Pm1>=1))))] != FALSE + [(Init * !(Pm4>=1))] != FALSE)
Checking (exact) 0 :([(Init * !(E(!(P4>=1) U !(Pm1>=1))))] != FALSE + [(Init * !(Pm4>=1))] != FALSE)
Checking (exact) 0 :[(Init * !(E(!(P4>=1) U !(Pm1>=1))))] != FALSE
Checking (exact) 0 :(Init * !(E(!(P4>=1) U !(Pm1>=1))))
Checking (exact) 1 :!(E(!(P4>=1) U !(Pm1>=1)))
Checking (exact) 1 :E(!(P4>=1) U !(Pm1>=1))
Hit Full ! (commute/partial/dont) 14/0/2
Checking (exact) 1 :Init
Checking (exact) 0 :[(Init * !(Pm4>=1))] != FALSE
Checking (exact) 0 :(Init * !(Pm4>=1))
(forward)formula 10,1,18.2187,246404,1,0,44,1.61359e+06,92,21,1270,1.61927e+06,55
FORMULA Kanban-PT-0050-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (((E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)) * (((Pback4>=1 + Pm1>=1) + Pback1>=1) * AX(P4>=1))) + (Pm2>=1 + EX(!(Pm2>=1)))) + EF(E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))
=> equivalent forward existential formula: ([(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))] = FALSE * ([(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(((Pback4>=1 + Pm1>=1) + Pback1>=1)))] = FALSE * [(EY(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))) * !(P4>=1))] = FALSE))
Checking (exact) 0 :([(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))] = FALSE * ([(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(((Pback4>=1 + Pm1>=1) + Pback1>=1)))] = FALSE * [(EY(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))) * !(P4>=1))] = FALSE))
Checking (exact) 1 :([(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(((Pback4>=1 + Pm1>=1) + Pback1>=1)))] = FALSE * [(EY(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))) * !(P4>=1))] = FALSE)
Checking (exact) 1 :[(EY(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))) * !(P4>=1))] = FALSE
Checking (exact) 0 :(EY(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))) * !(P4>=1))
Checking (exact) 1 :!(P4>=1)
Checking (exact) 1 :EY(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))))
Checking (exact) 1 :((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))
Checking (exact) 1 :!((Pm2>=1 + EX(!(Pm2>=1))))
Checking (exact) 1 :(Pm2>=1 + EX(!(Pm2>=1)))
Checking (exact) 1 :EX(!(Pm2>=1))
Checking (exact) 1 :(Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))))
Checking (exact) 1 :!(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))
Checking (exact) 1 :E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))
Checking (exact) 1 :E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))
Hit Full ! (commute/partial/dont) 14/0/2
Checking (exact) 1 :[(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(((Pback4>=1 + Pm1>=1) + Pback1>=1)))] = FALSE
Checking (exact) 0 :(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(((Pback4>=1 + Pm1>=1) + Pback1>=1)))
Checking (exact) 1 :!(((Pback4>=1 + Pm1>=1) + Pback1>=1))
Checking (exact) 1 :((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))
Checking (exact) 1 :!((Pm2>=1 + EX(!(Pm2>=1))))
Checking (exact) 1 :(Pm2>=1 + EX(!(Pm2>=1)))
Checking (exact) 1 :EX(!(Pm2>=1))
Checking (exact) 1 :(Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))))
Checking (exact) 1 :!(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))
Checking (exact) 1 :E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))
Checking (exact) 1 :E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))
Checking (exact) 1 :[(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))] = FALSE
Checking (exact) 0 :(((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1))))) * !(E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))
Checking (exact) 1 :!(E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))
Checking (exact) 1 :E(P4>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))
Hit Full ! (commute/partial/dont) 14/0/2
Checking (exact) 1 :((Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))) * !((Pm2>=1 + EX(!(Pm2>=1)))))
Checking (exact) 1 :!((Pm2>=1 + EX(!(Pm2>=1))))
Checking (exact) 1 :(Pm2>=1 + EX(!(Pm2>=1)))
Checking (exact) 1 :EX(!(Pm2>=1))
Checking (exact) 1 :(Init * !(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))))
Checking (exact) 1 :!(E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))))
Checking (exact) 1 :E(TRUE U E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1)))
Checking (exact) 1 :E(Pout1>=1 U ((Pout2>=1 * Pout3>=1) * P1>=1))
(forward)formula 11,1,18.7041,254420,1,0,55,1.66106e+06,107,25,1312,1.67003e+06,65
FORMULA Kanban-PT-0050-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: ((!((P4>=1 + Pm1>=1)) * !(Pm1>=1)) * (EG(Pback4>=1) * AF(Pback4>=1)))
=> equivalent forward existential formula: ([(Init * !((!((P4>=1 + Pm1>=1)) * !(Pm1>=1))))] = FALSE * ([(Init * !(EG(Pback4>=1)))] = FALSE * [FwdG(Init,!(Pback4>=1))] = FALSE))
Checking (exact) 0 :([(Init * !((!((P4>=1 + Pm1>=1)) * !(Pm1>=1))))] = FALSE * ([(Init * !(EG(Pback4>=1)))] = FALSE * [FwdG(Init,!(Pback4>=1))] = FALSE))
Checking (exact) 1 :([(Init * !(EG(Pback4>=1)))] = FALSE * [FwdG(Init,!(Pback4>=1))] = FALSE)
Checking (exact) 1 :[FwdG(Init,!(Pback4>=1))] = FALSE
Checking (exact) 0 :FwdG(Init,!(Pback4>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 14/0/2
(forward)formula 12,0,18.7046,254576,1,0,55,1.66106e+06,114,26,1318,1.67003e+06,68
FORMULA Kanban-PT-0050-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(AX(Pm2>=1))
=> equivalent forward existential formula: [(EY(Init) * !(Pm2>=1))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(Pm2>=1))] != FALSE
Checking (exact) 0 :(EY(Init) * !(Pm2>=1))
Checking (exact) 1 :!(Pm2>=1)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 13,1,18.7098,254576,1,0,56,1.66106e+06,114,28,1318,1.67084e+06,69
FORMULA Kanban-PT-0050-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EX(Pback3>=1)
=> equivalent forward existential formula: [(EY(Init) * Pback3>=1)] != FALSE
Checking (exact) 0 :[(EY(Init) * Pback3>=1)] != FALSE
Checking (exact) 0 :(EY(Init) * Pback3>=1)
Checking (exact) 1 :Pback3>=1
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 14,0,18.7101,254584,1,0,58,1.66107e+06,114,29,1318,1.67085e+06,70
FORMULA Kanban-PT-0050-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG(AF(((P4>=1 * Pm2>=1) + !(Pback4>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((P4>=1 * Pm2>=1) + !(Pback4>=1))))))] != FALSE
Checking (exact) 0 :[FwdG(Init,!(EG(!(((P4>=1 * Pm2>=1) + !(Pback4>=1))))))] != FALSE
Checking (exact) 0 :FwdG(Init,!(EG(!(((P4>=1 * Pm2>=1) + !(Pback4>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG(!(((P4>=1 * Pm2>=1) + !(Pback4>=1)))))
Checking (exact) 1 :EG(!(((P4>=1 * Pm2>=1) + !(Pback4>=1))))
(forward)formula 15,1,219.185,2200664,1,0,1202,1.52438e+07,10,1167,1013,1.68972e+07,268
FORMULA Kanban-PT-0050-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
BK_STOP 1464172623763
--------------------
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 10:33:23 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2016 10:33:23 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 20 ms
May 25, 2016 10:33:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 places.
May 25, 2016 10:33:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
May 25, 2016 10:33:23 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
May 25, 2016 10:33:23 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 7 ms
May 25, 2016 10:33:23 AM 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_Kanban-PT-0050"
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_Kanban-PT-0050.tgz
mv S_Kanban-PT-0050 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_Kanban-PT-0050, 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-146416412400130"
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 ;