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.r490-tall-167912709601122.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 UtilityControlRoom-PT-Z2T4N02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709601122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.4K Feb 26 14:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 14:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 14:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 26 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K Mar 5 18:23 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 UtilityControlRoom-PT-Z2T4N02-CTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679378930794

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=UtilityControlRoom-PT-Z2T4N02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 06:08:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 06:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:08:52] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-21 06:08:52] [INFO ] Transformed 38 places.
[2023-03-21 06:08:52] [INFO ] Transformed 54 transitions.
[2023-03-21 06:08:52] [INFO ] Parsed PT model containing 38 places and 54 transitions and 170 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-21 06:08:52] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-21 06:08:52] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-21 06:08:52] [INFO ] Reduced 2 identical enabling conditions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 9 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 38 cols
[2023-03-21 06:08:52] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-21 06:08:52] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-21 06:08:52] [INFO ] Invariant cache hit.
[2023-03-21 06:08:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-21 06:08:52] [INFO ] Invariant cache hit.
[2023-03-21 06:08:52] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 38/38 places, 46/46 transitions.
Support contains 38 out of 38 places after structural reductions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 20 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 9 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 46 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 41) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 06:08:53] [INFO ] Invariant cache hit.
[2023-03-21 06:08:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-21 06:08:53] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 46 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 34 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 34 transition count 42
Applied a total of 8 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 34/38 places, 42/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 38 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 34 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 32 transition count 40
Applied a total of 12 rules in 9 ms. Remains 32 /38 variables (removed 6) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 32/38 places, 40/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 34 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 34 transition count 42
Applied a total of 8 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 34/38 places, 42/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 46/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 4 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 4 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 46/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 4 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 38 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 30 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 30 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 26 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 24 transition count 28
Applied a total of 32 rules in 5 ms. Remains 24 /38 variables (removed 14) and now considering 28/46 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 24/38 places, 28/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 28 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 33 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 29 transition count 38
Applied a total of 17 rules in 4 ms. Remains 29 /38 variables (removed 9) and now considering 38/46 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 29/38 places, 38/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 38 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 43
Applied a total of 6 rules in 1 ms. Remains 35 /38 variables (removed 3) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 35/38 places, 43/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 43
Applied a total of 6 rules in 1 ms. Remains 35 /38 variables (removed 3) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 35/38 places, 43/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 34 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 34 transition count 42
Applied a total of 8 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/38 places, 42/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 38 transition count 39
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 31 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 31 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 28 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 28 transition count 32
Applied a total of 25 rules in 4 ms. Remains 28 /38 variables (removed 10) and now considering 32/46 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 28/38 places, 32/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 43
Applied a total of 6 rules in 1 ms. Remains 35 /38 variables (removed 3) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 35/38 places, 43/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 34 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 34 transition count 42
Applied a total of 8 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/38 places, 42/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 3 ms
[2023-03-21 06:08:53] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 34 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 34 transition count 42
Applied a total of 8 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 34/38 places, 42/46 transitions.
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:53] [INFO ] Flatten gal took : 2 ms
[2023-03-21 06:08:54] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-21 06:08:54] [INFO ] Flatten gal took : 5 ms
[2023-03-21 06:08:54] [INFO ] Flatten gal took : 5 ms
[2023-03-21 06:08:54] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 06:08:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 46 transitions and 138 arcs took 1 ms.
Total runtime 1805 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: 38 NrTr: 46 NrArc: 138)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.720sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 332 (3.3e+02) #states 1,092 (3)



starting MCC model checker
--------------------------

checking: AF [EX [[p20<=0 | [p32<=0 | [1<=p27 & 1<=p34]]]]]
normalized: ~ [EG [~ [EX [[[[1<=p27 & 1<=p34] | p32<=0] | p20<=0]]]]]

abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (p32<=0)
states: 640
abstracting: (1<=p34)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
..
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [AG [A [AX [[1<=p0 & [1<=p5 & 1<=p26]]] U AG [~ [[p0<=0 | [p6<=0 | p26<=0]]]]]]]
normalized: EG [~ [E [true U ~ [[~ [EG [E [true U [[p6<=0 | p26<=0] | p0<=0]]]] & ~ [E [E [true U [[p6<=0 | p26<=0] | p0<=0]] U [EX [~ [[[1<=p5 & 1<=p26] & 1<=p0]]] & E [true U [[p6<=0 | p26<=0] | p0<=0]]]]]]]]]]

abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
.abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[AX [1<=p18] & EX [[[[AF [1<=p11] | [p27<=0 | p36<=0]] & 1<=p1] & [1<=p5 & 1<=p26]]]]]
normalized: ~ [EX [~ [[EX [[[1<=p5 & 1<=p26] & [[[p27<=0 | p36<=0] | ~ [EG [~ [1<=p11]]]] & 1<=p1]]] & ~ [EX [~ [1<=p18]]]]]]]

abstracting: (1<=p18)
states: 68
.abstracting: (1<=p1)
states: 416
abstracting: (1<=p11)
states: 68
.
EG iterations: 1
abstracting: (p36<=0)
states: 1,058 (3)
abstracting: (p27<=0)
states: 12
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
..-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [[[AF [[p30<=0 & [p0<=0 | [p5<=0 | p26<=0]]]] | [AX [[p27<=0 | p35<=0]] | AG [[p20<=0 | p32<=0]]]] | [p27<=0 | [p35<=0 | 1<=p14]]]]
normalized: EX [[[[p35<=0 | 1<=p14] | p27<=0] | [[~ [E [true U ~ [[p20<=0 | p32<=0]]]] | ~ [EX [~ [[p27<=0 | p35<=0]]]]] | ~ [EG [~ [[[[p5<=0 | p26<=0] | p0<=0] & p30<=0]]]]]]]

abstracting: (p30<=0)
states: 640
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
.
EG iterations: 1
abstracting: (p35<=0)
states: 1,058 (3)
abstracting: (p27<=0)
states: 12
.abstracting: (p32<=0)
states: 640
abstracting: (p20<=0)
states: 1,024 (3)
abstracting: (p27<=0)
states: 12
abstracting: (1<=p14)
states: 68
abstracting: (p35<=0)
states: 1,058 (3)
.-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[AG [[p0<=0 | [p6<=0 | p26<=0]]] & [[1<=p29 | [1<=p27 & 1<=p35]] | [[1<=p27 & 1<=p34] | [p13<=0 & [p23<=0 | p31<=0]]]]]]
normalized: E [true U [[[[[p23<=0 | p31<=0] & p13<=0] | [1<=p27 & 1<=p34]] | [[1<=p27 & 1<=p35] | 1<=p29]] & ~ [E [true U ~ [[[p6<=0 | p26<=0] | p0<=0]]]]]]

abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (1<=p29)
states: 60
abstracting: (1<=p35)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
abstracting: (1<=p34)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
abstracting: (p13<=0)
states: 1,024 (3)
abstracting: (p31<=0)
states: 640
abstracting: (p23<=0)
states: 1,024 (3)
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [E [AG [AF [[1<=p28 & 1<=p25]]] U 1<=p25] | AX [[AX [A [1<=p24 U 1<=p12]] | [AX [E [1<=p12 U [1<=p20 & 1<=p30]]] | [1<=p0 & [1<=p7 & 1<=p26]]]]]]
normalized: [~ [EX [~ [[[[[1<=p7 & 1<=p26] & 1<=p0] | ~ [EX [~ [E [1<=p12 U [1<=p20 & 1<=p30]]]]]] | ~ [EX [~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [1<=p24] & ~ [1<=p12]]]]]]]]]]]] | E [~ [E [true U EG [~ [[1<=p28 & 1<=p25]]]]] U 1<=p25]]

abstracting: (1<=p25)
states: 120
abstracting: (1<=p25)
states: 120
abstracting: (1<=p28)
states: 60
.
EG iterations: 1
abstracting: (1<=p12)
states: 68
abstracting: (1<=p24)
states: 120
abstracting: (1<=p12)
states: 68
abstracting: (1<=p12)
states: 68
.
EG iterations: 1
.abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p12)
states: 68
.abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [[EX [[AF [[p0<=0 | [p5<=0 | p26<=0]]] | AX [[p0<=0 | [p5<=0 | p26<=0]]]]] & [AF [AX [[p1<=0 | [p4<=0 | p26<=0]]]] | [1<=p0 & [1<=p4 & 1<=p26]]]]]
normalized: ~ [EX [~ [[[[[1<=p4 & 1<=p26] & 1<=p0] | ~ [EG [EX [~ [[[p4<=0 | p26<=0] | p1<=0]]]]]] & EX [[~ [EX [~ [[[p5<=0 | p26<=0] | p0<=0]]]] | ~ [EG [~ [[[p5<=0 | p26<=0] | p0<=0]]]]]]]]]]

abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
.
EG iterations: 1
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
..abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p4<=0)
states: 972
..
EG iterations: 1
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [AF [EG [[[[1<=p16 | 1<=p17] | [1<=p18 | 1<=p19]] | [[1<=p12 | 1<=p13] | [1<=p14 | 1<=p15]]]]] U [[[1<=p0 & [1<=p4 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]]
normalized: E [~ [EG [~ [EG [[[[1<=p14 | 1<=p15] | [1<=p12 | 1<=p13]] | [[1<=p18 | 1<=p19] | [1<=p16 | 1<=p17]]]]]]] U [[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]]]

abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p17)
states: 68
abstracting: (1<=p16)
states: 68
abstracting: (1<=p19)
states: 68
abstracting: (1<=p18)
states: 68
abstracting: (1<=p13)
states: 68
abstracting: (1<=p12)
states: 68
abstracting: (1<=p15)
states: 68
abstracting: (1<=p14)
states: 68
.
EG iterations: 1
....
EG iterations: 4
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AF [[AX [EF [[[[[p1<=0 | [p6<=0 | p26<=0]] & [p0<=0 | [p4<=0 | p26<=0]]] & [[p0<=0 | [p5<=0 | p26<=0]] & [p1<=0 | [p5<=0 | p26<=0]]]] & [[[p0<=0 | [p7<=0 | p26<=0]] & [p1<=0 | [p4<=0 | p26<=0]]] & [[p0<=0 | [p6<=0 | p26<=0]] & [p1<=0 | [p7<=0 | p26<=0]]]]]]] & [p28<=0 & p29<=0]]]
normalized: ~ [EG [~ [[[p28<=0 & p29<=0] & ~ [EX [~ [E [true U [[[[[p7<=0 | p26<=0] | p1<=0] & [[p6<=0 | p26<=0] | p0<=0]] & [[[p4<=0 | p26<=0] | p1<=0] & [[p7<=0 | p26<=0] | p0<=0]]] & [[[[p5<=0 | p26<=0] | p1<=0] & [[p5<=0 | p26<=0] | p0<=0]] & [[[p4<=0 | p26<=0] | p0<=0] & [[p6<=0 | p26<=0] | p1<=0]]]]]]]]]]]]

abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p4<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p7<=0)
states: 972
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p4<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p7<=0)
states: 972
.abstracting: (p29<=0)
states: 1,032 (3)
abstracting: (p28<=0)
states: 1,032 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [EX [[[[[[1<=p26 & 1<=p6] & 1<=p1] | [1<=p0 & [1<=p4 & 1<=p26]]] | [[1<=p0 & [1<=p5 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]]] | [[[1<=p0 & [1<=p7 & 1<=p26]] | [1<=p1 & [1<=p4 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]]] & [~ [E [~ [EG [[[1<=p30 | 1<=p31] & [1<=p2 | 1<=p3]]]] U EG [[~ [[[[[1<=p1 & [1<=p6 & 1<=p26]] | [1<=p0 & [1<=p4 & 1<=p26]]] | [[1<=p0 & [1<=p5 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]]] | [[[1<=p0 & [1<=p7 & 1<=p26]] | [1<=p1 & [1<=p4 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]]] & [[[[1<=p23 & 1<=p33] | [1<=p21 & 1<=p32]] | [[1<=p20 & 1<=p32] | [1<=p22 & 1<=p33]]] & [1<=p2 | 1<=p3]]]]]] | AX [[1<=p24 | 1<=p25]]]]
normalized: [[~ [EX [~ [[1<=p24 | 1<=p25]]]] | ~ [E [~ [EG [[[1<=p2 | 1<=p3] & [1<=p30 | 1<=p31]]]] U EG [[[[1<=p2 | 1<=p3] & [[[1<=p22 & 1<=p33] | [1<=p20 & 1<=p32]] | [[1<=p21 & 1<=p32] | [1<=p23 & 1<=p33]]]] & ~ [[[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p4 & 1<=p26] & 1<=p1] | [[1<=p7 & 1<=p26] & 1<=p0]]] | [[[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p5 & 1<=p26] & 1<=p0]] | [[[1<=p4 & 1<=p26] & 1<=p0] | [[1<=p6 & 1<=p26] & 1<=p1]]]]]]]]]] & EX [[[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p4 & 1<=p26] & 1<=p1] | [[1<=p7 & 1<=p26] & 1<=p0]]] | [[[[1<=p5 & 1<=p26] & 1<=p1] | [1<=p0 & [1<=p5 & 1<=p26]]] | [[1<=p0 & [1<=p4 & 1<=p26]] | [[1<=p26 & 1<=p6] & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 416
abstracting: (1<=p6)
states: 120
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
.abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p33)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p33)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p3)
states: 60
abstracting: (1<=p2)
states: 60
..
EG iterations: 2
abstracting: (1<=p31)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p3)
states: 60
abstracting: (1<=p2)
states: 60
......
EG iterations: 6
abstracting: (1<=p25)
states: 120
abstracting: (1<=p24)
states: 120
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [~ [A [AG [[AF [[[[1<=p23 & 1<=p33] | [1<=p21 & 1<=p32]] | [[1<=p20 & 1<=p32] | [1<=p22 & 1<=p33]]]] | [1<=p30 | 1<=p31]]] U E [[[[[[1<=p20 & 1<=p30] | [1<=p21 & 1<=p30]] | [[1<=p22 & 1<=p31] | [1<=p23 & 1<=p31]]] & [1<=p30 | 1<=p31]] | [[[[1<=p20 & 1<=p30] | [1<=p21 & 1<=p30]] | [[1<=p22 & 1<=p31] | [1<=p23 & 1<=p31]]] & [[[1<=p0 & [1<=p4 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]]] U [EG [[1<=p24 | 1<=p25]] & EX [[[[1<=p16 | 1<=p17] | [1<=p18 | 1<=p19]] | [[1<=p12 | 1<=p13] | [1<=p14 | 1<=p15]]]]]]]] | EG [A [~ [[[[1<=p20 & 1<=p30] | [1<=p21 & 1<=p30]] | [[1<=p22 & 1<=p31] | [1<=p23 & 1<=p31]]]] U ~ [[[[1<=p0 & [1<=p4 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]]]]]
normalized: [EG [[~ [EG [[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]]]] & ~ [E [[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]] U [[[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]] & [[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]]]]]]] | ~ [[~ [EG [~ [E [[[[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]] & [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]] | [[1<=p30 | 1<=p31] & [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]]] U [EX [[[[1<=p14 | 1<=p15] | [1<=p12 | 1<=p13]] | [[1<=p18 | 1<=p19] | [1<=p16 | 1<=p17]]]] & EG [[1<=p24 | 1<=p25]]]]]]] & ~ [E [~ [E [[[[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]] & [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]] | [[1<=p30 | 1<=p31] & [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]]] U [EX [[[[1<=p14 | 1<=p15] | [1<=p12 | 1<=p13]] | [[1<=p18 | 1<=p19] | [1<=p16 | 1<=p17]]]] & EG [[1<=p24 | 1<=p25]]]]] U [E [true U ~ [[[1<=p30 | 1<=p31] | ~ [EG [~ [[[[1<=p22 & 1<=p33] | [1<=p20 & 1<=p32]] | [[1<=p21 & 1<=p32] | [1<=p23 & 1<=p33]]]]]]]]] & ~ [E [[[[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]] & [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]] | [[1<=p30 | 1<=p31] & [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]]] U [EX [[[[1<=p14 | 1<=p15] | [1<=p12 | 1<=p13]] | [[1<=p18 | 1<=p19] | [1<=p16 | 1<=p17]]]] & EG [[1<=p24 | 1<=p25]]]]]]]]]]]

abstracting: (1<=p25)
states: 120
abstracting: (1<=p24)
states: 120
.
EG iterations: 1
abstracting: (1<=p17)
states: 68
abstracting: (1<=p16)
states: 68
abstracting: (1<=p19)
states: 68
abstracting: (1<=p18)
states: 68
abstracting: (1<=p13)
states: 68
abstracting: (1<=p12)
states: 68
abstracting: (1<=p15)
states: 68
abstracting: (1<=p14)
states: 68
.abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p33)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p33)
states: 452
abstracting: (1<=p22)
states: 68
........
EG iterations: 8
abstracting: (1<=p31)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p25)
states: 120
abstracting: (1<=p24)
states: 120
.
EG iterations: 1
abstracting: (1<=p17)
states: 68
abstracting: (1<=p16)
states: 68
abstracting: (1<=p19)
states: 68
abstracting: (1<=p18)
states: 68
abstracting: (1<=p13)
states: 68
abstracting: (1<=p12)
states: 68
abstracting: (1<=p15)
states: 68
abstracting: (1<=p14)
states: 68
.abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p25)
states: 120
abstracting: (1<=p24)
states: 120
.
EG iterations: 1
abstracting: (1<=p17)
states: 68
abstracting: (1<=p16)
states: 68
abstracting: (1<=p19)
states: 68
abstracting: (1<=p18)
states: 68
abstracting: (1<=p13)
states: 68
abstracting: (1<=p12)
states: 68
abstracting: (1<=p15)
states: 68
abstracting: (1<=p14)
states: 68
.abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
....
EG iterations: 4
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
.
EG iterations: 1
........
EG iterations: 8
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EG [[AF [EX [[[[p30<=0 & p31<=0] & [p16<=0 & [p17<=0 & p18<=0]]] & [[p19<=0 & p12<=0] & [p13<=0 & [p14<=0 & p15<=0]]]]]] | [[[EX [AF [[[[p16<=0 & p17<=0] & [p18<=0 & p19<=0]] & [[p12<=0 & p13<=0] & [p14<=0 & p15<=0]]]]] & [AX [[[[p16<=0 & p17<=0] & [p18<=0 & p19<=0]] & [[p12<=0 & p13<=0] & [p14<=0 & p15<=0]]]] & E [~ [[[[[1<=p1 & [1<=p6 & 1<=p26]] | [1<=p0 & [1<=p4 & 1<=p26]]] | [[1<=p0 & [1<=p5 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]]] | [[[1<=p0 & [1<=p7 & 1<=p26]] | [1<=p1 & [1<=p4 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]]] U [[[1<=p23 & 1<=p33] | [1<=p21 & 1<=p32]] | [[1<=p20 & 1<=p32] | [1<=p22 & 1<=p33]]]]]] & [[EF [[[[1<=p0 & [1<=p4 & 1<=p26]] | [1<=p1 & [1<=p5 & 1<=p26]]] | [[1<=p0 & [1<=p6 & 1<=p26]] | [1<=p1 & [1<=p7 & 1<=p26]]]]] | [E [[1<=p28 | 1<=p29] U [[[1<=p23 & 1<=p33] | [1<=p21 & 1<=p32]] | [[1<=p20 & 1<=p32] | [1<=p22 & 1<=p33]]]] & [[[[1<=p20 & 1<=p30] | [1<=p21 & 1<=p30]] | [[1<=p22 & 1<=p31] | [1<=p23 & 1<=p31]]] | [[[1<=p27 & 1<=p37] | [1<=p27 & 1<=p35]] | [[1<=p27 & 1<=p36] | [1<=p27 & 1<=p34]]]]]] & [[p1<=0 | [p6<=0 | p26<=0]] & [p0<=0 | [p4<=0 | p26<=0]]]]] & [[[p0<=0 | [p5<=0 | p26<=0]] & [[p1<=0 | [p5<=0 | p26<=0]] & [p0<=0 | [p7<=0 | p26<=0]]]] & [[p1<=0 | [p4<=0 | p26<=0]] & [[p0<=0 | [p6<=0 | p26<=0]] & [p1<=0 | [p7<=0 | p26<=0]]]]]]]]
normalized: EG [[[[[[[[p7<=0 | p26<=0] | p1<=0] & [[p6<=0 | p26<=0] | p0<=0]] & [[p4<=0 | p26<=0] | p1<=0]] & [[[[p7<=0 | p26<=0] | p0<=0] & [[p5<=0 | p26<=0] | p1<=0]] & [[p5<=0 | p26<=0] | p0<=0]]] & [[[[[p4<=0 | p26<=0] | p0<=0] & [[p6<=0 | p26<=0] | p1<=0]] & [[[[[[1<=p27 & 1<=p34] | [1<=p27 & 1<=p36]] | [[1<=p27 & 1<=p35] | [1<=p27 & 1<=p37]]] | [[[1<=p23 & 1<=p31] | [1<=p22 & 1<=p31]] | [[1<=p21 & 1<=p30] | [1<=p20 & 1<=p30]]]] & E [[1<=p28 | 1<=p29] U [[[1<=p22 & 1<=p33] | [1<=p20 & 1<=p32]] | [[1<=p21 & 1<=p32] | [1<=p23 & 1<=p33]]]]] | E [true U [[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p4 & 1<=p26] & 1<=p0]]]]]] & [[E [~ [[[[[[1<=p7 & 1<=p26] & 1<=p1] | [[1<=p6 & 1<=p26] & 1<=p0]] | [[[1<=p4 & 1<=p26] & 1<=p1] | [[1<=p7 & 1<=p26] & 1<=p0]]] | [[[[1<=p5 & 1<=p26] & 1<=p1] | [[1<=p5 & 1<=p26] & 1<=p0]] | [[[1<=p4 & 1<=p26] & 1<=p0] | [[1<=p6 & 1<=p26] & 1<=p1]]]]] U [[[1<=p22 & 1<=p33] | [1<=p20 & 1<=p32]] | [[1<=p21 & 1<=p32] | [1<=p23 & 1<=p33]]]] & ~ [EX [~ [[[[p14<=0 & p15<=0] & [p12<=0 & p13<=0]] & [[p18<=0 & p19<=0] & [p16<=0 & p17<=0]]]]]]] & EX [~ [EG [~ [[[[p14<=0 & p15<=0] & [p12<=0 & p13<=0]] & [[p18<=0 & p19<=0] & [p16<=0 & p17<=0]]]]]]]]]] | ~ [EG [~ [EX [[[[[p14<=0 & p15<=0] & p13<=0] & [p19<=0 & p12<=0]] & [[[p17<=0 & p18<=0] & p16<=0] & [p30<=0 & p31<=0]]]]]]]]]

abstracting: (p31<=0)
states: 640
abstracting: (p30<=0)
states: 640
abstracting: (p16<=0)
states: 1,024 (3)
abstracting: (p18<=0)
states: 1,024 (3)
abstracting: (p17<=0)
states: 1,024 (3)
abstracting: (p12<=0)
states: 1,024 (3)
abstracting: (p19<=0)
states: 1,024 (3)
abstracting: (p13<=0)
states: 1,024 (3)
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (p14<=0)
states: 1,024 (3)
.....
EG iterations: 4
abstracting: (p17<=0)
states: 1,024 (3)
abstracting: (p16<=0)
states: 1,024 (3)
abstracting: (p19<=0)
states: 1,024 (3)
abstracting: (p18<=0)
states: 1,024 (3)
abstracting: (p13<=0)
states: 1,024 (3)
abstracting: (p12<=0)
states: 1,024 (3)
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (p14<=0)
states: 1,024 (3)
.
EG iterations: 1
.abstracting: (p17<=0)
states: 1,024 (3)
abstracting: (p16<=0)
states: 1,024 (3)
abstracting: (p19<=0)
states: 1,024 (3)
abstracting: (p18<=0)
states: 1,024 (3)
abstracting: (p13<=0)
states: 1,024 (3)
abstracting: (p12<=0)
states: 1,024 (3)
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (p14<=0)
states: 1,024 (3)
.abstracting: (1<=p33)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p33)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p4)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p5)
states: 120
abstracting: (1<=p0)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p6)
states: 120
abstracting: (1<=p1)
states: 416
abstracting: (1<=p26)
states: 1,092 (3)
abstracting: (1<=p7)
states: 120
abstracting: (1<=p33)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p32)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p33)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p29)
states: 60
abstracting: (1<=p28)
states: 60
abstracting: (1<=p30)
states: 452
abstracting: (1<=p20)
states: 68
abstracting: (1<=p30)
states: 452
abstracting: (1<=p21)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p22)
states: 68
abstracting: (1<=p31)
states: 452
abstracting: (1<=p23)
states: 68
abstracting: (1<=p37)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
abstracting: (1<=p35)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
abstracting: (1<=p36)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
abstracting: (1<=p34)
states: 34
abstracting: (1<=p27)
states: 1,080 (3)
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p4<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p5<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p7<=0)
states: 972
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p4<=0)
states: 972
abstracting: (p0<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p6<=0)
states: 972
abstracting: (p1<=0)
states: 676
abstracting: (p26<=0)
states: 0
abstracting: (p7<=0)
states: 972
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

totally nodes used: 57168 (5.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 95638 254508 350146
used/not used/entry size/cache size: 310719 66798145 16 1024MB
basic ops cache: hits/miss/sum: 17461 42220 59681
used/not used/entry size/cache size: 80507 16696709 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: 1806 3979 5785
used/not used/entry size/cache size: 3979 8384629 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 67053587
1 53806
2 1284
3 88
4 40
5 24
6 21
7 4
8 2
9 5
>= 10 3

Total processing time: 0m 4.411sec


BK_STOP 1679378939486

--------------------
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:770 (16), effective:62 (1)

initing FirstDep: 0m 0.000sec


iterations count:226 (4), effective:21 (0)

iterations count:226 (4), effective:21 (0)

iterations count:46 (1), effective:0 (0)

iterations count:226 (4), effective:21 (0)

iterations count:46 (1), effective:0 (0)

iterations count:276 (6), effective:27 (0)

iterations count:496 (10), effective:50 (1)

iterations count:58 (1), effective:1 (0)

iterations count:46 (1), effective:0 (0)

iterations count:55 (1), effective:1 (0)

iterations count:46 (1), effective:0 (0)

iterations count:435 (9), effective:36 (0)

iterations count:450 (9), effective:43 (0)

iterations count:46 (1), effective:0 (0)

iterations count:200 (4), effective:22 (0)

iterations count:46 (1), effective:0 (0)

iterations count:46 (1), effective:0 (0)

iterations count:46 (1), effective:0 (0)

iterations count:535 (11), effective:47 (1)

iterations count:145 (3), effective:14 (0)

iterations count:289 (6), effective:32 (0)

iterations count:522 (11), effective:38 (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="UtilityControlRoom-PT-Z2T4N02"
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 UtilityControlRoom-PT-Z2T4N02, 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 r490-tall-167912709601122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T4N02.tgz
mv UtilityControlRoom-PT-Z2T4N02 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;