Execution Chart

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

Trace from the execution

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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-100-CTLFireability-0
FORMULA_NAME Dekker-PT-100-CTLFireability-1
FORMULA_NAME Dekker-PT-100-CTLFireability-10
FORMULA_NAME Dekker-PT-100-CTLFireability-11
FORMULA_NAME Dekker-PT-100-CTLFireability-12
FORMULA_NAME Dekker-PT-100-CTLFireability-13
FORMULA_NAME Dekker-PT-100-CTLFireability-14
FORMULA_NAME Dekker-PT-100-CTLFireability-15
FORMULA_NAME Dekker-PT-100-CTLFireability-2
FORMULA_NAME Dekker-PT-100-CTLFireability-3
FORMULA_NAME Dekker-PT-100-CTLFireability-4
FORMULA_NAME Dekker-PT-100-CTLFireability-5
FORMULA_NAME Dekker-PT-100-CTLFireability-6
FORMULA_NAME Dekker-PT-100-CTLFireability-7
FORMULA_NAME Dekker-PT-100-CTLFireability-8
FORMULA_NAME Dekker-PT-100-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1464164505944


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,6.46502e+31,7.88519,141656,2,2088,5,314146,6,0,12203,84687,0


Converting to forward existential form...Done !
original formula: EF((AG((((flag_1_33>=1 * flag_1_75>=1) * p1_75>=1) * ((flag_1_63>=1 * flag_1_73>=1) * p1_73>=1))) * AG(!(((flag_1_71>=1 * flag_1_84>=1) * p1_84>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !((((flag_1_33>=1 * flag_1_75>=1) * p1_75>=1) * ((flag_1_63>=1 * flag_1_73>=1) * p1_73>=1)))))) * !(E(TRUE U !(!(((flag_1_71>=1 * flag_1_84>=1) * p1_84>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(E(TRUE U !((((flag_1_33>=1 * flag_1_75>=1) * p1_75>=1) * ((flag_1_63>=1 * flag_1_73>=1) * p1_73>=1)))))) * !(E(TRUE U !(!(((flag_1_71>=1 * flag_1_84>=1) * p1_84>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(E(TRUE U !((((flag_1_33>=1 * flag_1_75>=1) * p1_75>=1) * ((flag_1_63>=1 * flag_1_73>=1) * p1_73>=1)))))) * !(E(TRUE U !(!(((flag_1_71>=1 * flag_1_84>=1) * p1_84>=1))))))
Checking (exact) 1 :!(E(TRUE U !(!(((flag_1_71>=1 * flag_1_84>=1) * p1_84>=1)))))
Checking (exact) 1 :E(TRUE U !(!(((flag_1_71>=1 * flag_1_84>=1) * p1_84>=1))))
(forward)formula 0,0,110.879,2051844,1,0,20510,1.3642e+07,20427,10203,143331,5.83835e+06,20413
FORMULA Dekker-PT-100-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(EX(((((flag_1_69>=1 * flag_1_87>=1) * p1_69>=1) * ((flag_1_38>=1 * flag_1_67>=1) * p1_38>=1)) + (((flag_1_70>=1 * flag_1_86>=1) * p1_70>=1) * ((flag_1_59>=1 * flag_1_68>=1) * p1_59>=1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((((flag_1_69>=1 * flag_1_87>=1) * p1_69>=1) * ((flag_1_38>=1 * flag_1_67>=1) * p1_38>=1)) + (((flag_1_70>=1 * flag_1_86>=1) * p1_70>=1) * ((flag_1_59>=1 * flag_1_68>=1) * p1_59>=1))))] != FALSE
Checking (exact) 0 :[(EY(EY(Init)) * ((((flag_1_69>=1 * flag_1_87>=1) * p1_69>=1) * ((flag_1_38>=1 * flag_1_67>=1) * p1_38>=1)) + (((flag_1_70>=1 * flag_1_86>=1) * p1_70>=1) * ((flag_1_59>=1 * flag_1_68>=1) * p1_59>=1))))] != FALSE
Checking (exact) 0 :(EY(EY(Init)) * ((((flag_1_69>=1 * flag_1_87>=1) * p1_69>=1) * ((flag_1_38>=1 * flag_1_67>=1) * p1_38>=1)) + (((flag_1_70>=1 * flag_1_86>=1) * p1_70>=1) * ((flag_1_59>=1 * flag_1_68>=1) * p1_59>=1))))
Checking (exact) 1 :((((flag_1_69>=1 * flag_1_87>=1) * p1_69>=1) * ((flag_1_38>=1 * flag_1_67>=1) * p1_38>=1)) + (((flag_1_70>=1 * flag_1_86>=1) * p1_70>=1) * ((flag_1_59>=1 * flag_1_68>=1) * p1_59>=1)))
Checking (exact) 1 :EY(EY(Init))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 1,0,113.623,2052104,1,0,20516,1.36502e+07,20460,10205,143656,5.84695e+06,20417
FORMULA Dekker-PT-100-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(AF(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1)) U ((flag_1_25>=1 * flag_1_82>=1) * p1_25>=1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1))))) * ((flag_1_25>=1 * flag_1_82>=1) * p1_25>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!(EG(!(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1))))) * ((flag_1_25>=1 * flag_1_82>=1) * p1_25>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,!(EG(!(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1))))) * ((flag_1_25>=1 * flag_1_82>=1) * p1_25>=1))
Checking (exact) 1 :((flag_1_25>=1 * flag_1_82>=1) * p1_25>=1)
Checking (exact) 1 :p1_25>=1
Checking (exact) 1 :FwdU(Init,!(EG(!(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG(!(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1))))
Checking (exact) 1 :EG(!(((flag_1_45>=1 * flag_1_67>=1) * p1_67>=1)))
(forward)formula 2,0,118.183,2053644,1,0,20521,1.38046e+07,20484,10212,143870,5.93282e+06,20433
FORMULA Dekker-PT-100-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(AG((EG(((flag_1_28>=1 * flag_1_58>=1) * p1_28>=1)) + !(((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!(((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1)))) * !(EG(((flag_1_28>=1 * flag_1_58>=1) * p1_28>=1))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(!(((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1)))) * !(EG(((flag_1_28>=1 * flag_1_58>=1) * p1_28>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(!(((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1)))) * !(EG(((flag_1_28>=1 * flag_1_58>=1) * p1_28>=1))))
Checking (exact) 1 :!(EG(((flag_1_28>=1 * flag_1_58>=1) * p1_28>=1)))
Checking (exact) 1 :EG(((flag_1_28>=1 * flag_1_58>=1) * p1_28>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * !(!(((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1))))
Checking (exact) 1 :!(!(((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1)))
Checking (exact) 1 :((flag_1_22>=1 * flag_1_69>=1) * p1_69>=1)
Checking (exact) 1 :p1_69>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 3,1,119.962,2055192,1,0,20527,1.39833e+07,20500,10218,143879,6.01705e+06,20443
FORMULA Dekker-PT-100-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A(AF((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1))) U E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))) * !(E(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))) U (!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1)))))) * !(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))) * !(E(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))) U (!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1)))))) * !(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))) * !(E(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))) U (!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1)))))) * !(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))))
Checking (exact) 1 :!(E(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))) U (!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1)))))) * !(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))))))
Checking (exact) 1 :E(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))) U (!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1)))))) * !(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))
Checking (exact) 1 :!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))
Checking (exact) 1 :E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))
Checking (exact) 1 :(!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1)))))) * !(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))))
Checking (exact) 1 :!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))
Checking (exact) 1 :E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))
Checking (exact) 1 :!(!(EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1))))))
Checking (exact) 1 :EG(!((((flag_1_8>=1 * flag_1_74>=1) * p1_74>=1) * ((flag_1_47>=1 * flag_1_88>=1) * p1_88>=1))))
Checking (exact) 1 :(Init * !(EG(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))))))
Checking (exact) 1 :!(EG(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))))
Checking (exact) 1 :EG(!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))))
Checking (exact) 1 :!(E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1)))
Checking (exact) 1 :E(((flag_1_22>=1 * flag_1_56>=1) * p1_22>=1) U ((flag_1_2>=1 * flag_1_47>=1) * p1_47>=1))
Checking (exact) 1 :Init
(forward)formula 4,0,157.687,2224504,1,0,20547,1.49025e+07,33,10232,47215,6.44486e+06,45
FORMULA Dekker-PT-100-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(EF((!((((flag_1_54>=1 * flag_1_63>=1) * p1_63>=1) * ((flag_1_8>=1 * flag_1_24>=1) * p1_8>=1))) * EG(((flag_1_7>=1 * flag_1_55>=1) * p1_55>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((flag_1_54>=1 * flag_1_63>=1) * p1_63>=1) * ((flag_1_8>=1 * flag_1_24>=1) * p1_8>=1)))),((flag_1_7>=1 * flag_1_55>=1) * p1_55>=1))] = FALSE
Checking (exact) 0 :[FwdG((FwdU(Init,TRUE) * !((((flag_1_54>=1 * flag_1_63>=1) * p1_63>=1) * ((flag_1_8>=1 * flag_1_24>=1) * p1_8>=1)))),((flag_1_7>=1 * flag_1_55>=1) * p1_55>=1))] = FALSE
Checking (exact) 0 :FwdG((FwdU(Init,TRUE) * !((((flag_1_54>=1 * flag_1_63>=1) * p1_63>=1) * ((flag_1_8>=1 * flag_1_24>=1) * p1_8>=1)))),((flag_1_7>=1 * flag_1_55>=1) * p1_55>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * !((((flag_1_54>=1 * flag_1_63>=1) * p1_63>=1) * ((flag_1_8>=1 * flag_1_24>=1) * p1_8>=1))))
Checking (exact) 1 :!((((flag_1_54>=1 * flag_1_63>=1) * p1_63>=1) * ((flag_1_8>=1 * flag_1_24>=1) * p1_8>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9801/696/399
(forward)formula 5,0,163.523,2224504,1,0,20547,1.49025e+07,65,10232,69233,6.44486e+06,50
FORMULA Dekker-PT-100-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E((EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1)))) U E(((flag_1_34>=1 * flag_1_60>=1) * p1_34>=1) U ((flag_1_52>=1 * flag_1_85>=1) * p1_85>=1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1))))),((flag_1_34>=1 * flag_1_60>=1) * p1_34>=1)) * ((flag_1_52>=1 * flag_1_85>=1) * p1_85>=1))] != FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,(EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1))))),((flag_1_34>=1 * flag_1_60>=1) * p1_34>=1)) * ((flag_1_52>=1 * flag_1_85>=1) * p1_85>=1))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,(EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1))))),((flag_1_34>=1 * flag_1_60>=1) * p1_34>=1)) * ((flag_1_52>=1 * flag_1_85>=1) * p1_85>=1))
Checking (exact) 1 :((flag_1_52>=1 * flag_1_85>=1) * p1_85>=1)
Checking (exact) 1 :p1_85>=1
Checking (exact) 1 :FwdU(FwdU(Init,(EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1))))),((flag_1_34>=1 * flag_1_60>=1) * p1_34>=1))
Checking (exact) 1 :FwdU(Init,(EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :(EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1)) + (!(((flag_1_2>=1 * flag_1_23>=1) * p1_2>=1)) + !(((flag_1_38>=1 * flag_1_50>=1) * p1_38>=1))))
Checking (exact) 1 :EG(((flag_1_22>=1 * flag_1_61>=1) * p1_22>=1))
Hit Full ! (commute/partial/dont) 9801/696/399
(forward)formula 6,1,413.621,2497116,1,0,20547,1.96266e+07,26,10232,47950,6.44486e+06,169
FORMULA Dekker-PT-100-CTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG(((((flag_1_18>=1 * flag_1_23>=1) * p1_18>=1) + !((((flag_1_51>=1 * flag_1_96>=1) * p1_51>=1) + ((flag_1_23>=1 * flag_1_50>=1) * p1_50>=1)))) * ((flag_1_36>=1 * p3_36>=1) + !(((flag_1_34>=1 * flag_1_52>=1) * p1_52>=1)))))
=> equivalent forward existential formula: [FwdG(Init,((((flag_1_18>=1 * flag_1_23>=1) * p1_18>=1) + !((((flag_1_51>=1 * flag_1_96>=1) * p1_51>=1) + ((flag_1_23>=1 * flag_1_50>=1) * p1_50>=1)))) * ((flag_1_36>=1 * p3_36>=1) + !(((flag_1_34>=1 * flag_1_52>=1) * p1_52>=1)))))] != FALSE
Checking (exact) 0 :[FwdG(Init,((((flag_1_18>=1 * flag_1_23>=1) * p1_18>=1) + !((((flag_1_51>=1 * flag_1_96>=1) * p1_51>=1) + ((flag_1_23>=1 * flag_1_50>=1) * p1_50>=1)))) * ((flag_1_36>=1 * p3_36>=1) + !(((flag_1_34>=1 * flag_1_52>=1) * p1_52>=1)))))] != FALSE
Checking (exact) 0 :FwdG(Init,((((flag_1_18>=1 * flag_1_23>=1) * p1_18>=1) + !((((flag_1_51>=1 * flag_1_96>=1) * p1_51>=1) + ((flag_1_23>=1 * flag_1_50>=1) * p1_50>=1)))) * ((flag_1_36>=1 * p3_36>=1) + !(((flag_1_34>=1 * flag_1_52>=1) * p1_52>=1)))))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 8651/566/1549
(forward)formula 7,1,483.54,2792060,1,0,20547,2.37301e+07,9,10232,24923,7.74302e+06,1
FORMULA Dekker-PT-100-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF((((flag_1_4>=1 * flag_1_42>=1) * p1_42>=1) + AX(((flag_1_47>=1 * flag_1_52>=1) * p1_52>=1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((flag_1_4>=1 * flag_1_42>=1) * p1_42>=1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((flag_1_47>=1 * flag_1_52>=1) * p1_52>=1)))))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,TRUE) * ((flag_1_4>=1 * flag_1_42>=1) * p1_42>=1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((flag_1_47>=1 * flag_1_52>=1) * p1_52>=1)))))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * ((flag_1_4>=1 * flag_1_42>=1) * p1_42>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * ((flag_1_4>=1 * flag_1_42>=1) * p1_42>=1))
Checking (exact) 1 :((flag_1_4>=1 * flag_1_42>=1) * p1_42>=1)
Checking (exact) 1 :p1_42>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 8,1,483.6,2792060,1,0,20547,2.37301e+07,16,10232,24931,7.74302e+06,3
FORMULA Dekker-PT-100-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((AF(EX(((flag_1_5>=1 * flag_1_59>=1) * p1_5>=1))) + ((flag_1_43>=1 * flag_1_65>=1) * p1_43>=1)) + A(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1))) U ((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))
=> equivalent forward existential formula: [FwdG(((Init * !(!((E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))))) * !(((flag_1_43>=1 * flag_1_65>=1) * p1_43>=1))),!(EX(((flag_1_5>=1 * flag_1_59>=1) * p1_5>=1))))] = FALSE
Checking (exact) 0 :[FwdG(((Init * !(!((E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))))) * !(((flag_1_43>=1 * flag_1_65>=1) * p1_43>=1))),!(EX(((flag_1_5>=1 * flag_1_59>=1) * p1_5>=1))))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(!((E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))))) * !(((flag_1_43>=1 * flag_1_65>=1) * p1_43>=1))),!(EX(((flag_1_5>=1 * flag_1_59>=1) * p1_5>=1))))
Checking (exact) 1 :((Init * !(!((E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))))) * !(((flag_1_43>=1 * flag_1_65>=1) * p1_43>=1)))
Checking (exact) 1 :!(((flag_1_43>=1 * flag_1_65>=1) * p1_43>=1))
Checking (exact) 1 :(Init * !(!((E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))))))
Checking (exact) 1 :!(!((E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))))
Checking (exact) 1 :(E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))) + EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))
Checking (exact) 1 :E(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)) U (!(((((flag_1_11>=1 * flag_1_15>=1) * p1_15>=1) * ((flag_1_18>=1 * flag_1_93>=1) * p1_93>=1)) + !(((flag_1_21>=1 * flag_1_28>=1) * p1_28>=1)))) * !(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1))))
Checking (exact) 1 :EG(!(((flag_1_46>=1 * flag_1_73>=1) * p1_46>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EX(((flag_1_5>=1 * flag_1_59>=1) * p1_5>=1)))
Checking (exact) 1 :EX(((flag_1_5>=1 * flag_1_59>=1) * p1_5>=1))
(forward)formula 9,0,611.188,2792064,1,0,20547,2.37301e+07,76,10232,67847,7.74302e+06,248
FORMULA Dekker-PT-100-CTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(((EF(((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1)) * EF(((flag_1_19>=1 * flag_1_42>=1) * p1_19>=1))) + AX(((flag_1_60>=1 * flag_1_74>=1) * p1_74>=1))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1))),TRUE) * ((flag_1_19>=1 * flag_1_42>=1) * p1_19>=1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((flag_1_60>=1 * flag_1_74>=1) * p1_74>=1)))))] != FALSE)
Checking (exact) 0 :([(FwdU((FwdU(Init,TRUE) * E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1))),TRUE) * ((flag_1_19>=1 * flag_1_42>=1) * p1_19>=1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((flag_1_60>=1 * flag_1_74>=1) * p1_74>=1)))))] != FALSE)
Checking (exact) 0 :[(FwdU((FwdU(Init,TRUE) * E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1))),TRUE) * ((flag_1_19>=1 * flag_1_42>=1) * p1_19>=1))] != FALSE
Checking (exact) 0 :(FwdU((FwdU(Init,TRUE) * E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1))),TRUE) * ((flag_1_19>=1 * flag_1_42>=1) * p1_19>=1))
Checking (exact) 1 :((flag_1_19>=1 * flag_1_42>=1) * p1_19>=1)
Checking (exact) 1 :p1_19>=1
Checking (exact) 1 :FwdU((FwdU(Init,TRUE) * E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1))),TRUE)
Checking (exact) 1 :(FwdU(Init,TRUE) * E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1)))
Checking (exact) 1 :E(TRUE U ((flag_1_3>=1 * flag_1_36>=1) * p1_36>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 10,1,618.841,2872632,1,0,20547,2.37301e+07,98,10232,68989,7.74302e+06,261
FORMULA Dekker-PT-100-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AF((AG(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)) + AF(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1)))) + (((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1))))
=> equivalent forward existential formula: [FwdG((Init * !((((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1))))),!((!(E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)))) + !(EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1)))))))] = FALSE
Checking (exact) 0 :[FwdG((Init * !((((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1))))),!((!(E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)))) + !(EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1)))))))] = FALSE
Checking (exact) 0 :FwdG((Init * !((((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1))))),!((!(E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)))) + !(EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1)))))))
Checking (exact) 1 :(Init * !((((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1)))))
Checking (exact) 1 :!((((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1))))
Checking (exact) 1 :(((flag_1_81>=1 * flag_1_86>=1) * p1_86>=1) + EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1)))
Checking (exact) 1 :EX(((flag_1_48>=1 * flag_1_77>=1) * p1_77>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :!((!(E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)))) + !(EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1))))))
Checking (exact) 1 :(!(E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)))) + !(EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1)))))
Checking (exact) 1 :!(E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1))))
Checking (exact) 1 :E(TRUE U !(((flag_1_13>=1 * flag_1_27>=1) * p1_13>=1)))
Checking (exact) 1 :!(EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1))))
Checking (exact) 1 :EG(!(((flag_1_32>=1 * flag_1_65>=1) * p1_32>=1)))
(forward)formula 11,0,840.255,3433848,1,0,20547,2.57609e+07,13,10232,46701,8.27295e+06,174
FORMULA Dekker-PT-100-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(((flag_1_29>=1 * flag_1_48>=1) * p1_48>=1))
=> equivalent forward existential formula: [FwdG(Init,!(((flag_1_29>=1 * flag_1_48>=1) * p1_48>=1)))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(((flag_1_29>=1 * flag_1_48>=1) * p1_48>=1)))] = FALSE
Checking (exact) 0 :FwdG(Init,!(((flag_1_29>=1 * flag_1_48>=1) * p1_48>=1)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9801/0/399
(forward)formula 12,0,852.278,3433848,1,0,20547,2.57609e+07,27,10232,68790,8.27295e+06,182
FORMULA Dekker-PT-100-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(AF(((flag_1_72>=1 * flag_1_74>=1) * p1_72>=1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((flag_1_72>=1 * flag_1_74>=1) * p1_72>=1)))))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(EG(!(((flag_1_72>=1 * flag_1_74>=1) * p1_72>=1)))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(EG(!(((flag_1_72>=1 * flag_1_74>=1) * p1_72>=1)))))
Checking (exact) 1 :!(EG(!(((flag_1_72>=1 * flag_1_74>=1) * p1_72>=1))))
Checking (exact) 1 :EG(!(((flag_1_72>=1 * flag_1_74>=1) * p1_72>=1)))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 13,0,853.473,3433848,1,0,20547,2.57609e+07,39,10232,68799,8.27295e+06,190
FORMULA Dekker-PT-100-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(A(!(((flag_1_45>=1 * flag_1_58>=1) * p1_45>=1)) U (((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1)))) * (!(!(((flag_1_45>=1 * flag_1_58>=1) * p1_45>=1))) * !((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1))))] = FALSE)
Checking (exact) 0 :([(FwdU(FwdU(Init,TRUE),!((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1)))) * (!(!(((flag_1_45>=1 * flag_1_58>=1) * p1_45>=1))) * !((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1))))] = FALSE)
Checking (exact) 1 :[FwdG(FwdU(Init,TRUE),!((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1))))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!((((flag_1_7>=1 * flag_1_70>=1) * p1_70>=1) + ((flag_1_13>=1 * flag_1_99>=1) * p1_13>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 9410/391/790
(forward)formula 14,0,862.172,3433848,1,0,20547,2.57609e+07,61,10232,69920,8.27295e+06,194
FORMULA Dekker-PT-100-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((!(AF(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1))) * AX(!(((flag_1_82>=1 * flag_1_85>=1) * p1_82>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!(EG(!(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1)))))) * !(EX(!(!(((flag_1_82>=1 * flag_1_85>=1) * p1_82>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(!(EG(!(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1)))))) * !(EX(!(!(((flag_1_82>=1 * flag_1_85>=1) * p1_82>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(!(EG(!(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1)))))) * !(EX(!(!(((flag_1_82>=1 * flag_1_85>=1) * p1_82>=1))))))
Checking (exact) 1 :!(EX(!(!(((flag_1_82>=1 * flag_1_85>=1) * p1_82>=1)))))
Checking (exact) 1 :EX(!(!(((flag_1_82>=1 * flag_1_85>=1) * p1_82>=1))))
Checking (exact) 1 :(FwdU(Init,TRUE) * !(!(EG(!(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1))))))
Checking (exact) 1 :!(!(EG(!(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1)))))
Checking (exact) 1 :EG(!(((flag_1_32>=1 * flag_1_44>=1) * p1_32>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 15,1,865.033,3433848,1,0,20547,2.57609e+07,80,10232,69934,8.27295e+06,206
FORMULA Dekker-PT-100-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1464165379169

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Dekker-PT-100"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/S_Dekker-PT-100.tgz
mv S_Dekker-PT-100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_Dekker-PT-100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r145kn-smll-146416245700040"
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 ;