About the Execution of ITS-Tools.L for Philosophers-PT-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15750.520 | 3209.00 | 7515.00 | 110.60 | TFFTFFFTTFFTTFFF | 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)
...................
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Philosophers-PT-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-csrt-152666477400760
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000005-CTLFireability-00
FORMULA_NAME Philosophers-PT-000005-CTLFireability-01
FORMULA_NAME Philosophers-PT-000005-CTLFireability-02
FORMULA_NAME Philosophers-PT-000005-CTLFireability-03
FORMULA_NAME Philosophers-PT-000005-CTLFireability-04
FORMULA_NAME Philosophers-PT-000005-CTLFireability-05
FORMULA_NAME Philosophers-PT-000005-CTLFireability-06
FORMULA_NAME Philosophers-PT-000005-CTLFireability-07
FORMULA_NAME Philosophers-PT-000005-CTLFireability-08
FORMULA_NAME Philosophers-PT-000005-CTLFireability-09
FORMULA_NAME Philosophers-PT-000005-CTLFireability-10
FORMULA_NAME Philosophers-PT-000005-CTLFireability-11
FORMULA_NAME Philosophers-PT-000005-CTLFireability-12
FORMULA_NAME Philosophers-PT-000005-CTLFireability-13
FORMULA_NAME Philosophers-PT-000005-CTLFireability-14
FORMULA_NAME Philosophers-PT-000005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527274895951
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph3524996763849920483.txt, -o, /tmp/graph3524996763849920483.bin, -w, /tmp/graph3524996763849920483.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph3524996763849920483.bin, -l, -1, -v, -w, /tmp/graph3524996763849920483.weights, -q, 0, -e, 0.001], workingDir=null]
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 5 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,243,0.015631,4600,22,19,144,60,64,86,29,74,0
Converting to forward existential form...Done !
original formula: EX(EX(((((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))&&((((((u4.Fork_5>=1)&&(u2.Catch2_1>=1))||((u1.Catch2_4>=1)&&(u0.Fork_3>=1)))||((u1.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u2.Fork_1>=1)&&(u3.Catch2_2>=1)))||((u3.Fork_2>=1)&&(u0.Catch2_3>=1))))||(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))||((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))&&((((((u4.Fork_5>=1)&&(u2.Catch2_1>=1))||((u1.Catch2_4>=1)&&(u0.Fork_3>=1)))||((u1.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u2.Fork_1>=1)&&(u3.Catch2_2>=1)))||((u3.Fork_2>=1)&&(u0.Catch2_3>=1))))||(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))||((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1))))))] != FALSE
(forward)formula 0,1,0.023623,5224,1,0,290,60,176,215,48,74,444
FORMULA Philosophers-PT-000005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(E(!(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))) U !(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))) U !(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 1,0,0.031624,5224,1,0,851,148,313,716,129,163,1488
FORMULA Philosophers-PT-000005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AX(AG((((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))||((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))))) * !((EG((((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1))) + !(AG(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !((((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))||((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))))] = FALSE * ([FwdG(Init,(((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1)))] = FALSE * [(FwdU(Init,TRUE) * !(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))))] = FALSE))
(forward)formula 2,0,0.033235,5488,1,0,852,148,313,727,129,163,1488
FORMULA Philosophers-PT-000005-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(EG((((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1)))] != FALSE
(forward)formula 3,1,0.035025,5488,1,0,998,149,326,853,129,174,1849
FORMULA Philosophers-PT-000005-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))
=> equivalent forward existential formula: [(Init * !(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))))] != FALSE
(forward)formula 4,0,0.036014,5488,1,0,998,149,326,853,129,174,1862
FORMULA Philosophers-PT-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(AF((((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))||((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))||((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1))))))] = FALSE
(forward)formula 5,0,0.055058,5488,1,0,1300,153,330,1130,129,183,2682
FORMULA Philosophers-PT-000005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AX((((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))&&(!(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))||((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))))) * (((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1)))
=> equivalent forward existential formula: ([(EY(Init) * !((((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))&&(!(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))||((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))))))] = FALSE * [(Init * !((((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1))))] = FALSE)
(forward)formula 6,0,0.05582,5752,1,0,1311,153,331,1143,129,183,2696
FORMULA Philosophers-PT-000005-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AF(!(AG((((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1))))) + (E(!(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))) U ((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))) + ((EX(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))) * (((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))||((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))) * EG(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !((E(!(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))) U ((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))) + ((EX(((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1)))) * (((((((u2.Catch1_1>=1)&&(u2.Fork_1>=1))||((u3.Catch1_2>=1)&&(u3.Fork_2>=1)))||((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))||((u1.Catch1_4>=1)&&(u1.Fork_4>=1)))||((((((u3.Think_2>=1)&&(u3.Fork_2>=1))||((u0.Fork_3>=1)&&(u0.Think_3>=1)))||((u2.Think_1>=1)&&(u2.Fork_1>=1)))||((u1.Fork_4>=1)&&(u1.Think_4>=1)))||((u4.Fork_5>=1)&&(u4.Think_5>=1))))) * EG(((((((u2.Fork_1>=1)&&(u3.Think_2>=1))||((u4.Fork_5>=1)&&(u2.Think_1>=1)))||((u1.Think_4>=1)&&(u0.Fork_3>=1)))||((u3.Fork_2>=1)&&(u0.Think_3>=1)))||((u1.Fork_4>=1)&&(u4.Think_5>=1)))))))),!(!(!(E(TRUE U !((((((u1.Eat_4>=1)||(u0.Eat_3>=1))||(u3.Eat_2>=1))||(u2.Eat_1>=1))||(u4.Eat_5>=1))))))))] = FALSE
(forward)formula 7,1,0.077199,6016,1,0,1932,155,411,1830,136,186,4046
FORMULA Philosophers-PT-000005-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((u1.Think_4>=1)&&(u0.Fork_3>=1))
=> equivalent forward existential formula: [(Init * ((u1.Think_4>=1)&&(u0.Fork_3>=1)))] != FALSE
(forward)formula 8,1,0.093431,6016,1,0,1935,155,411,1830,136,186,4049
FORMULA Philosophers-PT-000005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AX(AF(!(((u3.Fork_2>=1)&&(u0.Catch2_3>=1))))) * (((((!((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||(((u1.Catch2_4>=1)&&(u0.Fork_3>=1))&&((u4.Fork_5>=1)&&(u4.Think_5>=1))))&&((u2.Catch1_1>=1)&&(u2.Fork_1>=1)))||(!((!(u2.Eat_1>=1))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1))))) + AF(((u1.Fork_4>=1)&&(u4.Catch2_5>=1)))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!(!(((u3.Fork_2>=1)&&(u0.Catch2_3>=1)))))] = FALSE * [FwdG((Init * !(((((!((u4.Fork_5>=1)&&(u4.Catch1_5>=1)))||(((u1.Catch2_4>=1)&&(u0.Fork_3>=1))&&((u4.Fork_5>=1)&&(u4.Think_5>=1))))&&((u2.Catch1_1>=1)&&(u2.Fork_1>=1)))||(!((!(u2.Eat_1>=1))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1))))))),!(((u1.Fork_4>=1)&&(u4.Catch2_5>=1))))] = FALSE)
(forward)formula 9,0,0.096247,6016,1,0,2132,158,462,2051,143,200,4558
FORMULA Philosophers-PT-000005-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: ((u3.Eat_2>=1) * AF(((u3.Fork_2>=1)&&(u0.Think_3>=1))))
=> equivalent forward existential formula: ([(Init * !((u3.Eat_2>=1)))] = FALSE * [FwdG(Init,!(((u3.Fork_2>=1)&&(u0.Think_3>=1))))] = FALSE)
(forward)formula 10,0,0.096766,6016,1,0,2143,158,475,2059,143,200,4570
FORMULA Philosophers-PT-000005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: ((u1.Think_4>=1)&&(u0.Fork_3>=1))
=> equivalent forward existential formula: [(Init * ((u1.Think_4>=1)&&(u0.Fork_3>=1)))] != FALSE
(forward)formula 11,1,0.097001,6016,1,0,2143,158,475,2059,143,200,4570
FORMULA Philosophers-PT-000005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(EF(((((u1.Catch1_4>=1)&&(u1.Fork_4>=1))||((u4.Fork_5>=1)&&(u2.Catch2_1>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((((u1.Catch1_4>=1)&&(u1.Fork_4>=1))||((u4.Fork_5>=1)&&(u2.Catch2_1>=1)))||((u0.Catch1_3>=1)&&(u0.Fork_3>=1))))] != FALSE
(forward)formula 12,1,0.098599,6016,1,0,2163,158,505,2090,143,205,4723
FORMULA Philosophers-PT-000005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX((((((u2.Think_1>=1)&&(u2.Fork_1>=1))&&(u4.Eat_5>=1))||(u1.Eat_4>=1)) * EX(((u1.Think_4>=1)&&(u0.Fork_3>=1))))) * (!(A(((u3.Catch1_2>=1)&&(u3.Fork_2>=1)) U ((u4.Fork_5>=1)&&(u2.Catch2_1>=1)))) * AG(EX(((u0.Catch1_3>=1)&&(u0.Fork_3>=1))))))
=> equivalent forward existential formula: ([(Init * !(EX((((((u2.Think_1>=1)&&(u2.Fork_1>=1))&&(u4.Eat_5>=1))||(u1.Eat_4>=1)) * EX(((u1.Think_4>=1)&&(u0.Fork_3>=1)))))))] = FALSE * ([((Init * !(EG(!(((u4.Fork_5>=1)&&(u2.Catch2_1>=1)))))) * !(E(!(((u4.Fork_5>=1)&&(u2.Catch2_1>=1))) U (!(((u3.Catch1_2>=1)&&(u3.Fork_2>=1))) * !(((u4.Fork_5>=1)&&(u2.Catch2_1>=1)))))))] = FALSE * [(FwdU(Init,TRUE) * !(EX(((u0.Catch1_3>=1)&&(u0.Fork_3>=1)))))] = FALSE))
(forward)formula 13,0,0.099445,6016,1,0,2247,158,505,2162,143,205,4830
FORMULA Philosophers-PT-000005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(!(EG(!(((u3.Catch1_2>=1)&&(u3.Fork_2>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((u3.Catch1_2>=1)&&(u3.Fork_2>=1))))] = FALSE
(forward)formula 14,0,0.101282,6016,1,0,2408,158,522,2327,143,205,5218
FORMULA Philosophers-PT-000005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (u4.Eat_5>=1)
=> equivalent forward existential formula: [(Init * (u4.Eat_5>=1))] != FALSE
(forward)formula 15,0,0.101488,6280,1,0,2408,158,522,2327,143,205,5218
FORMULA Philosophers-PT-000005-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1527274899160
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 25, 2018 7:01:38 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 25, 2018 7:01:38 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2018 7:01:38 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 30 ms
May 25, 2018 7:01:38 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
May 25, 2018 7:01:38 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
May 25, 2018 7:01:38 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
May 25, 2018 7:01:38 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 25, 2018 7:01:38 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
May 25, 2018 7:01:38 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
Begin: Fri May 25 19:01:38 2018
Computation of communities with the Newman-Girvan Modularity quality function
level 0:
start computation: Fri May 25 19:01:38 2018
network size: 25 nodes, 90 links, 50 weight
quality increased from -0.0447778 to 0.533333
end computation: Fri May 25 19:01:38 2018
level 1:
start computation: Fri May 25 19:01:38 2018
network size: 5 nodes, 15 links, 50 weight
quality increased from 0.533333 to 0.533333
end computation: Fri May 25 19:01:38 2018
End: Fri May 25 19:01:38 2018
Total duration: 0 sec
0.533333
May 25, 2018 7:01:38 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 25, 2018 7:01:38 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 7 ms
May 25, 2018 7:01:38 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 25, 2018 7:01:38 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 5 redundant transitions.
May 25, 2018 7:01:38 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 1 ms
May 25, 2018 7:01:38 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is Philosophers-PT-000005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r117-csrt-152666477400760"
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 '
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 ;