fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978400026
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVs-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6731.812 34626.00 41884.00 81.60 FTTTFFTTTTFTFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978400026.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 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 ShieldRVs-PT-002B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679338369609

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=ShieldRVs-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:51] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-20 18:52:51] [INFO ] Transformed 83 places.
[2023-03-20 18:52:51] [INFO ] Transformed 93 transitions.
[2023-03-20 18:52:51] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:51] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 93 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 64 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 82 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 92
Applied a total of 2 rules in 15 ms. Remains 82 /83 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 82 cols
[2023-03-20 18:52:51] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-20 18:52:51] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-20 18:52:51] [INFO ] Invariant cache hit.
[2023-03-20 18:52:51] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-20 18:52:51] [INFO ] Invariant cache hit.
[2023-03-20 18:52:51] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/83 places, 92/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 82/83 places, 92/93 transitions.
Support contains 64 out of 82 places after structural reductions.
[2023-03-20 18:52:51] [INFO ] Flatten gal took : 24 ms
[2023-03-20 18:52:51] [INFO ] Flatten gal took : 9 ms
[2023-03-20 18:52:51] [INFO ] Input system was already deterministic with 92 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 74) seen :68
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 18:52:52] [INFO ] Invariant cache hit.
[2023-03-20 18:52:52] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 18:52:52] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 18:52:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-20 18:52:52] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 18:52:52] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
[2023-03-20 18:52:52] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2023-03-20 18:52:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-20 18:52:52] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 18:52:52] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 16 ms.
Support contains 7 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 92/92 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 82 transition count 86
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 76 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 75 transition count 85
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 14 place count 75 transition count 76
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 32 place count 66 transition count 76
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 42 place count 56 transition count 66
Iterating global reduction 3 with 10 rules applied. Total rules applied 52 place count 56 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 52 place count 56 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 52 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 86 place count 39 transition count 49
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 39 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 38 transition count 48
Applied a total of 92 rules in 37 ms. Remains 38 /82 variables (removed 44) and now considering 48/92 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 38/82 places, 48/92 transitions.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Probably explored full state space saw : 26953 states, properties seen :0
Probabilistic random walk after 141829 steps, saw 26953 distinct states, run finished after 324 ms. (steps per millisecond=437 ) properties seen :0
Explored full state space saw : 26953 states, properties seen :0
Exhaustive walk after 141829 steps, saw 26953 distinct states, run finished after 293 ms. (steps per millisecond=484 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-002B-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 92 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 80
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 69 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 69 transition count 79
Applied a total of 26 rules in 5 ms. Remains 69 /82 variables (removed 13) and now considering 79/92 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/82 places, 79/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 69 transition count 79
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 68 transition count 78
Applied a total of 28 rules in 5 ms. Remains 68 /82 variables (removed 14) and now considering 78/92 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 68/82 places, 78/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 69 transition count 79
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 68 transition count 78
Applied a total of 28 rules in 4 ms. Remains 68 /82 variables (removed 14) and now considering 78/92 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/82 places, 78/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 80
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 69 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 69 transition count 79
Applied a total of 26 rules in 4 ms. Remains 69 /82 variables (removed 13) and now considering 79/92 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/82 places, 79/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 81 transition count 84
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 74 transition count 84
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 74 transition count 75
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 65 transition count 75
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 43 place count 54 transition count 64
Iterating global reduction 2 with 11 rules applied. Total rules applied 54 place count 54 transition count 64
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 54 place count 54 transition count 60
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 50 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 40 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 39 transition count 49
Applied a total of 83 rules in 13 ms. Remains 39 /82 variables (removed 43) and now considering 49/92 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 39/82 places, 49/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 80
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 69 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 69 transition count 79
Applied a total of 26 rules in 5 ms. Remains 69 /82 variables (removed 13) and now considering 79/92 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/82 places, 79/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:53] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 81 transition count 84
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 74 transition count 84
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 74 transition count 73
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 63 transition count 73
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 49 place count 50 transition count 60
Iterating global reduction 2 with 13 rules applied. Total rules applied 62 place count 50 transition count 60
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 62 place count 50 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 45 transition count 55
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 96 place count 33 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 31 transition count 41
Applied a total of 98 rules in 10 ms. Remains 31 /82 variables (removed 51) and now considering 41/92 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 31/82 places, 41/92 transitions.
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:53] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 81 transition count 83
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 83
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 73 transition count 72
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 62 transition count 72
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 50 place count 50 transition count 60
Iterating global reduction 2 with 12 rules applied. Total rules applied 62 place count 50 transition count 60
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 62 place count 50 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 45 transition count 55
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 92 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 33 transition count 43
Applied a total of 94 rules in 10 ms. Remains 33 /82 variables (removed 49) and now considering 43/92 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 33/82 places, 43/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 83
Applied a total of 18 rules in 2 ms. Remains 73 /82 variables (removed 9) and now considering 83/92 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/82 places, 83/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 81
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 70 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 70 transition count 80
Applied a total of 24 rules in 2 ms. Remains 70 /82 variables (removed 12) and now considering 80/92 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 70/82 places, 80/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 73 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 73 transition count 83
Applied a total of 18 rules in 2 ms. Remains 73 /82 variables (removed 9) and now considering 83/92 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/82 places, 83/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 83
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 83
Applied a total of 18 rules in 1 ms. Remains 73 /82 variables (removed 9) and now considering 83/92 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 73/82 places, 83/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 81 transition count 82
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 72 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 72 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 66 transition count 76
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 43 place count 53 transition count 63
Iterating global reduction 2 with 13 rules applied. Total rules applied 56 place count 53 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 56 place count 53 transition count 61
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 51 transition count 61
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 40 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 38 transition count 48
Applied a total of 84 rules in 8 ms. Remains 38 /82 variables (removed 44) and now considering 48/92 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 38/82 places, 48/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 80
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 80
Applied a total of 24 rules in 1 ms. Remains 70 /82 variables (removed 12) and now considering 80/92 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 70/82 places, 80/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 82/82 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 81 transition count 82
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 72 transition count 82
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 72 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 62 transition count 72
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 51 place count 49 transition count 59
Iterating global reduction 2 with 13 rules applied. Total rules applied 64 place count 49 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 64 place count 49 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 44 transition count 54
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 98 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 30 transition count 40
Applied a total of 100 rules in 9 ms. Remains 30 /82 variables (removed 52) and now considering 40/92 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 30/82 places, 40/92 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:54] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:52:54] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:52:54] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-20 18:52:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 92 transitions and 286 arcs took 1 ms.
Total runtime 3026 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: 82 NrTr: 92 NrArc: 286)

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

net check time: 0m 0.000sec

init dd package: 0m 3.190sec


RS generation: 0m 0.736sec


-> reachability set: #nodes 12219 (1.2e+04) #states 3,942,839 (6)



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

checking: EX [EF [AX [1<=0]]]
normalized: EX [E [true U ~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.184sec

checking: AF [[p55<=1 & 1<=p55]]
normalized: ~ [EG [~ [[p55<=1 & 1<=p55]]]]

abstracting: (1<=p55)
states: 572,134 (5)
abstracting: (p55<=1)
states: 3,942,839 (6)
......................................................................................
EG iterations: 86
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.271sec

checking: EG [[[p53<=0 & 0<=p53] | [[p59<=0 & 0<=p59] | [p68<=0 & 0<=p68]]]]
normalized: EG [[[[p68<=0 & 0<=p68] | [p59<=0 & 0<=p59]] | [p53<=0 & 0<=p53]]]

abstracting: (0<=p53)
states: 3,942,839 (6)
abstracting: (p53<=0)
states: 3,551,249 (6)
abstracting: (0<=p59)
states: 3,942,839 (6)
abstracting: (p59<=0)
states: 2,578,757 (6)
abstracting: (0<=p68)
states: 3,942,839 (6)
abstracting: (p68<=0)
states: 3,410,343 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EG [[EF [[[p64<=1 & 1<=p64] | [[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p68<=1 & 1<=p68]]]]] | [p7<=0 & 0<=p7]]]
normalized: EG [[[p7<=0 & 0<=p7] | E [true U [[[[p68<=1 & 1<=p68] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]] | [p64<=1 & 1<=p64]]]]]

abstracting: (1<=p64)
states: 399,801 (5)
abstracting: (p64<=1)
states: 3,942,839 (6)
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (0<=p7)
states: 3,942,839 (6)
abstracting: (p7<=0)
states: 3,941,687 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.450sec

checking: [~ [E [AF [[[p6<=1 & 1<=p6] | [p66<=1 & 1<=p66]]] U [AG [~ [AG [[[p29<=1 & 1<=p29] & [[p40<=1 & 1<=p40] & [p63<=1 & 1<=p63]]]]]] & [p44<=1 & 1<=p44]]]] & AG [E [[p19<=1 & 1<=p19] U EF [[p19<=1 & 1<=p19]]]]]
normalized: [~ [E [true U ~ [E [[p19<=1 & 1<=p19] U E [true U [p19<=1 & 1<=p19]]]]]] & ~ [E [~ [EG [~ [[[p66<=1 & 1<=p66] | [p6<=1 & 1<=p6]]]]] U [[p44<=1 & 1<=p44] & ~ [E [true U ~ [E [true U ~ [[[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p29<=1 & 1<=p29]]]]]]]]]]]

abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p44)
states: 151
abstracting: (p44<=1)
states: 3,942,839 (6)
abstracting: (1<=p6)
states: 288
abstracting: (p6<=1)
states: 3,942,839 (6)
abstracting: (1<=p66)
states: 490,201 (5)
abstracting: (p66<=1)
states: 3,942,839 (6)
.........................
EG iterations: 25
abstracting: (1<=p19)
states: 118,314 (5)
abstracting: (p19<=1)
states: 3,942,839 (6)
abstracting: (1<=p19)
states: 118,314 (5)
abstracting: (p19<=1)
states: 3,942,839 (6)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.408sec

checking: AF [[EF [EX [[p41<=1 & 1<=p41]]] & [AF [E [[p23<=1 & 1<=p23] U [p38<=1 & 1<=p38]]] | ~ [A [[[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p68<=1 & 1<=p68]]] U ~ [EG [[[p4<=1 & 1<=p4] & [[p13<=1 & 1<=p13] & [p40<=1 & 1<=p40]]]]]]]]]]
normalized: ~ [EG [~ [[[~ [[~ [EG [EG [[[[p40<=1 & 1<=p40] & [p13<=1 & 1<=p13]] & [p4<=1 & 1<=p4]]]]] & ~ [E [EG [[[[p40<=1 & 1<=p40] & [p13<=1 & 1<=p13]] & [p4<=1 & 1<=p4]]] U [~ [[[[p68<=1 & 1<=p68] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]]] & EG [[[[p40<=1 & 1<=p40] & [p13<=1 & 1<=p13]] & [p4<=1 & 1<=p4]]]]]]]] | ~ [EG [~ [E [[p23<=1 & 1<=p23] U [p38<=1 & 1<=p38]]]]]] & E [true U EX [[p41<=1 & 1<=p41]]]]]]]

abstracting: (1<=p41)
states: 395,431 (5)
abstracting: (p41<=1)
states: 3,942,839 (6)
.abstracting: (1<=p38)
states: 443,774 (5)
abstracting: (p38<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
.
EG iterations: 1
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p13)
states: 363,807 (5)
abstracting: (p13<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
..............................
EG iterations: 30
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p13)
states: 363,807 (5)
abstracting: (p13<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
..............................
EG iterations: 30
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p13)
states: 363,807 (5)
abstracting: (p13<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
..............................
EG iterations: 30
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.256sec

checking: A [AX [[[p16<=1 & 1<=p16] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]]] U E [[[p22<=1 & 1<=p22] & [p34<=1 & 1<=p34]] U E [~ [A [[p23<=1 & 1<=p23] U [p23<=1 & 1<=p23]]] U [[p54<=1 & 1<=p54] & [[p59<=1 & 1<=p59] & [p67<=1 & 1<=p67]]]]]]
normalized: [~ [EG [~ [E [[[p34<=1 & 1<=p34] & [p22<=1 & 1<=p22]] U E [~ [[~ [EG [~ [[p23<=1 & 1<=p23]]]] & ~ [E [~ [[p23<=1 & 1<=p23]] U [~ [[p23<=1 & 1<=p23]] & ~ [[p23<=1 & 1<=p23]]]]]]] U [[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p54<=1 & 1<=p54]]]]]]] & ~ [E [~ [E [[[p34<=1 & 1<=p34] & [p22<=1 & 1<=p22]] U E [~ [[~ [EG [~ [[p23<=1 & 1<=p23]]]] & ~ [E [~ [[p23<=1 & 1<=p23]] U [~ [[p23<=1 & 1<=p23]] & ~ [[p23<=1 & 1<=p23]]]]]]] U [[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p54<=1 & 1<=p54]]]]] U [~ [E [[[p34<=1 & 1<=p34] & [p22<=1 & 1<=p22]] U E [~ [[~ [EG [~ [[p23<=1 & 1<=p23]]]] & ~ [E [~ [[p23<=1 & 1<=p23]] U [~ [[p23<=1 & 1<=p23]] & ~ [[p23<=1 & 1<=p23]]]]]]] U [[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p54<=1 & 1<=p54]]]]] & EX [~ [[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p16<=1 & 1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 550,412 (5)
abstracting: (p16<=1)
states: 3,942,839 (6)
abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
.abstracting: (1<=p54)
states: 572,134 (5)
abstracting: (p54<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
....................................
EG iterations: 36
abstracting: (1<=p22)
states: 1,220,738 (6)
abstracting: (p22<=1)
states: 3,942,839 (6)
abstracting: (1<=p34)
states: 620,941 (5)
abstracting: (p34<=1)
states: 3,942,839 (6)
abstracting: (1<=p54)
states: 572,134 (5)
abstracting: (p54<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
....................................
EG iterations: 36
abstracting: (1<=p22)
states: 1,220,738 (6)
abstracting: (p22<=1)
states: 3,942,839 (6)
abstracting: (1<=p34)
states: 620,941 (5)
abstracting: (p34<=1)
states: 3,942,839 (6)
abstracting: (1<=p54)
states: 572,134 (5)
abstracting: (p54<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
....................................
EG iterations: 36
abstracting: (1<=p22)
states: 1,220,738 (6)
abstracting: (p22<=1)
states: 3,942,839 (6)
abstracting: (1<=p34)
states: 620,941 (5)
abstracting: (p34<=1)
states: 3,942,839 (6)
...............................
EG iterations: 31
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.465sec

checking: [EG [[p57<=0 & 0<=p57]] | AG [[EG [AX [AF [[p32<=1 & 1<=p32]]]] | EG [[[[p69<=0 & 0<=p69] | [p18<=0 & 0<=p18]] & [AF [[[p16<=1 & 1<=p16] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]]] | EX [[[p15<=1 & 1<=p15] & [[p21<=1 & 1<=p21] & [p28<=1 & 1<=p28]]]]]]]]]]
normalized: [~ [E [true U ~ [[EG [[[~ [EG [~ [[[[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]] & [p16<=1 & 1<=p16]]]]] | EX [[[[p28<=1 & 1<=p28] & [p21<=1 & 1<=p21]] & [p15<=1 & 1<=p15]]]] & [[p18<=0 & 0<=p18] | [p69<=0 & 0<=p69]]]] | EG [~ [EX [EG [~ [[p32<=1 & 1<=p32]]]]]]]]]] | EG [[p57<=0 & 0<=p57]]]

abstracting: (0<=p57)
states: 3,942,839 (6)
abstracting: (p57<=0)
states: 3,848,221 (6)
.........................................................
EG iterations: 57
abstracting: (1<=p32)
states: 10,656 (4)
abstracting: (p32<=1)
states: 3,942,839 (6)
................................
EG iterations: 32
.................................
EG iterations: 32
abstracting: (0<=p69)
states: 3,942,839 (6)
abstracting: (p69<=0)
states: 3,410,343 (6)
abstracting: (0<=p18)
states: 3,942,839 (6)
abstracting: (p18<=0)
states: 3,907,352 (6)
abstracting: (1<=p15)
states: 417,981 (5)
abstracting: (p15<=1)
states: 3,942,839 (6)
abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
abstracting: (1<=p28)
states: 428,653 (5)
abstracting: (p28<=1)
states: 3,942,839 (6)
.abstracting: (1<=p16)
states: 550,412 (5)
abstracting: (p16<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
.................................................
EG iterations: 49
....................................................
EG iterations: 52
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.359sec

checking: EX [~ [E [~ [[[p65<=1 & 1<=p65] & [p79<=1 & 1<=p79]]] U [~ [E [[p23<=1 & 1<=p23] U [p47<=1 & 1<=p47]]] & [AG [[[p11<=1 & 1<=p11] & [[p51<=1 & 1<=p51] & [p78<=1 & 1<=p78]]]] & [~ [[p51<=1 & 1<=p51]] | [[p50<=1 & 1<=p50] | [p6<=1 & 1<=p6]]]]]]]]
normalized: EX [~ [E [~ [[[p79<=1 & 1<=p79] & [p65<=1 & 1<=p65]]] U [[~ [E [true U ~ [[[[p78<=1 & 1<=p78] & [p51<=1 & 1<=p51]] & [p11<=1 & 1<=p11]]]]] & [[[p6<=1 & 1<=p6] | [p50<=1 & 1<=p50]] | ~ [[p51<=1 & 1<=p51]]]] & ~ [E [[p23<=1 & 1<=p23] U [p47<=1 & 1<=p47]]]]]]]

abstracting: (1<=p47)
states: 37,835 (4)
abstracting: (p47<=1)
states: 3,942,839 (6)
abstracting: (1<=p23)
states: 10,368 (4)
abstracting: (p23<=1)
states: 3,942,839 (6)
abstracting: (1<=p51)
states: 421,930 (5)
abstracting: (p51<=1)
states: 3,942,839 (6)
abstracting: (1<=p50)
states: 378,576 (5)
abstracting: (p50<=1)
states: 3,942,839 (6)
abstracting: (1<=p6)
states: 288
abstracting: (p6<=1)
states: 3,942,839 (6)
abstracting: (1<=p11)
states: 629,586 (5)
abstracting: (p11<=1)
states: 3,942,839 (6)
abstracting: (1<=p51)
states: 421,930 (5)
abstracting: (p51<=1)
states: 3,942,839 (6)
abstracting: (1<=p78)
states: 380,462 (5)
abstracting: (p78<=1)
states: 3,942,839 (6)
abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (1<=p79)
states: 390,785 (5)
abstracting: (p79<=1)
states: 3,942,839 (6)
.-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: ~ [E [AG [[~ [EF [[[p22<=1 & 1<=p22] & [p34<=1 & 1<=p34]]]] | A [E [[[p68<=1 & 1<=p68] & [p79<=1 & 1<=p79]] U [[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p67<=1 & 1<=p67]]]] U E [[p67<=1 & 1<=p67] U [[p29<=1 & 1<=p29] & [[p40<=1 & 1<=p40] & [p63<=1 & 1<=p63]]]]]]] U [[p60<=1 & 1<=p60] & [p73<=1 & 1<=p73]]]]
normalized: ~ [E [~ [E [true U ~ [[[~ [EG [~ [E [[p67<=1 & 1<=p67] U [[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p29<=1 & 1<=p29]]]]]] & ~ [E [~ [E [[p67<=1 & 1<=p67] U [[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p29<=1 & 1<=p29]]]] U [~ [E [[[p79<=1 & 1<=p79] & [p68<=1 & 1<=p68]] U [[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]]]] & ~ [E [[p67<=1 & 1<=p67] U [[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p29<=1 & 1<=p29]]]]]]]] | ~ [E [true U [[p34<=1 & 1<=p34] & [p22<=1 & 1<=p22]]]]]]]] U [[p73<=1 & 1<=p73] & [p60<=1 & 1<=p60]]]]

abstracting: (1<=p60)
states: 1,251,936 (6)
abstracting: (p60<=1)
states: 3,942,839 (6)
abstracting: (1<=p73)
states: 578,874 (5)
abstracting: (p73<=1)
states: 3,942,839 (6)
abstracting: (1<=p22)
states: 1,220,738 (6)
abstracting: (p22<=1)
states: 3,942,839 (6)
abstracting: (1<=p34)
states: 620,941 (5)
abstracting: (p34<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (1<=p79)
states: 390,785 (5)
abstracting: (p79<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
............................................
EG iterations: 44
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.170sec

checking: E [EF [[[1<=p4 & p4<=1] & [[p16<=1 & 1<=p16] & [p40<=1 & 1<=p40]]]] U [[AG [EX [[[p37<=1 & 1<=p37] & [p52<=1 & 1<=p52]]]] & [p71<=1 & 1<=p71]] & [~ [AX [EG [[p51<=1 & 1<=p51]]]] & [[p28<=1 & 1<=p28] | [EX [[[p22<=1 & 1<=p22] & [p34<=1 & 1<=p34]]] & [AF [[[p16<=1 & 1<=p16] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]]] | [[p43<=1 & 1<=p43] | [[p65<=1 & 1<=p65] & [p76<=1 & 1<=p76]]]]]]]]]
normalized: E [E [true U [[[p40<=1 & 1<=p40] & [p16<=1 & 1<=p16]] & [1<=p4 & p4<=1]]] U [[[[[[[[p65<=1 & 1<=p65] & [p76<=1 & 1<=p76]] | [p43<=1 & 1<=p43]] | ~ [EG [~ [[[p16<=1 & 1<=p16] & [[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]]]]]]] & EX [[[p34<=1 & 1<=p34] & [p22<=1 & 1<=p22]]]] | [p28<=1 & 1<=p28]] & EX [~ [EG [[p51<=1 & 1<=p51]]]]] & [[p71<=1 & 1<=p71] & ~ [E [true U ~ [EX [[[p52<=1 & 1<=p52] & [p37<=1 & 1<=p37]]]]]]]]]

abstracting: (1<=p37)
states: 412,462 (5)
abstracting: (p37<=1)
states: 3,942,839 (6)
abstracting: (1<=p52)
states: 406,258 (5)
abstracting: (p52<=1)
states: 3,942,839 (6)
.abstracting: (1<=p71)
states: 5,587 (3)
abstracting: (p71<=1)
states: 3,942,839 (6)
abstracting: (1<=p51)
states: 421,930 (5)
abstracting: (p51<=1)
states: 3,942,839 (6)
...................................................................
EG iterations: 67
.abstracting: (1<=p28)
states: 428,653 (5)
abstracting: (p28<=1)
states: 3,942,839 (6)
abstracting: (1<=p22)
states: 1,220,738 (6)
abstracting: (p22<=1)
states: 3,942,839 (6)
abstracting: (1<=p34)
states: 620,941 (5)
abstracting: (p34<=1)
states: 3,942,839 (6)
.abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p16)
states: 550,412 (5)
abstracting: (p16<=1)
states: 3,942,839 (6)
.................................................
EG iterations: 49
abstracting: (1<=p43)
states: 151
abstracting: (p43<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (1<=p16)
states: 550,412 (5)
abstracting: (p16<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.092sec

checking: [AF [EG [[[AG [[p1<=1 & 1<=p1]] | [E [[p76<=1 & 1<=p76] U [p56<=1 & 1<=p56]] | [p71<=0 & 0<=p71]]] & [p49<=1 & 1<=p49]]]] | EF [[[AF [[EG [[p19<=0 & 0<=p19]] | [p70<=1 & 1<=p70]]] & AX [[[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p67<=1 & 1<=p67]]]]] & [AG [[[p4<=1 & 1<=p4] & [[p16<=1 & 1<=p16] & [p40<=1 & 1<=p40]]]] & [[p50<=1 & 1<=p50] & [[p4<=0 & 0<=p4] | [[p16<=0 & 0<=p16] | [p40<=0 & 0<=p40]]]]]]]]
normalized: [~ [EG [~ [EG [[[p49<=1 & 1<=p49] & [[[p71<=0 & 0<=p71] | E [[p76<=1 & 1<=p76] U [p56<=1 & 1<=p56]]] | ~ [E [true U ~ [[p1<=1 & 1<=p1]]]]]]]]]] | E [true U [[~ [EX [~ [[[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]]]]] & ~ [EG [~ [[[p70<=1 & 1<=p70] | EG [[p19<=0 & 0<=p19]]]]]]] & [[[[[p40<=0 & 0<=p40] | [p16<=0 & 0<=p16]] | [p4<=0 & 0<=p4]] & [p50<=1 & 1<=p50]] & ~ [E [true U ~ [[[[p40<=1 & 1<=p40] & [p16<=1 & 1<=p16]] & [p4<=1 & 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p16)
states: 550,412 (5)
abstracting: (p16<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p50)
states: 378,576 (5)
abstracting: (p50<=1)
states: 3,942,839 (6)
abstracting: (0<=p4)
states: 3,942,839 (6)
abstracting: (p4<=0)
states: 2,442,705 (6)
abstracting: (0<=p16)
states: 3,942,839 (6)
abstracting: (p16<=0)
states: 3,392,427 (6)
abstracting: (0<=p40)
states: 3,942,839 (6)
abstracting: (p40<=0)
states: 3,547,408 (6)
abstracting: (0<=p19)
states: 3,942,839 (6)
abstracting: (p19<=0)
states: 3,824,525 (6)
..............................................................
EG iterations: 62
abstracting: (1<=p70)
states: 5,436 (3)
abstracting: (p70<=1)
states: 3,942,839 (6)
...........................................................................
EG iterations: 75
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
.abstracting: (1<=p1)
states: 288
abstracting: (p1<=1)
states: 3,942,839 (6)
abstracting: (1<=p56)
states: 37,835 (4)
abstracting: (p56<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
abstracting: (0<=p71)
states: 3,942,839 (6)
abstracting: (p71<=0)
states: 3,937,252 (6)
abstracting: (1<=p49)
states: 556,784 (5)
abstracting: (p49<=1)
states: 3,942,839 (6)
...................................................................
EG iterations: 67

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.279sec

checking: E [~ [[[p4<=1 & 1<=p4] & [[p13<=1 & 1<=p13] & [p40<=1 & 1<=p40]]]] U [[[p11<=1 & 1<=p11] & [[p51<=1 & 1<=p51] & [p78<=1 & 1<=p78]]] | [[~ [[p37<=1 & 1<=p37]] & AF [[p81<=1 & 1<=p81]]] & [[~ [[[p65<=1 & 1<=p65] & [p79<=1 & 1<=p79]]] | A [[[p65<=1 & 1<=p65] & [p76<=1 & 1<=p76]] U [p43<=1 & 1<=p43]]] & [[AX [[[p65<=1 & 1<=p65] & [p76<=1 & 1<=p76]]] | [[p65<=1 & 1<=p65] & [p76<=1 & 1<=p76]]] & [AG [E [[p80<=1 & 1<=p80] U [p46<=1 & 1<=p46]]] | [[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p68<=1 & 1<=p68]]]]]]]]]
normalized: E [~ [[[[p40<=1 & 1<=p40] & [p13<=1 & 1<=p13]] & [p4<=1 & 1<=p4]]] U [[[[[[[[p68<=1 & 1<=p68] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]] | ~ [E [true U ~ [E [[p80<=1 & 1<=p80] U [p46<=1 & 1<=p46]]]]]] & [[[p76<=1 & 1<=p76] & [p65<=1 & 1<=p65]] | ~ [EX [~ [[[p76<=1 & 1<=p76] & [p65<=1 & 1<=p65]]]]]]] & [[~ [EG [~ [[p43<=1 & 1<=p43]]]] & ~ [E [~ [[p43<=1 & 1<=p43]] U [~ [[[p76<=1 & 1<=p76] & [p65<=1 & 1<=p65]]] & ~ [[p43<=1 & 1<=p43]]]]]] | ~ [[[p79<=1 & 1<=p79] & [p65<=1 & 1<=p65]]]]] & [~ [EG [~ [[p81<=1 & 1<=p81]]]] & ~ [[p37<=1 & 1<=p37]]]] | [[[p78<=1 & 1<=p78] & [p51<=1 & 1<=p51]] & [p11<=1 & 1<=p11]]]]

abstracting: (1<=p11)
states: 629,586 (5)
abstracting: (p11<=1)
states: 3,942,839 (6)
abstracting: (1<=p51)
states: 421,930 (5)
abstracting: (p51<=1)
states: 3,942,839 (6)
abstracting: (1<=p78)
states: 380,462 (5)
abstracting: (p78<=1)
states: 3,942,839 (6)
abstracting: (1<=p37)
states: 412,462 (5)
abstracting: (p37<=1)
states: 3,942,839 (6)
abstracting: (1<=p81)
states: 5,587 (3)
abstracting: (p81<=1)
states: 3,942,839 (6)
.............................
EG iterations: 29
abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (1<=p79)
states: 390,785 (5)
abstracting: (p79<=1)
states: 3,942,839 (6)
abstracting: (1<=p43)
states: 151
abstracting: (p43<=1)
states: 3,942,839 (6)
abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
abstracting: (1<=p43)
states: 151
abstracting: (p43<=1)
states: 3,942,839 (6)
abstracting: (1<=p43)
states: 151
abstracting: (p43<=1)
states: 3,942,839 (6)
..
EG iterations: 2
abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
.abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
abstracting: (1<=p46)
states: 10,072 (4)
abstracting: (p46<=1)
states: 3,942,839 (6)
abstracting: (1<=p80)
states: 390,785 (5)
abstracting: (p80<=1)
states: 3,942,839 (6)
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p13)
states: 363,807 (5)
abstracting: (p13<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.065sec

checking: [E [[E [~ [[p27<=1 & 1<=p27]] U ~ [[[p52<=1 & 1<=p52] | [p3<=1 & 1<=p3]]]] & [[p7<=1 & 1<=p7] | [[[p8<=1 & 1<=p8] & [[[p49<=1 & 1<=p49] | [[p4<=1 & 1<=p4] & [[p13<=1 & 1<=p13] & [p39<=1 & 1<=p39]]]] & ~ [[p78<=1 & 1<=p78]]]] | [p70<=1 & 1<=p70]]]] U AX [EX [AF [[p70<=1 & 1<=p70]]]]] | AG [E [[~ [EG [[[p68<=1 & 1<=p68] & [p76<=1 & 1<=p76]]]] | [[[p50<=1 & 1<=p50] | [[[p29<=1 & 1<=p29] & [p37<=1 & 1<=p37]] & [[p63<=1 & 1<=p63] & [p46<=1 & 1<=p46]]]] & ~ [EX [[[p29<=1 & 1<=p29] & [[p37<=1 & 1<=p37] & [p63<=1 & 1<=p63]]]]]]] U [~ [[A [[p12<=1 & 1<=p12] U [[p15<=1 & 1<=p15] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]]] | A [[p37<=1 & 1<=p37] U [p42<=1 & 1<=p42]]]] & E [AX [[p5<=1 & 1<=p5]] U ~ [[[p60<=1 & 1<=p60] & [p73<=1 & 1<=p73]]]]]]]]
normalized: [~ [E [true U ~ [E [[~ [EG [[[p76<=1 & 1<=p76] & [p68<=1 & 1<=p68]]]] | [~ [EX [[[[p63<=1 & 1<=p63] & [p37<=1 & 1<=p37]] & [p29<=1 & 1<=p29]]]] & [[[[p46<=1 & 1<=p46] & [p63<=1 & 1<=p63]] & [[p37<=1 & 1<=p37] & [p29<=1 & 1<=p29]]] | [p50<=1 & 1<=p50]]]] U [~ [[[~ [EG [~ [[p42<=1 & 1<=p42]]]] & ~ [E [~ [[p42<=1 & 1<=p42]] U [~ [[p37<=1 & 1<=p37]] & ~ [[p42<=1 & 1<=p42]]]]]] | [~ [EG [~ [[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p15<=1 & 1<=p15]]]]] & ~ [E [~ [[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p15<=1 & 1<=p15]]] U [~ [[p12<=1 & 1<=p12]] & ~ [[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p15<=1 & 1<=p15]]]]]]]]] & E [~ [EX [~ [[p5<=1 & 1<=p5]]]] U ~ [[[p60<=1 & 1<=p60] & [p73<=1 & 1<=p73]]]]]]]]] | E [[[[[p70<=1 & 1<=p70] | [[~ [[p78<=1 & 1<=p78]] & [[[[p39<=1 & 1<=p39] & [p13<=1 & 1<=p13]] & [p4<=1 & 1<=p4]] | [p49<=1 & 1<=p49]]] & [p8<=1 & 1<=p8]]] | [p7<=1 & 1<=p7]] & E [~ [[p27<=1 & 1<=p27]] U ~ [[[p3<=1 & 1<=p3] | [p52<=1 & 1<=p52]]]]] U ~ [EX [~ [EX [~ [EG [~ [[p70<=1 & 1<=p70]]]]]]]]]]

abstracting: (1<=p70)
states: 5,436 (3)
abstracting: (p70<=1)
states: 3,942,839 (6)
.............................
EG iterations: 29
..abstracting: (1<=p52)
states: 406,258 (5)
abstracting: (p52<=1)
states: 3,942,839 (6)
abstracting: (1<=p3)
states: 1,183,411 (6)
abstracting: (p3<=1)
states: 3,942,839 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p27<=1)
states: 3,942,839 (6)
abstracting: (1<=p7)
states: 1,152 (3)
abstracting: (p7<=1)
states: 3,942,839 (6)
abstracting: (1<=p8)
states: 12,123 (4)
abstracting: (p8<=1)
states: 3,942,839 (6)
abstracting: (1<=p49)
states: 556,784 (5)
abstracting: (p49<=1)
states: 3,942,839 (6)
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p13)
states: 363,807 (5)
abstracting: (p13<=1)
states: 3,942,839 (6)
abstracting: (1<=p39)
states: 312,241 (5)
abstracting: (p39<=1)
states: 3,942,839 (6)
abstracting: (1<=p78)
states: 380,462 (5)
abstracting: (p78<=1)
states: 3,942,839 (6)
abstracting: (1<=p70)
states: 5,436 (3)
abstracting: (p70<=1)
states: 3,942,839 (6)
abstracting: (1<=p73)
states: 578,874 (5)
abstracting: (p73<=1)
states: 3,942,839 (6)
abstracting: (1<=p60)
states: 1,251,936 (6)
abstracting: (p60<=1)
states: 3,942,839 (6)
abstracting: (1<=p5)
states: 288
abstracting: (p5<=1)
states: 3,942,839 (6)
.abstracting: (1<=p15)
states: 417,981 (5)
abstracting: (p15<=1)
states: 3,942,839 (6)
abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p12)
states: 428,436 (5)
abstracting: (p12<=1)
states: 3,942,839 (6)
abstracting: (1<=p15)
states: 417,981 (5)
abstracting: (p15<=1)
states: 3,942,839 (6)
abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p15)
states: 417,981 (5)
abstracting: (p15<=1)
states: 3,942,839 (6)
abstracting: (1<=p21)
states: 1,408,683 (6)
abstracting: (p21<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
.
EG iterations: 1
abstracting: (1<=p42)
states: 10,656 (4)
abstracting: (p42<=1)
states: 3,942,839 (6)
abstracting: (1<=p37)
states: 412,462 (5)
abstracting: (p37<=1)
states: 3,942,839 (6)
abstracting: (1<=p42)
states: 10,656 (4)
abstracting: (p42<=1)
states: 3,942,839 (6)
abstracting: (1<=p42)
states: 10,656 (4)
abstracting: (p42<=1)
states: 3,942,839 (6)
..........................................
EG iterations: 42
abstracting: (1<=p50)
states: 378,576 (5)
abstracting: (p50<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p37)
states: 412,462 (5)
abstracting: (p37<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p46)
states: 10,072 (4)
abstracting: (p46<=1)
states: 3,942,839 (6)
abstracting: (1<=p29)
states: 531,858 (5)
abstracting: (p29<=1)
states: 3,942,839 (6)
abstracting: (1<=p37)
states: 412,462 (5)
abstracting: (p37<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
.abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
..................................
EG iterations: 34
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.285sec

checking: AX [[[[p8<=1 & 1<=p8] | EF [[[[p78<=1 & 1<=p78] & [[p68<=1 & 1<=p68] & [p76<=1 & 1<=p76]]] | [[p54<=1 & 1<=p54] & [[p59<=1 & 1<=p59] & [p67<=1 & 1<=p67]]]]]] | [[[A [E [[p67<=1 & 1<=p67] U [[p4<=1 & 1<=p4] & [[p16<=1 & 1<=p16] & [p39<=1 & 1<=p39]]]] U ~ [AG [[[p27<=1 & 1<=p27] & [[p40<=1 & 1<=p40] & [p63<=1 & 1<=p63]]]]]] & AX [[p43<=0 & 0<=p43]]] & [[[[[p24<=1 & 1<=p24] & [p27<=1 & 1<=p27]] & [[p37<=1 & 1<=p37] & [p63<=1 & 1<=p63]]] | [[p41<=1 & 1<=p41] & [p62<=1 & 1<=p62]]] & [[[p10<=1 & 1<=p10] | [[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p67<=1 & 1<=p67]]]] | [[[p27<=1 & 1<=p27] & [[p40<=1 & 1<=p40] & [p63<=1 & 1<=p63]]] | [[p65<=1 & 1<=p65] & [p76<=1 & 1<=p76]]]]]] | [AG [[[[p77<=0 & 0<=p77] | [p29<=0 & 0<=p29]] | [[p40<=0 & 0<=p40] | [p63<=0 & 0<=p63]]]] & [E [[[p53<=1 & 1<=p53] & [[p59<=1 & 1<=p59] & [p68<=1 & 1<=p68]]] U [p66<=1 & 1<=p66]] & [p13<=1 & 1<=p13]]]]]]
normalized: ~ [EX [~ [[[[[[p13<=1 & 1<=p13] & E [[[[p68<=1 & 1<=p68] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]] U [p66<=1 & 1<=p66]]] & ~ [E [true U ~ [[[[p63<=0 & 0<=p63] | [p40<=0 & 0<=p40]] | [[p29<=0 & 0<=p29] | [p77<=0 & 0<=p77]]]]]]] | [[[[[[p76<=1 & 1<=p76] & [p65<=1 & 1<=p65]] | [[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p27<=1 & 1<=p27]]] | [[[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p53<=1 & 1<=p53]] | [p10<=1 & 1<=p10]]] & [[[p62<=1 & 1<=p62] & [p41<=1 & 1<=p41]] | [[[p63<=1 & 1<=p63] & [p37<=1 & 1<=p37]] & [[p27<=1 & 1<=p27] & [p24<=1 & 1<=p24]]]]] & [~ [EX [~ [[p43<=0 & 0<=p43]]]] & [~ [EG [~ [E [true U ~ [[[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p27<=1 & 1<=p27]]]]]]] & ~ [E [~ [E [true U ~ [[[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p27<=1 & 1<=p27]]]]] U [~ [E [[p67<=1 & 1<=p67] U [[[p39<=1 & 1<=p39] & [p16<=1 & 1<=p16]] & [p4<=1 & 1<=p4]]]] & ~ [E [true U ~ [[[[p63<=1 & 1<=p63] & [p40<=1 & 1<=p40]] & [p27<=1 & 1<=p27]]]]]]]]]]]] | [E [true U [[[[p67<=1 & 1<=p67] & [p59<=1 & 1<=p59]] & [p54<=1 & 1<=p54]] | [[[p76<=1 & 1<=p76] & [p68<=1 & 1<=p68]] & [p78<=1 & 1<=p78]]]] | [p8<=1 & 1<=p8]]]]]]

abstracting: (1<=p8)
states: 12,123 (4)
abstracting: (p8<=1)
states: 3,942,839 (6)
abstracting: (1<=p78)
states: 380,462 (5)
abstracting: (p78<=1)
states: 3,942,839 (6)
abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
abstracting: (1<=p54)
states: 572,134 (5)
abstracting: (p54<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p27<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p4)
states: 1,500,134 (6)
abstracting: (p4<=1)
states: 3,942,839 (6)
abstracting: (1<=p16)
states: 550,412 (5)
abstracting: (p16<=1)
states: 3,942,839 (6)
abstracting: (1<=p39)
states: 312,241 (5)
abstracting: (p39<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p27<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p27<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
.
EG iterations: 1
abstracting: (0<=p43)
states: 3,942,839 (6)
abstracting: (p43<=0)
states: 3,942,688 (6)
.abstracting: (1<=p24)
states: 521,490 (5)
abstracting: (p24<=1)
states: 3,942,839 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p27<=1)
states: 3,942,839 (6)
abstracting: (1<=p37)
states: 412,462 (5)
abstracting: (p37<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p41)
states: 395,431 (5)
abstracting: (p41<=1)
states: 3,942,839 (6)
abstracting: (1<=p62)
states: 527,060 (5)
abstracting: (p62<=1)
states: 3,942,839 (6)
abstracting: (1<=p10)
states: 530,615 (5)
abstracting: (p10<=1)
states: 3,942,839 (6)
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p67)
states: 387,648 (5)
abstracting: (p67<=1)
states: 3,942,839 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p27<=1)
states: 3,942,839 (6)
abstracting: (1<=p40)
states: 395,431 (5)
abstracting: (p40<=1)
states: 3,942,839 (6)
abstracting: (1<=p63)
states: 600,020 (5)
abstracting: (p63<=1)
states: 3,942,839 (6)
abstracting: (1<=p65)
states: 461,338 (5)
abstracting: (p65<=1)
states: 3,942,839 (6)
abstracting: (1<=p76)
states: 397,842 (5)
abstracting: (p76<=1)
states: 3,942,839 (6)
abstracting: (0<=p77)
states: 3,942,839 (6)
abstracting: (p77<=0)
states: 3,496,079 (6)
abstracting: (0<=p29)
states: 3,942,839 (6)
abstracting: (p29<=0)
states: 3,410,981 (6)
abstracting: (0<=p40)
states: 3,942,839 (6)
abstracting: (p40<=0)
states: 3,547,408 (6)
abstracting: (0<=p63)
states: 3,942,839 (6)
abstracting: (p63<=0)
states: 3,342,819 (6)
abstracting: (1<=p66)
states: 490,201 (5)
abstracting: (p66<=1)
states: 3,942,839 (6)
abstracting: (1<=p53)
states: 391,590 (5)
abstracting: (p53<=1)
states: 3,942,839 (6)
abstracting: (1<=p59)
states: 1,364,082 (6)
abstracting: (p59<=1)
states: 3,942,839 (6)
abstracting: (1<=p68)
states: 532,496 (5)
abstracting: (p68<=1)
states: 3,942,839 (6)
abstracting: (1<=p13)
states: 363,807 (5)
abstracting: (p13<=1)
states: 3,942,839 (6)
.-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.863sec

totally nodes used: 17701035 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17145819 45020222 62166041
used/not used/entry size/cache size: 40192933 26915931 16 1024MB
basic ops cache: hits/miss/sum: 4115588 9388614 13504202
used/not used/entry size/cache size: 10815801 5961415 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: 34469 117869 152338
used/not used/entry size/cache size: 117048 8271560 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 52623775
1 11800554
2 2227353
3 391754
4 57583
5 6989
6 766
7 80
8 10
9 0
>= 10 0

Total processing time: 0m29.804sec


BK_STOP 1679338404235

--------------------
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:36767 (399), effective:3467 (37)

initing FirstDep: 0m 0.000sec


iterations count:12176 (132), effective:1030 (11)

iterations count:8149 (88), effective:740 (8)

iterations count:188 (2), effective:9 (0)

iterations count:102 (1), effective:2 (0)

iterations count:118 (1), effective:6 (0)

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

iterations count:134 (1), effective:7 (0)

iterations count:3792 (41), effective:279 (3)

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

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

iterations count:12922 (140), effective:1153 (12)

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

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

iterations count:12922 (140), effective:1153 (12)

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

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

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

iterations count:12922 (140), effective:1153 (12)

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

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

iterations count:109 (1), effective:4 (0)

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

iterations count:4029 (43), effective:321 (3)

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

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

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

iterations count:115 (1), effective:2 (0)

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

iterations count:198 (2), effective:10 (0)

iterations count:1348 (14), effective:69 (0)

iterations count:111 (1), effective:3 (0)

iterations count:10030 (109), effective:735 (7)

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

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

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

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

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

iterations count:98 (1), effective:2 (0)

iterations count:10009 (108), effective:788 (8)

iterations count:128 (1), effective:2 (0)

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

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

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

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

iterations count:119 (1), effective:3 (0)

iterations count:12970 (140), effective:1163 (12)

iterations count:129 (1), effective:4 (0)

iterations count:1121 (12), effective:46 (0)

iterations count:129 (1), effective:4 (0)

iterations count:129 (1), effective:4 (0)

iterations count:8212 (89), effective:739 (8)

iterations count:92 (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="ShieldRVs-PT-002B"
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 ShieldRVs-PT-002B, 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 r426-tajo-167905978400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-002B.tgz
mv ShieldRVs-PT-002B 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 ;