Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348700433.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is HirschbergSinclair-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 8.1K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 02:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 02:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 136K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678784309790

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=HirschbergSinclair-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 08:58:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 08:58:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:58:33] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-14 08:58:33] [INFO ] Transformed 260 places.
[2023-03-14 08:58:33] [INFO ] Transformed 236 transitions.
[2023-03-14 08:58:33] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Support contains 95 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 253 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 252 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 252 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 251 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 251 transition count 234
Applied a total of 11 rules in 109 ms. Remains 251 /260 variables (removed 9) and now considering 234/236 (removed 2) transitions.
// Phase 1: matrix 234 rows 251 cols
[2023-03-14 08:58:33] [INFO ] Computed 17 place invariants in 20 ms
[2023-03-14 08:58:34] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-14 08:58:34] [INFO ] Invariant cache hit.
[2023-03-14 08:58:35] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-03-14 08:58:35] [INFO ] Invariant cache hit.
[2023-03-14 08:58:35] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 251/260 places, 234/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1826 ms. Remains : 251/260 places, 234/236 transitions.
Support contains 95 out of 251 places after structural reductions.
[2023-03-14 08:58:35] [INFO ] Flatten gal took : 98 ms
[2023-03-14 08:58:35] [INFO ] Flatten gal took : 43 ms
[2023-03-14 08:58:36] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 878 ms. (steps per millisecond=11 ) properties (out of 72) seen :57
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-14 08:58:37] [INFO ] Invariant cache hit.
[2023-03-14 08:58:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-14 08:58:37] [INFO ] [Real]Absence check using 3 positive and 14 generalized place invariants in 73 ms returned sat
[2023-03-14 08:58:37] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-14 08:58:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-14 08:58:37] [INFO ] [Nat]Absence check using 3 positive and 14 generalized place invariants in 70 ms returned sat
[2023-03-14 08:58:38] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :1
[2023-03-14 08:58:38] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-14 08:58:38] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :1
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 239 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 239 transition count 121
Reduce places removed 103 places and 0 transitions.
Graph (complete) has 224 edges and 136 vertex of which 33 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.0 ms
Discarding 103 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Iterating post reduction 1 with 104 rules applied. Total rules applied 218 place count 33 transition count 76
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 270 place count 33 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 270 place count 33 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 32 transition count 23
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 32 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 274 place count 31 transition count 22
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 280 place count 25 transition count 16
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 13 rules applied. Total rules applied 293 place count 19 transition count 9
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 300 place count 12 transition count 9
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 300 place count 12 transition count 4
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 311 place count 6 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 312 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 312 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 314 place count 4 transition count 3
Applied a total of 314 rules in 31 ms. Remains 4 /251 variables (removed 247) and now considering 3/234 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 4/251 places, 3/234 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-10-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 20 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 22 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 234 transitions.
Support contains 59 out of 251 places (down from 65) after GAL structural reductions.
FORMULA HirschbergSinclair-PT-10-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 251 stabilizing places and 234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 251 transition count 234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA HirschbergSinclair-PT-10-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 248 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 8 places and 8 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 240 transition count 141
Reduce places removed 85 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 89 rules applied. Total rules applied 175 place count 155 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 179 place count 151 transition count 137
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 187 place count 143 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 142 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 142 transition count 128
Applied a total of 197 rules in 37 ms. Remains 142 /251 variables (removed 109) and now considering 128/234 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 142/251 places, 128/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 11 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 240 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 240 transition count 226
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 232 transition count 218
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 232 transition count 218
Applied a total of 35 rules in 36 ms. Remains 232 /251 variables (removed 19) and now considering 218/234 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 232/251 places, 218/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 16 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 18 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 239 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 239 transition count 225
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 230 transition count 216
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 230 transition count 216
Applied a total of 39 rules in 28 ms. Remains 230 /251 variables (removed 21) and now considering 216/234 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 230/251 places, 216/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 15 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 16 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 239 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 239 transition count 225
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 230 transition count 216
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 230 transition count 216
Applied a total of 39 rules in 28 ms. Remains 230 /251 variables (removed 21) and now considering 216/234 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 230/251 places, 216/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 14 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 16 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 249 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 241 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 241 transition count 226
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 233 transition count 218
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 233 transition count 218
Applied a total of 34 rules in 44 ms. Remains 233 /251 variables (removed 18) and now considering 218/234 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 233/251 places, 218/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 20 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 16 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 239 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 239 transition count 225
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 231 transition count 217
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 231 transition count 217
Applied a total of 37 rules in 42 ms. Remains 231 /251 variables (removed 20) and now considering 217/234 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 231/251 places, 217/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 13 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 15 ms
[2023-03-14 08:58:38] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 248 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 238 transition count 123
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 137 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 136 transition count 122
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 214 place count 127 transition count 113
Iterating global reduction 3 with 9 rules applied. Total rules applied 223 place count 127 transition count 113
Applied a total of 223 rules in 19 ms. Remains 127 /251 variables (removed 124) and now considering 113/234 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 127/251 places, 113/234 transitions.
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:58:38] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 248 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 239 transition count 133
Reduce places removed 92 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 95 rules applied. Total rules applied 188 place count 147 transition count 130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 191 place count 144 transition count 130
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 138 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 138 transition count 124
Applied a total of 203 rules in 20 ms. Remains 138 /251 variables (removed 113) and now considering 124/234 (removed 110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 138/251 places, 124/234 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 240 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 240 transition count 226
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 232 transition count 218
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 232 transition count 218
Applied a total of 35 rules in 22 ms. Remains 232 /251 variables (removed 19) and now considering 218/234 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 232/251 places, 218/234 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 11 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 11 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 248 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 239 transition count 124
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 138 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 137 transition count 123
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 214 place count 128 transition count 114
Iterating global reduction 3 with 9 rules applied. Total rules applied 223 place count 128 transition count 114
Applied a total of 223 rules in 18 ms. Remains 128 /251 variables (removed 123) and now considering 114/234 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 128/251 places, 114/234 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 248 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 238 transition count 124
Reduce places removed 100 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 138 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 137 transition count 123
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 212 place count 128 transition count 114
Iterating global reduction 3 with 9 rules applied. Total rules applied 221 place count 128 transition count 114
Applied a total of 221 rules in 19 ms. Remains 128 /251 variables (removed 123) and now considering 114/234 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 128/251 places, 114/234 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Graph (complete) has 470 edges and 251 vertex of which 248 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 238 transition count 121
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 135 transition count 121
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 215 place count 127 transition count 113
Iterating global reduction 2 with 8 rules applied. Total rules applied 223 place count 127 transition count 113
Applied a total of 223 rules in 17 ms. Remains 127 /251 variables (removed 124) and now considering 113/234 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 127/251 places, 113/234 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 234/234 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 248 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 239 transition count 225
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 239 transition count 225
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 230 transition count 216
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 230 transition count 216
Applied a total of 39 rules in 22 ms. Remains 230 /251 variables (removed 21) and now considering 216/234 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 230/251 places, 216/234 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 11 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 13 ms
[2023-03-14 08:58:39] [INFO ] Input system was already deterministic with 216 transitions.
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 13 ms
[2023-03-14 08:58:39] [INFO ] Flatten gal took : 12 ms
[2023-03-14 08:58:39] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-14 08:58:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 234 transitions and 701 arcs took 3 ms.
Total runtime 6257 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: 251 NrTr: 234 NrArc: 701)

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

net check time: 0m 0.000sec

init dd package: 0m 3.496sec


RS generation: 0m 4.882sec


-> reachability set: #nodes 53038 (5.3e+04) #states 5,426,521,624,272 (12)



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

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

abstracting: (1<=p145)
states: 117,224,603,336 (11)
.-> the formula is TRUE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.970sec

checking: EX [AG [p185<=0]]
normalized: EX [~ [E [true U ~ [p185<=0]]]]

abstracting: (p185<=0)
states: 5,372,924,120,000 (12)
.-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.246sec

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

abstracting: (1<=p61)
states: 692,689,157,692 (11)
.-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.975sec

checking: EG [AG [EF [~ [p210<=p41]]]]
normalized: EG [~ [E [true U ~ [E [true U ~ [p210<=p41]]]]]]

abstracting: (p210<=p41)
states: 5,388,935,795,216 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.467sec

checking: ~ [E [1<=p97 U AF [~ [p76<=p89]]]]
normalized: ~ [E [1<=p97 U ~ [EG [p76<=p89]]]]

abstracting: (p76<=p89)
states: 5,417,222,580,476 (12)
......................................................................
EG iterations: 70
abstracting: (1<=p97)
states: 26,711,830,540 (10)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.728sec

checking: AG [AF [[AX [AF [p221<=p71]] | p169<=p6]]]
normalized: ~ [E [true U EG [~ [[p169<=p6 | ~ [EX [EG [~ [p221<=p71]]]]]]]]]

abstracting: (p221<=p71)
states: 5,376,864,227,861 (12)
.
EG iterations: 1
.abstracting: (p169<=p6)
states: 5,336,488,691,260 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.507sec

checking: EF [~ [E [A [EF [1<=p18] U p206<=p128] U 1<=p162]]]
normalized: E [true U ~ [E [[~ [EG [~ [p206<=p128]]] & ~ [E [~ [p206<=p128] U [~ [E [true U 1<=p18]] & ~ [p206<=p128]]]]] U 1<=p162]]]

abstracting: (1<=p162)
states: 55,936,986,160 (10)
abstracting: (p206<=p128)
states: 5,389,449,564,752 (12)
abstracting: (1<=p18)
states: 715,583,519 (8)
abstracting: (p206<=p128)
states: 5,389,449,564,752 (12)
abstracting: (p206<=p128)
states: 5,389,449,564,752 (12)
............................................................
EG iterations: 60
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.970sec

checking: [EG [1<=p39] | EG [AG [[EG [[p222<=0 & p81<=p82]] | EF [~ [1<=p145]]]]]]
normalized: [EG [~ [E [true U ~ [[E [true U ~ [1<=p145]] | EG [[p222<=0 & p81<=p82]]]]]]] | EG [1<=p39]]

abstracting: (1<=p39)
states: 892,262,676,343 (11)
.................................
before gc: list nodes free: 1121446

after gc: idd nodes used:1489681, unused:62510319; list nodes free:280757577
...................................................................
EG iterations: 100
abstracting: (p81<=p82)
states: 5,417,752,399,248 (12)
abstracting: (p222<=0)
states: 5,367,022,749,428 (12)
......................................................................
EG iterations: 70
abstracting: (1<=p145)
states: 117,224,603,336 (11)

EG iterations: 0
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m16.745sec

checking: AG [[E [[[p80<=0 | p138<=p21] & ~ [1<=p189]] U AX [1<=p168]] & EX [~ [1<=p114]]]]
normalized: ~ [E [true U ~ [[EX [~ [1<=p114]] & E [[~ [1<=p189] & [p80<=0 | p138<=p21]] U ~ [EX [~ [1<=p168]]]]]]]]

abstracting: (1<=p168)
states: 115,410,577,496 (11)
.abstracting: (p138<=p21)
states: 5,384,204,611,600 (12)
abstracting: (p80<=0)
states: 5,406,603,600,596 (12)
abstracting: (1<=p189)
states: 53,718,618,352 (10)

before gc: list nodes free: 1264381

after gc: idd nodes used:186282, unused:63813718; list nodes free:286507846
abstracting: (1<=p114)
states: 35,437,485,552 (10)
.-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.071sec

checking: [EX [1<=p115] & [EX [~ [p34<=0]] | AG [E [~ [1<=p191] U [p67<=p76 & p49<=p87]]]]]
normalized: [[~ [E [true U ~ [E [~ [1<=p191] U [p67<=p76 & p49<=p87]]]]] | EX [~ [p34<=0]]] & EX [1<=p115]]

abstracting: (1<=p115)
states: 63,106,233,240 (10)
.abstracting: (p34<=0)
states: 4,760,748,640,136 (12)
.abstracting: (p49<=p87)
states: 4,727,066,311,746 (12)
abstracting: (p67<=p76)
states: 4,749,194,995,306 (12)
abstracting: (1<=p191)
states: 59,098,725,256 (10)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.398sec

checking: AF [[[EF [AG [~ [p161<=p184]]] & [p134<=0 & p38<=p202]] | [1<=p247 & A [A [1<=p106 U 1<=p17] U 1<=p44]]]]
normalized: ~ [EG [~ [[[1<=p247 & [~ [EG [~ [1<=p44]]] & ~ [E [~ [1<=p44] U [~ [[~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [1<=p106] & ~ [1<=p17]]]]]] & ~ [1<=p44]]]]]] | [[p134<=0 & p38<=p202] & E [true U ~ [E [true U p161<=p184]]]]]]]]

abstracting: (p161<=p184)
states: 5,313,903,878,040 (12)
abstracting: (p38<=p202)
states: 3,714,952,642,116 (12)
abstracting: (p134<=0)
states: 5,365,625,591,720 (12)
abstracting: (1<=p44)
states: 1,316,539,605,615 (12)
abstracting: (1<=p17)
states: 2,771,175,557,060 (12)
abstracting: (1<=p106)
states: 30,980,942,720 (10)
abstracting: (1<=p17)
states: 2,771,175,557,060 (12)
abstracting: (1<=p17)
states: 2,771,175,557,060 (12)
..........................................................
before gc: list nodes free: 8026454

after gc: idd nodes used:1596429, unused:62403571; list nodes free:280475260
...................................................
EG iterations: 109
abstracting: (1<=p44)
states: 1,316,539,605,615 (12)
abstracting: (1<=p44)
states: 1,316,539,605,615 (12)
...........................................
before gc: list nodes free: 9196431

after gc: idd nodes used:954535, unused:63045465; list nodes free:283253766
...........................................................
EG iterations: 102
abstracting: (1<=p247)
states: 1,726,520,832 (9)
...................................
EG iterations: 35
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m22.179sec

checking: [AG [[AG [~ [p70<=p186]] | ~ [1<=p119]]] | [E [~ [EX [0<=0]] U p134<=0] & AG [[~ [E [1<=p38 U p155<=0]] & [p169<=p92 & AG [~ [1<=p216]]]]]]]
normalized: [[~ [E [true U ~ [[[p169<=p92 & ~ [E [true U 1<=p216]]] & ~ [E [1<=p38 U p155<=0]]]]]] & E [~ [EX [0<=0]] U p134<=0]] | ~ [E [true U ~ [[~ [1<=p119] | ~ [E [true U p70<=p186]]]]]]]

abstracting: (p70<=p186)
states: 4,134,511,129,910 (12)
abstracting: (1<=p119)
states: 48,455,247,388 (10)
abstracting: (p134<=0)
states: 5,365,625,591,720 (12)
abstracting: (0<=0)
states: 5,426,521,624,272 (12)
.abstracting: (p155<=0)
states: 5,309,297,020,936 (12)
abstracting: (1<=p38)
states: 1,724,356,567,916 (12)
abstracting: (1<=p216)
states: 38,080,473,712 (10)
abstracting: (p169<=p92)
states: 5,336,488,691,260 (12)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.239sec

checking: EF [[AF [[1<=p206 & ~ [E [p104<=p232 U 1<=p93]]]] & [AG [[p104<=0 & [p98<=0 & [1<=p38 | 1<=p240]]]] & [A [p122<=p41 U p201<=p123] | 1<=p57]]]]
normalized: E [true U [[[1<=p57 | [~ [EG [~ [p201<=p123]]] & ~ [E [~ [p201<=p123] U [~ [p122<=p41] & ~ [p201<=p123]]]]]] & ~ [E [true U ~ [[p104<=0 & [p98<=0 & [1<=p38 | 1<=p240]]]]]]] & ~ [EG [~ [[1<=p206 & ~ [E [p104<=p232 U 1<=p93]]]]]]]]

abstracting: (1<=p93)
states: 26,950,993,516 (10)
abstracting: (p104<=p232)
states: 5,395,191,689,856 (12)
abstracting: (1<=p206)
states: 37,072,059,520 (10)
.
EG iterations: 1
abstracting: (1<=p240)
states: 38,802,306,220 (10)
abstracting: (1<=p38)
states: 1,724,356,567,916 (12)
abstracting: (p98<=0)
states: 5,392,310,311,016 (12)
abstracting: (p104<=0)
states: 5,395,191,689,856 (12)
abstracting: (p201<=p123)
states: 5,346,607,984,560 (12)
abstracting: (p122<=p41)
states: 5,379,290,791,248 (12)
abstracting: (p201<=p123)
states: 5,346,607,984,560 (12)
abstracting: (p201<=p123)
states: 5,346,607,984,560 (12)
.
EG iterations: 1
abstracting: (1<=p57)
states: 691,191,860,928 (11)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-10-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.444sec

totally nodes used: 297515855 (3.0e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 250956561 1103766670 1354723231
used/not used/entry size/cache size: 62930707 4178157 16 1024MB
basic ops cache: hits/miss/sum: 13825572 56327516 70153088
used/not used/entry size/cache size: 12050633 4726583 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: 133640 642556 776196
used/not used/entry size/cache size: 180390 8208218 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 35572693
1 20881568
2 7835826
3 2213216
4 497368
5 91404
6 14429
7 2064
8 264
9 32
>= 10 0

Total processing time: 11m42.993sec


BK_STOP 1678785023425

--------------------
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:13778 (58), effective:479 (2)

initing FirstDep: 0m 0.000sec


iterations count:2997 (12), effective:149 (0)

iterations count:3497 (14), effective:185 (0)

iterations count:425 (1), effective:13 (0)

iterations count:439 (1), effective:14 (0)

iterations count:6085 (26), effective:323 (1)

iterations count:6227 (26), effective:324 (1)

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

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

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

iterations count:3897 (16), effective:197 (0)

iterations count:3918 (16), effective:198 (0)

iterations count:298 (1), effective:5 (0)

iterations count:8902 (38), effective:434 (1)

iterations count:7722 (33), effective:381 (1)

iterations count:987 (4), effective:38 (0)

iterations count:4270 (18), effective:215 (0)

iterations count:327 (1), effective:5 (0)

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

iterations count:6671 (28), effective:341 (1)

iterations count:3377 (14), effective:177 (0)

iterations count:1247 (5), effective:56 (0)

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

iterations count:557 (2), effective:6 (0)

iterations count:6462 (27), effective:340 (1)

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

iterations count:725 (3), effective:22 (0)

iterations count:711 (3), effective:25 (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="HirschbergSinclair-PT-10"
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 HirschbergSinclair-PT-10, 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 r202-smll-167840348700433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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