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)
.............................................
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is Philosophers-PT-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-csrt-152666480400760
=====================================================================

--------------------
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 Philosophers-PT-000005-CTLFireability-00
FORMULA_NAME Philosophers-PT-000005-CTLFireability-01
FORMULA_NAME Philosophers-PT-000005-CTLFireability-02
FORMULA_NAME Philosophers-PT-000005-CTLFireability-03
FORMULA_NAME Philosophers-PT-000005-CTLFireability-04
FORMULA_NAME Philosophers-PT-000005-CTLFireability-05
FORMULA_NAME Philosophers-PT-000005-CTLFireability-06
FORMULA_NAME Philosophers-PT-000005-CTLFireability-07
FORMULA_NAME Philosophers-PT-000005-CTLFireability-08
FORMULA_NAME Philosophers-PT-000005-CTLFireability-09
FORMULA_NAME Philosophers-PT-000005-CTLFireability-10
FORMULA_NAME Philosophers-PT-000005-CTLFireability-11
FORMULA_NAME Philosophers-PT-000005-CTLFireability-12
FORMULA_NAME Philosophers-PT-000005-CTLFireability-13
FORMULA_NAME Philosophers-PT-000005-CTLFireability-14
FORMULA_NAME Philosophers-PT-000005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527341470996


BK_STOP 1527341478351

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Philosophers-PT-000005 as instance name.
Using Philosophers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 82, 'Memory': 100.91, 'Tool': 'gspn'}, {'Time': 193, 'Memory': 112.38, 'Tool': 'lola'}, {'Time': 316, 'Memory': 106.88, 'Tool': 'lola'}, {'Time': 1981, 'Memory': 1604.02, 'Tool': 'marcie'}, {'Time': 2027, 'Memory': 1551, 'Tool': 'marcie'}, {'Time': 2237, 'Memory': 152.06, 'Tool': 'gspn'}, {'Time': 3189, 'Memory': 243.57, 'Tool': 'itstools'}, {'Time': 3596, 'Memory': 226.86, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 38.890243902439025x far from the best tool gspn.
CTLFireability itstools Philosophers-PT-000005...
May 26, 2018 1:31:17 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, CTLFireability]
May 26, 2018 1:31:17 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 26, 2018 1:31:17 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 34 ms
May 26, 2018 1:31:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
May 26, 2018 1:31:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
May 26, 2018 1:31:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 8 ms
May 26, 2018 1:31:17 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
May 26, 2018 1:31:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/CTLFireability.pnml.gal : 3 ms
May 26, 2018 1:31:17 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /mcc-data/CTLFireability.ctl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /mcc-data/CTLFireability.pnml.gal, -t, CGAL, -ctl, /mcc-data/CTLFireability.ctl], workingDir=/mcc-data]

its-ctl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /mcc-data/CTLFireability.pnml.gal -t CGAL -ctl /mcc-data/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,243,0.00723,4432,2,112,5,435,6,0,128,296,0


Converting to forward existential form...Done !
original formula: EX(EX(((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))&&((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1))))||(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))&&((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1))))||(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1))))))] != FALSE
(forward)formula 0,1,0.017637,4948,1,0,9,898,8,1,251,779,3
FORMULA Philosophers-PT-000005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG(E(!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) U !(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) U !(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/41/25
(forward)formula 1,0,0.036025,5476,1,0,14,4255,26,4,726,3004,11
FORMULA Philosophers-PT-000005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX(AG((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))) * !((EG((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))) + !(AG(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))))] = FALSE * ([FwdG(Init,(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))] = FALSE * [(FwdU(Init,TRUE) * !(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))] = FALSE))
(forward)formula 2,0,0.040386,5740,1,0,16,4358,26,6,729,3322,12
FORMULA Philosophers-PT-000005-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(EG((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/15
(forward)formula 3,1,0.043785,5740,1,0,17,4762,33,7,780,4054,16
FORMULA Philosophers-PT-000005-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))
=> equivalent forward existential formula: [(Init * !(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))] != FALSE
(forward)formula 4,0,0.045068,5740,1,0,17,4762,33,7,780,4054,17
FORMULA Philosophers-PT-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(AF((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/40/25
(forward)formula 5,0,0.053403,6004,1,0,18,5994,41,8,859,5400,21
FORMULA Philosophers-PT-000005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))&&(!(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))))) * (((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))
=> equivalent forward existential formula: ([(EY(Init) * !((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))&&(!(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))))))] = FALSE * [(Init * !((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] = FALSE)
(forward)formula 6,0,0.054285,6268,1,0,19,6001,42,8,868,5405,22
FORMULA Philosophers-PT-000005-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AF(!(AG((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))) + (E(!(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))) U ((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))) + ((EX(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) * (((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))) * EG(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !((E(!(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))) U ((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))) + ((EX(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) * (((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))) * EG(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))))))),!(!(!(E(TRUE U !((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/42/25
(forward)formula 7,1,0.083177,6796,1,0,30,9102,63,14,929,8849,32
FORMULA Philosophers-PT-000005-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((Think_4>=1)&&(Fork_3>=1))
=> equivalent forward existential formula: [(Init * ((Think_4>=1)&&(Fork_3>=1)))] != FALSE
(forward)formula 8,1,0.083666,6796,1,0,31,9105,64,14,929,8849,33
FORMULA Philosophers-PT-000005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AX(AF(!(((Fork_2>=1)&&(Catch2_3>=1))))) * (((((!((Fork_5>=1)&&(Catch1_5>=1)))||(((Catch2_4>=1)&&(Fork_3>=1))&&((Fork_5>=1)&&(Think_5>=1))))&&((Catch1_1>=1)&&(Fork_1>=1)))||(!((!(Eat_1>=1))||((Catch1_3>=1)&&(Fork_3>=1))))) + AF(((Fork_4>=1)&&(Catch2_5>=1)))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!(((Fork_2>=1)&&(Catch2_3>=1)))))] = FALSE * [FwdG((Init * !(((((!((Fork_5>=1)&&(Catch1_5>=1)))||(((Catch2_4>=1)&&(Fork_3>=1))&&((Fork_5>=1)&&(Think_5>=1))))&&((Catch1_1>=1)&&(Fork_1>=1)))||(!((!(Eat_1>=1))||((Catch1_3>=1)&&(Fork_3>=1))))))),!(((Fork_4>=1)&&(Catch2_5>=1))))] = FALSE)
Hit Full ! (commute/partial/dont) 18/0/7
(forward)formula 9,0,0.087873,6796,1,0,32,9160,74,17,970,9044,38
FORMULA Philosophers-PT-000005-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((Eat_2>=1) * AF(((Fork_2>=1)&&(Think_3>=1))))
=> equivalent forward existential formula: ([(Init * !((Eat_2>=1)))] = FALSE * [FwdG(Init,!(((Fork_2>=1)&&(Think_3>=1))))] = FALSE)
(forward)formula 10,0,0.089186,6796,1,0,33,9204,83,18,972,9064,40
FORMULA Philosophers-PT-000005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((Think_4>=1)&&(Fork_3>=1))
=> equivalent forward existential formula: [(Init * ((Think_4>=1)&&(Fork_3>=1)))] != FALSE
(forward)formula 11,1,0.089787,6796,1,0,33,9204,83,18,972,9064,40
FORMULA Philosophers-PT-000005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EX((EF((((Catch1_4>=1)&&(Fork_4>=1))||((Fork_5>=1)&&(Catch2_1>=1)))) + EF(((Catch1_3>=1)&&(Fork_3>=1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * (((Catch1_4>=1)&&(Fork_4>=1))||((Fork_5>=1)&&(Catch2_1>=1))))] != FALSE + [(FwdU(EY(Init),TRUE) * ((Catch1_3>=1)&&(Fork_3>=1)))] != FALSE)
(forward)formula 12,1,0.092176,6796,1,0,35,9223,85,19,977,9132,43
FORMULA Philosophers-PT-000005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (EX((((((Think_1>=1)&&(Fork_1>=1))&&(Eat_5>=1))||(Eat_4>=1)) * EX(((Think_4>=1)&&(Fork_3>=1))))) * (!(A(((Catch1_2>=1)&&(Fork_2>=1)) U ((Fork_5>=1)&&(Catch2_1>=1)))) * AG(EX(((Catch1_3>=1)&&(Fork_3>=1))))))
=> equivalent forward existential formula: ([(Init * !(EX((((((Think_1>=1)&&(Fork_1>=1))&&(Eat_5>=1))||(Eat_4>=1)) * EX(((Think_4>=1)&&(Fork_3>=1)))))))] = FALSE * ([((Init * !(EG(!(((Fork_5>=1)&&(Catch2_1>=1)))))) * !(E(!(((Fork_5>=1)&&(Catch2_1>=1))) U (!(((Catch1_2>=1)&&(Fork_2>=1))) * !(((Fork_5>=1)&&(Catch2_1>=1)))))))] = FALSE * [(FwdU(Init,TRUE) * !(EX(((Catch1_3>=1)&&(Fork_3>=1)))))] = FALSE))
(forward)formula 13,0,0.095192,7060,1,0,38,9478,86,21,977,9455,45
FORMULA Philosophers-PT-000005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(!(EG(!(((Catch1_2>=1)&&(Fork_2>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((Catch1_2>=1)&&(Fork_2>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 18/0/7
(forward)formula 14,0,0.099989,7060,1,0,40,9856,94,24,1010,10137,49
FORMULA Philosophers-PT-000005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (Eat_5>=1)
=> equivalent forward existential formula: [(Init * (Eat_5>=1))] != FALSE
(forward)formula 15,0,0.10024,7060,1,0,41,9856,95,24,1010,10137,50
FORMULA Philosophers-PT-000005-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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="Philosophers-PT-000005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is Philosophers-PT-000005, 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 r119-csrt-152666480400760"
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 ;