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_Dekker-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r145kn-smll-146416245600004
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464163901527


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,6144,0.059839,5484,2,198,5,3061,6,0,323,1662,0


Converting to forward existential form...Done !
original formula: EF((EG((((flag_1_3>=1 * flag_1_4>=1) * p1_4>=1) + ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1))) * EG((((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1) * (flag_1_6>=1 * p3_6>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * EG((((flag_1_3>=1 * flag_1_4>=1) * p1_4>=1) + ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)))),(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1) * (flag_1_6>=1 * p3_6>=1)))] != FALSE
Checking (exact) 0 :[FwdG((FwdU(Init,TRUE) * EG((((flag_1_3>=1 * flag_1_4>=1) * p1_4>=1) + ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)))),(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1) * (flag_1_6>=1 * p3_6>=1)))] != FALSE
Checking (exact) 0 :FwdG((FwdU(Init,TRUE) * EG((((flag_1_3>=1 * flag_1_4>=1) * p1_4>=1) + ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)))),(((flag_1_7>=1 * flag_1_9>=1) * p1_7>=1) * (flag_1_6>=1 * p3_6>=1)))
Checking (exact) 1 :(FwdU(Init,TRUE) * EG((((flag_1_3>=1 * flag_1_4>=1) * p1_4>=1) + ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1))))
Checking (exact) 1 :EG((((flag_1_3>=1 * flag_1_4>=1) * p1_4>=1) + ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 64/207/56
(forward)formula 0,1,0.213035,8140,1,0,265,18902,295,127,2806,15265,260
FORMULA Dekker-PT-010-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(((!(((flag_1_4>=1 * flag_1_7>=1) * p1_4>=1)) + !(((flag_1_3>=1 * flag_1_8>=1) * p1_3>=1))) + (!((flag_1_6>=1 * p3_6>=1)) * !((flag_1_0>=1 * p3_0>=1)))) U AX((((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((!(((flag_1_4>=1 * flag_1_7>=1) * p1_4>=1)) + !(((flag_1_3>=1 * flag_1_8>=1) * p1_3>=1))) + (!((flag_1_6>=1 * p3_6>=1)) * !((flag_1_0>=1 * p3_0>=1))))) * !(EX(!((((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,((!(((flag_1_4>=1 * flag_1_7>=1) * p1_4>=1)) + !(((flag_1_3>=1 * flag_1_8>=1) * p1_3>=1))) + (!((flag_1_6>=1 * p3_6>=1)) * !((flag_1_0>=1 * p3_0>=1))))) * !(EX(!((((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,((!(((flag_1_4>=1 * flag_1_7>=1) * p1_4>=1)) + !(((flag_1_3>=1 * flag_1_8>=1) * p1_3>=1))) + (!((flag_1_6>=1 * p3_6>=1)) * !((flag_1_0>=1 * p3_0>=1))))) * !(EX(!((((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))))))
Checking (exact) 1 :!(EX(!((((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1)))))
Checking (exact) 1 :EX(!((((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1) * (flag_1_9>=1 * p3_9>=1))))
(forward)formula 1,0,0.219218,8140,1,0,266,19455,301,127,2819,15969,265
FORMULA Dekker-PT-010-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (E((!(((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) + !((flag_0_4>=1 * p0_4>=1))) U ((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1)) * E(!((((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1))) U ((flag_1_8>=1 * p3_8>=1) * ((flag_1_7>=1 * p3_7>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * E((!(((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) + !((flag_0_4>=1 * p0_4>=1))) U ((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))),!((((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))) * ((flag_1_8>=1 * p3_8>=1) * ((flag_1_7>=1 * p3_7>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * E((!(((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) + !((flag_0_4>=1 * p0_4>=1))) U ((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))),!((((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))) * ((flag_1_8>=1 * p3_8>=1) * ((flag_1_7>=1 * p3_7>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))))] != FALSE
Checking (exact) 0 :(FwdU((Init * E((!(((flag_1_0>=1 * flag_1_8>=1) * p1_0>=1)) + !((flag_0_4>=1 * p0_4>=1))) U ((flag_1_6>=1 * flag_1_9>=1) * p1_6>=1))),!((((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1) * ((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)))) * ((flag_1_8>=1 * p3_8>=1) * ((flag_1_7>=1 * p3_7>=1) * ((flag_1_0>=1 * flag_1_3>=1) * p1_0>=1))))
(forward)formula 2,0,0.220298,8296,1,0,266,19492,316,127,2833,15973,265
FORMULA Dekker-PT-010-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(AG(((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))))
Checking (exact) 1 :!(E(TRUE U !(((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))
Checking (exact) 1 :E(TRUE U !(((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))
(forward)formula 3,0,0.23116,8488,1,0,267,20840,327,127,2883,16809,271
FORMULA Dekker-PT-010-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(EF((((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1))) U (!(((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1) * ((flag_1_6>=1 * flag_1_7>=1) * p1_7>=1))) * AF(((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1))))
=> equivalent forward existential formula: [((FwdU(Init,E(TRUE U (((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1)))) * !(((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1) * ((flag_1_6>=1 * flag_1_7>=1) * p1_7>=1)))) * !(EG(!(((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1)))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,E(TRUE U (((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1)))) * !(((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1) * ((flag_1_6>=1 * flag_1_7>=1) * p1_7>=1)))) * !(EG(!(((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1)))))] != FALSE
Checking (exact) 0 :((FwdU(Init,E(TRUE U (((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1)))) * !(((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1) * ((flag_1_6>=1 * flag_1_7>=1) * p1_7>=1)))) * !(EG(!(((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1)))))
Checking (exact) 1 :!(EG(!(((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1))))
Checking (exact) 1 :EG(!(((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1)))
Checking (exact) 1 :(FwdU(Init,E(TRUE U (((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1)))) * !(((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1) * ((flag_1_6>=1 * flag_1_7>=1) * p1_7>=1))))
Checking (exact) 1 :!(((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1) * ((flag_1_6>=1 * flag_1_7>=1) * p1_7>=1)))
Checking (exact) 1 :FwdU(Init,E(TRUE U (((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :E(TRUE U (((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) * (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_6>=1)))
(forward)formula 4,0,0.251909,9244,1,0,270,23035,383,132,2944,19343,283
FORMULA Dekker-PT-010-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(((((flag_1_1>=1 * flag_1_7>=1) * p1_7>=1) + AX(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1))) * ((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))
=> equivalent forward existential formula: ([(EY((EY(Init) * !(((flag_1_1>=1 * flag_1_7>=1) * p1_7>=1)))) * !(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1)))] = FALSE * [(EY(Init) * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))] = FALSE)
Checking (exact) 0 :([(EY((EY(Init) * !(((flag_1_1>=1 * flag_1_7>=1) * p1_7>=1)))) * !(((flag_1_4>=1 * flag_1_6>=1) * p1_4>=1)))] = FALSE * [(EY(Init) * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))] = FALSE)
Checking (exact) 1 :[(EY(Init) * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))] = FALSE
Checking (exact) 0 :(EY(Init) * !(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1)))
Checking (exact) 1 :!(((flag_1_1>=1 * flag_1_6>=1) * p1_1>=1))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 5,0,0.254169,9244,1,0,273,23226,389,134,2952,19636,285
FORMULA Dekker-PT-010-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(!(((!(((flag_1_4>=1 * flag_1_8>=1) * p1_4>=1)) + (((flag_1_3>=1 * flag_1_4>=1) * p1_3>=1) * (flag_0_5>=1 * p0_5>=1))) + ((((flag_1_1>=1 * flag_1_9>=1) * p1_9>=1) + ((flag_1_4>=1 * flag_1_9>=1) * p1_4>=1)) * (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) + (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(((!(((flag_1_4>=1 * flag_1_8>=1) * p1_4>=1)) + (((flag_1_3>=1 * flag_1_4>=1) * p1_3>=1) * (flag_0_5>=1 * p0_5>=1))) + ((((flag_1_1>=1 * flag_1_9>=1) * p1_9>=1) + ((flag_1_4>=1 * flag_1_9>=1) * p1_4>=1)) * (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) + (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1))))))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(((!(((flag_1_4>=1 * flag_1_8>=1) * p1_4>=1)) + (((flag_1_3>=1 * flag_1_4>=1) * p1_3>=1) * (flag_0_5>=1 * p0_5>=1))) + ((((flag_1_1>=1 * flag_1_9>=1) * p1_9>=1) + ((flag_1_4>=1 * flag_1_9>=1) * p1_4>=1)) * (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) + (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1))))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(((!(((flag_1_4>=1 * flag_1_8>=1) * p1_4>=1)) + (((flag_1_3>=1 * flag_1_4>=1) * p1_3>=1) * (flag_0_5>=1 * p0_5>=1))) + ((((flag_1_1>=1 * flag_1_9>=1) * p1_9>=1) + ((flag_1_4>=1 * flag_1_9>=1) * p1_4>=1)) * (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) + (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1))))))
Checking (exact) 1 :!(((!(((flag_1_4>=1 * flag_1_8>=1) * p1_4>=1)) + (((flag_1_3>=1 * flag_1_4>=1) * p1_3>=1) * (flag_0_5>=1 * p0_5>=1))) + ((((flag_1_1>=1 * flag_1_9>=1) * p1_9>=1) + ((flag_1_4>=1 * flag_1_9>=1) * p1_4>=1)) * (((flag_1_7>=1 * flag_1_8>=1) * p1_7>=1) + (((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1)))))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 6,0,0.264179,9256,1,0,276,23639,431,136,3030,20380,286
FORMULA Dekker-PT-010-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EF(((flag_1_7>=1 * flag_1_8>=1) * p1_8>=1)) + EX((flag_0_9>=1 * p0_9>=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((flag_1_7>=1 * flag_1_8>=1) * p1_8>=1))] != FALSE + [(EY(Init) * (flag_0_9>=1 * p0_9>=1))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * ((flag_1_7>=1 * flag_1_8>=1) * p1_8>=1))] != FALSE + [(EY(Init) * (flag_0_9>=1 * p0_9>=1))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * ((flag_1_7>=1 * flag_1_8>=1) * p1_8>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * ((flag_1_7>=1 * flag_1_8>=1) * p1_8>=1))
Checking (exact) 1 :((flag_1_7>=1 * flag_1_8>=1) * p1_8>=1)
Checking (exact) 1 :p1_8>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 7,1,0.265235,9368,1,0,278,23652,433,138,3032,20407,288
FORMULA Dekker-PT-010-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(EX(!((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))))
=> equivalent forward existential formula: [(EY(Init) * !((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1)))] = FALSE
Checking (exact) 0 :[(EY(Init) * !((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1)))] = FALSE
Checking (exact) 0 :(EY(Init) * !((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1)))
Checking (exact) 1 :!((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 8,0,0.268444,9416,1,0,280,23730,452,140,3067,20500,289
FORMULA Dekker-PT-010-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1) + ((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))) + AX(((((((((((flag_0_0>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))))
=> equivalent forward existential formula: [(EY(((Init * !(((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1))) * !((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1)))))) * !(((((((((((flag_0_0>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))] = FALSE
Checking (exact) 0 :[(EY(((Init * !(((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1))) * !((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1)))))) * !(((((((((((flag_0_0>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))] = FALSE
Checking (exact) 0 :(EY(((Init * !(((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1))) * !((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1)))))) * !(((((((((((flag_0_0>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))
Checking (exact) 1 :!(((((((((((flag_0_0>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_1>=1) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))
Checking (exact) 1 :EY(((Init * !(((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1))) * !((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))))))
Checking (exact) 1 :((Init * !(((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1))) * !((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1)))))
Checking (exact) 1 :!((EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))))
Checking (exact) 1 :(EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1)) * E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1)))
Checking (exact) 1 :E((((((((((flag_0_0>=1 * flag_0_1>=1) * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_9>=1) * p1_8>=1) U ((flag_1_0>=1 * flag_1_4>=1) * p1_0>=1))
Checking (exact) 1 :EX(((flag_1_5>=1 * flag_1_6>=1) * p1_5>=1))
Checking (exact) 1 :(Init * !(((flag_1_1>=1 * flag_1_8>=1) * p1_1>=1)))
(forward)formula 9,0,0.308474,10148,1,0,289,26233,490,148,3118,23177,305
FORMULA Dekker-PT-010-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG((((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))
=> equivalent forward existential formula: [FwdG(Init,(((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))] != FALSE
Checking (exact) 0 :[FwdG(Init,(((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))] != FALSE
Checking (exact) 0 :FwdG(Init,(((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))
Checking (exact) 1 :Init
(forward)formula 10,0,0.313368,10240,1,0,289,26233,495,149,3120,23223,305
FORMULA Dekker-PT-010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + EF(((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1))) * E(((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1) U AF(((flag_1_0>=1 * flag_1_6>=1) * p1_6>=1))))
=> equivalent forward existential formula: [(FwdU((Init * ((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1)))),((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1)) * !(EG(!(((flag_1_0>=1 * flag_1_6>=1) * p1_6>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU((Init * ((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1)))),((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1)) * !(EG(!(((flag_1_0>=1 * flag_1_6>=1) * p1_6>=1)))))] != FALSE
Checking (exact) 0 :(FwdU((Init * ((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1)))),((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1)) * !(EG(!(((flag_1_0>=1 * flag_1_6>=1) * p1_6>=1)))))
Checking (exact) 1 :!(EG(!(((flag_1_0>=1 * flag_1_6>=1) * p1_6>=1))))
Checking (exact) 1 :EG(!(((flag_1_0>=1 * flag_1_6>=1) * p1_6>=1)))
Checking (exact) 1 :FwdU((Init * ((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1)))),((flag_1_6>=1 * flag_1_9>=1) * p1_9>=1))
Checking (exact) 1 :(Init * ((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1))))
Checking (exact) 1 :((!((((flag_1_0>=1 * flag_1_1>=1) * p1_0>=1) * ((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + !(((flag_1_0>=1 * flag_1_2>=1) * p1_0>=1))) + E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1)))
Checking (exact) 1 :E(TRUE U ((flag_1_8>=1 * flag_1_9>=1) * p1_9>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 81/66/39
(forward)formula 11,0,0.33654,10632,1,0,294,27839,521,155,3169,25549,322
FORMULA Dekker-PT-010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(EG((!((flag_0_1>=1 * p0_1>=1)) + ((flag_0_4>=1 * p0_4>=1) + (((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!((flag_0_1>=1 * p0_1>=1)) + ((flag_0_4>=1 * p0_4>=1) + (((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(EG((!((flag_0_1>=1 * p0_1>=1)) + ((flag_0_4>=1 * p0_4>=1) + (((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(EG((!((flag_0_1>=1 * p0_1>=1)) + ((flag_0_4>=1 * p0_4>=1) + (((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG((!((flag_0_1>=1 * p0_1>=1)) + ((flag_0_4>=1 * p0_4>=1) + (((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1)))))
Checking (exact) 1 :EG((!((flag_0_1>=1 * p0_1>=1)) + ((flag_0_4>=1 * p0_4>=1) + (((((((((flag_0_1>=1 * flag_0_2>=1) * flag_0_3>=1) * flag_0_4>=1) * flag_0_5>=1) * flag_0_6>=1) * flag_0_7>=1) * flag_0_8>=1) * flag_0_9>=1) * p1_0>=1))))
(forward)formula 12,1,0.369603,10952,1,0,297,29316,537,159,3178,27460,329
FORMULA Dekker-PT-010-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(((flag_1_2>=1 * flag_1_6>=1) * p1_6>=1) U ((!(((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((flag_1_2>=1 * flag_1_6>=1) * p1_6>=1)) * ((!(((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,((flag_1_2>=1 * flag_1_6>=1) * p1_6>=1)) * ((!(((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,((flag_1_2>=1 * flag_1_6>=1) * p1_6>=1)) * ((!(((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))))
Checking (exact) 1 :((!(((flag_1_1>=1 * flag_1_9>=1) * p1_1>=1)) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)))
Checking (exact) 1 :((((flag_1_3>=1 * flag_1_7>=1) * p1_3>=1) * ((flag_1_1>=1 * flag_1_6>=1) * p1_6>=1)) * ((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1))
Checking (exact) 1 :((flag_1_0>=1 * flag_1_5>=1) * p1_0>=1)
Checking (exact) 1 :p1_0>=1
Checking (exact) 1 :FwdU(Init,((flag_1_2>=1 * flag_1_6>=1) * p1_6>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 81/66/39
(forward)formula 13,0,0.381389,11216,1,0,303,29681,564,163,3256,28041,336
FORMULA Dekker-PT-010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(((flag_1_2>=1 * flag_1_3>=1) * p1_3>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((flag_1_2>=1 * flag_1_3>=1) * p1_3>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(((flag_1_2>=1 * flag_1_3>=1) * p1_3>=1)))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(((flag_1_2>=1 * flag_1_3>=1) * p1_3>=1)))
Checking (exact) 1 :!(((flag_1_2>=1 * flag_1_3>=1) * p1_3>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 14,0,0.383248,11268,1,0,305,29848,569,165,3262,28331,337
FORMULA Dekker-PT-010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(((AX(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1)) * ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)) + AG(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1)))))
=> equivalent forward existential formula: ([((EY(Init) * ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)) * !(EX(!(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1)))))] != FALSE + [(EY(Init) * !(E(TRUE U !(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1))))))] != FALSE)
Checking (exact) 0 :([((EY(Init) * ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)) * !(EX(!(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1)))))] != FALSE + [(EY(Init) * !(E(TRUE U !(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1))))))] != FALSE)
Checking (exact) 0 :[((EY(Init) * ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)) * !(EX(!(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1)))))] != FALSE
Checking (exact) 0 :((EY(Init) * ((flag_1_0>=1 * flag_1_6>=1) * p1_0>=1)) * !(EX(!(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1)))))
Checking (exact) 1 :!(EX(!(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1))))
Checking (exact) 1 :EX(!(((flag_1_4>=1 * flag_1_5>=1) * p1_5>=1)))
Checking (exact) 0 :[(EY(Init) * !(E(TRUE U !(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1))))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(E(TRUE U !(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1))))))
Checking (exact) 1 :!(E(TRUE U !(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1)))))
Checking (exact) 1 :E(TRUE U !(((flag_0_4>=1 * p0_4>=1) * ((flag_1_0>=1 * flag_1_9>=1) * p1_9>=1))))
(forward)formula 15,0,0.426813,11580,1,0,309,31366,581,167,3280,29895,345
FORMULA Dekker-PT-010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1464163907116

--------------------
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 8:11:45 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2016 8:11:45 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
May 25, 2016 8:11:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 25, 2016 8:11:46 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
May 25, 2016 8:11:46 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 107 ms
May 25, 2016 8:11:46 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 19 ms
May 25, 2016 8:11:46 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_Dekker-PT-010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/S_Dekker-PT-010.tgz
mv S_Dekker-PT-010 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_Dekker-PT-010, 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 r145kn-smll-146416245600004"
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 ;