About the Execution of ITS-Tools.M for SharedMemory-COL-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
355.380 | 5686.00 | 14401.00 | 137.80 | TTTFFTTFFTTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r201-csrt-155286433700113.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is SharedMemory-COL-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-csrt-155286433700113
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.8K Feb 12 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 8 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 4 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 12K Mar 10 17:31 model.pnml
--------------------
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 SharedMemory-COL-000005-CTLFireability-00
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-01
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-02
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-03
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-04
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-05
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-06
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-07
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-08
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-09
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-10
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-11
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-12
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-13
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-14
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1553790419742
16:27:02.933 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
16:27:02.935 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord
Successfully loaded order from file /home/mcc/execution/model.ord
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,1863,0.141075,5300,2,652,5,2704,6,0,242,1819,0
Converting to forward existential form...Done !
original formula: AX(((EX(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))) + !((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1)))) + (((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))))
=> equivalent forward existential formula: [(((EY(Init) * !((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)))) * !(!((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1))))) * !(EX(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.290407,8324,1,0,12,19321,13,3,1241,8070,7
FORMULA SharedMemory-COL-000005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))) + ((EF((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))) + AF((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)))) * A((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)) U ((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1))))))
=> equivalent forward existential formula: ([FwdG(((Init * !(E(TRUE U ((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))) * !(E(TRUE U (((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))))),!((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))))] = FALSE * ([(FwdU((Init * !(E(TRUE U ((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))),!(((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1))))) * (!((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))) * !(((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1))))))] = FALSE * [FwdG((Init * !(E(TRUE U ((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))),!(((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))))] = FALSE))
(forward)formula 1,1,0.402138,10172,1,0,15,26020,39,5,1324,14415,16
FORMULA SharedMemory-COL-000005-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (((EF((((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))&&(((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1)))) + !(AF(((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))))) + AG((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1)))) + EG(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))
=> equivalent forward existential formula: [(FwdU(((Init * !(EG(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))) * !((E(TRUE U (((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))&&(((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1)))) + !(!(EG(!(((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))))))))),TRUE) * !((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1))))] = FALSE
(forward)formula 2,1,0.511744,13340,1,0,19,48947,47,7,1382,24922,20
FORMULA SharedMemory-COL-000005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: FALSE
=> equivalent forward existential formula: [(Init * FALSE)] != FALSE
(forward)formula 3,0,0.511812,13340,1,0,19,48947,47,7,1382,24922,20
FORMULA SharedMemory-COL-000005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(!(EF(((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))||((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))||((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))))))] != FALSE
(forward)formula 4,0,0.516893,13604,1,0,20,48990,48,7,1390,25001,23
FORMULA SharedMemory-COL-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(EX(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * ((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1))))] != FALSE
(forward)formula 5,1,0.531383,13604,1,0,23,49353,48,8,1390,25426,24
FORMULA SharedMemory-COL-000005-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)))
=> equivalent forward existential formula: [FwdG(Init,(((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 20/0/40
(forward)formula 6,1,0.56417,14660,1,0,23,51512,54,9,1419,28455,27
FORMULA SharedMemory-COL-000005-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: FALSE
=> equivalent forward existential formula: [(Init * FALSE)] != FALSE
(forward)formula 7,0,0.56423,14660,1,0,23,51512,54,9,1419,28455,27
FORMULA SharedMemory-COL-000005-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG(!(((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))||((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1))||((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))))))))] != FALSE
(forward)formula 8,0,0.582029,15156,1,0,24,51534,55,9,1423,28592,30
FORMULA SharedMemory-COL-000005-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG((((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)))
=> equivalent forward existential formula: [FwdG(Init,(((((active_0>=1)||(active_1>=1))||(active_2>=1))||(active_3>=1))||(active_4>=1)))] != FALSE
(forward)formula 9,1,0.582846,15156,1,0,24,51534,55,9,1423,28592,30
FORMULA SharedMemory-COL-000005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: TRUE
=> equivalent forward existential formula: [(Init * TRUE)] != FALSE
(forward)formula 10,1,0.582886,15156,1,0,24,51534,55,9,1423,28592,30
FORMULA SharedMemory-COL-000005-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: TRUE
=> equivalent forward existential formula: [(Init * TRUE)] != FALSE
(forward)formula 11,1,0.582909,15156,1,0,24,51534,55,9,1423,28592,30
FORMULA SharedMemory-COL-000005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF(EX(!((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1))))) * E(!(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1)))) U ((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1))||(!((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1)))))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U EX(!((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1)))))),!(((((((((((((((((((((((extBus_0>=1)&&(memory_0>=1))&&(queue_1>=1))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_0>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_1>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_3>=1)))||(((extBus_0>=1)&&(memory_2>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_3>=1))&&(queue_4>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_0>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_1>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_2>=1)))||(((extBus_0>=1)&&(memory_4>=1))&&(queue_3>=1))))) * ((((((((((((((((((((((((((extMemAcc_0>=1)||(extMemAcc_5>=1))||(extMemAcc_10>=1))||(extMemAcc_15>=1))||(extMemAcc_20>=1))||(extMemAcc_1>=1))||(extMemAcc_6>=1))||(extMemAcc_11>=1))||(extMemAcc_16>=1))||(extMemAcc_21>=1))||(extMemAcc_2>=1))||(extMemAcc_7>=1))||(extMemAcc_12>=1))||(extMemAcc_17>=1))||(extMemAcc_22>=1))||(extMemAcc_3>=1))||(extMemAcc_8>=1))||(extMemAcc_13>=1))||(extMemAcc_18>=1))||(extMemAcc_23>=1))||(extMemAcc_4>=1))||(extMemAcc_9>=1))||(extMemAcc_14>=1))||(extMemAcc_19>=1))||(extMemAcc_24>=1))||(!((((((ownMemAcc_0>=1)&&(memory_0>=1))||((ownMemAcc_1>=1)&&(memory_1>=1)))||((ownMemAcc_2>=1)&&(memory_2>=1)))||((ownMemAcc_3>=1)&&(memory_3>=1)))||((ownMemAcc_4>=1)&&(memory_4>=1))))))] != FALSE
Hit Full ! (commute/partial/dont) 5/31/55
(forward)formula 12,1,0.625125,15420,1,0,29,53113,63,11,1589,30716,38
FORMULA SharedMemory-COL-000005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: TRUE
=> equivalent forward existential formula: [(Init * TRUE)] != FALSE
(forward)formula 13,1,0.625222,15420,1,0,29,53113,63,11,1589,30716,38
FORMULA SharedMemory-COL-000005-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: FALSE
=> equivalent forward existential formula: [(Init * FALSE)] != FALSE
(forward)formula 14,0,0.625248,15420,1,0,29,53113,63,11,1589,30716,38
FORMULA SharedMemory-COL-000005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: TRUE
=> equivalent forward existential formula: [(Init * TRUE)] != FALSE
(forward)formula 15,1,0.625269,15420,1,0,29,53113,63,11,1589,30716,38
FORMULA SharedMemory-COL-000005-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1553790425428
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 28, 2019 4:27:02 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 28, 2019 4:27:02 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 28, 2019 4:27:02 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 927 ms
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :P->ownMemAcc,queue,memory,active,
Dot->extBus,
PxP->extMemAcc,
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 28, 2019 4:27:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $m and $x of transition endOwnAcc
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 5.0 instantiations of transitions. Total transitions/syncs built is 72
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.instantiate.CTLSimplifier simplifyTemporal
INFO: Initial state reduction rules for CTL removed 7 formulas.
Mar 28, 2019 4:27:03 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 56 ms
Mar 28, 2019 4:27:04 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 17 transitions. Expanding to a total of 72 deterministic transitions.
Mar 28, 2019 4:27:04 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 3 ms.
Mar 28, 2019 4:27:04 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 46 places.
Mar 28, 2019 4:27:04 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 60 transitions.
Mar 28, 2019 4:27:04 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
Mar 28, 2019 4:27:04 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 46 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="SharedMemory-COL-000005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstoolsm"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
echo " Input is SharedMemory-COL-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 r201-csrt-155286433700113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000005.tgz
mv SharedMemory-COL-000005 execution
cd execution
if [ "CTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 ;