fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r193kn-qhx2-146444252400058
Last Updated
June 30, 2016

About the Execution of ITS-Tools for S_CircularTrains-PT-012

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
292.460 5880.00 14162.00 251.90 FTFFTFTTFTFTTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................................................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_CircularTrains-PT-012, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193kn-qhx2-146444252400058
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1464833281103


its-ctl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,195,0.022372,4300,2,198,5,786,6,0,111,625,0


Converting to forward existential form...Done !
original formula: AG((F3>=1 * Section_2>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((F3>=1 * Section_2>=1)))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !((F3>=1 * Section_2>=1)))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !((F3>=1 * Section_2>=1)))
Checking (exact) 1 :!((F3>=1 * Section_2>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 0,0,0.024121,4304,1,0,8,786,12,2,120,625,1
FORMULA CircularTrains-PT-012-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + EF((Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1)))) * EF(EG((Section_12>=1 * F1>=1)))) + (EF(EF((F5>=1 * Section_4>=1))) * ((Section_9>=1 * F10>=1) + ((F11>=1 * Section_10>=1) + EF((F9>=1 * Section_8>=1))))))
=> equivalent forward existential formula: ([FwdG(FwdU((Init * ((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1))))),TRUE),(Section_12>=1 * F1>=1))] != FALSE + ([((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (Section_9>=1 * F10>=1))] != FALSE + ([((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (F11>=1 * Section_10>=1))] != FALSE + [(FwdU((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))),TRUE) * (F9>=1 * Section_8>=1))] != FALSE)))
Checking (exact) 0 :([FwdG(FwdU((Init * ((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1))))),TRUE),(Section_12>=1 * F1>=1))] != FALSE + ([((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (Section_9>=1 * F10>=1))] != FALSE + ([((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (F11>=1 * Section_10>=1))] != FALSE + [(FwdU((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))),TRUE) * (F9>=1 * Section_8>=1))] != FALSE)))
Checking (exact) 0 :[FwdG(FwdU((Init * ((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1))))),TRUE),(Section_12>=1 * F1>=1))] != FALSE
Checking (exact) 0 :FwdG(FwdU((Init * ((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1))))),TRUE),(Section_12>=1 * F1>=1))
Checking (exact) 1 :FwdU((Init * ((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1))))),TRUE)
Checking (exact) 1 :(Init * ((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1)))))
Checking (exact) 1 :((!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1))) * !((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1))))
Checking (exact) 1 :!((((F2>=1 * Section_1>=1) * (Section_5>=1 * F6>=1)) * (F9>=1 * Section_8>=1)))
Checking (exact) 1 :(!(((F11>=1 * Section_10>=1) + (Section_11>=1 * F12>=1))) + E(TRUE U (Section_5>=1 * F6>=1)))
Checking (exact) 1 :E(TRUE U (Section_5>=1 * F6>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9/2/3
Checking (exact) 0 :([((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (Section_9>=1 * F10>=1))] != FALSE + ([((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (F11>=1 * Section_10>=1))] != FALSE + [(FwdU((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))),TRUE) * (F9>=1 * Section_8>=1))] != FALSE))
Checking (exact) 0 :[((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (Section_9>=1 * F10>=1))] != FALSE
Checking (exact) 0 :((Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))) * (Section_9>=1 * F10>=1))
Checking (exact) 1 :(Section_9>=1 * F10>=1)
Checking (exact) 1 :F10>=1
Checking (exact) 1 :(Init * E(TRUE U E(TRUE U (F5>=1 * Section_4>=1))))
Checking (exact) 1 :E(TRUE U E(TRUE U (F5>=1 * Section_4>=1)))
Checking (exact) 1 :E(TRUE U (F5>=1 * Section_4>=1))
Checking (exact) 1 :Init
(forward)formula 1,1,0.054346,5288,1,0,17,3858,67,9,642,3095,23
FORMULA CircularTrains-PT-012-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (E((((Section_6>=1 * F7>=1) * (F5>=1 * Section_4>=1)) * (Section_9>=1 * F10>=1)) U EG((F3>=1 * Section_2>=1))) * (((Section_12>=1 * F1>=1) * ((!((F11>=1 * Section_10>=1)) + ((Section_11>=1 * F12>=1) + (F8>=1 * Section_7>=1))) * (((Section_6>=1 * F7>=1) + (Section_11>=1 * F12>=1)) * ((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))) + (((F2>=1 * Section_1>=1) + (F3>=1 * Section_2>=1)) * (Section_6>=1 * F7>=1))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * (((Section_12>=1 * F1>=1) * ((!((F11>=1 * Section_10>=1)) + ((Section_11>=1 * F12>=1) + (F8>=1 * Section_7>=1))) * (((Section_6>=1 * F7>=1) + (Section_11>=1 * F12>=1)) * ((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))) + (((F2>=1 * Section_1>=1) + (F3>=1 * Section_2>=1)) * (Section_6>=1 * F7>=1)))),(((Section_6>=1 * F7>=1) * (F5>=1 * Section_4>=1)) * (Section_9>=1 * F10>=1))),(F3>=1 * Section_2>=1))] != FALSE
Checking (exact) 0 :[FwdG(FwdU((Init * (((Section_12>=1 * F1>=1) * ((!((F11>=1 * Section_10>=1)) + ((Section_11>=1 * F12>=1) + (F8>=1 * Section_7>=1))) * (((Section_6>=1 * F7>=1) + (Section_11>=1 * F12>=1)) * ((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))) + (((F2>=1 * Section_1>=1) + (F3>=1 * Section_2>=1)) * (Section_6>=1 * F7>=1)))),(((Section_6>=1 * F7>=1) * (F5>=1 * Section_4>=1)) * (Section_9>=1 * F10>=1))),(F3>=1 * Section_2>=1))] != FALSE
Checking (exact) 0 :FwdG(FwdU((Init * (((Section_12>=1 * F1>=1) * ((!((F11>=1 * Section_10>=1)) + ((Section_11>=1 * F12>=1) + (F8>=1 * Section_7>=1))) * (((Section_6>=1 * F7>=1) + (Section_11>=1 * F12>=1)) * ((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))) + (((F2>=1 * Section_1>=1) + (F3>=1 * Section_2>=1)) * (Section_6>=1 * F7>=1)))),(((Section_6>=1 * F7>=1) * (F5>=1 * Section_4>=1)) * (Section_9>=1 * F10>=1))),(F3>=1 * Section_2>=1))
Checking (exact) 1 :FwdU((Init * (((Section_12>=1 * F1>=1) * ((!((F11>=1 * Section_10>=1)) + ((Section_11>=1 * F12>=1) + (F8>=1 * Section_7>=1))) * (((Section_6>=1 * F7>=1) + (Section_11>=1 * F12>=1)) * ((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))) + (((F2>=1 * Section_1>=1) + (F3>=1 * Section_2>=1)) * (Section_6>=1 * F7>=1)))),(((Section_6>=1 * F7>=1) * (F5>=1 * Section_4>=1)) * (Section_9>=1 * F10>=1)))
Checking (exact) 1 :(Init * (((Section_12>=1 * F1>=1) * ((!((F11>=1 * Section_10>=1)) + ((Section_11>=1 * F12>=1) + (F8>=1 * Section_7>=1))) * (((Section_6>=1 * F7>=1) + (Section_11>=1 * F12>=1)) * ((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))) + (((F2>=1 * Section_1>=1) + (F3>=1 * Section_2>=1)) * (Section_6>=1 * F7>=1))))
(forward)formula 2,0,0.057459,5288,1,0,18,3898,104,9,680,3105,25
FORMULA CircularTrains-PT-012-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((Section_5>=1 * F6>=1) + (F4>=1 * Section_3>=1))
=> equivalent forward existential formula: [(Init * ((Section_5>=1 * F6>=1) + (F4>=1 * Section_3>=1)))] != FALSE
Checking (exact) 0 :[(Init * ((Section_5>=1 * F6>=1) + (F4>=1 * Section_3>=1)))] != FALSE
Checking (exact) 0 :(Init * ((Section_5>=1 * F6>=1) + (F4>=1 * Section_3>=1)))
(forward)formula 3,1,0.058395,5352,1,0,19,3904,109,9,683,3105,26
FORMULA CircularTrains-PT-012-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(((!(((F5>=1 * Section_4>=1) + ((F5>=1 * Section_4>=1) * (F2>=1 * Section_1>=1)))) * !(((Section_5>=1 * F6>=1) * (F4>=1 * Section_3>=1)))) * EF(EF((F2>=1 * Section_1>=1)))))
=> equivalent forward existential formula: ([(Init * !((!(((F5>=1 * Section_4>=1) + ((F5>=1 * Section_4>=1) * (F2>=1 * Section_1>=1)))) * !(((Section_5>=1 * F6>=1) * (F4>=1 * Section_3>=1))))))] != FALSE + [(Init * !(E(TRUE U E(TRUE U (F2>=1 * Section_1>=1)))))] != FALSE)
Checking (exact) 0 :([(Init * !((!(((F5>=1 * Section_4>=1) + ((F5>=1 * Section_4>=1) * (F2>=1 * Section_1>=1)))) * !(((Section_5>=1 * F6>=1) * (F4>=1 * Section_3>=1))))))] != FALSE + [(Init * !(E(TRUE U E(TRUE U (F2>=1 * Section_1>=1)))))] != FALSE)
Checking (exact) 0 :[(Init * !((!(((F5>=1 * Section_4>=1) + ((F5>=1 * Section_4>=1) * (F2>=1 * Section_1>=1)))) * !(((Section_5>=1 * F6>=1) * (F4>=1 * Section_3>=1))))))] != FALSE
Checking (exact) 0 :(Init * !((!(((F5>=1 * Section_4>=1) + ((F5>=1 * Section_4>=1) * (F2>=1 * Section_1>=1)))) * !(((Section_5>=1 * F6>=1) * (F4>=1 * Section_3>=1))))))
Checking (exact) 0 :[(Init * !(E(TRUE U E(TRUE U (F2>=1 * Section_1>=1)))))] != FALSE
Checking (exact) 0 :(Init * !(E(TRUE U E(TRUE U (F2>=1 * Section_1>=1)))))
Checking (exact) 1 :!(E(TRUE U E(TRUE U (F2>=1 * Section_1>=1))))
Checking (exact) 1 :E(TRUE U E(TRUE U (F2>=1 * Section_1>=1)))
Checking (exact) 1 :E(TRUE U (F2>=1 * Section_1>=1))
(forward)formula 4,0,0.062398,5360,1,0,21,4059,119,9,706,3231,30
FORMULA CircularTrains-PT-012-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !((EG(EX((F4>=1 * Section_3>=1))) * AG(!((F5>=1 * Section_4>=1)))))
=> equivalent forward existential formula: ([(Init * !(EG(EX((F4>=1 * Section_3>=1)))))] != FALSE + [(FwdU(Init,TRUE) * (F5>=1 * Section_4>=1))] != FALSE)
Checking (exact) 0 :([(Init * !(EG(EX((F4>=1 * Section_3>=1)))))] != FALSE + [(FwdU(Init,TRUE) * (F5>=1 * Section_4>=1))] != FALSE)
Checking (exact) 0 :[(Init * !(EG(EX((F4>=1 * Section_3>=1)))))] != FALSE
Checking (exact) 0 :(Init * !(EG(EX((F4>=1 * Section_3>=1)))))
Checking (exact) 1 :!(EG(EX((F4>=1 * Section_3>=1))))
Checking (exact) 1 :EG(EX((F4>=1 * Section_3>=1)))
Checking (exact) 1 :EX((F4>=1 * Section_3>=1))
Fast SCC detection found none.
Checking (exact) 1 :Init
(forward)formula 5,1,0.085174,5628,1,0,23,6852,124,9,728,5495,32
FORMULA CircularTrains-PT-012-CTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E(EF(!((Section_6>=1 * F7>=1))) U !((((F8>=1 * Section_7>=1) + (Section_11>=1 * F12>=1)) + ((Section_11>=1 * F12>=1) + (F5>=1 * Section_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !((Section_6>=1 * F7>=1)))) * !((((F8>=1 * Section_7>=1) + (Section_11>=1 * F12>=1)) + ((Section_11>=1 * F12>=1) + (F5>=1 * Section_4>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,E(TRUE U !((Section_6>=1 * F7>=1)))) * !((((F8>=1 * Section_7>=1) + (Section_11>=1 * F12>=1)) + ((Section_11>=1 * F12>=1) + (F5>=1 * Section_4>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,E(TRUE U !((Section_6>=1 * F7>=1)))) * !((((F8>=1 * Section_7>=1) + (Section_11>=1 * F12>=1)) + ((Section_11>=1 * F12>=1) + (F5>=1 * Section_4>=1)))))
Checking (exact) 1 :!((((F8>=1 * Section_7>=1) + (Section_11>=1 * F12>=1)) + ((Section_11>=1 * F12>=1) + (F5>=1 * Section_4>=1))))
Checking (exact) 1 :FwdU(Init,E(TRUE U !((Section_6>=1 * F7>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :E(TRUE U !((Section_6>=1 * F7>=1)))
(forward)formula 6,1,0.090986,5904,1,0,26,7044,128,11,738,5900,36
FORMULA CircularTrains-PT-012-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((((EF((Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + EF((Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1)) + !(EX((((F8>=1 * Section_7>=1) + (F9>=1 * Section_8>=1)) + ((F4>=1 * Section_3>=1) + (Section_5>=1 * F6>=1))))))
=> equivalent forward existential formula: [(EY((Init * !((((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1))))) * (((F8>=1 * Section_7>=1) + (F9>=1 * Section_8>=1)) + ((F4>=1 * Section_3>=1) + (Section_5>=1 * F6>=1))))] = FALSE
Checking (exact) 0 :[(EY((Init * !((((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1))))) * (((F8>=1 * Section_7>=1) + (F9>=1 * Section_8>=1)) + ((F4>=1 * Section_3>=1) + (Section_5>=1 * F6>=1))))] = FALSE
Checking (exact) 0 :(EY((Init * !((((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1))))) * (((F8>=1 * Section_7>=1) + (F9>=1 * Section_8>=1)) + ((F4>=1 * Section_3>=1) + (Section_5>=1 * F6>=1))))
Checking (exact) 1 :(((F8>=1 * Section_7>=1) + (F9>=1 * Section_8>=1)) + ((F4>=1 * Section_3>=1) + (Section_5>=1 * F6>=1)))
Checking (exact) 1 :EY((Init * !((((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1)))))
Checking (exact) 1 :(Init * !((((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1))))
Checking (exact) 1 :!((((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1)))
Checking (exact) 1 :(((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1))) * (F3>=1 * Section_2>=1))
Checking (exact) 1 :(F3>=1 * Section_2>=1)
Checking (exact) 1 :Section_2>=1
Checking (exact) 1 :((E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1)))) + E(TRUE U (Section_5>=1 * F6>=1)))
Checking (exact) 1 :(E(TRUE U (Section_6>=1 * F7>=1)) + (!((Section_12>=1 * F1>=1)) * !((F3>=1 * Section_2>=1))))
Checking (exact) 1 :E(TRUE U (Section_6>=1 * F7>=1))
Checking (exact) 1 :E(TRUE U (Section_5>=1 * F6>=1))
Checking (exact) 1 :Init
(forward)formula 7,0,0.102625,5940,1,0,36,7568,133,17,746,6852,45
FORMULA CircularTrains-PT-012-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((F5>=1 * Section_4>=1) * AX(EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1)))))
=> equivalent forward existential formula: ([(Init * !((F5>=1 * Section_4>=1)))] = FALSE * [(EY(Init) * !(EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1)))))] = FALSE)
Checking (exact) 0 :([(Init * !((F5>=1 * Section_4>=1)))] = FALSE * [(EY(Init) * !(EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1)))))] = FALSE)
Checking (exact) 1 :[(EY(Init) * !(EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1)))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1)))))
Checking (exact) 1 :!(EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1))))
Checking (exact) 1 :EX(((F4>=1 * Section_3>=1) * (F5>=1 * Section_4>=1)))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 8,0,0.105431,6048,1,0,36,7568,135,18,750,6877,46
FORMULA CircularTrains-PT-012-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (F2>=1 * Section_1>=1)
=> equivalent forward existential formula: [(Init * (F2>=1 * Section_1>=1))] != FALSE
Checking (exact) 0 :[(Init * (F2>=1 * Section_1>=1))] != FALSE
Checking (exact) 0 :(Init * (F2>=1 * Section_1>=1))
(forward)formula 9,0,0.107101,6056,1,0,37,7570,135,18,750,6877,47
FORMULA CircularTrains-PT-012-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AG(AG(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1)))) + AX(AG(((F5>=1 * Section_4>=1) * (F11>=1 * Section_10>=1)))))
=> equivalent forward existential formula: [(FwdU(EY((Init * !(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))))))))),TRUE) * !(((F5>=1 * Section_4>=1) * (F11>=1 * Section_10>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(EY((Init * !(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))))))))),TRUE) * !(((F5>=1 * Section_4>=1) * (F11>=1 * Section_10>=1))))] = FALSE
Checking (exact) 0 :(FwdU(EY((Init * !(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))))))))),TRUE) * !(((F5>=1 * Section_4>=1) * (F11>=1 * Section_10>=1))))
Checking (exact) 1 :!(((F5>=1 * Section_4>=1) * (F11>=1 * Section_10>=1)))
Checking (exact) 1 :FwdU(EY((Init * !(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))))))))),TRUE)
Checking (exact) 1 :EY((Init * !(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1)))))))))))
Checking (exact) 1 :(Init * !(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))))))))
Checking (exact) 1 :!(!(E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1)))))))))
Checking (exact) 1 :E(TRUE U !(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1)))))))
Checking (exact) 1 :!(!(E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))))
Checking (exact) 1 :E(TRUE U !(((F3>=1 * Section_2>=1) + (Section_5>=1 * F6>=1))))
Checking (exact) 1 :Init
(forward)formula 10,0,0.112836,6080,1,0,40,7703,139,20,757,7036,53
FORMULA CircularTrains-PT-012-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(((F11>=1 * Section_10>=1) + !((F5>=1 * Section_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((F11>=1 * Section_10>=1) + !((F5>=1 * Section_4>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(((F11>=1 * Section_10>=1) + !((F5>=1 * Section_4>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(((F11>=1 * Section_10>=1) + !((F5>=1 * Section_4>=1)))))
Checking (exact) 1 :!(((F11>=1 * Section_10>=1) + !((F5>=1 * Section_4>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 11,0,0.114619,6080,1,0,42,7742,142,22,759,7262,54
FORMULA CircularTrains-PT-012-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(((A((F11>=1 * Section_10>=1) U (F8>=1 * Section_7>=1)) * AF(!((F2>=1 * Section_1>=1)))) * !(AG((F11>=1 * Section_10>=1)))))
=> equivalent forward existential formula: ((([(FwdU(Init,!((F8>=1 * Section_7>=1))) * (!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1))))] != FALSE + [FwdG(Init,!((F8>=1 * Section_7>=1)))] != FALSE) + [FwdG(Init,!(!((F2>=1 * Section_1>=1))))] != FALSE) + [(Init * !(E(TRUE U !((F11>=1 * Section_10>=1)))))] != FALSE)
Checking (exact) 0 :((([(FwdU(Init,!((F8>=1 * Section_7>=1))) * (!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1))))] != FALSE + [FwdG(Init,!((F8>=1 * Section_7>=1)))] != FALSE) + [FwdG(Init,!(!((F2>=1 * Section_1>=1))))] != FALSE) + [(Init * !(E(TRUE U !((F11>=1 * Section_10>=1)))))] != FALSE)
Checking (exact) 0 :(([(FwdU(Init,!((F8>=1 * Section_7>=1))) * (!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1))))] != FALSE + [FwdG(Init,!((F8>=1 * Section_7>=1)))] != FALSE) + [FwdG(Init,!(!((F2>=1 * Section_1>=1))))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,!((F8>=1 * Section_7>=1))) * (!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1))))] != FALSE + [FwdG(Init,!((F8>=1 * Section_7>=1)))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,!((F8>=1 * Section_7>=1))) * (!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,!((F8>=1 * Section_7>=1))) * (!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1))))
Checking (exact) 1 :(!((F11>=1 * Section_10>=1)) * !((F8>=1 * Section_7>=1)))
Checking (exact) 1 :!((F8>=1 * Section_7>=1))
Checking (exact) 1 :FwdU(Init,!((F8>=1 * Section_7>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9/0/3
(forward)formula 12,1,0.12299,6116,1,0,49,7876,151,25,780,7528,59
FORMULA CircularTrains-PT-012-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG((Section_6>=1 * F7>=1))
=> equivalent forward existential formula: [FwdG(Init,(Section_6>=1 * F7>=1))] != FALSE
Checking (exact) 0 :[FwdG(Init,(Section_6>=1 * F7>=1))] != FALSE
Checking (exact) 0 :FwdG(Init,(Section_6>=1 * F7>=1))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9/2/3
(forward)formula 13,0,0.128918,6200,1,0,50,8336,157,26,809,8138,62
FORMULA CircularTrains-PT-012-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((F9>=1 * Section_8>=1))
=> equivalent forward existential formula: [FwdG(Init,!((F9>=1 * Section_8>=1)))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((F9>=1 * Section_8>=1)))] = FALSE
Checking (exact) 0 :FwdG(Init,!((F9>=1 * Section_8>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9/0/3
(forward)formula 14,1,0.136712,6368,1,0,52,8997,164,27,827,9022,66
FORMULA CircularTrains-PT-012-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (F4>=1 * Section_3>=1)
=> equivalent forward existential formula: [(Init * (F4>=1 * Section_3>=1))] != FALSE
Checking (exact) 0 :[(Init * (F4>=1 * Section_3>=1))] != FALSE
Checking (exact) 0 :(Init * (F4>=1 * Section_3>=1))
(forward)formula 15,1,0.137645,6368,1,0,53,9003,164,27,827,9022,67
FORMULA CircularTrains-PT-012-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1464833286983

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
Jun 02, 2016 2:08:05 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2016 2:08:05 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 33 ms
Jun 02, 2016 2:08:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Jun 02, 2016 2:08:06 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 12 transitions.
Jun 02, 2016 2:08:06 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 42 ms
Jun 02, 2016 2:08:06 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 18 ms
Jun 02, 2016 2:08:06 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 ms

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_CircularTrains-PT-012"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/fko/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_CircularTrains-PT-012.tgz
mv S_CircularTrains-PT-012 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_CircularTrains-PT-012, 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 r193kn-qhx2-146444252400058"
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 ;