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

About the Execution of Marcie+red for StigmergyElection-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6185.004 47417.00 67880.00 1142.60 TTTTFTFFTFFTTTFT normal

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.r458-smll-167912650600649.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 StigmergyElection-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650600649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.3M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679579043910

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=StigmergyElection-PT-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 13:44:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 13:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:44:07] [INFO ] Load time of PNML (sax parser for PT used): 757 ms
[2023-03-23 13:44:07] [INFO ] Transformed 114 places.
[2023-03-23 13:44:07] [INFO ] Transformed 6882 transitions.
[2023-03-23 13:44:07] [INFO ] Found NUPN structural information;
[2023-03-23 13:44:07] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 920 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyElection-PT-08a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 108 transition count 656
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 108 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 107 transition count 654
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 107 transition count 654
Applied a total of 14 rules in 48 ms. Remains 107 /114 variables (removed 7) and now considering 654/664 (removed 10) transitions.
[2023-03-23 13:44:07] [INFO ] Flow matrix only has 636 transitions (discarded 18 similar events)
// Phase 1: matrix 636 rows 107 cols
[2023-03-23 13:44:07] [INFO ] Computed 5 place invariants in 26 ms
[2023-03-23 13:44:08] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-23 13:44:08] [INFO ] Flow matrix only has 636 transitions (discarded 18 similar events)
[2023-03-23 13:44:08] [INFO ] Invariant cache hit.
[2023-03-23 13:44:08] [INFO ] State equation strengthened by 549 read => feed constraints.
[2023-03-23 13:44:09] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1899 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/114 places, 654/664 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1953 ms. Remains : 106/114 places, 654/664 transitions.
Support contains 66 out of 106 places after structural reductions.
[2023-03-23 13:44:10] [INFO ] Flatten gal took : 216 ms
[2023-03-23 13:44:10] [INFO ] Flatten gal took : 145 ms
[2023-03-23 13:44:10] [INFO ] Input system was already deterministic with 654 transitions.
Support contains 62 out of 106 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 1047 ms. (steps per millisecond=9 ) properties (out of 56) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 13:44:12] [INFO ] Flow matrix only has 636 transitions (discarded 18 similar events)
// Phase 1: matrix 636 rows 106 cols
[2023-03-23 13:44:12] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-23 13:44:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 13:44:12] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-23 13:44:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 13:44:12] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-23 13:44:12] [INFO ] State equation strengthened by 517 read => feed constraints.
[2023-03-23 13:44:12] [INFO ] After 161ms SMT Verify possible using 517 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 10 ms to minimize.
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2023-03-23 13:44:13] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2023-03-23 13:44:14] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2023-03-23 13:44:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1434 ms
[2023-03-23 13:44:14] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2023-03-23 13:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-23 13:44:14] [INFO ] After 1830ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-23 13:44:14] [INFO ] After 2282ms 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 15 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 654/654 transitions.
Graph (complete) has 316 edges and 106 vertex of which 103 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.16 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 103 transition count 588
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 63 transition count 563
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 142 place count 51 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 50 transition count 562
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 143 place count 50 transition count 557
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 153 place count 45 transition count 557
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 173 place count 25 transition count 536
Iterating global reduction 4 with 20 rules applied. Total rules applied 193 place count 25 transition count 536
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Iterating post reduction 4 with 259 rules applied. Total rules applied 452 place count 25 transition count 277
Performed 8 Post agglomeration using F-continuation condition with reduction of 240 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 471 place count 14 transition count 29
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 487 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 490 place count 12 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 491 place count 12 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 492 place count 12 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 493 place count 12 transition count 10
Applied a total of 493 rules in 125 ms. Remains 12 /106 variables (removed 94) and now considering 10/654 (removed 644) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 12/106 places, 10/654 transitions.
Finished random walk after 12 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA StigmergyElection-PT-08a-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 13:44:14] [INFO ] Flatten gal took : 88 ms
[2023-03-23 13:44:14] [INFO ] Flatten gal took : 77 ms
[2023-03-23 13:44:14] [INFO ] Input system was already deterministic with 654 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 91 transition count 633
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 91 transition count 633
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 79 transition count 616
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 79 transition count 616
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 74 transition count 611
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 74 transition count 611
Applied a total of 64 rules in 34 ms. Remains 74 /106 variables (removed 32) and now considering 611/654 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 74/106 places, 611/654 transitions.
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 56 ms
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 67 ms
[2023-03-23 13:44:15] [INFO ] Input system was already deterministic with 611 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 89 transition count 631
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 89 transition count 631
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 76 transition count 613
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 76 transition count 613
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 71 transition count 608
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 71 transition count 608
Applied a total of 70 rules in 19 ms. Remains 71 /106 variables (removed 35) and now considering 608/654 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 71/106 places, 608/654 transitions.
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 30 ms
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 33 ms
[2023-03-23 13:44:15] [INFO ] Input system was already deterministic with 608 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 105 transition count 621
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 73 transition count 621
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 64 place count 73 transition count 607
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 59 transition count 607
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 102 place count 49 transition count 591
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 49 transition count 591
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 49 transition count 588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 115 place count 49 transition count 587
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 117 place count 48 transition count 587
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 43 transition count 577
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 43 transition count 577
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 3 with 124 rules applied. Total rules applied 251 place count 43 transition count 453
Drop transitions removed 368 transitions
Redundant transition composition rules discarded 368 transitions
Iterating global reduction 4 with 368 rules applied. Total rules applied 619 place count 43 transition count 85
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 635 place count 35 transition count 77
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 643 place count 27 transition count 69
Applied a total of 643 rules in 129 ms. Remains 27 /106 variables (removed 79) and now considering 69/654 (removed 585) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 129 ms. Remains : 27/106 places, 69/654 transitions.
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:15] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 105 transition count 623
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 75 transition count 622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 74 transition count 622
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 62 place count 74 transition count 611
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 84 place count 63 transition count 611
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 95 place count 52 transition count 593
Iterating global reduction 3 with 11 rules applied. Total rules applied 106 place count 52 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 109 place count 52 transition count 590
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 109 place count 52 transition count 589
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 51 transition count 589
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 115 place count 47 transition count 581
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 47 transition count 581
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 131 place count 47 transition count 569
Drop transitions removed 460 transitions
Redundant transition composition rules discarded 460 transitions
Iterating global reduction 5 with 460 rules applied. Total rules applied 591 place count 47 transition count 109
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 607 place count 39 transition count 101
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 615 place count 31 transition count 93
Applied a total of 615 rules in 132 ms. Remains 31 /106 variables (removed 75) and now considering 93/654 (removed 561) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 134 ms. Remains : 31/106 places, 93/654 transitions.
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 7 ms
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 6 ms
[2023-03-23 13:44:15] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 105 transition count 626
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 78 transition count 623
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 75 transition count 623
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 60 place count 75 transition count 611
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 84 place count 63 transition count 611
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 95 place count 52 transition count 593
Iterating global reduction 3 with 11 rules applied. Total rules applied 106 place count 52 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 109 place count 52 transition count 590
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 109 place count 52 transition count 589
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 51 transition count 589
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 115 place count 47 transition count 581
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 47 transition count 581
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 147 place count 47 transition count 553
Drop transitions removed 459 transitions
Redundant transition composition rules discarded 459 transitions
Iterating global reduction 5 with 459 rules applied. Total rules applied 606 place count 47 transition count 94
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 622 place count 39 transition count 86
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 623 place count 39 transition count 86
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 624 place count 39 transition count 85
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 631 place count 32 transition count 78
Applied a total of 631 rules in 128 ms. Remains 32 /106 variables (removed 74) and now considering 78/654 (removed 576) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 129 ms. Remains : 32/106 places, 78/654 transitions.
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:15] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:15] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 88 transition count 629
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 88 transition count 629
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 74 transition count 609
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 74 transition count 609
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 68 transition count 603
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 68 transition count 603
Applied a total of 76 rules in 12 ms. Remains 68 /106 variables (removed 38) and now considering 603/654 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 68/106 places, 603/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 32 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 37 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 92 transition count 635
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 92 transition count 635
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 81 transition count 620
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 81 transition count 620
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 77 transition count 616
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 77 transition count 616
Applied a total of 58 rules in 11 ms. Remains 77 /106 variables (removed 29) and now considering 616/654 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 77/106 places, 616/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 29 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 31 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 89 transition count 631
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 89 transition count 631
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 80 transition count 619
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 80 transition count 619
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 77 transition count 616
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 77 transition count 616
Applied a total of 58 rules in 11 ms. Remains 77 /106 variables (removed 29) and now considering 616/654 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 77/106 places, 616/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 28 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 30 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 91 transition count 634
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 91 transition count 634
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 83 transition count 622
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 83 transition count 622
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 79 transition count 618
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 79 transition count 618
Applied a total of 54 rules in 11 ms. Remains 79 /106 variables (removed 27) and now considering 618/654 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 79/106 places, 618/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 27 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 30 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 618 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 105 transition count 622
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 74 transition count 622
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 62 place count 74 transition count 608
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 90 place count 60 transition count 608
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 49 transition count 590
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 49 transition count 590
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 49 transition count 587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 115 place count 49 transition count 586
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 117 place count 48 transition count 586
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 123 place count 42 transition count 574
Iterating global reduction 3 with 6 rules applied. Total rules applied 129 place count 42 transition count 574
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Iterating post reduction 3 with 252 rules applied. Total rules applied 381 place count 42 transition count 322
Drop transitions removed 248 transitions
Redundant transition composition rules discarded 248 transitions
Iterating global reduction 4 with 248 rules applied. Total rules applied 629 place count 42 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 645 place count 34 transition count 66
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 652 place count 27 transition count 59
Applied a total of 652 rules in 63 ms. Remains 27 /106 variables (removed 79) and now considering 59/654 (removed 595) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 27/106 places, 59/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 2 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 105 transition count 623
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 75 transition count 623
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 75 transition count 611
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 63 transition count 611
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 53 transition count 595
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 53 transition count 595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 53 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 53 transition count 593
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 107 place count 52 transition count 593
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 46 transition count 581
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 46 transition count 581
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 149 place count 46 transition count 551
Drop transitions removed 445 transitions
Redundant transition composition rules discarded 445 transitions
Iterating global reduction 4 with 445 rules applied. Total rules applied 594 place count 46 transition count 106
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 610 place count 38 transition count 98
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 618 place count 30 transition count 90
Applied a total of 618 rules in 107 ms. Remains 30 /106 variables (removed 76) and now considering 90/654 (removed 564) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 30/106 places, 90/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 5 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 105 transition count 623
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 75 transition count 623
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 60 place count 75 transition count 609
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 88 place count 61 transition count 609
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 98 place count 51 transition count 593
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 51 transition count 593
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 51 transition count 590
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 111 place count 51 transition count 589
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 113 place count 50 transition count 589
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 45 transition count 579
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 45 transition count 579
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 3 with 124 rules applied. Total rules applied 247 place count 45 transition count 455
Drop transitions removed 368 transitions
Redundant transition composition rules discarded 368 transitions
Iterating global reduction 4 with 368 rules applied. Total rules applied 615 place count 45 transition count 87
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 631 place count 37 transition count 79
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 639 place count 29 transition count 71
Applied a total of 639 rules in 60 ms. Remains 29 /106 variables (removed 77) and now considering 71/654 (removed 583) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 29/106 places, 71/654 transitions.
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:16] [INFO ] Flatten gal took : 3 ms
[2023-03-23 13:44:16] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 93 transition count 637
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 93 transition count 637
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 84 transition count 625
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 84 transition count 625
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 82 transition count 623
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 82 transition count 623
Applied a total of 48 rules in 10 ms. Remains 82 /106 variables (removed 24) and now considering 623/654 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 82/106 places, 623/654 transitions.
[2023-03-23 13:44:17] [INFO ] Flatten gal took : 26 ms
[2023-03-23 13:44:17] [INFO ] Flatten gal took : 29 ms
[2023-03-23 13:44:17] [INFO ] Input system was already deterministic with 623 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 654/654 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 105 transition count 621
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 73 transition count 621
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 64 place count 73 transition count 608
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 90 place count 60 transition count 608
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 50 transition count 592
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 50 transition count 592
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 50 transition count 589
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 113 place count 50 transition count 588
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 115 place count 49 transition count 588
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 120 place count 44 transition count 578
Iterating global reduction 3 with 5 rules applied. Total rules applied 125 place count 44 transition count 578
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 185 place count 44 transition count 518
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 4 with 416 rules applied. Total rules applied 601 place count 44 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 617 place count 36 transition count 94
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 625 place count 28 transition count 86
Applied a total of 625 rules in 65 ms. Remains 28 /106 variables (removed 78) and now considering 86/654 (removed 568) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 28/106 places, 86/654 transitions.
[2023-03-23 13:44:17] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:17] [INFO ] Flatten gal took : 4 ms
[2023-03-23 13:44:17] [INFO ] Input system was already deterministic with 86 transitions.
[2023-03-23 13:44:17] [INFO ] Flatten gal took : 45 ms
[2023-03-23 13:44:17] [INFO ] Flatten gal took : 63 ms
[2023-03-23 13:44:17] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-23 13:44:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 654 transitions and 8581 arcs took 14 ms.
Total runtime 10781 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: 106 NrTr: 654 NrArc: 8581)

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

net check time: 0m 0.001sec

init dd package: 0m 3.458sec


RS generation: 0m 2.663sec


-> reachability set: #nodes 41864 (4.2e+04) #states 462,748 (5)



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

checking: EG [AF [[p65<=0 & 0<=p65]]]
normalized: EG [~ [EG [~ [[p65<=0 & 0<=p65]]]]]

abstracting: (0<=p65)
states: 462,748 (5)
abstracting: (p65<=0)
states: 384,623 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.490sec

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

abstracting: (0<=p12)
states: 462,748 (5)
abstracting: (p12<=0)
states: 460,561 (5)
.................
EG iterations: 17
-> the formula is FALSE

FORMULA StigmergyElection-PT-08a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.752sec

checking: A [AF [EX [AG [EF [[p96<=1 & 1<=p96]]]]] U EF [[p59<=1 & 1<=p59]]]
normalized: [~ [EG [~ [E [true U [p59<=1 & 1<=p59]]]]] & ~ [E [~ [E [true U [p59<=1 & 1<=p59]]] U [EG [~ [EX [~ [E [true U ~ [E [true U [p96<=1 & 1<=p96]]]]]]]] & ~ [E [true U [p59<=1 & 1<=p59]]]]]]]

abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 462,748 (5)
abstracting: (1<=p96)
states: 16,384 (4)
abstracting: (p96<=1)
states: 462,748 (5)
.
EG iterations: 0
abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 462,748 (5)
abstracting: (1<=p59)
states: 1
abstracting: (p59<=1)
states: 462,748 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.712sec

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

abstracting: (p88<=0)
states: 462,747 (5)
abstracting: (0<=p88)
states: 462,748 (5)
...................
EG iterations: 17
abstracting: (0<=p36)
states: 462,748 (5)
abstracting: (p36<=0)
states: 460,561 (5)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.879sec

checking: EG [~ [A [AF [[p86<=1 & 1<=p86]] U [p42<=1 & 1<=p42]]]]
normalized: EG [~ [[~ [EG [~ [[p42<=1 & 1<=p42]]]] & ~ [E [~ [[p42<=1 & 1<=p42]] U [EG [~ [[p86<=1 & 1<=p86]]] & ~ [[p42<=1 & 1<=p42]]]]]]]]

abstracting: (1<=p42)
states: 16,384 (4)
abstracting: (p42<=1)
states: 462,748 (5)
abstracting: (1<=p86)
states: 1
abstracting: (p86<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (1<=p42)
states: 16,384 (4)
abstracting: (p42<=1)
states: 462,748 (5)
abstracting: (1<=p42)
states: 16,384 (4)
abstracting: (p42<=1)
states: 462,748 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.239sec

checking: EG [AG [[[1<=p18 & p18<=1] | [0<=p85 & p85<=0]]]]
normalized: EG [~ [E [true U ~ [[[0<=p85 & p85<=0] | [1<=p18 & p18<=1]]]]]]

abstracting: (p18<=1)
states: 462,748 (5)
abstracting: (1<=p18)
states: 16,384 (4)
abstracting: (p85<=0)
states: 446,364 (5)
abstracting: (0<=p85)
states: 462,748 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-08a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.140sec

checking: E [~ [[p2<=1 & 1<=p2]] U ~ [[[p71<=0 & 0<=p71] | [p81<=1 & 1<=p81]]]]
normalized: E [~ [[p2<=1 & 1<=p2]] U ~ [[[p81<=1 & 1<=p81] | [p71<=0 & 0<=p71]]]]

abstracting: (0<=p71)
states: 462,748 (5)
abstracting: (p71<=0)
states: 446,364 (5)
abstracting: (1<=p81)
states: 78,125 (4)
abstracting: (p81<=1)
states: 462,748 (5)
abstracting: (1<=p2)
states: 78,125 (4)
abstracting: (p2<=1)
states: 462,748 (5)
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.080sec

checking: A [[[p44<=1 & 1<=p44] | [p84<=0 & 0<=p84]] U EF [EG [[~ [EF [[1<=p68 & p68<=1]]] | [1<=p15 & p15<=1]]]]]
normalized: [~ [EG [~ [E [true U EG [[[1<=p15 & p15<=1] | ~ [E [true U [1<=p68 & p68<=1]]]]]]]]] & ~ [E [~ [E [true U EG [[[1<=p15 & p15<=1] | ~ [E [true U [1<=p68 & p68<=1]]]]]]] U [~ [[[p84<=0 & 0<=p84] | [p44<=1 & 1<=p44]]] & ~ [E [true U EG [[[1<=p15 & p15<=1] | ~ [E [true U [1<=p68 & p68<=1]]]]]]]]]]]

abstracting: (p68<=1)
states: 462,748 (5)
abstracting: (1<=p68)
states: 78,125 (4)
abstracting: (p15<=1)
states: 462,748 (5)
abstracting: (1<=p15)
states: 78,125 (4)
..
EG iterations: 2
abstracting: (1<=p44)
states: 16,384 (4)
abstracting: (p44<=1)
states: 462,748 (5)
abstracting: (0<=p84)
states: 462,748 (5)
abstracting: (p84<=0)
states: 446,364 (5)
abstracting: (p68<=1)
states: 462,748 (5)
abstracting: (1<=p68)
states: 78,125 (4)
abstracting: (p15<=1)
states: 462,748 (5)
abstracting: (1<=p15)
states: 78,125 (4)
..
EG iterations: 2
abstracting: (p68<=1)
states: 462,748 (5)
abstracting: (1<=p68)
states: 78,125 (4)
abstracting: (p15<=1)
states: 462,748 (5)
abstracting: (1<=p15)
states: 78,125 (4)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.203sec

checking: E [AF [[[p84<=0 & 0<=p84] | [p72<=1 & 1<=p72]]] U [AX [A [~ [EG [[[p79<=0 & 0<=p79] | [p50<=1 & 1<=p50]]]] U ~ [AX [[p32<=0 & 0<=p32]]]]] & ~ [AX [[p65<=1 & 1<=p65]]]]]
normalized: E [~ [EG [~ [[[p72<=1 & 1<=p72] | [p84<=0 & 0<=p84]]]]] U [EX [~ [[p65<=1 & 1<=p65]]] & ~ [EX [~ [[~ [EG [~ [EX [~ [[p32<=0 & 0<=p32]]]]]] & ~ [E [~ [EX [~ [[p32<=0 & 0<=p32]]]] U [EG [[[p50<=1 & 1<=p50] | [p79<=0 & 0<=p79]]] & ~ [EX [~ [[p32<=0 & 0<=p32]]]]]]]]]]]]]

abstracting: (0<=p32)
states: 462,748 (5)
abstracting: (p32<=0)
states: 462,747 (5)
.abstracting: (0<=p79)
states: 462,748 (5)
abstracting: (p79<=0)
states: 384,623 (5)
abstracting: (1<=p50)
states: 2,187 (3)
abstracting: (p50<=1)
states: 462,748 (5)
.
EG iterations: 1
abstracting: (0<=p32)
states: 462,748 (5)
abstracting: (p32<=0)
states: 462,747 (5)
.abstracting: (0<=p32)
states: 462,748 (5)
abstracting: (p32<=0)
states: 462,747 (5)
..
EG iterations: 1
.abstracting: (1<=p65)
states: 78,125 (4)
abstracting: (p65<=1)
states: 462,748 (5)
.abstracting: (0<=p84)
states: 462,748 (5)
abstracting: (p84<=0)
states: 446,364 (5)
abstracting: (1<=p72)
states: 1
abstracting: (p72<=1)
states: 462,748 (5)
..
EG iterations: 2
-> the formula is FALSE

FORMULA StigmergyElection-PT-08a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.194sec

checking: [EG [[[1<=p45 & p45<=1] & [0<=p41 & p41<=0]]] | AF [AG [~ [A [[[[1<=p61 & p61<=1] | [p23<=0 & 0<=p23]] & [1<=p24 & p24<=1]] U AF [[[p97<=1 & 1<=p97] | [0<=p19 & p19<=0]]]]]]]]
normalized: [~ [EG [E [true U [~ [EG [EG [~ [[[0<=p19 & p19<=0] | [p97<=1 & 1<=p97]]]]]] & ~ [E [EG [~ [[[0<=p19 & p19<=0] | [p97<=1 & 1<=p97]]]] U [~ [[[1<=p24 & p24<=1] & [[p23<=0 & 0<=p23] | [1<=p61 & p61<=1]]]] & EG [~ [[[0<=p19 & p19<=0] | [p97<=1 & 1<=p97]]]]]]]]]]] | EG [[[0<=p41 & p41<=0] & [1<=p45 & p45<=1]]]]

abstracting: (p45<=1)
states: 462,748 (5)
abstracting: (1<=p45)
states: 1
abstracting: (p41<=0)
states: 384,623 (5)
abstracting: (0<=p41)
states: 462,748 (5)
.
EG iterations: 1
abstracting: (1<=p97)
states: 16,384 (4)
abstracting: (p97<=1)
states: 462,748 (5)
abstracting: (p19<=0)
states: 446,364 (5)
abstracting: (0<=p19)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (p61<=1)
states: 462,748 (5)
abstracting: (1<=p61)
states: 1
abstracting: (0<=p23)
states: 462,748 (5)
abstracting: (p23<=0)
states: 462,747 (5)
abstracting: (p24<=1)
states: 462,748 (5)
abstracting: (1<=p24)
states: 96,717 (4)
abstracting: (1<=p97)
states: 16,384 (4)
abstracting: (p97<=1)
states: 462,748 (5)
abstracting: (p19<=0)
states: 446,364 (5)
abstracting: (0<=p19)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (1<=p97)
states: 16,384 (4)
abstracting: (p97<=1)
states: 462,748 (5)
abstracting: (p19<=0)
states: 446,364 (5)
abstracting: (0<=p19)
states: 462,748 (5)
..
EG iterations: 2
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-08a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.765sec

checking: [EG [[[p21<=0 & 0<=p21] | [p97<=1 & 1<=p97]]] | AG [[[[p43<=0 & 0<=p43] | [p69<=1 & 1<=p69]] & EX [A [[[p91<=0 & 0<=p91] | [p60<=1 & 1<=p60]] U [p62<=1 & 1<=p62]]]]]]
normalized: [~ [E [true U ~ [[EX [[~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[[p60<=1 & 1<=p60] | [p91<=0 & 0<=p91]]] & ~ [[p62<=1 & 1<=p62]]]]]]] & [[p69<=1 & 1<=p69] | [p43<=0 & 0<=p43]]]]]] | EG [[[p97<=1 & 1<=p97] | [p21<=0 & 0<=p21]]]]

abstracting: (0<=p21)
states: 462,748 (5)
abstracting: (p21<=0)
states: 462,747 (5)
abstracting: (1<=p97)
states: 16,384 (4)
abstracting: (p97<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (0<=p43)
states: 462,748 (5)
abstracting: (p43<=0)
states: 446,364 (5)
abstracting: (1<=p69)
states: 16,384 (4)
abstracting: (p69<=1)
states: 462,748 (5)
abstracting: (1<=p62)
states: 96,717 (4)
abstracting: (p62<=1)
states: 462,748 (5)
abstracting: (0<=p91)
states: 462,748 (5)
abstracting: (p91<=0)
states: 460,561 (5)
abstracting: (1<=p60)
states: 1
abstracting: (p60<=1)
states: 462,748 (5)
abstracting: (1<=p62)
states: 96,717 (4)
abstracting: (p62<=1)
states: 462,748 (5)
abstracting: (1<=p62)
states: 96,717 (4)
abstracting: (p62<=1)
states: 462,748 (5)
..................
EG iterations: 18
.-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.035sec

checking: ~ [A [[AX [EX [~ [[[1<=p87 & p87<=1] | [0<=p99 & p99<=0]]]]] | A [[~ [[[1<=p49 & p49<=1] | [p87<=1 & 1<=p87]]] & EF [[1<=p68 & p68<=1]]] U ~ [AF [[p32<=1 & 1<=p32]]]]] U [[[1<=p23 & p23<=1] | [p14<=0 & 0<=p14]] & [p31<=1 & 1<=p31]]]]
normalized: ~ [[~ [EG [~ [[[p31<=1 & 1<=p31] & [[p14<=0 & 0<=p14] | [1<=p23 & p23<=1]]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] & [[p14<=0 & 0<=p14] | [1<=p23 & p23<=1]]]] U [~ [[[~ [EG [~ [EG [~ [[p32<=1 & 1<=p32]]]]]] & ~ [E [~ [EG [~ [[p32<=1 & 1<=p32]]]] U [~ [[E [true U [1<=p68 & p68<=1]] & ~ [[[p87<=1 & 1<=p87] | [1<=p49 & p49<=1]]]]] & ~ [EG [~ [[p32<=1 & 1<=p32]]]]]]]] | ~ [EX [~ [EX [~ [[[0<=p99 & p99<=0] | [1<=p87 & p87<=1]]]]]]]]] & ~ [[[p31<=1 & 1<=p31] & [[p14<=0 & 0<=p14] | [1<=p23 & p23<=1]]]]]]]]]

abstracting: (p23<=1)
states: 462,748 (5)
abstracting: (1<=p23)
states: 1
abstracting: (0<=p14)
states: 462,748 (5)
abstracting: (p14<=0)
states: 384,623 (5)
abstracting: (1<=p31)
states: 16,384 (4)
abstracting: (p31<=1)
states: 462,748 (5)
abstracting: (p87<=1)
states: 462,748 (5)
abstracting: (1<=p87)
states: 1
abstracting: (p99<=0)
states: 462,747 (5)
abstracting: (0<=p99)
states: 462,748 (5)
..abstracting: (1<=p32)
states: 1
abstracting: (p32<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (p49<=1)
states: 462,748 (5)
abstracting: (1<=p49)
states: 96,717 (4)
abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 462,748 (5)
abstracting: (p68<=1)
states: 462,748 (5)
abstracting: (1<=p68)
states: 78,125 (4)
abstracting: (1<=p32)
states: 1
abstracting: (p32<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (1<=p32)
states: 1
abstracting: (p32<=1)
states: 462,748 (5)
..
EG iterations: 2
...
EG iterations: 3
abstracting: (p23<=1)
states: 462,748 (5)
abstracting: (1<=p23)
states: 1
abstracting: (0<=p14)
states: 462,748 (5)
abstracting: (p14<=0)
states: 384,623 (5)
abstracting: (1<=p31)
states: 16,384 (4)
abstracting: (p31<=1)
states: 462,748 (5)
abstracting: (p23<=1)
states: 462,748 (5)
abstracting: (1<=p23)
states: 1
abstracting: (0<=p14)
states: 462,748 (5)
abstracting: (p14<=0)
states: 384,623 (5)
abstracting: (1<=p31)
states: 16,384 (4)
abstracting: (p31<=1)
states: 462,748 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.237sec

checking: [EF [[[[1<=p32 & p32<=1] | [1<=p10 & p10<=1]] & EX [[[p56<=1 & 1<=p56] | [[1<=p71 & p71<=1] | [p96<=0 & 0<=p96]]]]]] & EX [[A [EX [AX [[p38<=1 & 1<=p38]]] U [A [[[0<=p92 & p92<=0] | [1<=p51 & p51<=1]] U [1<=p46 & p46<=1]] | ~ [[[1<=p64 & p64<=1] | [0<=p72 & p72<=0]]]]] | [p11<=0 & 0<=p11]]]]
normalized: [EX [[[p11<=0 & 0<=p11] | [~ [EG [~ [[~ [[[0<=p72 & p72<=0] | [1<=p64 & p64<=1]]] | [~ [EG [~ [[1<=p46 & p46<=1]]]] & ~ [E [~ [[1<=p46 & p46<=1]] U [~ [[[1<=p51 & p51<=1] | [0<=p92 & p92<=0]]] & ~ [[1<=p46 & p46<=1]]]]]]]]]] & ~ [E [~ [[~ [[[0<=p72 & p72<=0] | [1<=p64 & p64<=1]]] | [~ [EG [~ [[1<=p46 & p46<=1]]]] & ~ [E [~ [[1<=p46 & p46<=1]] U [~ [[[1<=p51 & p51<=1] | [0<=p92 & p92<=0]]] & ~ [[1<=p46 & p46<=1]]]]]]]] U [~ [EX [~ [EX [~ [[p38<=1 & 1<=p38]]]]]] & ~ [[~ [[[0<=p72 & p72<=0] | [1<=p64 & p64<=1]]] | [~ [EG [~ [[1<=p46 & p46<=1]]]] & ~ [E [~ [[1<=p46 & p46<=1]] U [~ [[[1<=p51 & p51<=1] | [0<=p92 & p92<=0]]] & ~ [[1<=p46 & p46<=1]]]]]]]]]]]]]] & E [true U [EX [[[[p96<=0 & 0<=p96] | [1<=p71 & p71<=1]] | [p56<=1 & 1<=p56]]] & [[1<=p10 & p10<=1] | [1<=p32 & p32<=1]]]]]

abstracting: (p32<=1)
states: 462,748 (5)
abstracting: (1<=p32)
states: 1
abstracting: (p10<=1)
states: 462,748 (5)
abstracting: (1<=p10)
states: 1
abstracting: (1<=p56)
states: 16,384 (4)
abstracting: (p56<=1)
states: 462,748 (5)
abstracting: (p71<=1)
states: 462,748 (5)
abstracting: (1<=p71)
states: 16,384 (4)
abstracting: (0<=p96)
states: 462,748 (5)
abstracting: (p96<=0)
states: 446,364 (5)
.abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
abstracting: (p92<=0)
states: 384,623 (5)
abstracting: (0<=p92)
states: 462,748 (5)
abstracting: (p51<=1)
states: 462,748 (5)
abstracting: (1<=p51)
states: 2,187 (3)
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
..
EG iterations: 2
abstracting: (p64<=1)
states: 462,748 (5)
abstracting: (1<=p64)
states: 2,187 (3)
abstracting: (p72<=0)
states: 462,747 (5)
abstracting: (0<=p72)
states: 462,748 (5)
abstracting: (1<=p38)
states: 78,125 (4)
abstracting: (p38<=1)
states: 462,748 (5)
..abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
abstracting: (p92<=0)
states: 384,623 (5)
abstracting: (0<=p92)
states: 462,748 (5)
abstracting: (p51<=1)
states: 462,748 (5)
abstracting: (1<=p51)
states: 2,187 (3)
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
..
EG iterations: 2
abstracting: (p64<=1)
states: 462,748 (5)
abstracting: (1<=p64)
states: 2,187 (3)
abstracting: (p72<=0)
states: 462,747 (5)
abstracting: (0<=p72)
states: 462,748 (5)
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
abstracting: (p92<=0)
states: 384,623 (5)
abstracting: (0<=p92)
states: 462,748 (5)
abstracting: (p51<=1)
states: 462,748 (5)
abstracting: (1<=p51)
states: 2,187 (3)
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
abstracting: (p46<=1)
states: 462,748 (5)
abstracting: (1<=p46)
states: 1
..
EG iterations: 2
abstracting: (p64<=1)
states: 462,748 (5)
abstracting: (1<=p64)
states: 2,187 (3)
abstracting: (p72<=0)
states: 462,747 (5)
abstracting: (0<=p72)
states: 462,748 (5)
.
EG iterations: 1
abstracting: (0<=p11)
states: 462,748 (5)
abstracting: (p11<=0)
states: 366,028 (5)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-08a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.934sec

checking: [E [[p83<=1 & 1<=p83] U [[p5<=1 & 1<=p5] | [p95<=1 & 1<=p95]]] | [A [AF [[[p87<=0 & 0<=p87] | [p88<=1 & 1<=p88]]] U ~ [AF [[[p67<=0 & 0<=p67] | [p61<=1 & 1<=p61]]]]] & [EF [[EG [[[p78<=0 & 0<=p78] | [p50<=1 & 1<=p50]]] & EX [[[p71<=0 & 0<=p71] | [p5<=1 & 1<=p5]]]]] | AX [AX [[[p70<=0 & 0<=p70] | [p104<=1 & 1<=p104]]]]]]]
normalized: [[[~ [EG [~ [EG [~ [[[p61<=1 & 1<=p61] | [p67<=0 & 0<=p67]]]]]]] & ~ [E [~ [EG [~ [[[p61<=1 & 1<=p61] | [p67<=0 & 0<=p67]]]]] U [~ [EG [~ [[[p61<=1 & 1<=p61] | [p67<=0 & 0<=p67]]]]] & EG [~ [[[p88<=1 & 1<=p88] | [p87<=0 & 0<=p87]]]]]]]] & [E [true U [EG [[[p50<=1 & 1<=p50] | [p78<=0 & 0<=p78]]] & EX [[[p71<=0 & 0<=p71] | [p5<=1 & 1<=p5]]]]] | ~ [EX [EX [~ [[[p104<=1 & 1<=p104] | [p70<=0 & 0<=p70]]]]]]]] | E [[p83<=1 & 1<=p83] U [[p95<=1 & 1<=p95] | [p5<=1 & 1<=p5]]]]

abstracting: (1<=p5)
states: 16,384 (4)
abstracting: (p5<=1)
states: 462,748 (5)
abstracting: (1<=p95)
states: 78,125 (4)
abstracting: (p95<=1)
states: 462,748 (5)
abstracting: (1<=p83)
states: 16,384 (4)
abstracting: (p83<=1)
states: 462,748 (5)
abstracting: (0<=p70)
states: 462,748 (5)
abstracting: (p70<=0)
states: 446,364 (5)
abstracting: (1<=p104)
states: 2,187 (3)
abstracting: (p104<=1)
states: 462,748 (5)
..abstracting: (1<=p5)
states: 16,384 (4)
abstracting: (p5<=1)
states: 462,748 (5)
abstracting: (0<=p71)
states: 462,748 (5)
abstracting: (p71<=0)
states: 446,364 (5)
.abstracting: (0<=p78)
states: 462,748 (5)
abstracting: (p78<=0)
states: 460,561 (5)
abstracting: (1<=p50)
states: 2,187 (3)
abstracting: (p50<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (0<=p87)
states: 462,748 (5)
abstracting: (p87<=0)
states: 462,747 (5)
abstracting: (1<=p88)
states: 1
abstracting: (p88<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (0<=p67)
states: 462,748 (5)
abstracting: (p67<=0)
states: 384,623 (5)
abstracting: (1<=p61)
states: 1
abstracting: (p61<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (0<=p67)
states: 462,748 (5)
abstracting: (p67<=0)
states: 384,623 (5)
abstracting: (1<=p61)
states: 1
abstracting: (p61<=1)
states: 462,748 (5)
..
EG iterations: 2
abstracting: (0<=p67)
states: 462,748 (5)
abstracting: (p67<=0)
states: 384,623 (5)
abstracting: (1<=p61)
states: 1
abstracting: (p61<=1)
states: 462,748 (5)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-08a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.137sec

totally nodes used: 10529806 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9263516 50105647 59369163
used/not used/entry size/cache size: 39002054 28106810 16 1024MB
basic ops cache: hits/miss/sum: 1355993 8080021 9436014
used/not used/entry size/cache size: 8691751 8085465 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: 41707 262273 303980
used/not used/entry size/cache size: 258601 8130007 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 59060351
1 6105448
2 1497426
3 366225
4 67806
5 10175
6 1308
7 117
8 7
9 1
>= 10 0

Total processing time: 0m32.826sec


BK_STOP 1679579091327

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec


iterations count:70308 (107), effective:584 (0)

initing FirstDep: 0m 0.002sec


iterations count:7624 (11), effective:94 (0)

iterations count:7874 (12), effective:94 (0)

iterations count:7686 (11), effective:95 (0)

iterations count:7624 (11), effective:94 (0)

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

iterations count:7624 (11), effective:94 (0)

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

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

iterations count:7615 (11), effective:95 (0)

iterations count:7377 (11), effective:91 (0)

iterations count:7594 (11), effective:94 (0)

iterations count:7762 (11), effective:97 (0)

iterations count:7594 (11), effective:94 (0)

iterations count:7762 (11), effective:97 (0)

iterations count:7594 (11), effective:94 (0)

iterations count:7762 (11), effective:97 (0)

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

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

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

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

iterations count:7232 (11), effective:91 (0)

iterations count:7594 (11), effective:94 (0)

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

iterations count:7293 (11), effective:92 (0)

iterations count:7624 (11), effective:93 (0)

iterations count:7446 (11), effective:91 (0)

iterations count:7446 (11), effective:91 (0)

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

iterations count:7446 (11), effective:91 (0)

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

iterations count:667 (1), effective:3 (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="StigmergyElection-PT-08a"
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 StigmergyElection-PT-08a, 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 r458-smll-167912650600649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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