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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7589.812 42453.00 49172.00 61.80 FFFFFTTFFFTTTTFF 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-167905978600201.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 ShieldRVt-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 22:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 ShieldRVt-PT-002B-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-002B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679346225460

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:03:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:03:47] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-20 21:03:47] [INFO ] Transformed 103 places.
[2023-03-20 21:03:47] [INFO ] Transformed 103 transitions.
[2023-03-20 21:03:47] [INFO ] Found NUPN structural information;
[2023-03-20 21:03:47] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 77 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 100 transition count 100
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 100 transition count 100
Applied a total of 6 rules in 15 ms. Remains 100 /103 variables (removed 3) and now considering 100/103 (removed 3) transitions.
// Phase 1: matrix 100 rows 100 cols
[2023-03-20 21:03:47] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-20 21:03:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-20 21:03:47] [INFO ] Invariant cache hit.
[2023-03-20 21:03:47] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-20 21:03:47] [INFO ] Invariant cache hit.
[2023-03-20 21:03:47] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 100/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 100/103 places, 100/103 transitions.
Support contains 77 out of 100 places after structural reductions.
[2023-03-20 21:03:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 21:03:47] [INFO ] Flatten gal took : 34 ms
[2023-03-20 21:03:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-002B-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 21:03:47] [INFO ] Flatten gal took : 24 ms
[2023-03-20 21:03:48] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 74 out of 100 places (down from 77) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 72) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 21:03:48] [INFO ] Invariant cache hit.
[2023-03-20 21:03:48] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:03:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 21:03:49] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-20 21:03:49] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 21:03:49] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 9 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 100/100 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 100 transition count 78
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 78 transition count 76
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 77 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 76 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 49 place count 76 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 65 place count 68 transition count 67
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 73 place count 60 transition count 59
Iterating global reduction 4 with 8 rules applied. Total rules applied 81 place count 60 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 81 place count 60 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 93 place count 54 transition count 53
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 131 place count 35 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 139 place count 31 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 31 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 30 transition count 34
Applied a total of 141 rules in 41 ms. Remains 30 /100 variables (removed 70) and now considering 34/100 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 30/100 places, 34/100 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Probably explored full state space saw : 2715 states, properties seen :0
Probabilistic random walk after 14228 steps, saw 2715 distinct states, run finished after 124 ms. (steps per millisecond=114 ) properties seen :0
Explored full state space saw : 2715 states, properties seen :0
Exhaustive walk after 14228 steps, saw 2715 distinct states, run finished after 54 ms. (steps per millisecond=263 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 69 out of 100 places (down from 72) after GAL structural reductions.
Computed a total of 29 stabilizing places and 29 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 99 transition count 70
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 70 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 69 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 61 place count 69 transition count 60
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 77 place count 61 transition count 60
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 89 place count 49 transition count 48
Iterating global reduction 3 with 12 rules applied. Total rules applied 101 place count 49 transition count 48
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 101 place count 49 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 115 place count 42 transition count 41
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 145 place count 27 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 24 transition count 24
Applied a total of 148 rules in 25 ms. Remains 24 /100 variables (removed 76) and now considering 24/100 (removed 76) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 24/100 places, 24/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 87 transition count 87
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 87 transition count 87
Applied a total of 26 rules in 6 ms. Remains 87 /100 variables (removed 13) and now considering 87/100 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 87/100 places, 87/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 88 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 88 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 87 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 87 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 86 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 86 transition count 86
Applied a total of 28 rules in 8 ms. Remains 86 /100 variables (removed 14) and now considering 86/100 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 86/100 places, 86/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 82 transition count 82
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Applied a total of 40 rules in 8 ms. Remains 80 /100 variables (removed 20) and now considering 80/100 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 80/100 places, 80/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 86 transition count 86
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 86 transition count 86
Applied a total of 28 rules in 5 ms. Remains 86 /100 variables (removed 14) and now considering 86/100 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 86/100 places, 86/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 79 transition count 79
Applied a total of 42 rules in 5 ms. Remains 79 /100 variables (removed 21) and now considering 79/100 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 79/100 places, 79/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 85 transition count 85
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 4 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 83/100 places, 83/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 100 transition count 71
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 71 transition count 69
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 70 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 69 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 63 place count 69 transition count 60
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 79 place count 61 transition count 60
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 90 place count 50 transition count 49
Iterating global reduction 4 with 11 rules applied. Total rules applied 101 place count 50 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 101 place count 50 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 44 transition count 43
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 147 place count 27 transition count 26
Applied a total of 147 rules in 8 ms. Remains 27 /100 variables (removed 73) and now considering 26/100 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 27/100 places, 26/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 82 transition count 82
Applied a total of 36 rules in 4 ms. Remains 82 /100 variables (removed 18) and now considering 82/100 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 82/100 places, 82/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 79 transition count 79
Applied a total of 42 rules in 3 ms. Remains 79 /100 variables (removed 21) and now considering 79/100 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 79/100 places, 79/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 2 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 83/100 places, 83/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 84 transition count 84
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 84 transition count 84
Applied a total of 32 rules in 2 ms. Remains 84 /100 variables (removed 16) and now considering 84/100 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/100 places, 84/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:03:49] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 79 transition count 79
Applied a total of 42 rules in 3 ms. Remains 79 /100 variables (removed 21) and now considering 79/100 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 79/100 places, 79/100 transitions.
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:49] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:50] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 85 transition count 85
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 83 transition count 83
Applied a total of 34 rules in 3 ms. Remains 83 /100 variables (removed 17) and now considering 83/100 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 83/100 places, 83/100 transitions.
[2023-03-20 21:03:50] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:50] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:50] [INFO ] Input system was already deterministic with 83 transitions.
[2023-03-20 21:03:50] [INFO ] Flatten gal took : 17 ms
[2023-03-20 21:03:50] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:03:50] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-20 21:03:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 100 transitions and 236 arcs took 1 ms.
Total runtime 2956 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 100 NrTr: 100 NrArc: 236)

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

net check time: 0m 0.000sec

init dd package: 0m 3.068sec


RS generation: 0m 0.182sec


-> reachability set: #nodes 11604 (1.2e+04) #states 149,571,176 (8)



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

checking: AF [AG [AG [~ [[p70<=1 & 1<=p70]]]]]
normalized: ~ [EG [E [true U E [true U [p70<=1 & 1<=p70]]]]]

abstracting: (1<=p70)
states: 16,495,348 (7)
abstracting: (p70<=1)
states: 149,571,176 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.484sec

checking: EG [EF [AX [[p54<=0 & 0<=p54]]]]
normalized: EG [E [true U ~ [EX [~ [[p54<=0 & 0<=p54]]]]]]

abstracting: (0<=p54)
states: 149,571,176 (8)
abstracting: (p54<=0)
states: 148,534,938 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: EF [[[p46<=1 & 1<=p46] | AX [AG [[p51<=1 & 1<=p51]]]]]
normalized: E [true U [~ [EX [E [true U ~ [[p51<=1 & 1<=p51]]]]] | [p46<=1 & 1<=p46]]]

abstracting: (1<=p46)
states: 17,725,006 (7)
abstracting: (p46<=1)
states: 149,571,176 (8)
abstracting: (1<=p51)
states: 210
abstracting: (p51<=1)
states: 149,571,176 (8)
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.537sec

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

abstracting: (0<=p0)
states: 149,571,176 (8)
abstracting: (p0<=0)
states: 149,571,175 (8)
abstracting: (1<=p55)
states: 10,200,816 (7)
abstracting: (p55<=1)
states: 149,571,176 (8)
..........................................
EG iterations: 42
...........................................
EG iterations: 43
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.981sec

checking: EX [AF [[EG [AF [[p67<=0 & 0<=p67]]] & AG [EX [[[p73<=0 & 0<=p73] | [p44<=1 & 1<=p44]]]]]]]
normalized: EX [~ [EG [~ [[EG [~ [EG [~ [[p67<=0 & 0<=p67]]]]] & ~ [E [true U ~ [EX [[[p44<=1 & 1<=p44] | [p73<=0 & 0<=p73]]]]]]]]]]]

abstracting: (0<=p73)
states: 149,571,176 (8)
abstracting: (p73<=0)
states: 133,075,828 (8)
abstracting: (1<=p44)
states: 17,725,006 (7)
abstracting: (p44<=1)
states: 149,571,176 (8)
.abstracting: (0<=p67)
states: 149,571,176 (8)
abstracting: (p67<=0)
states: 137,751,768 (8)
................................................
EG iterations: 48
..................
EG iterations: 18

EG iterations: 0
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.135sec

checking: AF [[EX [[E [[p77<=1 & 1<=p77] U [[p63<=0 & 0<=p63] | [p49<=1 & 1<=p49]]] & [p53<=0 & 0<=p53]]] & [p5<=1 & 1<=p5]]]
normalized: ~ [EG [~ [[[p5<=1 & 1<=p5] & EX [[[p53<=0 & 0<=p53] & E [[p77<=1 & 1<=p77] U [[p49<=1 & 1<=p49] | [p63<=0 & 0<=p63]]]]]]]]]

abstracting: (0<=p63)
states: 149,571,176 (8)
abstracting: (p63<=0)
states: 137,272,800 (8)
abstracting: (1<=p49)
states: 18,462,554 (7)
abstracting: (p49<=1)
states: 149,571,176 (8)
abstracting: (1<=p77)
states: 10,710 (4)
abstracting: (p77<=1)
states: 149,571,176 (8)
abstracting: (0<=p53)
states: 149,571,176 (8)
abstracting: (p53<=0)
states: 149,570,546 (8)
.abstracting: (1<=p5)
states: 5,173 (3)
abstracting: (p5<=1)
states: 149,571,176 (8)
.....................
EG iterations: 21
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.252sec

checking: EG [[[AG [[~ [[p86<=0 & 0<=p86]] & ~ [[p53<=1 & 1<=p53]]]] | AF [AX [AG [[[p19<=0 & 0<=p19] | [p68<=1 & 1<=p68]]]]]] | [[[p30<=0 & 0<=p30] & [p42<=1 & 1<=p42]] | [[p21<=0 & 0<=p21] & [p29<=1 & 1<=p29]]]]]
normalized: EG [[[[[p29<=1 & 1<=p29] & [p21<=0 & 0<=p21]] | [[p42<=1 & 1<=p42] & [p30<=0 & 0<=p30]]] | [~ [EG [EX [E [true U ~ [[[p68<=1 & 1<=p68] | [p19<=0 & 0<=p19]]]]]]] | ~ [E [true U ~ [[~ [[p53<=1 & 1<=p53]] & ~ [[p86<=0 & 0<=p86]]]]]]]]]

abstracting: (0<=p86)
states: 149,571,176 (8)
abstracting: (p86<=0)
states: 131,650,411 (8)
abstracting: (1<=p53)
states: 630
abstracting: (p53<=1)
states: 149,571,176 (8)
abstracting: (0<=p19)
states: 149,571,176 (8)
abstracting: (p19<=0)
states: 143,500,480 (8)
abstracting: (1<=p68)
states: 16,495,348 (7)
abstracting: (p68<=1)
states: 149,571,176 (8)
....................................
EG iterations: 35
abstracting: (0<=p30)
states: 149,571,176 (8)
abstracting: (p30<=0)
states: 139,964,154 (8)
abstracting: (1<=p42)
states: 17,725,006 (7)
abstracting: (p42<=1)
states: 149,571,176 (8)
abstracting: (0<=p21)
states: 149,571,176 (8)
abstracting: (p21<=0)
states: 132,387,718 (8)
abstracting: (1<=p29)
states: 263,823 (5)
abstracting: (p29<=1)
states: 149,571,176 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.752sec

checking: AG [[[[p90<=0 & 0<=p90] | [p28<=1 & 1<=p28]] | [[EX [[[p98<=0 & 0<=p98] | [p87<=1 & 1<=p87]]] & AF [[p20<=1 & 1<=p20]]] | [[[p42<=0 & 0<=p42] | [p86<=1 & 1<=p86]] & [[p97<=1 & 1<=p97] | [[p0<=0 & 0<=p0] | [p11<=1 & 1<=p11]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p11<=1 & 1<=p11] | [p0<=0 & 0<=p0]] | [p97<=1 & 1<=p97]] & [[p86<=1 & 1<=p86] | [p42<=0 & 0<=p42]]] | [~ [EG [~ [[p20<=1 & 1<=p20]]]] & EX [[[p87<=1 & 1<=p87] | [p98<=0 & 0<=p98]]]]] | [[p28<=1 & 1<=p28] | [p90<=0 & 0<=p90]]]]]]

abstracting: (0<=p90)
states: 149,571,176 (8)
abstracting: (p90<=0)
states: 138,916,558 (8)
abstracting: (1<=p28)
states: 13,115,878 (7)
abstracting: (p28<=1)
states: 149,571,176 (8)
abstracting: (0<=p98)
states: 149,571,176 (8)
abstracting: (p98<=0)
states: 131,262,363 (8)
abstracting: (1<=p87)
states: 10,710 (4)
abstracting: (p87<=1)
states: 149,571,176 (8)
.abstracting: (1<=p20)
states: 13,115,878 (7)
abstracting: (p20<=1)
states: 149,571,176 (8)
............................
EG iterations: 28
abstracting: (0<=p42)
states: 149,571,176 (8)
abstracting: (p42<=0)
states: 131,846,170 (8)
abstracting: (1<=p86)
states: 17,920,765 (7)
abstracting: (p86<=1)
states: 149,571,176 (8)
abstracting: (1<=p97)
states: 17,388,295 (7)
abstracting: (p97<=1)
states: 149,571,176 (8)
abstracting: (0<=p0)
states: 149,571,176 (8)
abstracting: (p0<=0)
states: 149,571,175 (8)
abstracting: (1<=p11)
states: 15,934,820 (7)
abstracting: (p11<=1)
states: 149,571,176 (8)
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.855sec

checking: E [[~ [[EG [[AX [[p20<=1 & 1<=p20]] | [[p6<=1 & 1<=p6] | [p70<=1 & 1<=p70]]]] & ~ [[[p3<=0 & 0<=p3] | [[p74<=0 & 0<=p74] | [p42<=1 & 1<=p42]]]]]] & [[p33<=0 & 0<=p33] | [p90<=1 & 1<=p90]]] U EG [~ [E [~ [[[p48<=1 & 1<=p48] | [p64<=0 & 0<=p64]]] U [p60<=1 & 1<=p60]]]]]
normalized: E [[~ [[~ [[[[p42<=1 & 1<=p42] | [p74<=0 & 0<=p74]] | [p3<=0 & 0<=p3]]] & EG [[[[p70<=1 & 1<=p70] | [p6<=1 & 1<=p6]] | ~ [EX [~ [[p20<=1 & 1<=p20]]]]]]]] & [[p90<=1 & 1<=p90] | [p33<=0 & 0<=p33]]] U EG [~ [E [~ [[[p64<=0 & 0<=p64] | [p48<=1 & 1<=p48]]] U [p60<=1 & 1<=p60]]]]]

abstracting: (1<=p60)
states: 13,686,938 (7)
abstracting: (p60<=1)
states: 149,571,176 (8)
abstracting: (1<=p48)
states: 15,415,282 (7)
abstracting: (p48<=1)
states: 149,571,176 (8)
abstracting: (0<=p64)
states: 149,571,176 (8)
abstracting: (p64<=0)
states: 135,483,726 (8)
.
EG iterations: 1
abstracting: (0<=p33)
states: 149,571,176 (8)
abstracting: (p33<=0)
states: 131,900,745 (8)
abstracting: (1<=p90)
states: 10,654,618 (7)
abstracting: (p90<=1)
states: 149,571,176 (8)
abstracting: (1<=p20)
states: 13,115,878 (7)
abstracting: (p20<=1)
states: 149,571,176 (8)
.abstracting: (1<=p6)
states: 5,173 (3)
abstracting: (p6<=1)
states: 149,571,176 (8)
abstracting: (1<=p70)
states: 16,495,348 (7)
abstracting: (p70<=1)
states: 149,571,176 (8)
................................................
EG iterations: 48
abstracting: (0<=p3)
states: 149,571,176 (8)
abstracting: (p3<=0)
states: 103,044,709 (8)
abstracting: (0<=p74)
states: 149,571,176 (8)
abstracting: (p74<=0)
states: 132,340,197 (8)
abstracting: (1<=p42)
states: 17,725,006 (7)
abstracting: (p42<=1)
states: 149,571,176 (8)
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.683sec

checking: EG [[EX [[[p16<=0 & 0<=p16] | [p88<=1 & 1<=p88]]] | [[[[p83<=0 & 0<=p83] | [p75<=1 & 1<=p75]] & [[p68<=0 & 0<=p68] | [p58<=1 & 1<=p58]]] | [AG [A [AF [[p83<=1 & 1<=p83]] U [[p7<=0 & 0<=p7] & [p94<=0 & 0<=p94]]]] & E [AG [[[p55<=0 & 0<=p55] & [p24<=1 & 1<=p24]]] U [p82<=1 & 1<=p82]]]]]]
normalized: EG [[[[E [~ [E [true U ~ [[[p24<=1 & 1<=p24] & [p55<=0 & 0<=p55]]]]] U [p82<=1 & 1<=p82]] & ~ [E [true U ~ [[~ [EG [~ [[[p94<=0 & 0<=p94] & [p7<=0 & 0<=p7]]]]] & ~ [E [~ [[[p94<=0 & 0<=p94] & [p7<=0 & 0<=p7]]] U [EG [~ [[p83<=1 & 1<=p83]]] & ~ [[[p94<=0 & 0<=p94] & [p7<=0 & 0<=p7]]]]]]]]]]] | [[[p58<=1 & 1<=p58] | [p68<=0 & 0<=p68]] & [[p75<=1 & 1<=p75] | [p83<=0 & 0<=p83]]]] | EX [[[p88<=1 & 1<=p88] | [p16<=0 & 0<=p16]]]]]

abstracting: (0<=p16)
states: 149,571,176 (8)
abstracting: (p16<=0)
states: 133,636,356 (8)
abstracting: (1<=p88)
states: 10,710 (4)
abstracting: (p88<=1)
states: 149,571,176 (8)
.abstracting: (0<=p83)
states: 149,571,176 (8)
abstracting: (p83<=0)
states: 131,876,539 (8)
abstracting: (1<=p75)
states: 11,819,408 (7)
abstracting: (p75<=1)
states: 149,571,176 (8)
abstracting: (0<=p68)
states: 149,571,176 (8)
abstracting: (p68<=0)
states: 133,075,828 (8)
abstracting: (1<=p58)
states: 13,686,938 (7)
abstracting: (p58<=1)
states: 149,571,176 (8)
abstracting: (0<=p7)
states: 149,571,176 (8)
abstracting: (p7<=0)
states: 149,555,657 (8)
abstracting: (0<=p94)
states: 149,571,176 (8)
abstracting: (p94<=0)
states: 131,568,813 (8)
abstracting: (1<=p83)
states: 17,694,637 (7)
abstracting: (p83<=1)
states: 149,571,176 (8)
...........................................................
EG iterations: 59
abstracting: (0<=p7)
states: 149,571,176 (8)
abstracting: (p7<=0)
states: 149,555,657 (8)
abstracting: (0<=p94)
states: 149,571,176 (8)
abstracting: (p94<=0)
states: 131,568,813 (8)
abstracting: (0<=p7)
states: 149,571,176 (8)
abstracting: (p7<=0)
states: 149,555,657 (8)
abstracting: (0<=p94)
states: 149,571,176 (8)
abstracting: (p94<=0)
states: 131,568,813 (8)
.............................................................................
EG iterations: 77
abstracting: (1<=p82)
states: 17,694,637 (7)
abstracting: (p82<=1)
states: 149,571,176 (8)
abstracting: (0<=p55)
states: 149,571,176 (8)
abstracting: (p55<=0)
states: 139,370,360 (8)
abstracting: (1<=p24)
states: 17,183,458 (7)
abstracting: (p24<=1)
states: 149,571,176 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.837sec

checking: AF [[EX [0<=0] & [A [[EG [[[p3<=0 & 0<=p3] | [p46<=1 & 1<=p46]]] | [A [[p5<=0 & 0<=p5] U [p89<=1 & 1<=p89]] | ~ [[[p88<=0 & 0<=p88] | [p68<=1 & 1<=p68]]]]] U [p86<=1 & 1<=p86]] & E [[p0<=1 & 1<=p0] U [EX [~ [[[p23<=0 & 0<=p23] | [p73<=1 & 1<=p73]]]] | [~ [[[p37<=0 & 0<=p37] | [p11<=1 & 1<=p11]]] | ~ [[p7<=1 & 1<=p7]]]]]]]]
normalized: ~ [EG [~ [[[E [[p0<=1 & 1<=p0] U [[~ [[p7<=1 & 1<=p7]] | ~ [[[p11<=1 & 1<=p11] | [p37<=0 & 0<=p37]]]] | EX [~ [[[p73<=1 & 1<=p73] | [p23<=0 & 0<=p23]]]]]] & [~ [EG [~ [[p86<=1 & 1<=p86]]]] & ~ [E [~ [[p86<=1 & 1<=p86]] U [~ [[[~ [[[p68<=1 & 1<=p68] | [p88<=0 & 0<=p88]]] | [~ [EG [~ [[p89<=1 & 1<=p89]]]] & ~ [E [~ [[p89<=1 & 1<=p89]] U [~ [[p5<=0 & 0<=p5]] & ~ [[p89<=1 & 1<=p89]]]]]]] | EG [[[p46<=1 & 1<=p46] | [p3<=0 & 0<=p3]]]]] & ~ [[p86<=1 & 1<=p86]]]]]]] & EX [0<=0]]]]]

abstracting: (0<=0)
states: 149,571,176 (8)
.abstracting: (1<=p86)
states: 17,920,765 (7)
abstracting: (p86<=1)
states: 149,571,176 (8)
abstracting: (0<=p3)
states: 149,571,176 (8)
abstracting: (p3<=0)
states: 103,044,709 (8)
abstracting: (1<=p46)
states: 17,725,006 (7)
abstracting: (p46<=1)
states: 149,571,176 (8)
.......................................................
EG iterations: 55
abstracting: (1<=p89)
states: 14,490 (4)
abstracting: (p89<=1)
states: 149,571,176 (8)
abstracting: (0<=p5)
states: 149,571,176 (8)
abstracting: (p5<=0)
states: 149,566,003 (8)
abstracting: (1<=p89)
states: 14,490 (4)
abstracting: (p89<=1)
states: 149,571,176 (8)
abstracting: (1<=p89)
states: 14,490 (4)
abstracting: (p89<=1)
states: 149,571,176 (8)
....................
EG iterations: 20
abstracting: (0<=p88)
states: 149,571,176 (8)
abstracting: (p88<=0)
states: 149,560,466 (8)
abstracting: (1<=p68)
states: 16,495,348 (7)
abstracting: (p68<=1)
states: 149,571,176 (8)
abstracting: (1<=p86)
states: 17,920,765 (7)
abstracting: (p86<=1)
states: 149,571,176 (8)
abstracting: (1<=p86)
states: 17,920,765 (7)
abstracting: (p86<=1)
states: 149,571,176 (8)
................................................
EG iterations: 48
abstracting: (0<=p23)
states: 149,571,176 (8)
abstracting: (p23<=0)
states: 132,387,718 (8)
abstracting: (1<=p73)
states: 16,495,348 (7)
abstracting: (p73<=1)
states: 149,571,176 (8)
.abstracting: (0<=p37)
states: 149,571,176 (8)
abstracting: (p37<=0)
states: 132,401,420 (8)
abstracting: (1<=p11)
states: 15,934,820 (7)
abstracting: (p11<=1)
states: 149,571,176 (8)
abstracting: (1<=p7)
states: 15,519 (4)
abstracting: (p7<=1)
states: 149,571,176 (8)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 149,571,176 (8)
..............................................
EG iterations: 46
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.253sec

checking: [AF [~ [E [[p6<=0 & 0<=p6] U [p25<=0 & 0<=p25]]]] & [EF [[[p29<=0 & 0<=p29] & [p46<=1 & 1<=p46]]] & E [~ [[[A [[EF [[p63<=0 & 0<=p63]] | AX [[p44<=1 & 1<=p44]]] U ~ [[[p58<=0 & 0<=p58] | [p30<=1 & 1<=p30]]]] | EF [AX [[[p99<=0 & 0<=p99] | [p32<=1 & 1<=p32]]]]] | [[p13<=0 & 0<=p13] | [[p71<=1 & 1<=p71] | [p25<=1 & 1<=p25]]]]] U [AG [EX [EF [[[p1<=0 & 0<=p1] | [p43<=1 & 1<=p43]]]]] | ~ [[[p52<=1 & 1<=p52] | ~ [[[p84<=0 & 0<=p84] | [p2<=1 & 1<=p2]]]]]]]]]
normalized: [[E [~ [[[[[p25<=1 & 1<=p25] | [p71<=1 & 1<=p71]] | [p13<=0 & 0<=p13]] | [E [true U ~ [EX [~ [[[p32<=1 & 1<=p32] | [p99<=0 & 0<=p99]]]]]] | [~ [EG [[[p30<=1 & 1<=p30] | [p58<=0 & 0<=p58]]]] & ~ [E [[[p30<=1 & 1<=p30] | [p58<=0 & 0<=p58]] U [~ [[~ [EX [~ [[p44<=1 & 1<=p44]]]] | E [true U [p63<=0 & 0<=p63]]]] & [[p30<=1 & 1<=p30] | [p58<=0 & 0<=p58]]]]]]]]] U [~ [E [true U ~ [EX [E [true U [[p43<=1 & 1<=p43] | [p1<=0 & 0<=p1]]]]]]] | ~ [[~ [[[p2<=1 & 1<=p2] | [p84<=0 & 0<=p84]]] | [p52<=1 & 1<=p52]]]]] & E [true U [[p46<=1 & 1<=p46] & [p29<=0 & 0<=p29]]]] & ~ [EG [E [[p6<=0 & 0<=p6] U [p25<=0 & 0<=p25]]]]]

abstracting: (0<=p25)
states: 149,571,176 (8)
abstracting: (p25<=0)
states: 132,387,718 (8)
abstracting: (0<=p6)
states: 149,571,176 (8)
abstracting: (p6<=0)
states: 149,566,003 (8)

EG iterations: 0
abstracting: (0<=p29)
states: 149,571,176 (8)
abstracting: (p29<=0)
states: 149,307,353 (8)
abstracting: (1<=p46)
states: 17,725,006 (7)
abstracting: (p46<=1)
states: 149,571,176 (8)
abstracting: (1<=p52)
states: 210
abstracting: (p52<=1)
states: 149,571,176 (8)
abstracting: (0<=p84)
states: 149,571,176 (8)
abstracting: (p84<=0)
states: 131,876,539 (8)
abstracting: (1<=p2)
states: 54,014,126 (7)
abstracting: (p2<=1)
states: 149,571,176 (8)
abstracting: (0<=p1)
states: 149,571,176 (8)
abstracting: (p1<=0)
states: 149,566,003 (8)
abstracting: (1<=p43)
states: 14,069,792 (7)
abstracting: (p43<=1)
states: 149,571,176 (8)
.abstracting: (0<=p58)
states: 149,571,176 (8)
abstracting: (p58<=0)
states: 135,884,238 (8)
abstracting: (1<=p30)
states: 9,607,022 (6)
abstracting: (p30<=1)
states: 149,571,176 (8)
abstracting: (0<=p63)
states: 149,571,176 (8)
abstracting: (p63<=0)
states: 137,272,800 (8)
abstracting: (1<=p44)
states: 17,725,006 (7)
abstracting: (p44<=1)
states: 149,571,176 (8)
.abstracting: (0<=p58)
states: 149,571,176 (8)
abstracting: (p58<=0)
states: 135,884,238 (8)
abstracting: (1<=p30)
states: 9,607,022 (6)
abstracting: (p30<=1)
states: 149,571,176 (8)
abstracting: (0<=p58)
states: 149,571,176 (8)
abstracting: (p58<=0)
states: 135,884,238 (8)
abstracting: (1<=p30)
states: 9,607,022 (6)
abstracting: (p30<=1)
states: 149,571,176 (8)
............................................
EG iterations: 44
abstracting: (0<=p99)
states: 149,571,176 (8)
abstracting: (p99<=0)
states: 149,556,686 (8)
abstracting: (1<=p32)
states: 15,225,989 (7)
abstracting: (p32<=1)
states: 149,571,176 (8)
.abstracting: (0<=p13)
states: 149,571,176 (8)
abstracting: (p13<=0)
states: 133,636,356 (8)
abstracting: (1<=p71)
states: 16,495,348 (7)
abstracting: (p71<=1)
states: 149,571,176 (8)
abstracting: (1<=p25)
states: 17,183,458 (7)
abstracting: (p25<=1)
states: 149,571,176 (8)
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.820sec

checking: [[E [AF [[p82<=1 & 1<=p82]] U [[p46<=1 & 1<=p46] & [[E [[[p81<=0 & 0<=p81] | [[p88<=1 & 1<=p88] | [p40<=0 & 0<=p40]]] U ~ [[[p81<=0 & 0<=p81] | [p20<=1 & 1<=p20]]]] & AG [[p30<=1 & 1<=p30]]] | EF [[p59<=1 & 1<=p59]]]]] & AX [EG [AX [AF [[[p79<=0 & 0<=p79] | [p69<=1 & 1<=p69]]]]]]] & [A [[[p88<=0 & 0<=p88] | [p54<=1 & 1<=p54]] U [EF [[[p69<=0 & 0<=p69] | [[p48<=0 & 0<=p48] | [p97<=1 & 1<=p97]]]] & ~ [EX [[p62<=1 & 1<=p62]]]]] & AF [EG [[[p38<=0 & 0<=p38] | [p27<=1 & 1<=p27]]]]]]
normalized: [[~ [EX [~ [EG [~ [EX [EG [~ [[[p79<=0 & 0<=p79] | [p69<=1 & 1<=p69]]]]]]]]]] & E [~ [EG [~ [[p82<=1 & 1<=p82]]]] U [[E [true U [p59<=1 & 1<=p59]] | [~ [E [true U ~ [[p30<=1 & 1<=p30]]]] & E [[[[p40<=0 & 0<=p40] | [p88<=1 & 1<=p88]] | [p81<=0 & 0<=p81]] U ~ [[[p20<=1 & 1<=p20] | [p81<=0 & 0<=p81]]]]]] & [p46<=1 & 1<=p46]]]] & [[~ [EG [~ [[~ [EX [[p62<=1 & 1<=p62]]] & E [true U [[[p97<=1 & 1<=p97] | [p48<=0 & 0<=p48]] | [p69<=0 & 0<=p69]]]]]]] & ~ [E [~ [[~ [EX [[p62<=1 & 1<=p62]]] & E [true U [[[p97<=1 & 1<=p97] | [p48<=0 & 0<=p48]] | [p69<=0 & 0<=p69]]]]] U [~ [[~ [EX [[p62<=1 & 1<=p62]]] & E [true U [[[p97<=1 & 1<=p97] | [p48<=0 & 0<=p48]] | [p69<=0 & 0<=p69]]]]] & ~ [[[p54<=1 & 1<=p54] | [p88<=0 & 0<=p88]]]]]]] & ~ [EG [~ [EG [[[p27<=1 & 1<=p27] | [p38<=0 & 0<=p38]]]]]]]]

abstracting: (0<=p38)
states: 149,571,176 (8)
abstracting: (p38<=0)
states: 131,092,753 (8)
abstracting: (1<=p27)
states: 18,725,036 (7)
abstracting: (p27<=1)
states: 149,571,176 (8)
.......................................................................................................
EG iterations: 103
..............................................................................
EG iterations: 78
abstracting: (0<=p88)
states: 149,571,176 (8)
abstracting: (p88<=0)
states: 149,560,466 (8)
abstracting: (1<=p54)
states: 1,036,238 (6)
abstracting: (p54<=1)
states: 149,571,176 (8)
abstracting: (0<=p69)
states: 149,571,176 (8)
abstracting: (p69<=0)
states: 136,203,232 (8)
abstracting: (0<=p48)
states: 149,571,176 (8)
abstracting: (p48<=0)
states: 134,155,894 (8)
abstracting: (1<=p97)
states: 17,388,295 (7)
abstracting: (p97<=1)
states: 149,571,176 (8)
abstracting: (1<=p62)
states: 13,686,938 (7)
abstracting: (p62<=1)
states: 149,571,176 (8)
.abstracting: (0<=p69)
states: 149,571,176 (8)
abstracting: (p69<=0)
states: 136,203,232 (8)
abstracting: (0<=p48)
states: 149,571,176 (8)
abstracting: (p48<=0)
states: 134,155,894 (8)
abstracting: (1<=p97)
states: 17,388,295 (7)
abstracting: (p97<=1)
states: 149,571,176 (8)
abstracting: (1<=p62)
states: 13,686,938 (7)
abstracting: (p62<=1)
states: 149,571,176 (8)
.abstracting: (0<=p69)
states: 149,571,176 (8)
abstracting: (p69<=0)
states: 136,203,232 (8)
abstracting: (0<=p48)
states: 149,571,176 (8)
abstracting: (p48<=0)
states: 134,155,894 (8)
abstracting: (1<=p97)
states: 17,388,295 (7)
abstracting: (p97<=1)
states: 149,571,176 (8)
abstracting: (1<=p62)
states: 13,686,938 (7)
abstracting: (p62<=1)
states: 149,571,176 (8)
............................................
EG iterations: 43
abstracting: (1<=p46)
states: 17,725,006 (7)
abstracting: (p46<=1)
states: 149,571,176 (8)
abstracting: (0<=p81)
states: 149,571,176 (8)
abstracting: (p81<=0)
states: 131,876,539 (8)
abstracting: (1<=p20)
states: 13,115,878 (7)
abstracting: (p20<=1)
states: 149,571,176 (8)
abstracting: (0<=p81)
states: 149,571,176 (8)
abstracting: (p81<=0)
states: 131,876,539 (8)
abstracting: (1<=p88)
states: 10,710 (4)
abstracting: (p88<=1)
states: 149,571,176 (8)
abstracting: (0<=p40)
states: 149,571,176 (8)
abstracting: (p40<=0)
states: 149,214,239 (8)
abstracting: (1<=p30)
states: 9,607,022 (6)
abstracting: (p30<=1)
states: 149,571,176 (8)
abstracting: (1<=p59)
states: 13,686,938 (7)
abstracting: (p59<=1)
states: 149,571,176 (8)
abstracting: (1<=p82)
states: 17,694,637 (7)
abstracting: (p82<=1)
states: 149,571,176 (8)
.
EG iterations: 1
abstracting: (1<=p69)
states: 13,367,944 (7)
abstracting: (p69<=1)
states: 149,571,176 (8)
abstracting: (0<=p79)
states: 149,571,176 (8)
abstracting: (p79<=0)
states: 131,876,539 (8)
...............................................
EG iterations: 47
..
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.224sec

checking: AX [[EF [[[p43<=0 & 0<=p43] | [p23<=1 & 1<=p23]]] & [E [E [~ [[[p68<=0 & 0<=p68] & [p73<=0 & 0<=p73]]] U AX [[p43<=1 & 1<=p43]]] U [AF [AX [[p0<=1 & 1<=p0]]] & E [[[p39<=1 & 1<=p39] & [p97<=1 & 1<=p97]] U [[p41<=0 & 0<=p41] | [p43<=1 & 1<=p43]]]]] & [[E [[[[p86<=0 & 0<=p86] | [p68<=1 & 1<=p68]] & EX [[[p94<=0 & 0<=p94] | [p61<=1 & 1<=p61]]]] U E [[p86<=1 & 1<=p86] U [p7<=0 & 0<=p7]]] | AG [[[p78<=0 & 0<=p78] | [p30<=1 & 1<=p30]]]] | [[p42<=0 & 0<=p42] | [1<=p3 & p3<=1]]]]]]
normalized: ~ [EX [~ [[[E [E [~ [[[p73<=0 & 0<=p73] & [p68<=0 & 0<=p68]]] U ~ [EX [~ [[p43<=1 & 1<=p43]]]]] U [E [[[p39<=1 & 1<=p39] & [p97<=1 & 1<=p97]] U [[p43<=1 & 1<=p43] | [p41<=0 & 0<=p41]]] & ~ [EG [EX [~ [[p0<=1 & 1<=p0]]]]]]] & [[E [[EX [[[p61<=1 & 1<=p61] | [p94<=0 & 0<=p94]]] & [[p68<=1 & 1<=p68] | [p86<=0 & 0<=p86]]] U E [[p86<=1 & 1<=p86] U [p7<=0 & 0<=p7]]] | ~ [E [true U ~ [[[p30<=1 & 1<=p30] | [p78<=0 & 0<=p78]]]]]] | [[1<=p3 & p3<=1] | [p42<=0 & 0<=p42]]]] & E [true U [[p23<=1 & 1<=p23] | [p43<=0 & 0<=p43]]]]]]]

abstracting: (0<=p43)
states: 149,571,176 (8)
abstracting: (p43<=0)
states: 135,501,384 (8)
abstracting: (1<=p23)
states: 17,183,458 (7)
abstracting: (p23<=1)
states: 149,571,176 (8)
abstracting: (0<=p42)
states: 149,571,176 (8)
abstracting: (p42<=0)
states: 131,846,170 (8)
abstracting: (p3<=1)
states: 149,571,176 (8)
abstracting: (1<=p3)
states: 46,526,467 (7)
abstracting: (0<=p78)
states: 149,571,176 (8)
abstracting: (p78<=0)
states: 141,613,230 (8)
abstracting: (1<=p30)
states: 9,607,022 (6)
abstracting: (p30<=1)
states: 149,571,176 (8)
abstracting: (0<=p7)
states: 149,571,176 (8)
abstracting: (p7<=0)
states: 149,555,657 (8)
abstracting: (1<=p86)
states: 17,920,765 (7)
abstracting: (p86<=1)
states: 149,571,176 (8)
abstracting: (0<=p86)
states: 149,571,176 (8)
abstracting: (p86<=0)
states: 131,650,411 (8)
abstracting: (1<=p68)
states: 16,495,348 (7)
abstracting: (p68<=1)
states: 149,571,176 (8)
abstracting: (0<=p94)
states: 149,571,176 (8)
abstracting: (p94<=0)
states: 131,568,813 (8)
abstracting: (1<=p61)
states: 13,686,938 (7)
abstracting: (p61<=1)
states: 149,571,176 (8)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 149,571,176 (8)
.............................................
EG iterations: 44
abstracting: (0<=p41)
states: 149,571,176 (8)
abstracting: (p41<=0)
states: 137,302,052 (8)
abstracting: (1<=p43)
states: 14,069,792 (7)
abstracting: (p43<=1)
states: 149,571,176 (8)
abstracting: (1<=p97)
states: 17,388,295 (7)
abstracting: (p97<=1)
states: 149,571,176 (8)
abstracting: (1<=p39)
states: 263,823 (5)
abstracting: (p39<=1)
states: 149,571,176 (8)
abstracting: (1<=p43)
states: 14,069,792 (7)
abstracting: (p43<=1)
states: 149,571,176 (8)
.abstracting: (0<=p68)
states: 149,571,176 (8)
abstracting: (p68<=0)
states: 133,075,828 (8)
abstracting: (0<=p73)
states: 149,571,176 (8)
abstracting: (p73<=0)
states: 133,075,828 (8)
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.140sec

totally nodes used: 29566094 (3.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 26999844 59223506 86223350
used/not used/entry size/cache size: 48897151 18211713 16 1024MB
basic ops cache: hits/miss/sum: 4911895 9554739 14466634
used/not used/entry size/cache size: 11101120 5676096 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: 57333 164374 221707
used/not used/entry size/cache size: 162799 8225809 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 44157937
1 17545186
2 4380834
3 864325
4 139321
5 18826
6 2216
7 199
8 18
9 2
>= 10 0

Total processing time: 0m37.563sec


BK_STOP 1679346267913

--------------------
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 CTLCardinality -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:6667 (66), effective:1009 (10)

initing FirstDep: 0m 0.000sec


iterations count:1268 (12), effective:142 (1)

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

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

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

iterations count:2136 (21), effective:258 (2)

iterations count:4249 (42), effective:575 (5)

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

iterations count:448 (4), effective:32 (0)

iterations count:138 (1), effective:8 (0)

iterations count:2443 (24), effective:329 (3)

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

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

iterations count:540 (5), effective:44 (0)

iterations count:2044 (20), effective:251 (2)

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

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

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

iterations count:1262 (12), effective:175 (1)

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

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

iterations count:1576 (15), effective:191 (1)

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

iterations count:2766 (27), effective:362 (3)

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

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

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

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

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

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

iterations count:559 (5), effective:50 (0)

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

iterations count:1932 (19), effective:237 (2)

iterations count:824 (8), effective:98 (0)

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

iterations count:2159 (21), effective:263 (2)

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

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

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

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

iterations count:100 (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="ShieldRVt-PT-002B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVt-PT-002B, examination is CTLCardinality"
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-167905978600201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002B.tgz
mv ShieldRVt-PT-002B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;