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 176K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Philosophers-COL-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-csrt-152666477300669
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527270432002

17:47:14.272 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
17:47:14.275 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.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,243,0.01746,4412,2,112,5,435,6,0,128,296,0


Converting to forward existential form...Done !
original formula: EX(EX(((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1))))||(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1))))||(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))))] != FALSE
(forward)formula 0,1,0.034459,5276,1,0,9,898,8,1,251,779,3
FORMULA Philosophers-COL-000005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(E(!(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))) U !(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))) U !(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/41/25
(forward)formula 1,0,0.081473,5540,1,0,14,4272,26,4,723,3019,11
FORMULA Philosophers-COL-000005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(AG((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))))) * !((EG((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))) + !(AG(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))))] = FALSE * ([FwdG(Init,(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))] = FALSE * [(FwdU(Init,TRUE) * !(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))))] = FALSE))
(forward)formula 2,0,0.100989,5804,1,0,16,4374,26,6,726,3337,12
FORMULA Philosophers-COL-000005-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/15
(forward)formula 3,1,0.1056,5804,1,0,17,4778,33,7,777,4069,16
FORMULA Philosophers-COL-000005-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))
=> equivalent forward existential formula: [(Init * !(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))))] != FALSE
(forward)formula 4,0,0.107371,6068,1,0,17,4778,33,7,777,4069,17
FORMULA Philosophers-COL-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/42/25
(forward)formula 5,0,0.125303,6068,1,0,18,5918,41,8,859,5455,21
FORMULA Philosophers-COL-000005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))&&(!(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))))) * (((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))
=> equivalent forward existential formula: ([(EY(Init) * !((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))&&(!(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))))))] = FALSE * [(Init * !((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] = FALSE)
(forward)formula 6,0,0.140208,6596,1,0,19,5919,42,8,868,5464,22
FORMULA Philosophers-COL-000005-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(!(AG((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))) + (E(!(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))) U ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) + ((EX(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))) * (((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))) * EG(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !((E(!(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))) U ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) + ((EX(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))) * (((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))) * EG(((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))))))),!(!(!(E(TRUE U !((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/41/25
(forward)formula 7,1,0.182865,7124,1,0,30,9104,63,14,930,8935,32
FORMULA Philosophers-COL-000005-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(!((((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))) U EX(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))) * AF(((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))))
=> equivalent forward existential formula: (([((FwdU(Init,!(EX(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))) * !(!((((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))))) * !(EX(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))))] = FALSE * [FwdG(Init,!(EX(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))))] = FALSE) * [FwdG(Init,!(((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))))] = FALSE)
Hit Full ! (commute/partial/dont) 0/0/25
(forward)formula 8,0,0.190745,7124,1,0,31,10120,71,17,939,10541,36
FORMULA Philosophers-COL-000005-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 0/42/25
(forward)formula 9,1,0.197409,7388,1,0,34,11128,78,20,950,11773,40
FORMULA Philosophers-COL-000005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((EF((((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))) + ((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * (((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))] != FALSE + [(EY(Init) * ((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1))))] != FALSE)
(forward)formula 10,1,0.202936,7388,1,0,35,11128,80,21,965,11868,43
FORMULA Philosophers-COL-000005-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(AG(((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))))) * EX((((!((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))&&((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))) * AG((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))))))))] = FALSE * [(Init * !(EX((((!((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))&&((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))) * !(E(TRUE U !((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))))))] = FALSE)
(forward)formula 11,0,0.210833,7388,1,0,35,11128,81,22,966,11879,43
FORMULA Philosophers-COL-000005-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((EF(((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))) + ((!((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))||((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1))))))) * (E(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))) U ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) + E((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)) U (((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))))
=> equivalent forward existential formula: ([(FwdU((Init * E(TRUE U (E(TRUE U ((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))) + ((!((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))||((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))))))),((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) * ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))] != FALSE + [(FwdU((Init * E(TRUE U (E(TRUE U ((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))) + ((!((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))||((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))))))),(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))) * (((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] != FALSE)
Hit Full ! (commute/partial/dont) 0/0/25
Hit Full ! (commute/partial/dont) 10/0/15
(forward)formula 12,0,0.230615,7652,1,0,40,11626,96,25,989,12630,54
FORMULA Philosophers-COL-000005-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (((!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) * (AX(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))) * ((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))))) + ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) + EF((!((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) * AG(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))))
=> equivalent forward existential formula: ([(((Init * !(E(TRUE U (!((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) * !(E(TRUE U !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))))))) * !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))) * ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))] = FALSE * ([(EY(((Init * !(E(TRUE U (!((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) * !(E(TRUE U !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))))))) * !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))) * !(((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))))] = FALSE * [(((Init * !(E(TRUE U (!((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) * !(E(TRUE U !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))))))) * !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))) * !(((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1))))))] = FALSE))
(forward)formula 13,1,0.265535,7652,1,0,43,11753,98,29,1007,13018,57
FORMULA Philosophers-COL-000005-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] != FALSE
Hit Full ! (commute/partial/dont) 10/60/15
(forward)formula 14,1,0.273822,7652,1,0,43,12293,104,31,1061,13699,60
FORMULA Philosophers-COL-000005-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !((E((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))&&((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))) U ((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))) * ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))
=> equivalent forward existential formula: ([(Init * !(E((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))&&((((((think_0>=1)&&(fork_4>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))) U ((((((fork_4>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1))))))] != FALSE + [(Init * !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))] != FALSE)
Hit Full ! (commute/partial/dont) 0/0/25
(forward)formula 15,1,0.293528,8180,1,0,46,14098,111,33,1071,15406,64
FORMULA Philosophers-COL-000005-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1527270435791

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 25, 2018 5:47:13 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 25, 2018 5:47:13 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2018 5:47:13 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 25, 2018 5:47:14 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 815 ms
May 25, 2018 5:47:14 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
May 25, 2018 5:47:14 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 25, 2018 5:47:14 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

May 25, 2018 5:47:14 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 25, 2018 5:47:14 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 25, 2018 5:47:14 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
May 25, 2018 5:47:14 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 19 ms
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 15 ms
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_0 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_1 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_2 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_3 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_4 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_0 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_1 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_2 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_3 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_4 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_0 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_1 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_2 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_3 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_4 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_0 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_1 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_2 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_3 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_4 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_0 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_1 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_2 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_3 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_4 in partition

May 25, 2018 5:47:15 PM fr.lip6.move.gal.application.MccTranslator applyOrder
WARNING: Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: -1
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:434)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:145)
at fr.lip6.move.gal.application.MccTranslator.applyOrder(MccTranslator.java:120)
at fr.lip6.move.gal.application.MccTranslator.flattenSpec(MccTranslator.java:147)
at fr.lip6.move.gal.application.Application.start(Application.java:218)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:40)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:196)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:388)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:243)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:498)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1499)
at org.eclipse.equinox.launcher.Main.main(Main.java:1472)
May 25, 2018 5:47:15 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
May 25, 2018 5:47:15 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 1 ms
May 25, 2018 5:47:15 PM 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="Philosophers-COL-000005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstoolsl"
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-COL-000005.tgz
mv Philosophers-COL-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 itstoolsl"
echo " Input is Philosophers-COL-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 r117-csrt-152666477300669"
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 ;