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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.8K 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 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 185K 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-05-CTLCardinality-00
FORMULA_NAME Anderson-PT-05-CTLCardinality-01
FORMULA_NAME Anderson-PT-05-CTLCardinality-02
FORMULA_NAME Anderson-PT-05-CTLCardinality-03
FORMULA_NAME Anderson-PT-05-CTLCardinality-04
FORMULA_NAME Anderson-PT-05-CTLCardinality-05
FORMULA_NAME Anderson-PT-05-CTLCardinality-06
FORMULA_NAME Anderson-PT-05-CTLCardinality-07
FORMULA_NAME Anderson-PT-05-CTLCardinality-08
FORMULA_NAME Anderson-PT-05-CTLCardinality-09
FORMULA_NAME Anderson-PT-05-CTLCardinality-10
FORMULA_NAME Anderson-PT-05-CTLCardinality-11
FORMULA_NAME Anderson-PT-05-CTLCardinality-12
FORMULA_NAME Anderson-PT-05-CTLCardinality-13
FORMULA_NAME Anderson-PT-05-CTLCardinality-14
FORMULA_NAME Anderson-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680839106823

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-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:45:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:45:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:45:08] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-04-07 03:45:08] [INFO ] Transformed 161 places.
[2023-04-07 03:45:08] [INFO ] Transformed 365 transitions.
[2023-04-07 03:45:08] [INFO ] Found NUPN structural information;
[2023-04-07 03:45:08] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Support contains 67 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 145 transition count 285
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 145 transition count 285
Applied a total of 32 rules in 22 ms. Remains 145 /161 variables (removed 16) and now considering 285/365 (removed 80) transitions.
// Phase 1: matrix 285 rows 145 cols
[2023-04-07 03:45:08] [INFO ] Computed 13 invariants in 25 ms
[2023-04-07 03:45:08] [INFO ] Implicit Places using invariants in 417 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/161 places, 285/365 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 144/161 places, 285/365 transitions.
Support contains 67 out of 144 places after structural reductions.
[2023-04-07 03:45:09] [INFO ] Flatten gal took : 45 ms
[2023-04-07 03:45:09] [INFO ] Flatten gal took : 21 ms
[2023-04-07 03:45:09] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 61 out of 144 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 45) seen :38
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) 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
Running SMT prover for 7 properties.
// Phase 1: matrix 285 rows 144 cols
[2023-04-07 03:45:10] [INFO ] Computed 12 invariants in 14 ms
[2023-04-07 03:45:10] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 03:45:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 03:45:10] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:45:10] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-04-07 03:45:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:45:10] [INFO ] After 102ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-04-07 03:45:10] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-04-07 03:45:10] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 11 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 144 transition count 264
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 123 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 122 transition count 263
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 44 place count 122 transition count 249
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 72 place count 108 transition count 249
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 90 place count 90 transition count 143
Iterating global reduction 3 with 18 rules applied. Total rules applied 108 place count 90 transition count 143
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 118 place count 85 transition count 138
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 85 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 84 transition count 137
Applied a total of 120 rules in 32 ms. Remains 84 /144 variables (removed 60) and now considering 137/285 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 84/144 places, 137/285 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 84 cols
[2023-04-07 03:45:11] [INFO ] Computed 12 invariants in 2 ms
[2023-04-07 03:45:11] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:45:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-07 03:45:11] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-07 03:45:11] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:45:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:45:11] [INFO ] After 9ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:45:11] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 03:45:11] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 137/137 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 83 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 82 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 82 transition count 127
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 2 with 8 rules applied. Total rules applied 12 place count 78 transition count 123
Applied a total of 12 rules in 13 ms. Remains 78 /84 variables (removed 6) and now considering 123/137 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 78/84 places, 123/137 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 7223 states, properties seen :0
Probabilistic random walk after 24188 steps, saw 7223 distinct states, run finished after 65 ms. (steps per millisecond=372 ) properties seen :0
Explored full state space saw : 7223 states, properties seen :0
Exhaustive walk after 24188 steps, saw 7223 distinct states, run finished after 28 ms. (steps per millisecond=863 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-05-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 15 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 17 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 54 out of 144 places (down from 55) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 175
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 175
Applied a total of 44 rules in 9 ms. Remains 122 /144 variables (removed 22) and now considering 175/285 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 122/144 places, 175/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 175
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 175
Applied a total of 44 rules in 6 ms. Remains 122 /144 variables (removed 22) and now considering 175/285 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 122/144 places, 175/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 14 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 175
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 175
Applied a total of 44 rules in 4 ms. Remains 122 /144 variables (removed 22) and now considering 175/285 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 122/144 places, 175/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 261
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 120 transition count 261
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 48 place count 120 transition count 242
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 86 place count 101 transition count 242
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 109 place count 78 transition count 131
Iterating global reduction 2 with 23 rules applied. Total rules applied 132 place count 78 transition count 131
Applied a total of 132 rules in 13 ms. Remains 78 /144 variables (removed 66) and now considering 131/285 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 78/144 places, 131/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 166
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 166
Applied a total of 46 rules in 6 ms. Remains 121 /144 variables (removed 23) and now considering 166/285 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 121/144 places, 166/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 124 transition count 185
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 124 transition count 185
Applied a total of 40 rules in 3 ms. Remains 124 /144 variables (removed 20) and now considering 185/285 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/144 places, 185/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 13 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 174
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 174
Applied a total of 46 rules in 2 ms. Remains 121 /144 variables (removed 23) and now considering 174/285 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 121/144 places, 174/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 165
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 165
Applied a total of 48 rules in 3 ms. Remains 120 /144 variables (removed 24) and now considering 165/285 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/144 places, 165/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 144 transition count 272
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 131 transition count 266
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 38 place count 125 transition count 266
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 38 place count 125 transition count 250
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 70 place count 109 transition count 250
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 90 place count 89 transition count 142
Iterating global reduction 3 with 20 rules applied. Total rules applied 110 place count 89 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 86 transition count 139
Applied a total of 116 rules in 14 ms. Remains 86 /144 variables (removed 58) and now considering 139/285 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 86/144 places, 139/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 166
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 166
Applied a total of 46 rules in 3 ms. Remains 121 /144 variables (removed 23) and now considering 166/285 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 121/144 places, 166/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:11] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 144 transition count 263
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 122 transition count 263
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 44 place count 122 transition count 244
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 82 place count 103 transition count 244
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 104 place count 81 transition count 134
Iterating global reduction 2 with 22 rules applied. Total rules applied 126 place count 81 transition count 134
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 128 place count 80 transition count 133
Applied a total of 128 rules in 12 ms. Remains 80 /144 variables (removed 64) and now considering 133/285 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 80/144 places, 133/285 transitions.
[2023-04-07 03:45:11] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:12] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 144 transition count 264
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 123 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 122 transition count 263
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 44 place count 122 transition count 246
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 78 place count 105 transition count 246
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 99 place count 84 transition count 145
Iterating global reduction 3 with 21 rules applied. Total rules applied 120 place count 84 transition count 145
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 3 with 2 rules applied. Total rules applied 122 place count 83 transition count 144
Applied a total of 122 rules in 13 ms. Remains 83 /144 variables (removed 61) and now considering 144/285 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 83/144 places, 144/285 transitions.
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:12] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 261
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 120 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 119 transition count 260
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 50 place count 119 transition count 240
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 90 place count 99 transition count 240
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 114 place count 75 transition count 120
Iterating global reduction 3 with 24 rules applied. Total rules applied 138 place count 75 transition count 120
Applied a total of 138 rules in 10 ms. Remains 75 /144 variables (removed 69) and now considering 120/285 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 75/144 places, 120/285 transitions.
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 13 ms
[2023-04-07 03:45:12] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 165
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 165
Applied a total of 48 rules in 3 ms. Remains 120 /144 variables (removed 24) and now considering 165/285 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/144 places, 165/285 transitions.
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:12] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 285/285 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 261
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 120 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 119 transition count 260
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 50 place count 119 transition count 244
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 82 place count 103 transition count 244
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 103 place count 82 transition count 127
Iterating global reduction 3 with 21 rules applied. Total rules applied 124 place count 82 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 79 transition count 124
Applied a total of 130 rules in 18 ms. Remains 79 /144 variables (removed 65) and now considering 124/285 (removed 161) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 79/144 places, 124/285 transitions.
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:45:12] [INFO ] Input system was already deterministic with 124 transitions.
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:45:12] [INFO ] Flatten gal took : 15 ms
[2023-04-07 03:45:12] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-04-07 03:45:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 285 transitions and 1026 arcs took 2 ms.
Total runtime 3913 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: 144 NrTr: 285 NrArc: 1026)

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

net check time: 0m 0.000sec

init dd package: 0m 2.744sec


RS generation: 0m14.814sec


-> reachability set: #nodes 65025 (6.5e+04) #states 310,987 (5)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 310,987 (5)
.-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.827sec

checking: EF [AG [[p117<=1 & 1<=p117]]]
normalized: E [true U ~ [E [true U ~ [[p117<=1 & 1<=p117]]]]]

abstracting: (1<=p117)
states: 2,496 (3)
abstracting: (p117<=1)
states: 310,987 (5)
-> the formula is FALSE

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

MC time: 0m 2.419sec

checking: AF [[[p72<=0 & 0<=p72] & [p17<=1 & 1<=p17]]]
normalized: ~ [EG [~ [[[p17<=1 & 1<=p17] & [p72<=0 & 0<=p72]]]]]

abstracting: (0<=p72)
states: 310,987 (5)
abstracting: (p72<=0)
states: 294,007 (5)
abstracting: (1<=p17)
states: 27,744 (4)
abstracting: (p17<=1)
states: 310,987 (5)
.............................
EG iterations: 29
-> the formula is FALSE

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

MC time: 0m 3.690sec

checking: AG [EX [[[p40<=0 & 0<=p40] | EF [[p99<=1 & 1<=p99]]]]]
normalized: ~ [E [true U ~ [EX [[E [true U [p99<=1 & 1<=p99]] | [p40<=0 & 0<=p40]]]]]]

abstracting: (0<=p40)
states: 310,987 (5)
abstracting: (p40<=0)
states: 300,708 (5)
abstracting: (1<=p99)
states: 2,991 (3)
abstracting: (p99<=1)
states: 310,987 (5)
.-> the formula is TRUE

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

MC time: 0m 7.168sec

checking: AF [AX [AF [EG [[~ [[p134<=0 & 0<=p134]] & ~ [[p141<=1 & 1<=p141]]]]]]]
normalized: ~ [EG [EX [EG [~ [EG [[~ [[p141<=1 & 1<=p141]] & ~ [[p134<=0 & 0<=p134]]]]]]]]]

abstracting: (0<=p134)
states: 310,987 (5)
abstracting: (p134<=0)
states: 307,996 (5)
abstracting: (1<=p141)
states: 2,794 (3)
abstracting: (p141<=1)
states: 310,987 (5)
..........
EG iterations: 10

EG iterations: 0
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.350sec

checking: [AF [[[p94<=1 & 1<=p94] & [p47<=0 & 0<=p47]]] & E [[p31<=0 & 0<=p31] U AX [~ [[p58<=1 & 1<=p58]]]]]
normalized: [E [[p31<=0 & 0<=p31] U ~ [EX [[p58<=1 & 1<=p58]]]] & ~ [EG [~ [[[p47<=0 & 0<=p47] & [p94<=1 & 1<=p94]]]]]]

abstracting: (1<=p94)
states: 3,342 (3)
abstracting: (p94<=1)
states: 310,987 (5)
abstracting: (0<=p47)
states: 310,987 (5)
abstracting: (p47<=0)
states: 301,559 (5)
...........................
EG iterations: 27
abstracting: (1<=p58)
states: 15,600 (4)
abstracting: (p58<=1)
states: 310,987 (5)
.abstracting: (0<=p31)
states: 310,987 (5)
abstracting: (p31<=0)
states: 282,812 (5)
-> the formula is FALSE

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

MC time: 0m 6.375sec

checking: AG [[EX [EF [[[[p103<=0 & 0<=p103] | [p16<=1 & 1<=p16]] & [[p61<=0 & 0<=p61] | [p139<=1 & 1<=p139]]]]] | AF [EX [0<=0]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [0<=0]]]] | EX [E [true U [[[p139<=1 & 1<=p139] | [p61<=0 & 0<=p61]] & [[p16<=1 & 1<=p16] | [p103<=0 & 0<=p103]]]]]]]]]

abstracting: (0<=p103)
states: 310,987 (5)
abstracting: (p103<=0)
states: 307,979 (5)
abstracting: (1<=p16)
states: 26,044 (4)
abstracting: (p16<=1)
states: 310,987 (5)
abstracting: (0<=p61)
states: 310,987 (5)
abstracting: (p61<=0)
states: 303,045 (5)
abstracting: (1<=p139)
states: 3,516 (3)
abstracting: (p139<=1)
states: 310,987 (5)
.abstracting: (0<=0)
states: 310,987 (5)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.280sec

checking: AG [EF [[EF [[p106<=1 & 1<=p106]] & [EX [[[p53<=0 & 0<=p53] | [[p137<=1 & 1<=p137] | [p24<=1 & 1<=p24]]]] | [p108<=0 & 0<=p108]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p108<=0 & 0<=p108] | EX [[[[p24<=1 & 1<=p24] | [p137<=1 & 1<=p137]] | [p53<=0 & 0<=p53]]]] & E [true U [p106<=1 & 1<=p106]]]]]]]

abstracting: (1<=p106)
states: 2,682 (3)
abstracting: (p106<=1)
states: 310,987 (5)
abstracting: (0<=p53)
states: 310,987 (5)
abstracting: (p53<=0)
states: 303,011 (5)
abstracting: (1<=p137)
states: 2,183 (3)
abstracting: (p137<=1)
states: 310,987 (5)
abstracting: (1<=p24)
states: 28,185 (4)
abstracting: (p24<=1)
states: 310,987 (5)
.abstracting: (0<=p108)
states: 310,987 (5)
abstracting: (p108<=0)
states: 307,591 (5)
-> the formula is TRUE

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

MC time: 0m 7.197sec

checking: EX [AX [[A [[AG [[p25<=0 & 0<=p25]] | [[p75<=0 & 0<=p75] | [p141<=1 & 1<=p141]]] U [p119<=1 & 1<=p119]] | AX [[[p125<=0 & 0<=p125] & [p115<=1 & 1<=p115]]]]]]
normalized: EX [~ [EX [~ [[~ [EX [~ [[[p115<=1 & 1<=p115] & [p125<=0 & 0<=p125]]]]] | [~ [EG [~ [[p119<=1 & 1<=p119]]]] & ~ [E [~ [[p119<=1 & 1<=p119]] U [~ [[[[p141<=1 & 1<=p141] | [p75<=0 & 0<=p75]] | ~ [E [true U ~ [[p25<=0 & 0<=p25]]]]]] & ~ [[p119<=1 & 1<=p119]]]]]]]]]]]

abstracting: (1<=p119)
states: 3,342 (3)
abstracting: (p119<=1)
states: 310,987 (5)
abstracting: (0<=p25)
states: 310,987 (5)
abstracting: (p25<=0)
states: 286,781 (5)
abstracting: (0<=p75)
states: 310,987 (5)
abstracting: (p75<=0)
states: 294,912 (5)
abstracting: (1<=p141)
states: 2,794 (3)
abstracting: (p141<=1)
states: 310,987 (5)
abstracting: (1<=p119)
states: 3,342 (3)
abstracting: (p119<=1)
states: 310,987 (5)
abstracting: (1<=p119)
states: 3,342 (3)
abstracting: (p119<=1)
states: 310,987 (5)
............................
EG iterations: 28
abstracting: (0<=p125)
states: 310,987 (5)
abstracting: (p125<=0)
states: 308,153 (5)
abstracting: (1<=p115)
states: 3,100 (3)
abstracting: (p115<=1)
states: 310,987 (5)
...-> the formula is FALSE

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

MC time: 0m15.131sec

checking: E [EX [0<=0] U E [[[p89<=1 & 1<=p89] & [[p38<=1 & 1<=p38] | ~ [AF [[p93<=1 & 1<=p93]]]]] U AX [[AG [[p51<=1 & 1<=p51]] & [[p4<=0 & 0<=p4] | [p1<=1 & 1<=p1]]]]]]
normalized: E [EX [0<=0] U E [[[EG [~ [[p93<=1 & 1<=p93]]] | [p38<=1 & 1<=p38]] & [p89<=1 & 1<=p89]] U ~ [EX [~ [[~ [E [true U ~ [[p51<=1 & 1<=p51]]]] & [[p1<=1 & 1<=p1] | [p4<=0 & 0<=p4]]]]]]]]

abstracting: (0<=p4)
states: 310,987 (5)
abstracting: (p4<=0)
states: 258,952 (5)
abstracting: (1<=p1)
states: 42,462 (4)
abstracting: (p1<=1)
states: 310,987 (5)
abstracting: (1<=p51)
states: 17,455 (4)
abstracting: (p51<=1)
states: 310,987 (5)
.abstracting: (1<=p89)
states: 18,563 (4)
abstracting: (p89<=1)
states: 310,987 (5)
abstracting: (1<=p38)
states: 13,566 (4)
abstracting: (p38<=1)
states: 310,987 (5)
abstracting: (1<=p93)
states: 21,258 (4)
abstracting: (p93<=1)
states: 310,987 (5)
..........................
EG iterations: 26
abstracting: (0<=0)
states: 310,987 (5)
.-> the formula is FALSE

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

MC time: 0m 1.564sec

checking: EF [[AG [[[p58<=0 & 0<=p58] & [p130<=1 & 1<=p130]]] & [AG [[[[p7<=0 & 0<=p7] | [p18<=1 & 1<=p18]] & [p137<=1 & 1<=p137]]] | [p37<=1 & 1<=p37]]]]
normalized: E [true U [[~ [E [true U ~ [[[p137<=1 & 1<=p137] & [[p18<=1 & 1<=p18] | [p7<=0 & 0<=p7]]]]]] | [p37<=1 & 1<=p37]] & ~ [E [true U ~ [[[p130<=1 & 1<=p130] & [p58<=0 & 0<=p58]]]]]]]

abstracting: (0<=p58)
states: 310,987 (5)
abstracting: (p58<=0)
states: 295,387 (5)
abstracting: (1<=p130)
states: 3,272 (3)
abstracting: (p130<=1)
states: 310,987 (5)
abstracting: (1<=p37)
states: 16,628 (4)
abstracting: (p37<=1)
states: 310,987 (5)
abstracting: (0<=p7)
states: 310,987 (5)
abstracting: (p7<=0)
states: 269,255 (5)
abstracting: (1<=p18)
states: 24,234 (4)
abstracting: (p18<=1)
states: 310,987 (5)
abstracting: (1<=p137)
states: 2,183 (3)
abstracting: (p137<=1)
states: 310,987 (5)
-> the formula is FALSE

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

MC time: 0m 0.729sec

checking: AG [[~ [A [EG [[p45<=1 & 1<=p45]] U [p6<=0 & 0<=p6]]] | [~ [A [[p53<=1 & 1<=p53] U ~ [[[p56<=0 & 0<=p56] | [p94<=1 & 1<=p94]]]]] | AG [AF [[p69<=0 & 0<=p69]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U EG [~ [[p69<=0 & 0<=p69]]]]] | ~ [[~ [EG [[[p94<=1 & 1<=p94] | [p56<=0 & 0<=p56]]]] & ~ [E [[[p94<=1 & 1<=p94] | [p56<=0 & 0<=p56]] U [~ [[p53<=1 & 1<=p53]] & [[p94<=1 & 1<=p94] | [p56<=0 & 0<=p56]]]]]]]] | ~ [[~ [EG [~ [[p6<=0 & 0<=p6]]]] & ~ [E [~ [[p6<=0 & 0<=p6]] U [~ [EG [[p45<=1 & 1<=p45]]] & ~ [[p6<=0 & 0<=p6]]]]]]]]]]]

abstracting: (0<=p6)
states: 310,987 (5)
abstracting: (p6<=0)
states: 276,583 (5)
abstracting: (1<=p45)
states: 12,305 (4)
abstracting: (p45<=1)
states: 310,987 (5)
..........................
EG iterations: 26
abstracting: (0<=p6)
states: 310,987 (5)
abstracting: (p6<=0)
states: 276,583 (5)
abstracting: (0<=p6)
states: 310,987 (5)
abstracting: (p6<=0)
states: 276,583 (5)
.....................
EG iterations: 21
abstracting: (0<=p56)
states: 310,987 (5)
abstracting: (p56<=0)
states: 298,279 (5)
abstracting: (1<=p94)
states: 3,342 (3)
abstracting: (p94<=1)
states: 310,987 (5)
abstracting: (1<=p53)
states: 7,976 (3)
abstracting: (p53<=1)
states: 310,987 (5)
abstracting: (0<=p56)
states: 310,987 (5)
abstracting: (p56<=0)
states: 298,279 (5)
abstracting: (1<=p94)
states: 3,342 (3)
abstracting: (p94<=1)
states: 310,987 (5)
abstracting: (0<=p56)
states: 310,987 (5)
abstracting: (p56<=0)
states: 298,279 (5)
abstracting: (1<=p94)
states: 3,342 (3)
abstracting: (p94<=1)
states: 310,987 (5)
.
EG iterations: 1
abstracting: (0<=p69)
states: 310,987 (5)
abstracting: (p69<=0)
states: 292,689 (5)
..........................
EG iterations: 26
-> the formula is TRUE

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

MC time: 0m 5.088sec

checking: AG [[[EF [[[[p95<=1 & 1<=p95] | [p30<=0 & 0<=p30]] | [p70<=1 & 1<=p70]]] & E [[p74<=1 & 1<=p74] U [[p23<=0 & 0<=p23] | [p42<=1 & 1<=p42]]]] | EG [AF [[p140<=1 & 1<=p140]]]]]
normalized: ~ [E [true U ~ [[EG [~ [EG [~ [[p140<=1 & 1<=p140]]]]] | [E [[p74<=1 & 1<=p74] U [[p42<=1 & 1<=p42] | [p23<=0 & 0<=p23]]] & E [true U [[p70<=1 & 1<=p70] | [[p30<=0 & 0<=p30] | [p95<=1 & 1<=p95]]]]]]]]]

abstracting: (1<=p95)
states: 3,212 (3)
abstracting: (p95<=1)
states: 310,987 (5)
abstracting: (0<=p30)
states: 310,987 (5)
abstracting: (p30<=0)
states: 285,763 (5)
abstracting: (1<=p70)
states: 17,798 (4)
abstracting: (p70<=1)
states: 310,987 (5)
abstracting: (0<=p23)
states: 310,987 (5)
abstracting: (p23<=0)
states: 284,659 (5)
abstracting: (1<=p42)
states: 15,604 (4)
abstracting: (p42<=1)
states: 310,987 (5)
abstracting: (1<=p74)
states: 16,544 (4)
abstracting: (p74<=1)
states: 310,987 (5)
abstracting: (1<=p140)
states: 3,100 (3)
abstracting: (p140<=1)
states: 310,987 (5)
............................
EG iterations: 28
.............................
EG iterations: 29
-> the formula is FALSE

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

MC time: 0m18.788sec

checking: EG [[[AF [[[p69<=0 & 0<=p69] & [[p1<=1 & 1<=p1] & [p100<=0 & 0<=p100]]]] | EF [[[p59<=0 & 0<=p59] & [p14<=1 & 1<=p14]]]] | [AX [[[p18<=0 & 0<=p18] & [p31<=1 & 1<=p31]]] | EG [[p61<=0 & 0<=p61]]]]]
normalized: EG [[[E [true U [[p14<=1 & 1<=p14] & [p59<=0 & 0<=p59]]] | ~ [EG [~ [[[[p100<=0 & 0<=p100] & [p1<=1 & 1<=p1]] & [p69<=0 & 0<=p69]]]]]] | [EG [[p61<=0 & 0<=p61]] | ~ [EX [~ [[[p31<=1 & 1<=p31] & [p18<=0 & 0<=p18]]]]]]]]

abstracting: (0<=p18)
states: 310,987 (5)
abstracting: (p18<=0)
states: 286,753 (5)
abstracting: (1<=p31)
states: 28,175 (4)
abstracting: (p31<=1)
states: 310,987 (5)
.abstracting: (0<=p61)
states: 310,987 (5)
abstracting: (p61<=0)
states: 303,045 (5)
.
EG iterations: 1
abstracting: (0<=p69)
states: 310,987 (5)
abstracting: (p69<=0)
states: 292,689 (5)
abstracting: (1<=p1)
states: 42,462 (4)
abstracting: (p1<=1)
states: 310,987 (5)
abstracting: (0<=p100)
states: 310,987 (5)
abstracting: (p100<=0)
states: 308,153 (5)
..........................
EG iterations: 26
abstracting: (0<=p59)
states: 310,987 (5)
abstracting: (p59<=0)
states: 295,909 (5)
abstracting: (1<=p14)
states: 1,920 (3)
abstracting: (p14<=1)
states: 310,987 (5)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m14.614sec

checking: AF [[[p85<=1 & 1<=p85] & [AF [[p40<=0 & 0<=p40]] & [AF [[[p41<=0 & 0<=p41] & [p2<=1 & 1<=p2]]] | [EG [[p26<=1 & 1<=p26]] & [[p137<=1 & 1<=p137] & [[p99<=0 & 0<=p99] | [p65<=1 & 1<=p65]]]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [[[p2<=1 & 1<=p2] & [p41<=0 & 0<=p41]]]]] | [[[[p65<=1 & 1<=p65] | [p99<=0 & 0<=p99]] & [p137<=1 & 1<=p137]] & EG [[p26<=1 & 1<=p26]]]] & ~ [EG [~ [[p40<=0 & 0<=p40]]]]] & [p85<=1 & 1<=p85]]]]]

abstracting: (1<=p85)
states: 16,058 (4)
abstracting: (p85<=1)
states: 310,987 (5)
abstracting: (0<=p40)
states: 310,987 (5)
abstracting: (p40<=0)
states: 300,708 (5)
.........................
EG iterations: 25
abstracting: (1<=p26)
states: 23,391 (4)
abstracting: (p26<=1)
states: 310,987 (5)
.
EG iterations: 1
abstracting: (1<=p137)
states: 2,183 (3)
abstracting: (p137<=1)
states: 310,987 (5)
abstracting: (0<=p99)
states: 310,987 (5)
abstracting: (p99<=0)
states: 307,996 (5)
abstracting: (1<=p65)
states: 17,484 (4)
abstracting: (p65<=1)
states: 310,987 (5)
abstracting: (0<=p41)
states: 310,987 (5)
abstracting: (p41<=0)
states: 298,279 (5)
abstracting: (1<=p2)
states: 48,372 (4)
abstracting: (p2<=1)
states: 310,987 (5)
................................
EG iterations: 32
..........................
EG iterations: 26
-> the formula is FALSE

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

MC time: 0m10.923sec

totally nodes used: 29880324 (3.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 101950885 339393215 441344100
used/not used/entry size/cache size: 66676669 432195 16 1024MB
basic ops cache: hits/miss/sum: 7975927 20300050 28275977
used/not used/entry size/cache size: 14569584 2207632 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: 101668 436018 537686
used/not used/entry size/cache size: 425103 7963505 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 44548912
1 16747051
2 4562925
3 1029338
4 188323
5 28286
6 3568
7 412
8 46
9 3
>= 10 0

Total processing time: 1m58.484sec


BK_STOP 1680839231928

--------------------
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.000sec

47508 50719 65067 71199
iterations count:456645 (1602), effective:7021 (24)

initing FirstDep: 0m 0.000sec


iterations count:291 (1), effective:1 (0)
60672
iterations count:112764 (395), effective:3004 (10)

iterations count:20337 (71), effective:626 (2)

iterations count:595 (2), effective:9 (0)
56944
iterations count:129256 (453), effective:3269 (11)

iterations count:285 (1), effective:0 (0)
65916
iterations count:110481 (387), effective:2958 (10)

iterations count:99117 (347), effective:2531 (8)

iterations count:6816 (23), effective:133 (0)

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

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

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

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

iterations count:18163 (63), effective:386 (1)

iterations count:2277 (7), effective:26 (0)

iterations count:94909 (333), effective:2337 (8)
67096
iterations count:104319 (366), effective:2864 (10)

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-05"
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-05, 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-167987246800009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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