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-167905978400041.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-003B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.3K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 18:26 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 36K 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-003B-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-003B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679338377825

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=ShieldRVs-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:59] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-20 18:52:59] [INFO ] Transformed 123 places.
[2023-03-20 18:52:59] [INFO ] Transformed 138 transitions.
[2023-03-20 18:52:59] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:59] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-003B-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 117 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 117 transition count 132
Applied a total of 12 rules in 18 ms. Remains 117 /123 variables (removed 6) and now considering 132/138 (removed 6) transitions.
// Phase 1: matrix 132 rows 117 cols
[2023-03-20 18:52:59] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-20 18:52:59] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-20 18:52:59] [INFO ] Invariant cache hit.
[2023-03-20 18:53:00] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-20 18:53:00] [INFO ] Invariant cache hit.
[2023-03-20 18:53:00] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/123 places, 132/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 117/123 places, 132/138 transitions.
Support contains 73 out of 117 places after structural reductions.
[2023-03-20 18:53:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 18:53:00] [INFO ] Flatten gal took : 47 ms
[2023-03-20 18:53:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-003B-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:53:00] [INFO ] Flatten gal took : 15 ms
[2023-03-20 18:53:00] [INFO ] Input system was already deterministic with 132 transitions.
Support contains 66 out of 117 places (down from 73) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 52) seen :50
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:53:00] [INFO ] Invariant cache hit.
[2023-03-20 18:53:00] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:53:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-20 18:53:00] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 18:53:00] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2023-03-20 18:53:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 353 ms
[2023-03-20 18:53:01] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 18:53:01] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 132/132 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 117 transition count 120
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 105 transition count 120
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 105 transition count 106
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 91 transition count 106
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 65 place count 78 transition count 93
Iterating global reduction 2 with 13 rules applied. Total rules applied 78 place count 78 transition count 93
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 78 place count 78 transition count 88
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 88 place count 73 transition count 88
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 138 place count 48 transition count 63
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 48 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 47 transition count 62
Applied a total of 147 rules in 41 ms. Remains 47 /117 variables (removed 70) and now considering 62/132 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 47/117 places, 62/132 transitions.
Finished random walk after 2765 steps, including 45 resets, run visited all 1 properties in 12 ms. (steps per millisecond=230 )
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 132 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 116 transition count 119
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 104 transition count 119
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 104 transition count 105
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 90 transition count 105
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 65 place count 77 transition count 92
Iterating global reduction 2 with 13 rules applied. Total rules applied 78 place count 77 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 78 place count 77 transition count 87
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 88 place count 72 transition count 87
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 136 place count 48 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 46 transition count 61
Applied a total of 138 rules in 19 ms. Remains 46 /117 variables (removed 71) and now considering 61/132 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 46/117 places, 61/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 103 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 102 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 102 transition count 117
Applied a total of 30 rules in 8 ms. Remains 102 /117 variables (removed 15) and now considering 117/132 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 102/117 places, 117/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 13 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 107 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 107 transition count 122
Applied a total of 20 rules in 5 ms. Remains 107 /117 variables (removed 10) and now considering 122/132 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 107/117 places, 122/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 117
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 101 transition count 116
Applied a total of 32 rules in 8 ms. Remains 101 /117 variables (removed 16) and now considering 116/132 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 101/117 places, 116/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 132/132 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 116 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 107 transition count 122
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 18 place count 107 transition count 106
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 50 place count 91 transition count 106
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 64 place count 77 transition count 92
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 77 transition count 92
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 78 place count 77 transition count 87
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 88 place count 72 transition count 87
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 128 place count 52 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 50 transition count 65
Applied a total of 130 rules in 17 ms. Remains 50 /117 variables (removed 67) and now considering 65/132 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 50/117 places, 65/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 116 transition count 120
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 105 transition count 120
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 105 transition count 104
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 89 transition count 104
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 69 place count 74 transition count 89
Iterating global reduction 2 with 15 rules applied. Total rules applied 84 place count 74 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 84 place count 74 transition count 84
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 94 place count 69 transition count 84
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 138 place count 47 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 45 transition count 60
Applied a total of 140 rules in 12 ms. Remains 45 /117 variables (removed 72) and now considering 60/132 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 45/117 places, 60/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 106 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 105 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 105 transition count 120
Applied a total of 24 rules in 3 ms. Remains 105 /117 variables (removed 12) and now considering 120/132 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 105/117 places, 120/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 11 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 108 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 108 transition count 123
Applied a total of 18 rules in 2 ms. Remains 108 /117 variables (removed 9) and now considering 123/132 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 108/117 places, 123/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 117
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 101 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 101 transition count 116
Applied a total of 32 rules in 3 ms. Remains 101 /117 variables (removed 16) and now considering 116/132 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 101/117 places, 116/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 103 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 103 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 102 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 102 transition count 117
Applied a total of 30 rules in 3 ms. Remains 102 /117 variables (removed 15) and now considering 117/132 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/117 places, 117/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 120
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 105 transition count 120
Applied a total of 24 rules in 2 ms. Remains 105 /117 variables (removed 12) and now considering 120/132 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/117 places, 120/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 107 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 106 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 106 transition count 121
Applied a total of 22 rules in 3 ms. Remains 106 /117 variables (removed 11) and now considering 121/132 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/117 places, 121/132 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Input system was already deterministic with 121 transitions.
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:53:01] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 18:53:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 132 transitions and 420 arcs took 1 ms.
Total runtime 2290 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: 117 NrTr: 132 NrArc: 420)

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

net check time: 0m 0.000sec

init dd package: 0m 3.422sec


RS generation: 0m55.730sec


-> reachability set: #nodes 363588 (3.6e+05) #states 4,429,288,230 (9)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

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

FORMULA ShieldRVs-PT-003B-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.202sec

checking: EF [EX [[p109<=1 & 1<=p109]]]
normalized: E [true U EX [[p109<=1 & 1<=p109]]]

abstracting: (1<=p109)
states: 628,154,848 (8)
abstracting: (p109<=1)
states: 4,429,288,230 (9)
.-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.660sec

checking: EG [[p92<=0 & 0<=p92]]
normalized: EG [[p92<=0 & 0<=p92]]

abstracting: (0<=p92)
states: 4,429,288,230 (9)
abstracting: (p92<=0)
states: 3,794,819,685 (9)
................
before gc: list nodes free: 332912

after gc: idd nodes used:2325481, unused:61674519; list nodes free:293496589
.....
before gc: list nodes free: 1751245

after gc: idd nodes used:3644032, unused:60355968; list nodes free:291259829
MC time: 5m49.785sec

checking: AG [EF [[~ [[p95<=0 & 0<=p95]] & ~ [[p19<=1 & 1<=p19]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [[p19<=1 & 1<=p19]] & ~ [[p95<=0 & 0<=p95]]]]]]]

abstracting: (0<=p95)
states: 4,429,288,230 (9)
abstracting: (p95<=0)
states: 3,036,228,716 (9)
abstracting: (1<=p19)
states: 24,963,129 (7)
abstracting: (p19<=1)
states: 4,429,288,230 (9)
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m28.785sec

checking: [AX [AG [[p66<=1 & 1<=p66]]] | AX [EX [AX [EG [[p21<=1 & 1<=p21]]]]]]
normalized: [~ [EX [~ [EX [~ [EX [~ [EG [[p21<=1 & 1<=p21]]]]]]]]] | ~ [EX [E [true U ~ [[p66<=1 & 1<=p66]]]]]]

abstracting: (1<=p66)
states: 591,996,952 (8)
abstracting: (p66<=1)
states: 4,429,288,230 (9)
.abstracting: (1<=p21)
states: 1,346,775,442 (9)
abstracting: (p21<=1)
states: 4,429,288,230 (9)
.........
before gc: list nodes free: 12182795

after gc: idd nodes used:991140, unused:63008860; list nodes free:303807583
...................................
before gc: list nodes free: 3810798

after gc: idd nodes used:1954617, unused:62045383; list nodes free:299348849
MC time: 5m25.475sec

checking: AG [[~ [E [[[p29<=0 & 0<=p29] | [p65<=1 & 1<=p65]] U [[p92<=0 & 0<=p92] | [p45<=1 & 1<=p45]]]] | [[p88<=0 & 0<=p88] & [[p89<=0 & 0<=p89] | [p55<=1 & 1<=p55]]]]]
normalized: ~ [E [true U ~ [[[[[p89<=0 & 0<=p89] | [p55<=1 & 1<=p55]] & [p88<=0 & 0<=p88]] | ~ [E [[[p65<=1 & 1<=p65] | [p29<=0 & 0<=p29]] U [[p45<=1 & 1<=p45] | [p92<=0 & 0<=p92]]]]]]]]

abstracting: (0<=p92)
states: 4,429,288,230 (9)
abstracting: (p92<=0)
states: 3,794,819,685 (9)
abstracting: (1<=p45)
states: 173,952 (5)
abstracting: (p45<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p29)
states: 4,429,288,230 (9)
abstracting: (p29<=0)
states: 3,934,240,093 (9)
abstracting: (1<=p65)
states: 449,961,166 (8)
abstracting: (p65<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p88)
states: 4,429,288,230 (9)
abstracting: (p88<=0)
states: 3,945,887,707 (9)
abstracting: (1<=p55)
states: 590,222,518 (8)
abstracting: (p55<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p89)
states: 4,429,288,230 (9)
abstracting: (p89<=0)
states: 3,953,918,158 (9)
-> the formula is FALSE

FORMULA ShieldRVs-PT-003B-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.959sec

checking: [EF [AX [EX [~ [A [[[p9<=0 & 0<=p9] | [p85<=1 & 1<=p85]] U [[p73<=0 & 0<=p73] | [p35<=1 & 1<=p35]]]]]]] & [AF [[[p32<=0 & 0<=p32] | [p44<=1 & 1<=p44]]] | AG [[p7<=0 & 0<=p7]]]]
normalized: [[~ [E [true U ~ [[p7<=0 & 0<=p7]]]] | ~ [EG [~ [[[p44<=1 & 1<=p44] | [p32<=0 & 0<=p32]]]]]] & E [true U ~ [EX [~ [EX [~ [[~ [EG [~ [[[p35<=1 & 1<=p35] | [p73<=0 & 0<=p73]]]]] & ~ [E [~ [[[p35<=1 & 1<=p35] | [p73<=0 & 0<=p73]]] U [~ [[[p85<=1 & 1<=p85] | [p9<=0 & 0<=p9]]] & ~ [[[p35<=1 & 1<=p35] | [p73<=0 & 0<=p73]]]]]]]]]]]]]]

abstracting: (0<=p73)
states: 4,429,288,230 (9)
abstracting: (p73<=0)
states: 3,978,241,388 (9)
abstracting: (1<=p35)
states: 698,126,451 (8)
abstracting: (p35<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p9)
states: 4,429,288,230 (9)
abstracting: (p9<=0)
states: 4,421,611,689 (9)
abstracting: (1<=p85)
states: 629,046,415 (8)
abstracting: (p85<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p73)
states: 4,429,288,230 (9)
abstracting: (p73<=0)
states: 3,978,241,388 (9)
abstracting: (1<=p35)
states: 698,126,451 (8)
abstracting: (p35<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p73)
states: 4,429,288,230 (9)
abstracting: (p73<=0)
states: 3,978,241,388 (9)
abstracting: (1<=p35)
states: 698,126,451 (8)
abstracting: (p35<=1)
states: 4,429,288,230 (9)
...........................................................................
EG iterations: 75
..
before gc: list nodes free: 4902630

after gc: idd nodes used:1000852, unused:62999148; list nodes free:303807362
abstracting: (0<=p32)
states: 4,429,288,230 (9)
abstracting: (p32<=0)
states: 4,424,958,294 (9)
abstracting: (1<=p44)
states: 43,488 (4)
abstracting: (p44<=1)
states: 4,429,288,230 (9)
......................................................................................
EG iterations: 86
abstracting: (0<=p7)
states: 4,429,288,230 (9)
abstracting: (p7<=0)
states: 4,429,167,954 (9)
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m10.009sec

checking: A [~ [[~ [AF [[p46<=1 & 1<=p46]]] | [~ [[[p25<=0 & 0<=p25] | [p44<=1 & 1<=p44]]] & [[p116<=0 & 0<=p116] | [p61<=1 & 1<=p61]]]]] U [[p38<=1 & 1<=p38] & [~ [EF [AX [[p70<=0 & 0<=p70]]]] | EG [AX [[[[p73<=0 & 0<=p73] | [p65<=1 & 1<=p65]] | [[p66<=0 & 0<=p66] | [p68<=1 & 1<=p68]]]]]]]]
normalized: [~ [EG [~ [[[EG [~ [EX [~ [[[[p68<=1 & 1<=p68] | [p66<=0 & 0<=p66]] | [[p65<=1 & 1<=p65] | [p73<=0 & 0<=p73]]]]]]] | ~ [E [true U ~ [EX [~ [[p70<=0 & 0<=p70]]]]]]] & [p38<=1 & 1<=p38]]]]] & ~ [E [~ [[[EG [~ [EX [~ [[[[p68<=1 & 1<=p68] | [p66<=0 & 0<=p66]] | [[p65<=1 & 1<=p65] | [p73<=0 & 0<=p73]]]]]]] | ~ [E [true U ~ [EX [~ [[p70<=0 & 0<=p70]]]]]]] & [p38<=1 & 1<=p38]]] U [[[[[p61<=1 & 1<=p61] | [p116<=0 & 0<=p116]] & ~ [[[p44<=1 & 1<=p44] | [p25<=0 & 0<=p25]]]] | EG [~ [[p46<=1 & 1<=p46]]]] & ~ [[[EG [~ [EX [~ [[[[p68<=1 & 1<=p68] | [p66<=0 & 0<=p66]] | [[p65<=1 & 1<=p65] | [p73<=0 & 0<=p73]]]]]]] | ~ [E [true U ~ [EX [~ [[p70<=0 & 0<=p70]]]]]]] & [p38<=1 & 1<=p38]]]]]]]

abstracting: (1<=p38)
states: 463,386,713 (8)
abstracting: (p38<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p70)
states: 4,429,288,230 (9)
abstracting: (p70<=0)
states: 3,985,059,245 (9)
.abstracting: (0<=p73)
states: 4,429,288,230 (9)
abstracting: (p73<=0)
states: 3,978,241,388 (9)
abstracting: (1<=p65)
states: 449,961,166 (8)
abstracting: (p65<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p66)
states: 4,429,288,230 (9)
abstracting: (p66<=0)
states: 3,837,291,278 (9)
abstracting: (1<=p68)
states: 1,565,568 (6)
abstracting: (p68<=1)
states: 4,429,288,230 (9)
..
EG iterations: 1
abstracting: (1<=p46)
states: 4,186,944 (6)
abstracting: (p46<=1)
states: 4,429,288,230 (9)
...................................................
EG iterations: 51
abstracting: (0<=p25)
states: 4,429,288,230 (9)
abstracting: (p25<=0)
states: 3,850,442,084 (9)
abstracting: (1<=p44)
states: 43,488 (4)
abstracting: (p44<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p116)
states: 4,429,288,230 (9)
abstracting: (p116<=0)
states: 4,428,450,143 (9)
abstracting: (1<=p61)
states: 709,360,999 (8)
abstracting: (p61<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p38)
states: 463,386,713 (8)
abstracting: (p38<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p70)
states: 4,429,288,230 (9)
abstracting: (p70<=0)
states: 3,985,059,245 (9)
.abstracting: (0<=p73)
states: 4,429,288,230 (9)
abstracting: (p73<=0)
states: 3,978,241,388 (9)
abstracting: (1<=p65)
states: 449,961,166 (8)
abstracting: (p65<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p66)
states: 4,429,288,230 (9)
abstracting: (p66<=0)
states: 3,837,291,278 (9)
abstracting: (1<=p68)
states: 1,565,568 (6)
abstracting: (p68<=1)
states: 4,429,288,230 (9)
..
EG iterations: 1
abstracting: (1<=p38)
states: 463,386,713 (8)
abstracting: (p38<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p70)
states: 4,429,288,230 (9)
abstracting: (p70<=0)
states: 3,985,059,245 (9)
.abstracting: (0<=p73)
states: 4,429,288,230 (9)
abstracting: (p73<=0)
states: 3,978,241,388 (9)
abstracting: (1<=p65)
states: 449,961,166 (8)
abstracting: (p65<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p66)
states: 4,429,288,230 (9)
abstracting: (p66<=0)
states: 3,837,291,278 (9)
abstracting: (1<=p68)
states: 1,565,568 (6)
abstracting: (p68<=1)
states: 4,429,288,230 (9)
..
EG iterations: 1
.....................
before gc: list nodes free: 11489672

after gc: idd nodes used:2297534, unused:61702466; list nodes free:297969301
.......................................
before gc: list nodes free: 3565605

after gc: idd nodes used:3336825, unused:60663175; list nodes free:292717967
MC time: 5m29.265sec

checking: [EX [[EF [[p61<=1 & 1<=p61]] | [[p33<=0 & 0<=p33] | [p106<=1 & 1<=p106]]]] & [E [~ [EX [[[[p66<=0 & 0<=p66] | [p97<=1 & 1<=p97]] & [p78<=1 & 1<=p78]]]] U ~ [EF [[p7<=0 & 0<=p7]]]] | [EX [[[EG [[p95<=0 & 0<=p95]] | AX [1<=0]] & AG [A [[p105<=1 & 1<=p105] U [p47<=1 & 1<=p47]]]]] | EF [EG [[[p5<=0 & 0<=p5] | [p113<=1 & 1<=p113]]]]]]]
normalized: [[[E [true U EG [[[p5<=0 & 0<=p5] | [p113<=1 & 1<=p113]]]] | EX [[~ [E [true U ~ [[~ [EG [~ [[p47<=1 & 1<=p47]]]] & ~ [E [~ [[p47<=1 & 1<=p47]] U [~ [[p105<=1 & 1<=p105]] & ~ [[p47<=1 & 1<=p47]]]]]]]]] & [~ [EX [~ [1<=0]]] | EG [[p95<=0 & 0<=p95]]]]]] | E [~ [EX [[[p78<=1 & 1<=p78] & [[p97<=1 & 1<=p97] | [p66<=0 & 0<=p66]]]]] U ~ [E [true U [p7<=0 & 0<=p7]]]]] & EX [[[[p106<=1 & 1<=p106] | [p33<=0 & 0<=p33]] | E [true U [p61<=1 & 1<=p61]]]]]

abstracting: (1<=p61)
states: 709,360,999 (8)
abstracting: (p61<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p33)
states: 4,429,288,230 (9)
abstracting: (p33<=0)
states: 4,424,838,018 (9)
abstracting: (1<=p106)
states: 838,087 (5)
abstracting: (p106<=1)
states: 4,429,288,230 (9)
.abstracting: (0<=p7)
states: 4,429,288,230 (9)
abstracting: (p7<=0)
states: 4,429,167,954 (9)
abstracting: (0<=p66)
states: 4,429,288,230 (9)
abstracting: (p66<=0)
states: 3,837,291,278 (9)
abstracting: (1<=p97)
states: 1,407,385,970 (9)
abstracting: (p97<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p78)
states: 445,838,041 (8)
abstracting: (p78<=1)
states: 4,429,288,230 (9)
.abstracting: (0<=p95)
states: 4,429,288,230 (9)
abstracting: (p95<=0)
states: 3,036,228,716 (9)
.....................
before gc: list nodes free: 5493559

after gc: idd nodes used:3376943, unused:60623057; list nodes free:293018452
MC time: 4m32.654sec

checking: [AF [[[0<=p22 & p22<=0] & E [[[p23<=0 & 0<=p23] | [p65<=1 & 1<=p65]] U [[[p72<=0 & 0<=p72] | [p107<=1 & 1<=p107]] & [~ [[[p31<=0 & 0<=p31] | [p103<=1 & 1<=p103]]] & [[p76<=1 & 1<=p76] | [p30<=1 & 1<=p30]]]]]]] | EX [EX [[AF [[[p78<=0 & 0<=p78] & [p37<=1 & 1<=p37]]] & ~ [A [[p95<=1 & 1<=p95] U [p62<=1 & 1<=p62]]]]]]]
normalized: [~ [EG [~ [[E [[[p65<=1 & 1<=p65] | [p23<=0 & 0<=p23]] U [[[p107<=1 & 1<=p107] | [p72<=0 & 0<=p72]] & [[[p30<=1 & 1<=p30] | [p76<=1 & 1<=p76]] & ~ [[[p103<=1 & 1<=p103] | [p31<=0 & 0<=p31]]]]]] & [0<=p22 & p22<=0]]]]] | EX [EX [[~ [[~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[p95<=1 & 1<=p95]] & ~ [[p62<=1 & 1<=p62]]]]]]] & ~ [EG [~ [[[p37<=1 & 1<=p37] & [p78<=0 & 0<=p78]]]]]]]]]

abstracting: (0<=p78)
states: 4,429,288,230 (9)
abstracting: (p78<=0)
states: 3,983,450,189 (9)
abstracting: (1<=p37)
states: 392,250,308 (8)
abstracting: (p37<=1)
states: 4,429,288,230 (9)
.
EG iterations: 1
abstracting: (1<=p62)
states: 470,868,142 (8)
abstracting: (p62<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p95)
states: 1,393,059,514 (9)
abstracting: (p95<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p62)
states: 470,868,142 (8)
abstracting: (p62<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p62)
states: 470,868,142 (8)
abstracting: (p62<=1)
states: 4,429,288,230 (9)
.
EG iterations: 1
..abstracting: (p22<=0)
states: 2,818,479,792 (9)
abstracting: (0<=p22)
states: 4,429,288,230 (9)
abstracting: (0<=p31)
states: 4,429,288,230 (9)
abstracting: (p31<=0)
states: 3,846,112,148 (9)
abstracting: (1<=p103)
states: 471,962,616 (8)
abstracting: (p103<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p76)
states: 427,466,254 (8)
abstracting: (p76<=1)
states: 4,429,288,230 (9)
abstracting: (1<=p30)
states: 583,176,082 (8)
abstracting: (p30<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p72)
states: 4,429,288,230 (9)
abstracting: (p72<=0)
states: 3,769,433,622 (9)
abstracting: (1<=p107)
states: 439,055,458 (8)
abstracting: (p107<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p23)
states: 4,429,288,230 (9)
abstracting: (p23<=0)
states: 3,060,370,046 (9)
abstracting: (1<=p65)
states: 449,961,166 (8)
abstracting: (p65<=1)
states: 4,429,288,230 (9)
...........................
EG iterations: 27
-> the formula is TRUE

FORMULA ShieldRVs-PT-003B-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m15.970sec

checking: [AF [EX [[EX [[p97<=1 & 1<=p97]] | [[[p13<=0 & 0<=p13] & [[p10<=1 & 1<=p10] & [p78<=0 & 0<=p78]]] & [[[p98<=0 & 0<=p98] & [p25<=1 & 1<=p25]] & [[p50<=0 & 0<=p50] & [p108<=1 & 1<=p108]]]]]]] & AG [[[[p92<=0 & 0<=p92] | [[p36<=1 & 1<=p36] | AX [[p29<=0 & 0<=p29]]]] & ~ [A [~ [[p85<=0 & 0<=p85]] U E [[p57<=1 & 1<=p57] U [p110<=1 & 1<=p110]]]]]]]
normalized: [~ [E [true U ~ [[~ [[~ [EG [~ [E [[p57<=1 & 1<=p57] U [p110<=1 & 1<=p110]]]]] & ~ [E [~ [E [[p57<=1 & 1<=p57] U [p110<=1 & 1<=p110]]] U [[p85<=0 & 0<=p85] & ~ [E [[p57<=1 & 1<=p57] U [p110<=1 & 1<=p110]]]]]]]] & [[~ [EX [~ [[p29<=0 & 0<=p29]]]] | [p36<=1 & 1<=p36]] | [p92<=0 & 0<=p92]]]]]] & ~ [EG [~ [EX [[[[[[p108<=1 & 1<=p108] & [p50<=0 & 0<=p50]] & [[p25<=1 & 1<=p25] & [p98<=0 & 0<=p98]]] & [[[p78<=0 & 0<=p78] & [p10<=1 & 1<=p10]] & [p13<=0 & 0<=p13]]] | EX [[p97<=1 & 1<=p97]]]]]]]]

abstracting: (1<=p97)
states: 1,407,385,970 (9)
abstracting: (p97<=1)
states: 4,429,288,230 (9)
.abstracting: (0<=p13)
states: 4,429,288,230 (9)
abstracting: (p13<=0)
states: 3,938,789,707 (9)
abstracting: (1<=p10)
states: 24,963,129 (7)
abstracting: (p10<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p78)
states: 4,429,288,230 (9)
abstracting: (p78<=0)
states: 3,983,450,189 (9)
abstracting: (0<=p98)
states: 4,429,288,230 (9)
abstracting: (p98<=0)
states: 4,428,472,794 (9)
abstracting: (1<=p25)
states: 578,846,146 (8)
abstracting: (p25<=1)
states: 4,429,288,230 (9)
abstracting: (0<=p50)
states: 4,429,288,230 (9)
abstracting: (p50<=0)
states: 3,953,482,398 (9)
abstracting: (1<=p108)
states: 628,154,848 (8)
abstracting: (p108<=1)
states: 4,429,288,230 (9)
.........
before gc: list nodes free: 7457330

after gc: idd nodes used:3636478, unused:60363522; list nodes free:291811751
................MC time: 3m59.182sec

checking: [A [[[[p84<=0 & 0<=p84] | [p18<=1 & 1<=p18]] | [[p8<=1 & 1<=p8] | [EF [[p7<=1 & 1<=p7]] | AX [[[[p24<=1 & 1<=p24] | [[p73<=0 & 0<=p73] | [p70<=1 & 1<=p70]]] & AX [[p85<=0 & 0<=p85]]]]]]] U [[EF [[p79<=0 & 0<=p79]] | AF [[EX [[[p52<=0 & 0<=p52] | [p82<=1 & 1<=p82]]] & EG [[p28<=0 & 0<=p28]]]]] & AG [[[p12<=0 & 0<=p12] | [p71<=1 & 1<=p71]]]]] & EG [[[[p12<=0 & 0<=p12] | [p15<=1 & 1<=p15]] | [AF [[[p13<=0 & 0<=p13] | [p3<=1 & 1<=p3]]] | [AX [[p47<=0 & 0<=p47]] | [AG [[p107<=1 & 1<=p107]] & [[AX [[[p46<=0 & 0<=p46] | [p84<=1 & 1<=p84]]] | [[p54<=0 & 0<=p54] | [p78<=1 & 1<=p78]]] & ~ [A [[p77<=1 & 1<=p77] U [p24<=1 & 1<=p24]]]]]]]]]]
normalized: [EG [[[[[[~ [[~ [EG [~ [[p24<=1 & 1<=p24]]]] & ~ [E [~ [[p24<=1 & 1<=p24]] U [~ [[p77<=1 & 1<=p77]] & ~ [[p24<=1 & 1<=p24]]]]]]] & [[[p78<=1 & 1<=p78] | [p54<=0 & 0<=p54]] | ~ [EX [~ [[[p84<=1 & 1<=p84] | [p46<=0 & 0<=p46]]]]]]] & ~ [E [true U ~ [[p107<=1 & 1<=p107]]]]] | ~ [EX [~ [[p47<=0 & 0<=p47]]]]] | ~ [EG [~ [[[p3<=1 & 1<=p3] | [p13<=0 & 0<=p13]]]]]] | [[p15<=1 & 1<=p15] | [p12<=0 & 0<=p12]]]] & [~ [EG [~ [[~ [E [true U ~ [[[p71<=1 & 1<=p71] | [p12<=0 & 0<=p12]]]]] & [~ [EG [~ [[EG [[p28<=0 & 0<=p28]] & EX [[[p82<=1 & 1<=p82] | [p52<=0 & 0<=p52]]]]]]] | E [true U [p79<=0 & 0<=p79]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[p71<=1 & 1<=p71] | [p12<=0 & 0<=p12]]]]] & [~ [EG [~ [[EG [[p28<=0 & 0<=p28]] & EX [[[p82<=1 & 1<=p82] | [p52<=0 & 0<=p52]]]]]]] | E [true U [p79<=0 & 0<=p79]]]]] U [~ [[[[~ [EX [~ [[~ [EX [~ [[p85<=0 & 0<=p85]]]] & [[[p70<=1 & 1<=p70] | [p73<=0 & 0<=p73]] | [p24<=1 & 1<=p24]]]]]] | E [true U [p7<=1 & 1<=p7]]] | [p8<=1 & 1<=p8]] | [[p18<=1 & 1<=p18] | [p84<=0 & 0<=p84]]]] & ~ [[~ [E [true U ~ [[[p71<=1 & 1<=p71] | [p12<=0 & 0<=p12]]]]] & [~ [EG [~ [[EG [[p28<=0 & 0<=p28]] & EX [[[p82<=1 & 1<=p82] | [p52<=0 & 0<=p52]]]]]]] | E [true U [p79<=0 & 0<=p79]]]]]]]]]]

abstracting: (0<=p79)
states: 4,429,288,230 (9)
abstracting: (p79<=0)
states: 4,427,679,174 (9)

before gc: list nodes free: 1057859

after gc: idd nodes used:2761020, unused:61238980; list nodes free:295972687
abstracting: (0<=p52)
states: 4,429,288,230 (9)
abstracting: (p52<=0)
states: 3,915,148,044 (9)
abstracting: (1<=p82)
states: 90,604 (4)
abstracting: (p82<=1)
states: 4,429,288,230 (9)
.abstracting: (0<=p28)
states: 4,429,288,230 (9)
abstracting: (p28<=0)
states: 3,874,824,881 (9)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5825908 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100492 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

355022 494584 695569 459052
iterations count:408221 (3092), effective:24769 (187)

initing FirstDep: 0m 0.000sec


iterations count:18068 (136), effective:1325 (10)

net_ddint.h:600: Timeout: after 348 sec


iterations count:49688 (376), effective:3634 (27)

iterations count:57794 (437), effective:3448 (26)

iterations count:3680 (27), effective:163 (1)

net_ddint.h:600: Timeout: after 324 sec


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

iterations count:33425 (253), effective:2585 (19)

iterations count:53660 (406), effective:3316 (25)

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

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

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

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

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

net_ddint.h:600: Timeout: after 318 sec


iterations count:4261 (32), effective:220 (1)

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

net_ddint.h:600: Timeout: after 271 sec


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

iterations count:56569 (428), effective:3460 (26)

net_ddint.h:600: Timeout: after 238 sec


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

net_ddint.h:600: Timeout: after 198 sec

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-003B"
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 ShieldRVs-PT-003B, 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-167905978400041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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