About the Execution of Marcie+red for GlobalResAllocation-COL-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.563 | 13830.00 | 22042.00 | 451.30 | FFTTFTFFTTFTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348300162.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is GlobalResAllocation-COL-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348300162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.1K Feb 25 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 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 GlobalResAllocation-COL-03-CTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-03-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678638545771
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:29:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:29:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:29:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 16:29:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 16:29:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1005 ms
[2023-03-12 16:29:10] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 33 PT places and 4791.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
[2023-03-12 16:29:10] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 8 ms.
[2023-03-12 16:29:10] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=0 )
[2023-03-12 16:29:10] [INFO ] Flatten gal took : 27 ms
[2023-03-12 16:29:10] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 6
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-12 16:29:10] [INFO ] Unfolded HLPN to a Petri net with 13 places and 21 transitions 87 arcs in 20 ms.
[2023-03-12 16:29:10] [INFO ] Unfolded 16 HLPN properties in 9 ms.
Support contains 13 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 21/21 transitions.
Reduce isomorphic (modulo) transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 13 transition count 18
Applied a total of 6 rules in 13 ms. Remains 13 /13 variables (removed 0) and now considering 18/21 (removed 3) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-12 16:29:10] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-12 16:29:11] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
[2023-03-12 16:29:11] [INFO ] Invariant cache hit.
[2023-03-12 16:29:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 16:29:11] [INFO ] Invariant cache hit.
[2023-03-12 16:29:11] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-12 16:29:11] [INFO ] Invariant cache hit.
[2023-03-12 16:29:11] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/13 places, 18/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 13/13 places, 18/21 transitions.
Support contains 13 out of 13 places after structural reductions.
[2023-03-12 16:29:11] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:29:11] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:29:11] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 30) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:29:11] [INFO ] Invariant cache hit.
[2023-03-12 16:29:11] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:29:11] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:29:11] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Applied a total of 0 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-12 16:29:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 10/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-12 16:29:12] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 18
Applied a total of 3 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-12 16:29:12] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 10/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-12 16:29:12] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-12 16:29:12] [INFO ] Invariant cache hit.
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 13/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 18/18 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 18
Applied a total of 3 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 10 cols
[2023-03-12 16:29:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 16:29:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 10/13 places, 18/18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:29:12] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:29:12] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:29:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-12 16:29:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 13 places, 18 transitions and 75 arcs took 0 ms.
Total runtime 3893 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 13 NrTr: 18 NrArc: 75)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.775sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 113 (1.1e+02) #states 154
starting MCC model checker
--------------------------
checking: EG [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]
normalized: EG [[[1<=p1 & 3<=p3] | [[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]]]]
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
.
EG iterations: 1
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [[[p4<=1 | p7<=1] & [[p5<=1 | p8<=1] & [p6<=1 | p9<=1]]]]
normalized: EG [[[[p6<=1 | p9<=1] & [p5<=1 | p8<=1]] & [p4<=1 | p7<=1]]]
abstracting: (p7<=1)
states: 96
abstracting: (p4<=1)
states: 96
abstracting: (p8<=1)
states: 96
abstracting: (p5<=1)
states: 96
abstracting: (p9<=1)
states: 96
abstracting: (p6<=1)
states: 96
.
EG iterations: 1
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AX [AF [[[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]]
normalized: ~ [EX [EG [~ [[[2<=p4 & 2<=p7] | [[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]]]]]]]
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
.
EG iterations: 1
.-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [EG [[[p1<=0 | p3<=3] & [[p2<=0 | p3<=3] & [p0<=0 | p3<=3]]]]]
normalized: EX [EG [[[[p0<=0 | p3<=3] & [p2<=0 | p3<=3]] & [p1<=0 | p3<=3]]]]
abstracting: (p3<=3)
states: 116
abstracting: (p1<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p2<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p0<=0)
states: 121
.....
EG iterations: 5
.-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [EG [[AX [E [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] U [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]]] | EX [AF [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]]]]]]
normalized: E [true U EG [[EX [~ [EG [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]]]]] | ~ [EX [~ [E [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] U [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]]
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
.....
EG iterations: 5
.
EG iterations: 0
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [[EX [EF [AG [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]]] & A [A [[[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]] U [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] U [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]] & ~ [E [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]] U [~ [[~ [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]] & ~ [E [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]] U [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]] & ~ [[[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]]]]]] & ~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]] & EX [E [true U ~ [E [true U ~ [[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]]]]]]]]]]
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
.abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
EG iterations: 0
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AF [AG [[AG [[[p1<=0 | p3<=1] & [[p2<=0 | p3<=1] & [p0<=0 | p3<=1]]]] | [[p10<=3 & p11<=3] & [p12<=3 & [[[p2<=0 | p3<=0] & [[p0<=0 | p3<=0] & [p1<=0 | p3<=0]]] | [[[p1<=0 | p3<=3] & [[p2<=0 | p3<=3] & [p0<=0 | p3<=3]]] | [[p4<=0 | p7<=0] & [[p5<=0 | p8<=0] & [p6<=0 | p9<=0]]]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[[p10<=3 & p11<=3] & [[[[[[p6<=0 | p9<=0] & [p5<=0 | p8<=0]] & [p4<=0 | p7<=0]] | [[[p0<=0 | p3<=3] & [p2<=0 | p3<=3]] & [p1<=0 | p3<=3]]] | [[[p1<=0 | p3<=0] & [p0<=0 | p3<=0]] & [p2<=0 | p3<=0]]] & p12<=3]] | ~ [E [true U ~ [[[[p0<=0 | p3<=1] & [p2<=0 | p3<=1]] & [p1<=0 | p3<=1]]]]]]]]]]
abstracting: (p3<=1)
states: 58
abstracting: (p1<=0)
states: 121
abstracting: (p3<=1)
states: 58
abstracting: (p2<=0)
states: 121
abstracting: (p3<=1)
states: 58
abstracting: (p0<=0)
states: 121
abstracting: (p12<=3)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p2<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p0<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p1<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p1<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p2<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p0<=0)
states: 121
abstracting: (p7<=0)
states: 66
abstracting: (p4<=0)
states: 66
abstracting: (p8<=0)
states: 66
abstracting: (p5<=0)
states: 66
abstracting: (p9<=0)
states: 66
abstracting: (p6<=0)
states: 66
abstracting: (p11<=3)
states: 121
abstracting: (p10<=3)
states: 121
EG iterations: 0
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EG [[~ [A [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] U [4<=p10 | [4<=p11 | 4<=p12]]]] | [[[p2<=0 | p3<=0] & [[p0<=0 | p3<=0] & [p1<=0 | p3<=0]]] | [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] & [[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]]]]
normalized: EG [[[[[[p1<=0 | p3<=0] & [p0<=0 | p3<=0]] & [p2<=0 | p3<=0]] | [[[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]] & [[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]] | ~ [[~ [EG [~ [[[4<=p11 | 4<=p12] | 4<=p10]]]] & ~ [E [~ [[[4<=p11 | 4<=p12] | 4<=p10]] U [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]] & ~ [[[4<=p11 | 4<=p12] | 4<=p10]]]]]]]]]
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
..............
EG iterations: 14
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (p3<=0)
states: 28
abstracting: (p2<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p0<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p1<=0)
states: 121
.....
EG iterations: 5
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [AF [E [EF [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]] U [~ [[AX [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]] | E [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]] U [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]]]] & [[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]]] & EF [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]]]
normalized: [E [true U [[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] & ~ [EG [~ [E [E [true U [[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]] U [[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] & ~ [[E [[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] U [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]] | ~ [EX [~ [[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]]]]]]]]]]]]
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
.abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
EG iterations: 0
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [E [[[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]] | [[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]] U [4<=p10 | [4<=p11 | 4<=p12]]] & AF [[EX [[[4<=p10 | [4<=p11 | 4<=p12]] & [[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]] & AX [[[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]] & [[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]]]]]
normalized: [~ [EG [~ [[~ [EX [~ [[[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] & [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]] & EX [[[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] & [[4<=p11 | 4<=p12] | 4<=p10]]]]]]] & E [[[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]] | [[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] U [[4<=p11 | 4<=p12] | 4<=p10]]]
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
.abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
..
EG iterations: 1
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [AG [[[EG [[[p2<=0 | p3<=0] & [[p0<=0 | p3<=0] & [p1<=0 | p3<=0]]]] | [EX [E [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] U [[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]] | [[A [[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]] U [[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]] & [p4<=0 | p7<=0]] & [[p5<=0 | p8<=0] & [p6<=0 | p9<=0]]]]] | [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]]]
normalized: EG [~ [E [true U ~ [[[[EX [E [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]] | [[[p6<=0 | p9<=0] & [p5<=0 | p8<=0]] & [[p4<=0 | p7<=0] & [~ [EG [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]]]] & ~ [E [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] U [~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]] & ~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]]]]]]]]] | EG [[[[p1<=0 | p3<=0] & [p0<=0 | p3<=0]] & [p2<=0 | p3<=0]]]] | [[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (p3<=0)
states: 28
abstracting: (p2<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p0<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p1<=0)
states: 121
........
EG iterations: 8
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
.....
EG iterations: 5
abstracting: (p7<=0)
states: 66
abstracting: (p4<=0)
states: 66
abstracting: (p8<=0)
states: 66
abstracting: (p5<=0)
states: 66
abstracting: (p9<=0)
states: 66
abstracting: (p6<=0)
states: 66
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
..
EG iterations: 1
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: A [AG [[EF [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] & ~ [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]]] U ~ [AF [[[EG [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] & [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]] | [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]]] & [AG [[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]]] & EF [[[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]]]]]]
normalized: [~ [EG [~ [EG [~ [[[[[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]] | [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & EG [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] & [E [true U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] & ~ [E [true U ~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]]]]]]]]] & ~ [E [~ [EG [~ [[[[[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]] | [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & EG [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] & [E [true U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] & ~ [E [true U ~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]]]]]]] U [~ [EG [~ [[[[[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]] | [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & EG [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] & [E [true U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] & ~ [E [true U ~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]]]]]]] & E [true U ~ [[~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]] & E [true U [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]]]
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
.
EG iterations: 1
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
EG iterations: 0
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
.
EG iterations: 1
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
EG iterations: 0
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
.
EG iterations: 1
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[EG [[[~ [E [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] U [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]] | 4<=p10] | [4<=p11 | 4<=p12]]] | EX [[[[p2<=0 | p3<=0] & [[p0<=0 | p3<=0] & [p1<=0 | p3<=0]]] | [[p1<=0 | p3<=1] & [[p2<=0 | p3<=1] & [p0<=0 | p3<=1]]]]]] | [EG [AX [[[p1<=0 | p3<=3] & [[p2<=0 | p3<=3] & [p0<=0 | p3<=3]]]]] | [[~ [A [[4<=p10 | [4<=p11 | 4<=p12]] U [4<=p10 | [4<=p11 | 4<=p12]]]] & A [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]] U [[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]]]] & [p10<=3 & [p11<=3 & p12<=3]]]]]]
normalized: ~ [E [true U ~ [[[EG [[[~ [E [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] U [[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]] | 4<=p10] | [4<=p11 | 4<=p12]]] | EX [[[[[p0<=0 | p3<=1] & [p2<=0 | p3<=1]] & [p1<=0 | p3<=1]] | [[[p1<=0 | p3<=0] & [p0<=0 | p3<=0]] & [p2<=0 | p3<=0]]]]] | [[[~ [[~ [EG [~ [[[4<=p11 | 4<=p12] | 4<=p10]]]] & ~ [E [~ [[[4<=p11 | 4<=p12] | 4<=p10]] U [~ [[[4<=p11 | 4<=p12] | 4<=p10]] & ~ [[[4<=p11 | 4<=p12] | 4<=p10]]]]]]] & [~ [EG [~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]] & ~ [E [~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]] U [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] & ~ [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]]]]] & [[p11<=3 & p12<=3] & p10<=3]] | EG [~ [EX [~ [[[[p0<=0 | p3<=3] & [p2<=0 | p3<=3]] & [p1<=0 | p3<=3]]]]]]]]]]]
abstracting: (p3<=3)
states: 116
abstracting: (p1<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p2<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p0<=0)
states: 121
....
EG iterations: 3
abstracting: (p10<=3)
states: 121
abstracting: (p12<=3)
states: 121
abstracting: (p11<=3)
states: 121
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
........
EG iterations: 8
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
..............
EG iterations: 14
abstracting: (p3<=0)
states: 28
abstracting: (p2<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p0<=0)
states: 121
abstracting: (p3<=0)
states: 28
abstracting: (p1<=0)
states: 121
abstracting: (p3<=1)
states: 58
abstracting: (p1<=0)
states: 121
abstracting: (p3<=1)
states: 58
abstracting: (p2<=0)
states: 121
abstracting: (p3<=1)
states: 58
abstracting: (p0<=0)
states: 121
.abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
..
EG iterations: 2
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-03-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[AF [[[~ [A [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]] U [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]] | [[[p4<=1 | p7<=1] & [[p5<=1 | p8<=1] & [p6<=1 | p9<=1]]] | [[p1<=0 | p3<=3] & [[p2<=0 | p3<=3] & [p0<=0 | p3<=3]]]]] & [[[[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] & [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]] & [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]] | [1<=p1 & 3<=p3]] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]] & [AF [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] | AX [AG [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [E [true U ~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]] | ~ [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]] & ~ [EG [~ [[[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [[1<=p1 & 3<=p3] | [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & [[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]] & [[[[[p0<=0 | p3<=3] & [p2<=0 | p3<=3]] & [p1<=0 | p3<=3]] | [[[p6<=1 | p9<=1] & [p5<=1 | p8<=1]] & [p4<=1 | p7<=1]]] | ~ [[~ [EG [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]] & ~ [E [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]] U [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] & ~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]]]]]]]]]]]]]
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.....
EG iterations: 5
abstracting: (p7<=1)
states: 96
abstracting: (p4<=1)
states: 96
abstracting: (p8<=1)
states: 96
abstracting: (p5<=1)
states: 96
abstracting: (p9<=1)
states: 96
abstracting: (p6<=1)
states: 96
abstracting: (p3<=3)
states: 116
abstracting: (p1<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p2<=0)
states: 121
abstracting: (p3<=3)
states: 116
abstracting: (p0<=0)
states: 121
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
.....
EG iterations: 5
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: A [AF [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] U ~ [[EG [~ [[[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]] & [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]]] | [[[[AF [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] & ~ [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]]] | ~ [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]]] & EF [[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]]]] | ~ [[[E [[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]] U [[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]] & [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]] | [[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]] & [EF [[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]]] & [EG [[[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]] | E [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]] U [[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]]]]]]]]]
normalized: [~ [EG [[[~ [[[[E [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] | EG [[[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]] & E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]] & [[[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] | [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & E [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]]]] | [E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]] & [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] | [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] & ~ [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]] | EG [~ [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]] & ~ [E [[[~ [[[[E [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] | EG [[[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]] & E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]] & [[[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] | [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & E [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]]]] | [E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]] & [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] | [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] & ~ [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]] | EG [~ [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]] U [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] & [[~ [[[[E [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] | EG [[[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]] & E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]] & [[[[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]] | [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]] & E [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]]]] | [E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]] & [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] | [~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] & ~ [EG [~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]] | EG [~ [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]]]
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
...
EG iterations: 3
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
.
EG iterations: 1
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
...
EG iterations: 3
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
.
EG iterations: 1
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
...
EG iterations: 3
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
........
EG iterations: 8
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
.
EG iterations: 1
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.
EG iterations: 1
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: [E [[[[[[[[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]] & [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] | EF [[4<=p10 | [4<=p11 | 4<=p12]]]] & EG [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]]] | [2<=p4 & 2<=p7]] | [[2<=p5 & 2<=p8] | [[2<=p6 & 2<=p9] | ~ [[[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]] | [[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]]]]]] & [[[EF [[[1<=p1 & 3<=p3] | [[1<=p2 & 3<=p3] | [1<=p0 & 3<=p3]]]] | [1<=p2 & 1<=p3]] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]] & EG [~ [EF [[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]]]]]]] U [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]] & [[[~ [[[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]] & [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]] & AG [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]] | [AF [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]] | [2<=p4 & 2<=p7]]] | [[2<=p5 & 2<=p8] | [[2<=p6 & 2<=p9] | ~ [[[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]]]]]]] & A [[~ [AG [[[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]] & [[1<=p1 & 4<=p3] | [[1<=p2 & 4<=p3] | [1<=p0 & 4<=p3]]]] U [[[~ [EF [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]]] & [[AX [[[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]] | [1<=p2 & 1<=p3]] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]]] | E [[~ [[[1<=p1 & 2<=p3] | [[1<=p2 & 2<=p3] | [1<=p0 & 2<=p3]]]] & ~ [[4<=p10 | [4<=p11 | 4<=p12]]]] U [[2<=p4 & 2<=p7] | [[2<=p5 & 2<=p8] | [2<=p6 & 2<=p9]]]]] & EG [[[[1<=p2 & 1<=p3] | [[1<=p0 & 1<=p3] | [1<=p1 & 1<=p3]]] & [[1<=p4 & 1<=p7] | [[1<=p5 & 1<=p8] | [1<=p6 & 1<=p9]]]]]]]]
normalized: [E [[[[[EG [[[1<=p1 & 3<=p3] | [[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]]]] & [E [true U [[4<=p11 | 4<=p12] | 4<=p10]] | [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]] & [[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]]]] | [2<=p4 & 2<=p7]] | [[~ [[[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]] | [[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]]] | [2<=p6 & 2<=p9]] | [2<=p5 & 2<=p8]]] & [EG [~ [E [true U [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]] & [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [[1<=p2 & 1<=p3] | E [true U [[[1<=p0 & 3<=p3] | [1<=p2 & 3<=p3]] | [1<=p1 & 3<=p3]]]]]]] U [[[[~ [E [true U ~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]] & ~ [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]]] | [[2<=p4 & 2<=p7] | ~ [EG [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]]] | [[~ [[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]]] | [2<=p6 & 2<=p9]] | [2<=p5 & 2<=p8]]] & [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] & [~ [EG [~ [[EG [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]] & [E [[~ [[[4<=p11 | 4<=p12] | 4<=p10]] & ~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] | [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [[1<=p2 & 1<=p3] | ~ [EX [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]]] & ~ [E [true U [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]]] & ~ [E [~ [[EG [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]] & [E [[~ [[[4<=p11 | 4<=p12] | 4<=p10]] & ~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] | [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [[1<=p2 & 1<=p3] | ~ [EX [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]]] & ~ [E [true U [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]] U [~ [[[[[1<=p0 & 4<=p3] | [1<=p2 & 4<=p3]] | [1<=p1 & 4<=p3]] & E [true U ~ [[[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]]]]] & ~ [[EG [[[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]] & [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [1<=p2 & 1<=p3]]]] & [E [[~ [[[4<=p11 | 4<=p12] | 4<=p10]] & ~ [[[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]] U [[[2<=p6 & 2<=p9] | [2<=p5 & 2<=p8]] | [2<=p4 & 2<=p7]]] | [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p3]] | [[1<=p2 & 1<=p3] | ~ [EX [~ [[[[1<=p6 & 1<=p9] | [1<=p5 & 1<=p8]] | [1<=p4 & 1<=p7]]]]]]] & ~ [E [true U [[[1<=p0 & 2<=p3] | [1<=p2 & 2<=p3]] | [1<=p1 & 2<=p3]]]]]]]]]]]]]
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.
EG iterations: 1
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.
EG iterations: 1
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.
EG iterations: 1
..
EG iterations: 2
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
.....
EG iterations: 5
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (1<=p7)
states: 88
abstracting: (1<=p4)
states: 88
abstracting: (1<=p8)
states: 88
abstracting: (1<=p5)
states: 88
abstracting: (1<=p9)
states: 88
abstracting: (1<=p6)
states: 88
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p2)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p0)
states: 33
abstracting: (1<=p3)
states: 126
abstracting: (1<=p1)
states: 33
.
EG iterations: 1
abstracting: (2<=p8)
states: 58
abstracting: (2<=p5)
states: 58
abstracting: (2<=p9)
states: 58
abstracting: (2<=p6)
states: 58
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (2<=p7)
states: 58
abstracting: (2<=p4)
states: 58
abstracting: (4<=p3)
states: 38
abstracting: (1<=p1)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p2)
states: 33
abstracting: (4<=p3)
states: 38
abstracting: (1<=p0)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p1)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p2)
states: 33
abstracting: (2<=p3)
states: 96
abstracting: (1<=p0)
states: 33
abstracting: (4<=p10)
states: 33
abstracting: (4<=p12)
states: 33
abstracting: (4<=p11)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p2)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p0)
states: 33
abstracting: (3<=p3)
states: 63
abstracting: (1<=p1)
states: 33
.
EG iterations: 1
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-03-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
totally nodes used: 9826 (9.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 26384 44899 71283
used/not used/entry size/cache size: 52719 67056145 16 1024MB
basic ops cache: hits/miss/sum: 9792 14221 24013
used/not used/entry size/cache size: 25502 16751714 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1610 1245 2855
used/not used/entry size/cache size: 1245 8387363 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67100399
1 7931
2 229
3 126
4 84
5 41
6 21
7 10
8 5
9 3
>= 10 15
Total processing time: 0m 5.537sec
BK_STOP 1678638559601
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:160 (8), effective:18 (1)
initing FirstDep: 0m 0.000sec
iterations count:69 (3), effective:8 (0)
iterations count:18 (1), effective:0 (0)
iterations count:54 (3), effective:11 (0)
iterations count:169 (9), effective:19 (1)
iterations count:18 (1), effective:0 (0)
iterations count:63 (3), effective:7 (0)
iterations count:56 (3), effective:7 (0)
iterations count:18 (1), effective:0 (0)
iterations count:18 (1), effective:0 (0)
iterations count:21 (1), effective:2 (0)
iterations count:115 (6), effective:11 (0)
iterations count:58 (3), effective:5 (0)
iterations count:104 (5), effective:14 (0)
iterations count:40 (2), effective:5 (0)
iterations count:174 (9), effective:16 (0)
iterations count:63 (3), effective:7 (0)
iterations count:21 (1), effective:2 (0)
iterations count:93 (5), effective:16 (0)
iterations count:28 (1), effective:3 (0)
iterations count:93 (5), effective:16 (0)
iterations count:28 (1), effective:3 (0)
iterations count:93 (5), effective:16 (0)
iterations count:28 (1), effective:3 (0)
iterations count:18 (1), effective:0 (0)
iterations count:18 (1), effective:0 (0)
iterations count:18 (1), effective:0 (0)
iterations count:18 (1), effective:0 (0)
iterations count:146 (8), effective:12 (0)
iterations count:42 (2), effective:8 (0)
iterations count:53 (2), effective:6 (0)
iterations count:28 (1), effective:3 (0)
iterations count:53 (2), effective:6 (0)
iterations count:40 (2), effective:5 (0)
iterations count:53 (2), effective:6 (0)
iterations count:28 (1), effective:3 (0)
iterations count:53 (2), effective:6 (0)
iterations count:40 (2), effective:5 (0)
iterations count:156 (8), effective:20 (1)
iterations count:53 (2), effective:6 (0)
iterations count:28 (1), effective:3 (0)
iterations count:53 (2), effective:6 (0)
iterations count:40 (2), effective:5 (0)
iterations count:63 (3), effective:7 (0)
iterations count:18 (1), effective:0 (0)
iterations count:114 (6), effective:9 (0)
iterations count:63 (3), effective:7 (0)
iterations count:18 (1), effective:0 (0)
iterations count:49 (2), effective:6 (0)
iterations count:63 (3), effective:7 (0)
iterations count:18 (1), effective:0 (0)
iterations count:146 (8), effective:12 (0)
iterations count:89 (4), effective:9 (0)
iterations count:53 (2), effective:6 (0)
iterations count:54 (3), effective:6 (0)
iterations count:18 (1), effective:0 (0)
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="GlobalResAllocation-COL-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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-5348"
echo " Executing tool marciexred"
echo " Input is GlobalResAllocation-COL-03, 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 r202-smll-167840348300162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-03.tgz
mv GlobalResAllocation-COL-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; 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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;