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.r522-tall-167987246800017.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 Anderson-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 302K Mar 31 16:48 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 Anderson-PT-06-CTLCardinality-00
FORMULA_NAME Anderson-PT-06-CTLCardinality-01
FORMULA_NAME Anderson-PT-06-CTLCardinality-02
FORMULA_NAME Anderson-PT-06-CTLCardinality-03
FORMULA_NAME Anderson-PT-06-CTLCardinality-04
FORMULA_NAME Anderson-PT-06-CTLCardinality-05
FORMULA_NAME Anderson-PT-06-CTLCardinality-06
FORMULA_NAME Anderson-PT-06-CTLCardinality-07
FORMULA_NAME Anderson-PT-06-CTLCardinality-08
FORMULA_NAME Anderson-PT-06-CTLCardinality-09
FORMULA_NAME Anderson-PT-06-CTLCardinality-10
FORMULA_NAME Anderson-PT-06-CTLCardinality-11
FORMULA_NAME Anderson-PT-06-CTLCardinality-12
FORMULA_NAME Anderson-PT-06-CTLCardinality-13
FORMULA_NAME Anderson-PT-06-CTLCardinality-14
FORMULA_NAME Anderson-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680839529886

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=Anderson-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:52:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:52:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:52:11] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-04-07 03:52:11] [INFO ] Transformed 229 places.
[2023-04-07 03:52:11] [INFO ] Transformed 600 transitions.
[2023-04-07 03:52:11] [INFO ] Found NUPN structural information;
[2023-04-07 03:52:11] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 8 ms.
Support contains 73 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 197 transition count 368
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 197 transition count 368
Applied a total of 64 rules in 32 ms. Remains 197 /229 variables (removed 32) and now considering 368/600 (removed 232) transitions.
// Phase 1: matrix 368 rows 197 cols
[2023-04-07 03:52:11] [INFO ] Computed 15 invariants in 30 ms
[2023-04-07 03:52:11] [INFO ] Implicit Places using invariants in 334 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/229 places, 368/600 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 196/229 places, 368/600 transitions.
Support contains 73 out of 196 places after structural reductions.
[2023-04-07 03:52:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 03:52:12] [INFO ] Flatten gal took : 59 ms
FORMULA Anderson-PT-06-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:52:12] [INFO ] Flatten gal took : 25 ms
[2023-04-07 03:52:12] [INFO ] Input system was already deterministic with 368 transitions.
Support contains 62 out of 196 places (down from 73) after GAL structural reductions.
FORMULA Anderson-PT-06-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 38) seen :31
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 368 rows 196 cols
[2023-04-07 03:52:12] [INFO ] Computed 14 invariants in 14 ms
[2023-04-07 03:52:12] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 03:52:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 03:52:13] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 10 ms returned sat
[2023-04-07 03:52:13] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-04-07 03:52:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 03:52:13] [INFO ] After 90ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-04-07 03:52:13] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-04-07 03:52:13] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 368/368 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 335
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 163 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 162 transition count 334
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 68 place count 162 transition count 308
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 120 place count 136 transition count 308
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 144 place count 112 transition count 184
Iterating global reduction 3 with 24 rules applied. Total rules applied 168 place count 112 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 176 place count 108 transition count 180
Applied a total of 176 rules in 40 ms. Remains 108 /196 variables (removed 88) and now considering 180/368 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 108/196 places, 180/368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 108 cols
[2023-04-07 03:52:13] [INFO ] Computed 14 invariants in 6 ms
[2023-04-07 03:52:13] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:52:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-04-07 03:52:13] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-07 03:52:13] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:52:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 03:52:13] [INFO ] After 10ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:52:13] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 03:52:13] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 180/180 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 106 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 104 transition count 176
Applied a total of 8 rules in 11 ms. Remains 104 /108 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 104/108 places, 176/180 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13500 steps, run visited all 1 properties in 44 ms. (steps per millisecond=306 )
Probabilistic random walk after 13500 steps, saw 8134 distinct states, run finished after 44 ms. (steps per millisecond=306 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-04-07 03:52:13] [INFO ] Flatten gal took : 19 ms
[2023-04-07 03:52:13] [INFO ] Flatten gal took : 22 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 368 transitions.
Support contains 50 out of 196 places (down from 54) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 171 transition count 243
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 171 transition count 243
Applied a total of 50 rules in 6 ms. Remains 171 /196 variables (removed 25) and now considering 243/368 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 171/196 places, 243/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 169 transition count 241
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 169 transition count 241
Applied a total of 54 rules in 5 ms. Remains 169 /196 variables (removed 27) and now considering 241/368 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 169/196 places, 241/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 16 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 172 transition count 264
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 172 transition count 264
Applied a total of 48 rules in 5 ms. Remains 172 /196 variables (removed 24) and now considering 264/368 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 172/196 places, 264/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 168 transition count 240
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 168 transition count 240
Applied a total of 56 rules in 5 ms. Remains 168 /196 variables (removed 28) and now considering 240/368 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 168/196 places, 240/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 25 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 172 transition count 254
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 172 transition count 254
Applied a total of 48 rules in 6 ms. Remains 172 /196 variables (removed 24) and now considering 254/368 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 172/196 places, 254/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 196 transition count 333
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 161 transition count 333
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 161 transition count 303
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 131 transition count 303
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 158 place count 103 transition count 175
Iterating global reduction 2 with 28 rules applied. Total rules applied 186 place count 103 transition count 175
Applied a total of 186 rules in 20 ms. Remains 103 /196 variables (removed 93) and now considering 175/368 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 103/196 places, 175/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 14 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 170 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 170 transition count 252
Applied a total of 52 rules in 6 ms. Remains 170 /196 variables (removed 26) and now considering 252/368 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 170/196 places, 252/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 168 transition count 240
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 168 transition count 240
Applied a total of 56 rules in 6 ms. Remains 168 /196 variables (removed 28) and now considering 240/368 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 168/196 places, 240/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 196 transition count 334
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 162 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 160 transition count 332
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 72 place count 160 transition count 302
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 132 place count 130 transition count 302
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 160 place count 102 transition count 174
Iterating global reduction 3 with 28 rules applied. Total rules applied 188 place count 102 transition count 174
Applied a total of 188 rules in 16 ms. Remains 102 /196 variables (removed 94) and now considering 174/368 (removed 194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 102/196 places, 174/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 176 transition count 268
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 176 transition count 268
Applied a total of 40 rules in 6 ms. Remains 176 /196 variables (removed 20) and now considering 268/368 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 176/196 places, 268/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 196 transition count 333
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 161 transition count 333
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 161 transition count 303
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 131 transition count 303
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 158 place count 103 transition count 175
Iterating global reduction 2 with 28 rules applied. Total rules applied 186 place count 103 transition count 175
Applied a total of 186 rules in 15 ms. Remains 103 /196 variables (removed 93) and now considering 175/368 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 103/196 places, 175/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 169 transition count 241
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 169 transition count 241
Applied a total of 54 rules in 5 ms. Remains 169 /196 variables (removed 27) and now considering 241/368 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 169/196 places, 241/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 169 transition count 251
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 169 transition count 251
Applied a total of 54 rules in 10 ms. Remains 169 /196 variables (removed 27) and now considering 251/368 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 169/196 places, 251/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 251 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 368/368 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 196 transition count 332
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 160 transition count 332
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 72 place count 160 transition count 303
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 131 transition count 303
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 157 place count 104 transition count 176
Iterating global reduction 2 with 27 rules applied. Total rules applied 184 place count 104 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 103 transition count 175
Applied a total of 186 rules in 15 ms. Remains 103 /196 variables (removed 93) and now considering 175/368 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 103/196 places, 175/368 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:52:14] [INFO ] Input system was already deterministic with 175 transitions.
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:52:14] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:52:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 03:52:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 368 transitions and 1304 arcs took 2 ms.
Total runtime 3454 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: 196 NrTr: 368 NrArc: 1304)

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

net check time: 0m 0.000sec

init dd package: 0m 2.714sec


RS generation: 1m48.438sec


-> reachability set: #nodes 377214 (3.8e+05) #states 3,669,396 (6)



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

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

abstracting: (1<=p174)
states: 21,001 (4)
abstracting: (p174<=1)
states: 3,669,396 (6)
..................................
EG iterations: 34
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.062sec

checking: AG [AX [~ [[p91<=0 & 0<=p91]]]]
normalized: ~ [E [true U EX [[p91<=0 & 0<=p91]]]]

abstracting: (0<=p91)
states: 3,669,396 (6)
abstracting: (p91<=0)
states: 3,424,828 (6)
.-> the formula is FALSE

FORMULA Anderson-PT-06-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.649sec

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

abstracting: (0<=p163)
states: 3,669,396 (6)
abstracting: (p163<=0)
states: 3,644,328 (6)
..................................
EG iterations: 34
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57.765sec

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

abstracting: (0<=p59)
states: 3,669,396 (6)
abstracting: (p59<=0)
states: 3,520,143 (6)
.-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.325sec

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

abstracting: (0<=p76)
states: 3,669,396 (6)
abstracting: (p76<=0)
states: 3,517,711 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.634sec

checking: EG [EG [EF [[~ [[p136<=0 & 0<=p136]] & ~ [[p132<=1 & 1<=p132]]]]]]
normalized: EG [EG [E [true U [~ [[p132<=1 & 1<=p132]] & ~ [[p136<=0 & 0<=p136]]]]]]

abstracting: (0<=p136)
states: 3,669,396 (6)
abstracting: (p136<=0)
states: 3,642,660 (6)
abstracting: (1<=p132)
states: 21,858 (4)
abstracting: (p132<=1)
states: 3,669,396 (6)

before gc: list nodes free: 704545

after gc: idd nodes used:713825, unused:63286175; list nodes free:284243223

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m36.580sec

checking: [AX [AG [[p28<=0 & 0<=p28]]] | AF [[[p77<=0 & 0<=p77] & [p16<=1 & 1<=p16]]]]
normalized: [~ [EG [~ [[[p16<=1 & 1<=p16] & [p77<=0 & 0<=p77]]]]] | ~ [EX [E [true U ~ [[p28<=0 & 0<=p28]]]]]]

abstracting: (0<=p28)
states: 3,669,396 (6)
abstracting: (p28<=0)
states: 3,374,167 (6)
.abstracting: (0<=p77)
states: 3,669,396 (6)
abstracting: (p77<=0)
states: 3,567,440 (6)
abstracting: (1<=p16)
states: 84,480 (4)
abstracting: (p16<=1)
states: 3,669,396 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m19.062sec

checking: AG [[AF [[~ [[p150<=1 & 1<=p150]] | EX [~ [[p23<=0 & 0<=p23]]]]] & EF [~ [[p96<=0 & 0<=p96]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [[p96<=0 & 0<=p96]]] & ~ [EG [~ [[EX [~ [[p23<=0 & 0<=p23]]] | ~ [[p150<=1 & 1<=p150]]]]]]]]]]

abstracting: (1<=p150)
states: 21,435 (4)
abstracting: (p150<=1)
states: 3,669,396 (6)
abstracting: (0<=p23)
states: 3,669,396 (6)
abstracting: (p23<=0)
states: 3,428,232 (6)
.............
EG iterations: 12
abstracting: (0<=p96)
states: 3,669,396 (6)
abstracting: (p96<=0)
states: 3,469,434 (6)
-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m45.165sec

checking: AX [EF [EG [[[[p68<=0 & 0<=p68] | [p174<=1 & 1<=p174]] | [[p193<=0 & 0<=p193] | [p139<=1 & 1<=p139]]]]]]
normalized: ~ [EX [~ [E [true U EG [[[[p139<=1 & 1<=p139] | [p193<=0 & 0<=p193]] | [[p174<=1 & 1<=p174] | [p68<=0 & 0<=p68]]]]]]]]

abstracting: (0<=p68)
states: 3,669,396 (6)
abstracting: (p68<=0)
states: 3,528,134 (6)
abstracting: (1<=p174)
states: 21,001 (4)
abstracting: (p174<=1)
states: 3,669,396 (6)
abstracting: (0<=p193)
states: 3,669,396 (6)
abstracting: (p193<=0)
states: 3,650,576 (6)
abstracting: (1<=p139)
states: 23,103 (4)
abstracting: (p139<=1)
states: 3,669,396 (6)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.216sec

checking: EF [AG [[EF [[p102<=1 & 1<=p102]] & [[p179<=0 & 0<=p179] | EX [[[p141<=0 & 0<=p141] | [p117<=1 & 1<=p117]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[EX [[[p117<=1 & 1<=p117] | [p141<=0 & 0<=p141]]] | [p179<=0 & 0<=p179]] & E [true U [p102<=1 & 1<=p102]]]]]]]

abstracting: (1<=p102)
states: 193,691 (5)
abstracting: (p102<=1)
states: 3,669,396 (6)
abstracting: (0<=p179)
states: 3,669,396 (6)
abstracting: (p179<=0)
states: 3,647,158 (6)
abstracting: (0<=p141)
states: 3,669,396 (6)
abstracting: (p141<=0)
states: 3,639,790 (6)
abstracting: (1<=p117)
states: 272,970 (5)
abstracting: (p117<=1)
states: 3,669,396 (6)
.-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 1.308sec

checking: EX [~ [E [[p161<=1 & 1<=p161] U AG [[AX [[[p69<=0 & 0<=p69] | [p53<=1 & 1<=p53]]] & A [[[p1<=0 & 0<=p1] | [p51<=1 & 1<=p51]] U [[p175<=0 & 0<=p175] | [p146<=1 & 1<=p146]]]]]]]]
normalized: EX [~ [E [[p161<=1 & 1<=p161] U ~ [E [true U ~ [[[~ [EG [~ [[[p146<=1 & 1<=p146] | [p175<=0 & 0<=p175]]]]] & ~ [E [~ [[[p146<=1 & 1<=p146] | [p175<=0 & 0<=p175]]] U [~ [[[p51<=1 & 1<=p51] | [p1<=0 & 0<=p1]]] & ~ [[[p146<=1 & 1<=p146] | [p175<=0 & 0<=p175]]]]]]] & ~ [EX [~ [[[p53<=1 & 1<=p53] | [p69<=0 & 0<=p69]]]]]]]]]]]]

abstracting: (0<=p69)
states: 3,669,396 (6)
abstracting: (p69<=0)
states: 3,571,726 (6)
abstracting: (1<=p53)
states: 113,576 (5)
abstracting: (p53<=1)
states: 3,669,396 (6)
.abstracting: (0<=p175)
states: 3,669,396 (6)
abstracting: (p175<=0)
states: 3,646,293 (6)
abstracting: (1<=p146)
states: 19,085 (4)
abstracting: (p146<=1)
states: 3,669,396 (6)
abstracting: (0<=p1)
states: 3,669,396 (6)
abstracting: (p1<=0)
states: 3,234,988 (6)
abstracting: (1<=p51)
states: 157,306 (5)
abstracting: (p51<=1)
states: 3,669,396 (6)
abstracting: (0<=p175)
states: 3,669,396 (6)
abstracting: (p175<=0)
states: 3,646,293 (6)
abstracting: (1<=p146)
states: 19,085 (4)
abstracting: (p146<=1)
states: 3,669,396 (6)
abstracting: (0<=p175)
states: 3,669,396 (6)
abstracting: (p175<=0)
states: 3,646,293 (6)
abstracting: (1<=p146)
states: 19,085 (4)
abstracting: (p146<=1)
states: 3,669,396 (6)
............
EG iterations: 12

before gc: list nodes free: 1834397

after gc: idd nodes used:1364689, unused:62635311; list nodes free:281404668
abstracting: (1<=p161)
states: 28,831 (4)
abstracting: (p161<=1)
states: 3,669,396 (6)
.-> the formula is TRUE

FORMULA Anderson-PT-06-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 6.515sec

checking: [EF [[EG [EX [~ [[p62<=1 & 1<=p62]]]] | EG [[[p102<=0 & 0<=p102] | [p194<=1 & 1<=p194]]]]] | AX [A [[AG [~ [[p152<=1 & 1<=p152]]] | [[p22<=0 & 0<=p22] | [p23<=1 & 1<=p23]]] U EG [EF [[p54<=1 & 1<=p54]]]]]]
normalized: [~ [EX [~ [[~ [EG [~ [EG [E [true U [p54<=1 & 1<=p54]]]]]] & ~ [E [~ [EG [E [true U [p54<=1 & 1<=p54]]]] U [~ [[[[p23<=1 & 1<=p23] | [p22<=0 & 0<=p22]] | ~ [E [true U [p152<=1 & 1<=p152]]]]] & ~ [EG [E [true U [p54<=1 & 1<=p54]]]]]]]]]]] | E [true U [EG [[[p194<=1 & 1<=p194] | [p102<=0 & 0<=p102]]] | EG [EX [~ [[p62<=1 & 1<=p62]]]]]]]

abstracting: (1<=p62)
states: 140,338 (5)
abstracting: (p62<=1)
states: 3,669,396 (6)
.
EG iterations: 0
abstracting: (0<=p102)
states: 3,669,396 (6)
abstracting: (p102<=0)
states: 3,475,705 (6)
abstracting: (1<=p194)
states: 16,671 (4)
abstracting: (p194<=1)
states: 3,669,396 (6)
................................
EG iterations: 32
abstracting: (1<=p54)
states: 147,042 (5)
abstracting: (p54<=1)
states: 3,669,396 (6)

EG iterations: 0
abstracting: (1<=p152)
states: 22,256 (4)
abstracting: (p152<=1)
states: 3,669,396 (6)
abstracting: (0<=p22)
states: 3,669,396 (6)
abstracting: (p22<=0)
states: 3,413,519 (6)
abstracting: (1<=p23)
states: 241,164 (5)
abstracting: (p23<=1)
states: 3,669,396 (6)
abstracting: (1<=p54)
states: 147,042 (5)
abstracting: (p54<=1)
states: 3,669,396 (6)

EG iterations: 0
abstracting: (1<=p54)
states: 147,042 (5)
abstracting: (p54<=1)
states: 3,669,396 (6)

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

FORMULA Anderson-PT-06-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m59.971sec

checking: [AG [[[p3<=0 & 0<=p3] | [p61<=1 & 1<=p61]]] & [EG [[[p9<=0 & 0<=p9] | [p60<=1 & 1<=p60]]] | AF [E [A [[[p3<=0 & 0<=p3] | [p5<=1 & 1<=p5]] U E [[p82<=1 & 1<=p82] U [[p139<=0 & 0<=p139] | [p1<=1 & 1<=p1]]]] U [EX [0<=0] & ~ [[[p32<=0 & 0<=p32] | [p96<=1 & 1<=p96]]]]]]]]
normalized: [[~ [EG [~ [E [[~ [EG [~ [E [[p82<=1 & 1<=p82] U [[p1<=1 & 1<=p1] | [p139<=0 & 0<=p139]]]]]] & ~ [E [~ [E [[p82<=1 & 1<=p82] U [[p1<=1 & 1<=p1] | [p139<=0 & 0<=p139]]]] U [~ [[[p5<=1 & 1<=p5] | [p3<=0 & 0<=p3]]] & ~ [E [[p82<=1 & 1<=p82] U [[p1<=1 & 1<=p1] | [p139<=0 & 0<=p139]]]]]]]] U [~ [[[p96<=1 & 1<=p96] | [p32<=0 & 0<=p32]]] & EX [0<=0]]]]]] | EG [[[p60<=1 & 1<=p60] | [p9<=0 & 0<=p9]]]] & ~ [E [true U ~ [[[p61<=1 & 1<=p61] | [p3<=0 & 0<=p3]]]]]]

abstracting: (0<=p3)
states: 3,669,396 (6)
abstracting: (p3<=0)
states: 3,225,719 (6)
abstracting: (1<=p61)
states: 104,999 (5)
abstracting: (p61<=1)
states: 3,669,396 (6)
abstracting: (0<=p9)
states: 3,669,396 (6)
abstracting: (p9<=0)
states: 3,192,776 (6)
abstracting: (1<=p60)
states: 84,114 (4)
abstracting: (p60<=1)
states: 3,669,396 (6)
..............................
EG iterations: 30
abstracting: (0<=0)
states: 3,669,396 (6)
.abstracting: (0<=p32)
states: 3,669,396 (6)
abstracting: (p32<=0)
states: 3,464,145 (6)
abstracting: (1<=p96)
states: 199,962 (5)
abstracting: (p96<=1)
states: 3,669,396 (6)
abstracting: (0<=p139)
states: 3,669,396 (6)
abstracting: (p139<=0)
states: 3,646,293 (6)
abstracting: (1<=p1)
states: 434,408 (5)
abstracting: (p1<=1)
states: 3,669,396 (6)
abstracting: (1<=p82)
states: 156,455 (5)
abstracting: (p82<=1)
states: 3,669,396 (6)
abstracting: (0<=p3)
states: 3,669,396 (6)
abstracting: (p3<=0)
states: 3,225,719 (6)
abstracting: (1<=p5)
states: 546,451 (5)
abstracting: (p5<=1)
states: 3,669,396 (6)
abstracting: (0<=p139)
states: 3,669,396 (6)
abstracting: (p139<=0)
states: 3,646,293 (6)
abstracting: (1<=p1)
states: 434,408 (5)
abstracting: (p1<=1)
states: 3,669,396 (6)
abstracting: (1<=p82)
states: 156,455 (5)
abstracting: (p82<=1)
states: 3,669,396 (6)
abstracting: (0<=p139)
states: 3,669,396 (6)
abstracting: (p139<=0)
states: 3,646,293 (6)
abstracting: (1<=p1)
states: 434,408 (5)
abstracting: (p1<=1)
states: 3,669,396 (6)
abstracting: (1<=p82)
states: 156,455 (5)
abstracting: (p82<=1)
states: 3,669,396 (6)
............
EG iterations: 12

before gc: list nodes free: 2984794

after gc: idd nodes used:1884374, unused:62115626; list nodes free:279108207
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-06-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m49.225sec

checking: EG [EF [[[[[[~ [[p108<=0 & 0<=p108]] & ~ [[p115<=0 & 0<=p115]]] & [~ [[p60<=1 & 1<=p60]] & [[~ [[p35<=0 & 0<=p35]] & ~ [[p79<=1 & 1<=p79]]] | [~ [[p81<=0 & 0<=p81]] & ~ [[p30<=1 & 1<=p30]]]]]] | [p20<=1 & 1<=p20]] | [p172<=0 & 0<=p172]] | [EX [[[p173<=0 & 0<=p173] | [p85<=1 & 1<=p85]]] | EX [~ [[p74<=1 & 1<=p74]]]]]]]
normalized: EG [E [true U [[EX [~ [[p74<=1 & 1<=p74]]] | EX [[[p85<=1 & 1<=p85] | [p173<=0 & 0<=p173]]]] | [[p172<=0 & 0<=p172] | [[p20<=1 & 1<=p20] | [[[[~ [[p30<=1 & 1<=p30]] & ~ [[p81<=0 & 0<=p81]]] | [~ [[p79<=1 & 1<=p79]] & ~ [[p35<=0 & 0<=p35]]]] & ~ [[p60<=1 & 1<=p60]]] & [~ [[p115<=0 & 0<=p115]] & ~ [[p108<=0 & 0<=p108]]]]]]]]]

abstracting: (0<=p108)
states: 3,669,396 (6)
abstracting: (p108<=0)
states: 3,488,682 (6)
abstracting: (0<=p115)
states: 3,669,396 (6)
abstracting: (p115<=0)
states: 3,439,526 (6)
abstracting: (1<=p60)
states: 84,114 (4)
abstracting: (p60<=1)
states: 3,669,396 (6)
abstracting: (0<=p35)
states: 3,669,396 (6)
abstracting: (p35<=0)
states: 3,546,310 (6)
abstracting: (1<=p79)
states: 95,616 (4)
abstracting: (p79<=1)
states: 3,669,396 (6)
abstracting: (0<=p81)
states: 3,669,396 (6)
abstracting: (p81<=0)
states: 3,510,772 (6)
abstracting: (1<=p30)
states: 216,521 (5)
abstracting: (p30<=1)
states: 3,669,396 (6)
abstracting: (1<=p20)
states: 262,088 (5)
abstracting: (p20<=1)
states: 3,669,396 (6)
abstracting: (0<=p172)
states: 3,669,396 (6)
abstracting: (p172<=0)
states: 3,642,660 (6)
abstracting: (0<=p173)
states: 3,669,396 (6)
abstracting: (p173<=0)
states: 3,645,787 (6)
abstracting: (1<=p85)
states: 120,446 (5)
abstracting: (p85<=1)
states: 3,669,396 (6)
.abstracting: (1<=p74)
states: 204,008 (5)
abstracting: (p74<=1)
states: 3,669,396 (6)
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m43.490sec

totally nodes used: 207614745 (2.1e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 827737658 3376749833 4204487491
used/not used/entry size/cache size: 64948902 2159962 16 1024MB
basic ops cache: hits/miss/sum: 58029862 181612259 239642121
used/not used/entry size/cache size: 12990836 3786380 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: 714870 3374621 4089491
used/not used/entry size/cache size: 743997 7644611 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 51864581
1 11790569
2 2724126
3 601012
4 109784
5 16414
6 2106
7 244
8 26
9 2
>= 10 0

Total processing time: 23m32.572sec


BK_STOP 1680840948333

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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.001sec

21621 30400 41343 89001 115515 112512 166048 205262 206516 222799 250057 251924 243579 311737 344551 367490 386204 392158 384231 378004
iterations count:2067957 (5619), effective:21447 (58)

initing FirstDep: 0m 0.000sec


iterations count:22457 (61), effective:442 (1)

iterations count:21916 (59), effective:404 (1)
148526 345573
iterations count:238491 (648), effective:7653 (20)
288471
iterations count:184194 (500), effective:5886 (15)
273959 328789
iterations count:258675 (702), effective:7552 (20)

iterations count:448 (1), effective:1 (0)
297648 330878
iterations count:257082 (698), effective:7718 (20)

iterations count:368 (1), effective:0 (0)
172138 249396 378415
iterations count:330526 (898), effective:10912 (29)

iterations count:368 (1), effective:0 (0)
259160 332795
iterations count:242805 (659), effective:6980 (18)
301697 365038
iterations count:208413 (566), effective:6670 (18)
259160 332795
iterations count:242805 (659), effective:6980 (18)
259160 332795
iterations count:242805 (659), effective:6980 (18)

iterations count:57498 (156), effective:1206 (3)

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

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

iterations count:372 (1), effective:1 (0)
263911 388841
iterations count:205856 (559), effective:6345 (17)

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-06"
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 Anderson-PT-06, 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 r522-tall-167987246800017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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