About the Execution of ITS-Tools.L for Philosophers-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15752.290 | 3492.00 | 7422.00 | 91.80 | FFFFFFTTTFTTTFFF | 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 312K
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K 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 4.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K 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 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Philosophers-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-csrt-152666477400767
=====================================================================
--------------------
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-000010-CTLFireability-00
FORMULA_NAME Philosophers-PT-000010-CTLFireability-01
FORMULA_NAME Philosophers-PT-000010-CTLFireability-02
FORMULA_NAME Philosophers-PT-000010-CTLFireability-03
FORMULA_NAME Philosophers-PT-000010-CTLFireability-04
FORMULA_NAME Philosophers-PT-000010-CTLFireability-05
FORMULA_NAME Philosophers-PT-000010-CTLFireability-06
FORMULA_NAME Philosophers-PT-000010-CTLFireability-07
FORMULA_NAME Philosophers-PT-000010-CTLFireability-08
FORMULA_NAME Philosophers-PT-000010-CTLFireability-09
FORMULA_NAME Philosophers-PT-000010-CTLFireability-10
FORMULA_NAME Philosophers-PT-000010-CTLFireability-11
FORMULA_NAME Philosophers-PT-000010-CTLFireability-12
FORMULA_NAME Philosophers-PT-000010-CTLFireability-13
FORMULA_NAME Philosophers-PT-000010-CTLFireability-14
FORMULA_NAME Philosophers-PT-000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527274935640
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/graph2951832670062730878.txt, -o, /tmp/graph2951832670062730878.bin, -w, /tmp/graph2951832670062730878.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/graph2951832670062730878.bin, -l, -1, -v, -w, /tmp/graph2951832670062730878.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 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 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,59049,0.018862,4892,84,29,600,150,149,421,50,232,0
Converting to forward existential form...Done !
original formula: AG(EX(AF((((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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 0,0,0.179032,11272,1,0,15153,343,486,18046,200,676,18107
FORMULA Philosophers-PT-000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(EF((((!(((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))&&(((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1))))&&((((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))&&(((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1))))||((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((!(((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))&&(((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1))))&&((((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))&&(((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1))))||((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1)))))] = FALSE
(forward)formula 1,0,0.214779,12064,1,0,16585,344,708,19750,214,688,20961
FORMULA Philosophers-PT-000010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(EF(!((((((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))||(((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1))))&&(((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))||(((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1))))&&(((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1))))))] = FALSE
(forward)formula 2,0,0.227678,12328,1,0,17000,348,750,20406,219,697,21721
FORMULA Philosophers-PT-000010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((!(EX((((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1))))) + A((((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1))) U (((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!((E(!((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))) U (!((((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1)))) * !((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))))) + EG(!((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))))))))) * (((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1))))] = FALSE
(forward)formula 3,0,0.317111,15496,1,0,25852,363,771,29420,224,827,34181
FORMULA Philosophers-PT-000010-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: ((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))) * (!((((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1)))) * AX(AF(((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))))))
=> equivalent forward existential formula: ([(Init * !((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))))] = FALSE * ([(Init * (((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1))))] = FALSE * [FwdG(EY(Init),!(((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))))] = FALSE))
(forward)formula 4,0,0.360266,17344,1,0,31176,381,775,33198,224,925,40805
FORMULA Philosophers-PT-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(AX((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))))] = FALSE
(forward)formula 5,0,0.364871,17608,1,0,31410,384,775,33401,224,939,41372
FORMULA Philosophers-PT-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EX((((((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1)))||((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))) + AX((((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1)))))) * EF(!((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))))
=> equivalent forward existential formula: [(FwdU((Init * EX((((((((((((((i1.u3.Fork_4>=1)&&(i3.u1.Catch1_4>=1))||((i1.u3.Catch1_5>=1)&&(i1.u2.Fork_5>=1)))||((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))||((i4.u9.Fork_7>=1)&&(i4.u9.Catch1_7>=1)))||((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Catch1_2>=1)))||((i3.u1.Fork_3>=1)&&(i3.u6.Catch1_3>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Catch1_9>=1)))||((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))||((i2.u5.Catch1_10>=1)&&(i2.u5.Fork_10>=1)))||((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))) + !(EX(!((((((((((((i0.u0.Fork_2>=1)&&(i3.u6.Catch2_3>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Catch2_2>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Catch2_5>=1)))||((i3.u1.Fork_3>=1)&&(i3.u1.Catch2_4>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))||((i2.u5.Catch2_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u9.Catch2_7>=1)&&(i4.u9.Fork_6>=1)))||((i1.u2.Fork_5>=1)&&(i1.u2.Catch2_6>=1)))||((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))||((i4.u8.Catch2_8>=1)&&(i4.u9.Fork_7>=1))))))))),TRUE) * !((((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))))] != FALSE
(forward)formula 6,1,0.386365,17872,1,0,32279,407,901,34910,236,1025,42873
FORMULA Philosophers-PT-000010-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(!(((((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))||(((((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))&&(((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))||((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))||(((((((((((((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))||((i0.u7.Fork_1>=1)&&(i0.u0.Think_2>=1)))||((i2.u5.Fork_10>=1)&&(i0.u7.Think_1>=1)))||((i4.u9.Fork_6>=1)&&(i4.u9.Think_7>=1)))||((i1.u2.Think_6>=1)&&(i1.u2.Fork_5>=1)))||((i1.u3.Fork_4>=1)&&(i1.u3.Think_5>=1)))||((i3.u1.Think_4>=1)&&(i3.u1.Fork_3>=1)))||((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1)))||((i4.u8.Fork_8>=1)&&(i2.u4.Think_9>=1)))||((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1)))&&(((((((((((i0.u7.Fork_1>=1)&&(i0.u7.Think_1>=1))||((i1.u2.Think_6>=1)&&(i4.u9.Fork_6>=1)))||((i4.u9.Think_7>=1)&&(i4.u9.Fork_7>=1)))||((i4.u8.Fork_8>=1)&&(i4.u8.Think_8>=1)))||((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))||((i0.u0.Fork_2>=1)&&(i0.u0.Think_2>=1)))||((i3.u6.Think_3>=1)&&(i3.u1.Fork_3>=1)))||((i3.u1.Think_4>=1)&&(i1.u3.Fork_4>=1)))||((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))||((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))||((((((((((i0.u7.Eat_1>=1)||(i3.u6.Eat_3>=1))||(i0.u0.Eat_2>=1))||(i2.u5.Eat_10>=1))||(i4.u8.Eat_8>=1))||(i2.u4.Eat_9>=1))||(i1.u2.Eat_6>=1))||(i4.u9.Eat_7>=1))||(i3.u1.Eat_4>=1))||(i1.u3.Eat_5>=1))))))] != FALSE
(forward)formula 7,1,0.402288,18400,1,0,32862,409,925,36080,239,1034,43456
FORMULA Philosophers-PT-000010-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)) + (AX(((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))) * E((i1.u3.Eat_5>=1) U ((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))))) * AG(!(AG(((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1))))))
=> equivalent forward existential formula: (([(EY((Init * !(((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))) * !(((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))))] = FALSE * [((Init * !(((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))) * !(E((i1.u3.Eat_5>=1) U ((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))))] = FALSE) * [(FwdU(Init,TRUE) * !(E(TRUE U !(((i2.u5.Think_10>=1)&&(i2.u4.Fork_9>=1))))))] = FALSE)
(forward)formula 8,1,0.415537,19192,1,0,34025,430,1076,37249,254,1075,46037
FORMULA Philosophers-PT-000010-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (!(EF(EG((i2.u5.Eat_10>=1)))) * !(((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(i2.u5.Eat_10>=1))] = FALSE * [(Init * ((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))] = FALSE)
(forward)formula 9,0,0.417853,19192,1,0,34274,430,1090,37417,254,1075,46533
FORMULA Philosophers-PT-000010-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(!(((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1))) U AX(((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(((i4.u8.Catch1_8>=1)&&(i4.u8.Fork_8>=1)))) * !(EX(!(((i4.u8.Think_8>=1)&&(i4.u9.Fork_7>=1))))))] != FALSE
(forward)formula 10,1,0.420304,19192,1,0,34440,434,1104,37717,256,1095,46845
FORMULA Philosophers-PT-000010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((A(!(((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1))) U ((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))) + AG(((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))) + AG(!(AG(((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))))))
=> equivalent forward existential formula: [(FwdU((Init * !((!((E(!(((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))) U (!(!(((i4.u9.Fork_6>=1)&&(i1.u2.Catch1_6>=1)))) * !(((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))))) + EG(!(((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1)))))) + !(E(TRUE U !(((i1.u2.Fork_5>=1)&&(i1.u3.Think_5>=1)))))))),TRUE) * !(E(TRUE U !(((i2.u5.Fork_10>=1)&&(i0.u7.Catch2_1>=1))))))] = FALSE
(forward)formula 11,1,0.421398,19192,1,0,34469,434,1105,37748,256,1095,46968
FORMULA Philosophers-PT-000010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(AX(((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i3.u6.Think_3>=1)&&(i0.u0.Fork_2>=1))))))] != FALSE
(forward)formula 12,1,0.423497,19192,1,0,34723,434,1105,38004,256,1095,47257
FORMULA Philosophers-PT-000010-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(!(AX(((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1)))) U AG((i1.u3.Eat_5>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(((i2.u5.Fork_10>=1)&&(i2.u5.Think_10>=1))))))) * !(E(TRUE U !((i1.u3.Eat_5>=1)))))] != FALSE
(forward)formula 13,0,0.424184,19192,1,0,34736,434,1108,38008,257,1095,47363
FORMULA Philosophers-PT-000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(((EG(((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1))) * EF(((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))) * (i0.u0.Eat_2>=1)))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * (i0.u0.Eat_2>=1)) * EG(((i2.u4.Fork_9>=1)&&(i2.u4.Think_9>=1)))),TRUE) * ((i2.u4.Catch2_9>=1)&&(i4.u8.Fork_8>=1)))] != FALSE
(forward)formula 14,0,0.426502,19456,1,0,34944,435,1120,38201,257,1099,47725
FORMULA Philosophers-PT-000010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: ((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1))
=> equivalent forward existential formula: [(Init * ((i0.u7.Catch1_1>=1)&&(i0.u7.Fork_1>=1)))] != FALSE
(forward)formula 15,0,0.4268,19456,1,0,34947,435,1120,38201,257,1099,47732
FORMULA Philosophers-PT-000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1527274939132
--------------------
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:02:17 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:02:17 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2018 7:02:17 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 61 ms
May 25, 2018 7:02:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 25, 2018 7:02:17 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
May 25, 2018 7:02:17 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 20 ms
May 25, 2018 7:02:18 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 25, 2018 7:02:18 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
May 25, 2018 7:02:18 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 14 ms
Begin: Fri May 25 19:02:18 2018
Computation of communities with the Newman-Girvan Modularity quality function
level 0:
start computation: Fri May 25 19:02:18 2018
network size: 50 nodes, 180 links, 100 weight
quality increased from -0.0223889 to 0.631911
end computation: Fri May 25 19:02:18 2018
level 1:
start computation: Fri May 25 19:02:18 2018
network size: 10 nodes, 30 links, 100 weight
quality increased from 0.631911 to 0.665244
end computation: Fri May 25 19:02:18 2018
level 2:
start computation: Fri May 25 19:02:18 2018
network size: 5 nodes, 15 links, 100 weight
quality increased from 0.665244 to 0.665244
end computation: Fri May 25 19:02:18 2018
End: Fri May 25 19:02:18 2018
Total duration: 0 sec
0.665244
May 25, 2018 7:02:18 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 25, 2018 7:02:18 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 26 ms
May 25, 2018 7:02:18 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 25, 2018 7:02:18 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 10 redundant transitions.
May 25, 2018 7:02:18 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 12 ms
May 25, 2018 7:02:18 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 12 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-000010"
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-000010.tgz
mv Philosophers-PT-000010 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-000010, 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-152666477400767"
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 ;