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-3254
Executing tool itstools
Input is S_PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-149441683300265
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496402300810


its-ctl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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,325,0.064315,5592,2,486,5,2123,6,0,219,1608,0


Converting to forward existential form...Done !
original formula: ((EF(((Think_1>=1 + Think_3>=1) + Think_2>=1)) + !(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)))) * !((EF((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))) * (EG(((Think_1>=1 + Think_3>=1) + Think_2>=1)) + AF(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)))))))
=> equivalent forward existential formula: ([((Init * (E(TRUE U ((Think_1>=1 + Think_3>=1) + Think_2>=1)) + !(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1))))) * !(E(TRUE U (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)))))] != FALSE + [FwdG(((Init * (E(TRUE U ((Think_1>=1 + Think_3>=1) + Think_2>=1)) + !(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1))))) * !(EG(((Think_1>=1 + Think_3>=1) + Think_2>=1)))),!(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1))))] != FALSE)
Hit Full ! (commute/partial/dont) 0/72/81
(forward)formula 0,1,0.407656,12340,1,0,122,25887,248,59,2516,22460,175
FORMULA PhilosophersDyn-COL-03-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/63/81
(forward)formula 1,0,0.457123,13636,1,0,125,28702,266,61,2574,25342,179
FORMULA PhilosophersDyn-COL-03-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(AF((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))))] != FALSE
(forward)formula 2,0,0.65943,16444,1,0,183,43198,270,92,2574,36569,272
FORMULA PhilosophersDyn-COL-03-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))] = FALSE
(forward)formula 3,0,0.661002,16704,1,0,183,43198,270,92,2574,36569,272
FORMULA PhilosophersDyn-COL-03-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))] = FALSE
(forward)formula 4,0,0.662271,16708,1,0,183,43198,270,92,2574,36569,272
FORMULA PhilosophersDyn-COL-03-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))] = FALSE
(forward)formula 5,0,0.663511,16708,1,0,183,43198,270,92,2574,36569,272
FORMULA PhilosophersDyn-COL-03-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(EG((((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))) + !(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))) + !(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/81
(forward)formula 6,1,0.689014,16712,1,0,184,43745,279,94,2584,37491,276
FORMULA PhilosophersDyn-COL-03-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A((((((((((((((((((((((((((((((Think_2>=1 * Neighbourhood_2_1>=1) * Neighbourhood_1_2>=1) * Forks_2>=1) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_3>=1) * Think_3>=1)) + (((Neighbourhood_1_1>=1 * Neighbourhood_1_2>=1) * Think_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1) * Think_3>=1)) + (((Forks_3>=1 * Neighbourhood_3_3>=1) * Think_3>=1) * Neighbourhood_3_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_1>=1) * Neighbourhood_2_1>=1)) + (((Neighbourhood_1_3>=1 * Think_1>=1) * Neighbourhood_1_1>=1) * Forks_1>=1)) + (((Neighbourhood_2_3>=1 * Neighbourhood_2_2>=1) * Forks_2>=1) * Think_2>=1)) + (((Neighbourhood_3_1>=1 * Neighbourhood_3_3>=1) * Forks_3>=1) * Think_3>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Think_2>=1) * Neighbourhood_2_3>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Neighbourhood_1_2>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_3_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1)) + (((Neighbourhood_2_2>=1 * Think_2>=1) * Forks_2>=1) * Neighbourhood_3_2>=1)) + (((Neighbourhood_1_1>=1 * Think_1>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Think_3>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_1>=1) * Think_1>=1) * Forks_1>=1)) + ((Think_3>=1 * Forks_3>=1) * Neighbourhood_3_3>=2)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Think_3>=1) * Neighbourhood_2_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_3>=1) * Think_2>=1) * Forks_2>=1)) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=2)) + (((Neighbourhood_1_3>=1 * Forks_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Neighbourhood_1_1>=2 * Think_1>=1) * Forks_1>=1)) + (((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_1_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_2_1>=1) * Neighbourhood_1_3>=1)) U EF(((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)))))))) * !(E(!(E(TRUE U ((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))))) U (!((((((((((((((((((((((((((((((Think_2>=1 * Neighbourhood_2_1>=1) * Neighbourhood_1_2>=1) * Forks_2>=1) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_3>=1) * Think_3>=1)) + (((Neighbourhood_1_1>=1 * Neighbourhood_1_2>=1) * Think_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1) * Think_3>=1)) + (((Forks_3>=1 * Neighbourhood_3_3>=1) * Think_3>=1) * Neighbourhood_3_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_1>=1) * Neighbourhood_2_1>=1)) + (((Neighbourhood_1_3>=1 * Think_1>=1) * Neighbourhood_1_1>=1) * Forks_1>=1)) + (((Neighbourhood_2_3>=1 * Neighbourhood_2_2>=1) * Forks_2>=1) * Think_2>=1)) + (((Neighbourhood_3_1>=1 * Neighbourhood_3_3>=1) * Forks_3>=1) * Think_3>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Think_2>=1) * Neighbourhood_2_3>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Neighbourhood_1_2>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_3_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1)) + (((Neighbourhood_2_2>=1 * Think_2>=1) * Forks_2>=1) * Neighbourhood_3_2>=1)) + (((Neighbourhood_1_1>=1 * Think_1>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Think_3>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_1>=1) * Think_1>=1) * Forks_1>=1)) + ((Think_3>=1 * Forks_3>=1) * Neighbourhood_3_3>=2)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Think_3>=1) * Neighbourhood_2_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_3>=1) * Think_2>=1) * Forks_2>=1)) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=2)) + (((Neighbourhood_1_3>=1 * Forks_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Neighbourhood_1_1>=2 * Think_1>=1) * Forks_1>=1)) + (((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_1_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_2_1>=1) * Neighbourhood_1_3>=1))) * !(E(TRUE U ((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)))))))))] != FALSE
(forward)formula 7,0,0.758524,16888,1,0,186,44472,451,96,2830,38907,283
FORMULA PhilosophersDyn-COL-03-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG(((EF((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))) + (((Think_1>=1 + Think_3>=1) + Think_2>=1) * (((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)) + (((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))) * ((!((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))) + (((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)) * ((Think_1>=1 + Think_3>=1) + Think_2>=1))) + AF(((Think_1>=1 + Think_3>=1) + Think_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))) + (((Think_1>=1 + Think_3>=1) + Think_2>=1) * (((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)) + (((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))))) * ((!((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))) + (((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)) * ((Think_1>=1 + Think_3>=1) + Think_2>=1))) + !(EG(!(((Think_1>=1 + Think_3>=1) + Think_2>=1)))))))] != FALSE
(forward)formula 8,1,0.926935,19880,1,0,227,53401,466,132,2856,49485,345
FORMULA PhilosophersDyn-COL-03-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(!(A((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) U ((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1))) U (!((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))) * !(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1))))) + EG(!(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1)))))))))] = FALSE
(forward)formula 9,1,1.06417,21708,1,0,259,59344,526,154,2929,55562,414
FORMULA PhilosophersDyn-COL-03-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG((!(AF(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)))) + !(AX(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!(!(EX(!(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1)))))))) * !(EG(!(((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1))))))] = FALSE
(forward)formula 10,1,1.20676,25192,1,0,314,70146,530,186,2929,65622,507
FORMULA PhilosophersDyn-COL-03-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(((Think_1>=1 + Think_3>=1) + Think_2>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((Think_1>=1 + Think_3>=1) + Think_2>=1))] != FALSE
(forward)formula 11,1,1.20899,25200,1,0,316,70269,530,188,2929,66060,509
FORMULA PhilosophersDyn-COL-03-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1))
=> equivalent forward existential formula: [(Init * (((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)))] != FALSE
(forward)formula 12,0,1.21034,25204,1,0,316,70274,530,188,2929,66060,510
FORMULA PhilosophersDyn-COL-03-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AX(((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)))) + AX(!((!(((Think_1>=1 + Think_3>=1) + Think_2>=1)) * ((((((((((((((((((((((((((((((Think_2>=1 * Neighbourhood_2_1>=1) * Neighbourhood_1_2>=1) * Forks_2>=1) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_3>=1) * Think_3>=1)) + (((Neighbourhood_1_1>=1 * Neighbourhood_1_2>=1) * Think_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1) * Think_3>=1)) + (((Forks_3>=1 * Neighbourhood_3_3>=1) * Think_3>=1) * Neighbourhood_3_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_1>=1) * Neighbourhood_2_1>=1)) + (((Neighbourhood_1_3>=1 * Think_1>=1) * Neighbourhood_1_1>=1) * Forks_1>=1)) + (((Neighbourhood_2_3>=1 * Neighbourhood_2_2>=1) * Forks_2>=1) * Think_2>=1)) + (((Neighbourhood_3_1>=1 * Neighbourhood_3_3>=1) * Forks_3>=1) * Think_3>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Think_2>=1) * Neighbourhood_2_3>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Neighbourhood_1_2>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_3_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1)) + (((Neighbourhood_2_2>=1 * Think_2>=1) * Forks_2>=1) * Neighbourhood_3_2>=1)) + (((Neighbourhood_1_1>=1 * Think_1>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Think_3>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_1>=1) * Think_1>=1) * Forks_1>=1)) + ((Think_3>=1 * Forks_3>=1) * Neighbourhood_3_3>=2)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Think_3>=1) * Neighbourhood_2_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_3>=1) * Think_2>=1) * Forks_2>=1)) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=2)) + (((Neighbourhood_1_3>=1 * Forks_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Neighbourhood_1_1>=2 * Think_1>=1) * Forks_1>=1)) + (((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_1_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_2_1>=1) * Neighbourhood_1_3>=1)) * (((((((((((((((((((((((((((((Neighbourhood_1_2>=1 * Outside_2>=1) * Forks_2>=1) * Forks_1>=1) + ((Forks_1>=2 * Neighbourhood_1_1>=1) * Outside_2>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Forks_3>=1) * Outside_2>=1)) + (((Neighbourhood_1_2>=1 * Forks_2>=1) * Forks_1>=1) * Outside_1>=1)) + ((Forks_1>=2 * Outside_3>=1) * Neighbourhood_1_1>=1)) + (((Forks_2>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Outside_3>=1)) + (((Forks_2>=1 * Forks_1>=1) * Outside_1>=1) * Neighbourhood_2_1>=1)) + (((Outside_3>=1 * Neighbourhood_3_2>=1) * Forks_3>=1) * Forks_2>=1)) + (((Neighbourhood_3_1>=1 * Outside_3>=1) * Forks_3>=1) * Forks_1>=1)) + (((Forks_2>=1 * Outside_2>=1) * Neighbourhood_2_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Outside_2>=1) * Forks_3>=1) * Neighbourhood_3_1>=1)) + ((Neighbourhood_2_2>=1 * Forks_2>=2) * Outside_3>=1)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Outside_1>=1) * Forks_1>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_1>=1)) + (((Neighbourhood_3_2>=1 * Outside_1>=1) * Forks_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_2_2>=1) * Forks_2>=2)) + (((Forks_1>=1 * Outside_2>=1) * Neighbourhood_1_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Neighbourhood_2_1>=1) * Forks_2>=1) * Outside_3>=1)) + ((Forks_2>=2 * Neighbourhood_2_2>=1) * Outside_2>=1)) + ((Neighbourhood_3_3>=1 * Outside_2>=1) * Forks_3>=2)) + (((Neighbourhood_2_1>=1 * Forks_1>=1) * Forks_2>=1) * Outside_2>=1)) + (((Neighbourhood_1_3>=1 * Outside_1>=1) * Forks_1>=1) * Forks_3>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_3>=1)) + (((Outside_1>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=2)) + (((Outside_3>=1 * Forks_1>=1) * Forks_3>=1) * Neighbourhood_1_3>=1)) + (((Forks_1>=1 * Forks_2>=1) * Neighbourhood_1_2>=1) * Outside_3>=1)))))))
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(((((Forks_3>=1 * WaitLeft_3>=1) + (WaitLeft_1>=1 * Forks_1>=1)) + (Forks_2>=1 * WaitLeft_2>=1)) * (((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))))))))) * (!(((Think_1>=1 + Think_3>=1) + Think_2>=1)) * ((((((((((((((((((((((((((((((Think_2>=1 * Neighbourhood_2_1>=1) * Neighbourhood_1_2>=1) * Forks_2>=1) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_3>=1) * Think_3>=1)) + (((Neighbourhood_1_1>=1 * Neighbourhood_1_2>=1) * Think_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1) * Think_3>=1)) + (((Forks_3>=1 * Neighbourhood_3_3>=1) * Think_3>=1) * Neighbourhood_3_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_1>=1) * Neighbourhood_2_1>=1)) + (((Neighbourhood_1_3>=1 * Think_1>=1) * Neighbourhood_1_1>=1) * Forks_1>=1)) + (((Neighbourhood_2_3>=1 * Neighbourhood_2_2>=1) * Forks_2>=1) * Think_2>=1)) + (((Neighbourhood_3_1>=1 * Neighbourhood_3_3>=1) * Forks_3>=1) * Think_3>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Think_2>=1) * Neighbourhood_2_3>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Neighbourhood_1_2>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Think_2>=1 * Forks_2>=1) * Neighbourhood_3_2>=1) * Neighbourhood_2_1>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_1>=1)) + (((Neighbourhood_2_2>=1 * Think_2>=1) * Forks_2>=1) * Neighbourhood_3_2>=1)) + (((Neighbourhood_1_1>=1 * Think_1>=1) * Neighbourhood_3_1>=1) * Forks_1>=1)) + (((Forks_3>=1 * Think_3>=1) * Neighbourhood_1_3>=1) * Neighbourhood_3_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_1>=1) * Think_1>=1) * Forks_1>=1)) + ((Think_3>=1 * Forks_3>=1) * Neighbourhood_3_3>=2)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Think_3>=1) * Neighbourhood_2_3>=1)) + (((Neighbourhood_1_2>=1 * Neighbourhood_2_3>=1) * Think_2>=1) * Forks_2>=1)) + (((Forks_3>=1 * Neighbourhood_2_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=2)) + (((Neighbourhood_1_3>=1 * Forks_3>=1) * Neighbourhood_3_2>=1) * Think_3>=1)) + ((Neighbourhood_1_1>=2 * Think_1>=1) * Forks_1>=1)) + (((Forks_2>=1 * Think_2>=1) * Neighbourhood_2_2>=1) * Neighbourhood_1_2>=1)) + (((Think_1>=1 * Forks_1>=1) * Neighbourhood_2_1>=1) * Neighbourhood_1_3>=1)) * (((((((((((((((((((((((((((((Neighbourhood_1_2>=1 * Outside_2>=1) * Forks_2>=1) * Forks_1>=1) + ((Forks_1>=2 * Neighbourhood_1_1>=1) * Outside_2>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Forks_3>=1) * Outside_2>=1)) + (((Neighbourhood_1_2>=1 * Forks_2>=1) * Forks_1>=1) * Outside_1>=1)) + ((Forks_1>=2 * Outside_3>=1) * Neighbourhood_1_1>=1)) + (((Forks_2>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Outside_3>=1)) + (((Forks_2>=1 * Forks_1>=1) * Outside_1>=1) * Neighbourhood_2_1>=1)) + (((Outside_3>=1 * Neighbourhood_3_2>=1) * Forks_3>=1) * Forks_2>=1)) + (((Neighbourhood_3_1>=1 * Outside_3>=1) * Forks_3>=1) * Forks_1>=1)) + (((Forks_2>=1 * Outside_2>=1) * Neighbourhood_2_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Outside_2>=1) * Forks_3>=1) * Neighbourhood_3_1>=1)) + ((Neighbourhood_2_2>=1 * Forks_2>=2) * Outside_3>=1)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Outside_1>=1) * Forks_1>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_1>=1)) + (((Neighbourhood_3_2>=1 * Outside_1>=1) * Forks_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_2_2>=1) * Forks_2>=2)) + (((Forks_1>=1 * Outside_2>=1) * Neighbourhood_1_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Neighbourhood_2_1>=1) * Forks_2>=1) * Outside_3>=1)) + ((Forks_2>=2 * Neighbourhood_2_2>=1) * Outside_2>=1)) + ((Neighbourhood_3_3>=1 * Outside_2>=1) * Forks_3>=2)) + (((Neighbourhood_2_1>=1 * Forks_1>=1) * Forks_2>=1) * Outside_2>=1)) + (((Neighbourhood_1_3>=1 * Outside_1>=1) * Forks_1>=1) * Forks_3>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_3>=1)) + (((Outside_1>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=2)) + (((Outside_3>=1 * Forks_1>=1) * Forks_3>=1) * Neighbourhood_1_3>=1)) + (((Forks_1>=1 * Forks_2>=1) * Neighbourhood_1_2>=1) * Outside_3>=1)))))] = FALSE
(forward)formula 13,1,1.24775,25204,1,0,316,70435,699,188,3137,66103,510
FORMULA PhilosophersDyn-COL-03-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (!((!(AX(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1)))) + (((((((((((((((((((((((((((((Neighbourhood_1_2>=1 * Outside_2>=1) * Forks_2>=1) * Forks_1>=1) + ((Forks_1>=2 * Neighbourhood_1_1>=1) * Outside_2>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Forks_3>=1) * Outside_2>=1)) + (((Neighbourhood_1_2>=1 * Forks_2>=1) * Forks_1>=1) * Outside_1>=1)) + ((Forks_1>=2 * Outside_3>=1) * Neighbourhood_1_1>=1)) + (((Forks_2>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Outside_3>=1)) + (((Forks_2>=1 * Forks_1>=1) * Outside_1>=1) * Neighbourhood_2_1>=1)) + (((Outside_3>=1 * Neighbourhood_3_2>=1) * Forks_3>=1) * Forks_2>=1)) + (((Neighbourhood_3_1>=1 * Outside_3>=1) * Forks_3>=1) * Forks_1>=1)) + (((Forks_2>=1 * Outside_2>=1) * Neighbourhood_2_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Outside_2>=1) * Forks_3>=1) * Neighbourhood_3_1>=1)) + ((Neighbourhood_2_2>=1 * Forks_2>=2) * Outside_3>=1)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Outside_1>=1) * Forks_1>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_1>=1)) + (((Neighbourhood_3_2>=1 * Outside_1>=1) * Forks_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_2_2>=1) * Forks_2>=2)) + (((Forks_1>=1 * Outside_2>=1) * Neighbourhood_1_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Neighbourhood_2_1>=1) * Forks_2>=1) * Outside_3>=1)) + ((Forks_2>=2 * Neighbourhood_2_2>=1) * Outside_2>=1)) + ((Neighbourhood_3_3>=1 * Outside_2>=1) * Forks_3>=2)) + (((Neighbourhood_2_1>=1 * Forks_1>=1) * Forks_2>=1) * Outside_2>=1)) + (((Neighbourhood_1_3>=1 * Outside_1>=1) * Forks_1>=1) * Forks_3>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_3>=1)) + (((Outside_1>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=2)) + (((Outside_3>=1 * Forks_1>=1) * Forks_3>=1) * Neighbourhood_1_3>=1)) + (((Forks_1>=1 * Forks_2>=1) * Neighbourhood_1_2>=1) * Outside_3>=1)))) * EF(EF(!((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !((!(!(EX(!(((((((((((HasRight_3>=1 * HasLeft_3>=1) * Neighbourhood_3_2>=1) + ((HasRight_1>=1 * Neighbourhood_1_3>=1) * HasLeft_1>=1)) + ((HasRight_1>=1 * HasLeft_1>=1) * Neighbourhood_1_2>=1)) + ((Neighbourhood_2_2>=1 * HasLeft_2>=1) * HasRight_2>=1)) + ((Neighbourhood_3_1>=1 * HasLeft_3>=1) * HasRight_3>=1)) + ((HasRight_2>=1 * HasLeft_2>=1) * Neighbourhood_2_1>=1)) + ((HasRight_2>=1 * Neighbourhood_2_3>=1) * HasLeft_2>=1)) + ((HasRight_1>=1 * Neighbourhood_1_1>=1) * HasLeft_1>=1)) + ((HasRight_3>=1 * Neighbourhood_3_3>=1) * HasLeft_3>=1)))))) + (((((((((((((((((((((((((((((Neighbourhood_1_2>=1 * Outside_2>=1) * Forks_2>=1) * Forks_1>=1) + ((Forks_1>=2 * Neighbourhood_1_1>=1) * Outside_2>=1)) + (((Neighbourhood_3_2>=1 * Forks_2>=1) * Forks_3>=1) * Outside_2>=1)) + (((Neighbourhood_1_2>=1 * Forks_2>=1) * Forks_1>=1) * Outside_1>=1)) + ((Forks_1>=2 * Outside_3>=1) * Neighbourhood_1_1>=1)) + (((Forks_2>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Outside_3>=1)) + (((Forks_2>=1 * Forks_1>=1) * Outside_1>=1) * Neighbourhood_2_1>=1)) + (((Outside_3>=1 * Neighbourhood_3_2>=1) * Forks_3>=1) * Forks_2>=1)) + (((Neighbourhood_3_1>=1 * Outside_3>=1) * Forks_3>=1) * Forks_1>=1)) + (((Forks_2>=1 * Outside_2>=1) * Neighbourhood_2_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Outside_2>=1) * Forks_3>=1) * Neighbourhood_3_1>=1)) + ((Neighbourhood_2_2>=1 * Forks_2>=2) * Outside_3>=1)) + (((Neighbourhood_3_1>=1 * Forks_3>=1) * Outside_1>=1) * Forks_1>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_1>=1)) + (((Neighbourhood_3_2>=1 * Outside_1>=1) * Forks_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_2_2>=1) * Forks_2>=2)) + (((Forks_1>=1 * Outside_2>=1) * Neighbourhood_1_3>=1) * Forks_3>=1)) + (((Forks_1>=1 * Neighbourhood_2_1>=1) * Forks_2>=1) * Outside_3>=1)) + ((Forks_2>=2 * Neighbourhood_2_2>=1) * Outside_2>=1)) + ((Neighbourhood_3_3>=1 * Outside_2>=1) * Forks_3>=2)) + (((Neighbourhood_2_1>=1 * Forks_1>=1) * Forks_2>=1) * Outside_2>=1)) + (((Neighbourhood_1_3>=1 * Outside_1>=1) * Forks_1>=1) * Forks_3>=1)) + ((Neighbourhood_3_3>=1 * Forks_3>=2) * Outside_3>=1)) + (((Outside_1>=1 * Forks_3>=1) * Neighbourhood_2_3>=1) * Forks_2>=1)) + ((Outside_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=2)) + (((Outside_3>=1 * Forks_1>=1) * Forks_3>=1) * Neighbourhood_1_3>=1)) + (((Forks_1>=1 * Forks_2>=1) * Neighbourhood_1_2>=1) * Outside_3>=1))))),TRUE),TRUE) * !((((((((Outside_3>=1 * Outside_1>=1) * Outside_2>=1) + ((Outside_1>=1 * Outside_2>=1) * Outside_3>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1)) + ((Outside_2>=1 * Outside_1>=1) * Outside_3>=1)) + ((Outside_1>=1 * Outside_3>=1) * Outside_2>=1)) + ((Outside_3>=1 * Outside_2>=1) * Outside_1>=1))))] != FALSE
(forward)formula 14,0,1.28152,25564,1,0,318,70494,699,190,3146,66230,511
FORMULA PhilosophersDyn-COL-03-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1))
=> equivalent forward existential formula: [(Init * ((((((((((WaitRight_1>=1 * Neighbourhood_1_1>=1) * Forks_1>=1) + ((Forks_3>=1 * Neighbourhood_2_3>=1) * WaitRight_2>=1)) + ((Neighbourhood_2_1>=1 * WaitRight_2>=1) * Forks_1>=1)) + ((Forks_1>=1 * Neighbourhood_3_1>=1) * WaitRight_3>=1)) + ((Neighbourhood_1_3>=1 * Forks_3>=1) * WaitRight_1>=1)) + ((WaitRight_3>=1 * Forks_2>=1) * Neighbourhood_3_2>=1)) + ((WaitRight_1>=1 * Neighbourhood_1_2>=1) * Forks_2>=1)) + ((Forks_2>=1 * Neighbourhood_2_2>=1) * WaitRight_2>=1)) + ((Neighbourhood_3_3>=1 * WaitRight_3>=1) * Forks_3>=1)))] != FALSE
(forward)formula 15,0,1.28558,25884,1,0,319,70501,699,190,3146,66230,512
FORMULA PhilosophersDyn-COL-03-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Exit code :0

BK_STOP 1496402305745

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.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 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 11:18:23 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 11:18:23 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 96 ms
Jun 02, 2017 11:18:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
Jun 02, 2017 11:18:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
Jun 02, 2017 11:18:24 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 91 ms
Jun 02, 2017 11:18:24 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 28 ms
Jun 02, 2017 11:18:24 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 8 ms
Jun 02, 2017 11:18:25 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
Reverse transition relation is NOT exact ! Due to transitions Leave_2_1_1, Leave_3_1_1, Leave_2_3_3, Leave_1_3_2, Leave_2_3_1, Leave_1_3_3, Leave_1_2_2, Leave_3_2_1, Leave_2_1_3, Leave_3_2_2, Leave_3_1_2, Leave_1_2_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :42/30/12/84
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint
fixpoint of localApply rewriting as localApply of fixpoint

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_PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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/S_PhilosophersDyn-PT-03.tgz
mv S_PhilosophersDyn-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_PhilosophersDyn-PT-03, 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 r130-smll-149441683300265"
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 ;