About the Execution of Marcie+red for StigmergyElection-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10157.531 | 3600000.00 | 3639783.00 | 75127.80 | ?T?T?TFTTTTFFT?F | 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-167912650500593.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-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500593
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.8K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 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 203K 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-04b-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-04b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679551414120
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-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 06:03:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 06:03:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:03:38] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-03-23 06:03:38] [INFO ] Transformed 563 places.
[2023-03-23 06:03:38] [INFO ] Transformed 780 transitions.
[2023-03-23 06:03:38] [INFO ] Found NUPN structural information;
[2023-03-23 06:03:38] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-04b-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 510 transition count 727
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 510 transition count 727
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 128 place count 488 transition count 705
Iterating global reduction 0 with 22 rules applied. Total rules applied 150 place count 488 transition count 705
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 486 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 486 transition count 703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 155 place count 485 transition count 702
Iterating global reduction 0 with 1 rules applied. Total rules applied 156 place count 485 transition count 702
Applied a total of 156 rules in 267 ms. Remains 485 /563 variables (removed 78) and now considering 702/780 (removed 78) transitions.
// Phase 1: matrix 702 rows 485 cols
[2023-03-23 06:03:38] [INFO ] Computed 5 place invariants in 36 ms
[2023-03-23 06:03:39] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-23 06:03:39] [INFO ] Invariant cache hit.
[2023-03-23 06:03:40] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2023-03-23 06:03:40] [INFO ] Invariant cache hit.
[2023-03-23 06:03:41] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/563 places, 702/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2653 ms. Remains : 485/563 places, 702/780 transitions.
Support contains 95 out of 485 places after structural reductions.
[2023-03-23 06:03:41] [INFO ] Flatten gal took : 164 ms
[2023-03-23 06:03:41] [INFO ] Flatten gal took : 87 ms
[2023-03-23 06:03:42] [INFO ] Input system was already deterministic with 702 transitions.
Support contains 91 out of 485 places (down from 95) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1005 ms. (steps per millisecond=9 ) properties (out of 58) seen :34
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-23 06:03:43] [INFO ] Invariant cache hit.
[2023-03-23 06:03:44] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-23 06:03:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-23 06:03:46] [INFO ] After 1337ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2023-03-23 06:03:47] [INFO ] Deduced a trap composed of 172 places in 300 ms of which 14 ms to minimize.
[2023-03-23 06:03:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-23 06:03:47] [INFO ] Deduced a trap composed of 175 places in 213 ms of which 1 ms to minimize.
[2023-03-23 06:03:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-23 06:03:48] [INFO ] Deduced a trap composed of 174 places in 317 ms of which 2 ms to minimize.
[2023-03-23 06:03:48] [INFO ] Deduced a trap composed of 175 places in 237 ms of which 3 ms to minimize.
[2023-03-23 06:03:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 671 ms
[2023-03-23 06:03:48] [INFO ] Deduced a trap composed of 172 places in 426 ms of which 3 ms to minimize.
[2023-03-23 06:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2023-03-23 06:03:49] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2023-03-23 06:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-23 06:03:50] [INFO ] Deduced a trap composed of 171 places in 316 ms of which 1 ms to minimize.
[2023-03-23 06:03:50] [INFO ] Deduced a trap composed of 174 places in 271 ms of which 2 ms to minimize.
[2023-03-23 06:03:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 726 ms
[2023-03-23 06:03:50] [INFO ] Deduced a trap composed of 173 places in 262 ms of which 1 ms to minimize.
[2023-03-23 06:03:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-23 06:03:51] [INFO ] Deduced a trap composed of 175 places in 334 ms of which 1 ms to minimize.
[2023-03-23 06:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-23 06:03:51] [INFO ] After 6133ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :22
Attempting to minimize the solution found.
Minimization took 936 ms.
[2023-03-23 06:03:52] [INFO ] After 7993ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :22
Fused 24 Parikh solutions to 22 different solutions.
Parikh walk visited 3 properties in 246 ms.
Support contains 25 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 702/702 transitions.
Graph (trivial) has 452 edges and 485 vertex of which 47 / 485 are part of one of the 9 SCC in 10 ms
Free SCC test removed 38 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Graph (complete) has 816 edges and 447 vertex of which 443 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 293 rules applied. Total rules applied 295 place count 443 transition count 358
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 296 rules applied. Total rules applied 591 place count 154 transition count 351
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 602 place count 150 transition count 344
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 609 place count 143 transition count 344
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 609 place count 143 transition count 325
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 647 place count 124 transition count 325
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 651 place count 120 transition count 321
Iterating global reduction 4 with 4 rules applied. Total rules applied 655 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 656 place count 119 transition count 320
Iterating global reduction 4 with 1 rules applied. Total rules applied 657 place count 119 transition count 320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 691 place count 102 transition count 303
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 693 place count 102 transition count 301
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 702 place count 93 transition count 184
Iterating global reduction 5 with 9 rules applied. Total rules applied 711 place count 93 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 717 place count 93 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 719 place count 92 transition count 177
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 737 place count 83 transition count 179
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 743 place count 83 transition count 173
Free-agglomeration rule applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 768 place count 83 transition count 148
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 795 place count 58 transition count 146
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 802 place count 58 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 803 place count 58 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 58 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 805 place count 58 transition count 138
Applied a total of 805 rules in 229 ms. Remains 58 /485 variables (removed 427) and now considering 138/702 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 58/485 places, 138/702 transitions.
Finished random walk after 656 steps, including 24 resets, run visited all 19 properties in 34 ms. (steps per millisecond=19 )
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-23 06:03:53] [INFO ] Flatten gal took : 71 ms
[2023-03-23 06:03:53] [INFO ] Flatten gal took : 73 ms
[2023-03-23 06:03:53] [INFO ] Input system was already deterministic with 702 transitions.
Computed a total of 63 stabilizing places and 67 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 463 transition count 680
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 463 transition count 680
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 456 transition count 673
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 456 transition count 673
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 455 transition count 672
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 455 transition count 672
Applied a total of 60 rules in 87 ms. Remains 455 /485 variables (removed 30) and now considering 672/702 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 455/485 places, 672/702 transitions.
[2023-03-23 06:03:53] [INFO ] Flatten gal took : 35 ms
[2023-03-23 06:03:53] [INFO ] Flatten gal took : 35 ms
[2023-03-23 06:03:53] [INFO ] Input system was already deterministic with 672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 462 transition count 679
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 462 transition count 679
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 453 transition count 670
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 453 transition count 670
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 450 transition count 667
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 450 transition count 667
Applied a total of 70 rules in 83 ms. Remains 450 /485 variables (removed 35) and now considering 667/702 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 450/485 places, 667/702 transitions.
[2023-03-23 06:03:53] [INFO ] Flatten gal took : 29 ms
[2023-03-23 06:03:53] [INFO ] Flatten gal took : 31 ms
[2023-03-23 06:03:53] [INFO ] Input system was already deterministic with 667 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 457 transition count 674
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 457 transition count 674
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 447 transition count 664
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 443 transition count 660
Applied a total of 84 rules in 67 ms. Remains 443 /485 variables (removed 42) and now considering 660/702 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 443/485 places, 660/702 transitions.
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 25 ms
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:03:54] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Graph (trivial) has 494 edges and 485 vertex of which 72 / 485 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 303 rules applied. Total rules applied 304 place count 424 transition count 331
Reduce places removed 303 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 311 rules applied. Total rules applied 615 place count 121 transition count 323
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 620 place count 117 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 116 transition count 322
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 621 place count 116 transition count 309
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 647 place count 103 transition count 309
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 658 place count 92 transition count 296
Iterating global reduction 4 with 11 rules applied. Total rules applied 669 place count 92 transition count 296
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 671 place count 90 transition count 268
Iterating global reduction 4 with 2 rules applied. Total rules applied 673 place count 90 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 674 place count 90 transition count 267
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 702 place count 76 transition count 253
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 715 place count 63 transition count 141
Iterating global reduction 5 with 13 rules applied. Total rules applied 728 place count 63 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 735 place count 63 transition count 134
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 738 place count 60 transition count 128
Iterating global reduction 6 with 3 rules applied. Total rules applied 741 place count 60 transition count 128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 742 place count 59 transition count 126
Iterating global reduction 6 with 1 rules applied. Total rules applied 743 place count 59 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 745 place count 58 transition count 125
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 57 transition count 120
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 57 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 748 place count 57 transition count 119
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 753 place count 57 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 763 place count 52 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 764 place count 51 transition count 108
Applied a total of 764 rules in 85 ms. Remains 51 /485 variables (removed 434) and now considering 108/702 (removed 594) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 51/485 places, 108/702 transitions.
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:03:54] [INFO ] Input system was already deterministic with 108 transitions.
Finished random walk after 489 steps, including 51 resets, run visited all 1 properties in 4 ms. (steps per millisecond=122 )
FORMULA StigmergyElection-PT-04b-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 459 transition count 676
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 459 transition count 676
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 450 transition count 667
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 450 transition count 667
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 447 transition count 664
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 446 transition count 663
Applied a total of 78 rules in 135 ms. Remains 446 /485 variables (removed 39) and now considering 663/702 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 446/485 places, 663/702 transitions.
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:03:54] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Graph (trivial) has 492 edges and 485 vertex of which 75 / 485 are part of one of the 12 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 421 transition count 330
Reduce places removed 300 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 308 rules applied. Total rules applied 609 place count 121 transition count 322
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 613 place count 117 transition count 322
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 613 place count 117 transition count 309
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 639 place count 104 transition count 309
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 649 place count 94 transition count 297
Iterating global reduction 3 with 10 rules applied. Total rules applied 659 place count 94 transition count 297
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 661 place count 92 transition count 269
Iterating global reduction 3 with 2 rules applied. Total rules applied 663 place count 92 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 664 place count 92 transition count 268
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 692 place count 78 transition count 254
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 705 place count 65 transition count 148
Iterating global reduction 4 with 13 rules applied. Total rules applied 718 place count 65 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 724 place count 65 transition count 142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 727 place count 62 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 730 place count 62 transition count 136
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 731 place count 61 transition count 134
Iterating global reduction 5 with 1 rules applied. Total rules applied 732 place count 61 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 734 place count 60 transition count 133
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 738 place count 60 transition count 129
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 746 place count 56 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 747 place count 55 transition count 124
Applied a total of 747 rules in 73 ms. Remains 55 /485 variables (removed 430) and now considering 124/702 (removed 578) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 55/485 places, 124/702 transitions.
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 4 ms
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 6 ms
[2023-03-23 06:03:54] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 459 transition count 676
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 459 transition count 676
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 450 transition count 667
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 450 transition count 667
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 448 transition count 665
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 447 transition count 664
Applied a total of 76 rules in 117 ms. Remains 447 /485 variables (removed 38) and now considering 664/702 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 447/485 places, 664/702 transitions.
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:03:54] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:03:54] [INFO ] Input system was already deterministic with 664 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 459 transition count 676
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 459 transition count 676
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 448 transition count 665
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 448 transition count 665
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 444 transition count 661
Applied a total of 82 rules in 112 ms. Remains 444 /485 variables (removed 41) and now considering 661/702 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 444/485 places, 661/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 661 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 458 transition count 675
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 458 transition count 675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 447 transition count 664
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 443 transition count 660
Applied a total of 84 rules in 69 ms. Remains 443 /485 variables (removed 42) and now considering 660/702 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 443/485 places, 660/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 459 transition count 676
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 459 transition count 676
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 449 transition count 666
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 449 transition count 666
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 446 transition count 663
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 445 transition count 662
Applied a total of 80 rules in 60 ms. Remains 445 /485 variables (removed 40) and now considering 662/702 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 445/485 places, 662/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 662 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 458 transition count 675
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 458 transition count 675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 447 transition count 664
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 447 transition count 664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 444 transition count 661
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 443 transition count 660
Applied a total of 84 rules in 78 ms. Remains 443 /485 variables (removed 42) and now considering 660/702 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 443/485 places, 660/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 19 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Graph (trivial) has 494 edges and 485 vertex of which 75 / 485 are part of one of the 12 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 421 transition count 330
Reduce places removed 300 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 308 rules applied. Total rules applied 609 place count 121 transition count 322
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 614 place count 117 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 116 transition count 321
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 615 place count 116 transition count 308
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 641 place count 103 transition count 308
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 652 place count 92 transition count 295
Iterating global reduction 4 with 11 rules applied. Total rules applied 663 place count 92 transition count 295
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 665 place count 90 transition count 267
Iterating global reduction 4 with 2 rules applied. Total rules applied 667 place count 90 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 668 place count 90 transition count 266
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 696 place count 76 transition count 252
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 710 place count 62 transition count 138
Iterating global reduction 5 with 14 rules applied. Total rules applied 724 place count 62 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 731 place count 62 transition count 131
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 735 place count 58 transition count 123
Iterating global reduction 6 with 4 rules applied. Total rules applied 739 place count 58 transition count 123
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 741 place count 56 transition count 119
Iterating global reduction 6 with 2 rules applied. Total rules applied 743 place count 56 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 745 place count 55 transition count 118
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 54 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 54 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 748 place count 54 transition count 113
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 752 place count 54 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 760 place count 50 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 761 place count 49 transition count 104
Applied a total of 761 rules in 52 ms. Remains 49 /485 variables (removed 436) and now considering 104/702 (removed 598) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 49/485 places, 104/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Graph (trivial) has 483 edges and 485 vertex of which 73 / 485 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 290 rules applied. Total rules applied 291 place count 423 transition count 343
Reduce places removed 290 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 298 rules applied. Total rules applied 589 place count 133 transition count 335
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 595 place count 129 transition count 333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 597 place count 127 transition count 333
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 597 place count 127 transition count 319
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 625 place count 113 transition count 319
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 634 place count 104 transition count 309
Iterating global reduction 4 with 9 rules applied. Total rules applied 643 place count 104 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 645 place count 102 transition count 281
Iterating global reduction 4 with 2 rules applied. Total rules applied 647 place count 102 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 648 place count 102 transition count 280
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 676 place count 88 transition count 266
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 687 place count 77 transition count 163
Iterating global reduction 5 with 11 rules applied. Total rules applied 698 place count 77 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 704 place count 77 transition count 157
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 707 place count 74 transition count 151
Iterating global reduction 6 with 3 rules applied. Total rules applied 710 place count 74 transition count 151
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 712 place count 72 transition count 147
Iterating global reduction 6 with 2 rules applied. Total rules applied 714 place count 72 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 716 place count 71 transition count 146
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 717 place count 70 transition count 141
Iterating global reduction 6 with 1 rules applied. Total rules applied 718 place count 70 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 719 place count 70 transition count 140
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 723 place count 70 transition count 136
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 731 place count 66 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 732 place count 65 transition count 131
Applied a total of 732 rules in 56 ms. Remains 65 /485 variables (removed 420) and now considering 131/702 (removed 571) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 65/485 places, 131/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 6 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 6 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 702/702 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 457 transition count 674
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 457 transition count 674
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 446 transition count 663
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 446 transition count 663
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 443 transition count 660
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 442 transition count 659
Applied a total of 86 rules in 54 ms. Remains 442 /485 variables (removed 43) and now considering 659/702 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 442/485 places, 659/702 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:03:55] [INFO ] Input system was already deterministic with 659 transitions.
[2023-03-23 06:03:55] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:03:56] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:03:56] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-23 06:03:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 485 places, 702 transitions and 2524 arcs took 6 ms.
Total runtime 17998 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: 485 NrTr: 702 NrArc: 2524)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.073sec
net check time: 0m 0.000sec
init dd package: 0m 3.448sec
RS generation: 0m38.428sec
-> reachability set: #nodes 27799 (2.8e+04) #states 968,203,041 (8)
starting MCC model checker
--------------------------
checking: EG [EX [[p247<=0 & 0<=p247]]]
normalized: EG [EX [[p247<=0 & 0<=p247]]]
abstracting: (0<=p247)
states: 968,203,041 (8)
abstracting: (p247<=0)
states: 962,904,993 (8)
............................
before gc: list nodes free: 1410932
after gc: idd nodes used:587879, unused:63412121; list nodes free:297286917
.........MC time: 4m34.023sec
checking: AG [EF [[p462<=1 & 1<=p462]]]
normalized: ~ [E [true U ~ [E [true U [p462<=1 & 1<=p462]]]]]
abstracting: (1<=p462)
states: 4,533,438 (6)
abstracting: (p462<=1)
states: 968,203,041 (8)
-> the formula is FALSE
FORMULA StigmergyElection-PT-04b-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.082sec
checking: EX [EX [AG [EX [[[p391<=0 & 0<=p391] | [p157<=1 & 1<=p157]]]]]]
normalized: EX [EX [~ [E [true U ~ [EX [[[p157<=1 & 1<=p157] | [p391<=0 & 0<=p391]]]]]]]]
abstracting: (0<=p391)
states: 968,203,041 (8)
abstracting: (p391<=0)
states: 955,723,665 (8)
abstracting: (1<=p157)
states: 12,252,702 (7)
abstracting: (p157<=1)
states: 968,203,041 (8)
...-> the formula is FALSE
FORMULA StigmergyElection-PT-04b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m34.030sec
checking: EF [[AG [[p370<=1 & 1<=p370]] | [~ [[p400<=0 & 0<=p400]] & [p479<=1 & 1<=p479]]]]
normalized: E [true U [[[p479<=1 & 1<=p479] & ~ [[p400<=0 & 0<=p400]]] | ~ [E [true U ~ [[p370<=1 & 1<=p370]]]]]]
abstracting: (1<=p370)
states: 5,080,320 (6)
abstracting: (p370<=1)
states: 968,203,041 (8)
abstracting: (0<=p400)
states: 968,203,041 (8)
abstracting: (p400<=0)
states: 963,122,721 (8)
abstracting: (1<=p479)
states: 69,157,360 (7)
abstracting: (p479<=1)
states: 968,203,041 (8)
before gc: list nodes free: 5406851
after gc: idd nodes used:120441, unused:63879559; list nodes free:299352244
-> the formula is TRUE
FORMULA StigmergyElection-PT-04b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m13.338sec
checking: EX [EG [[A [AF [[p429<=0 & 0<=p429]] U AG [[p152<=0 & 0<=p152]]] & [E [~ [[p166<=1 & 1<=p166]] U AG [[p289<=1 & 1<=p289]]] | [p71<=1 & 1<=p71]]]]]
normalized: EX [EG [[[[p71<=1 & 1<=p71] | E [~ [[p166<=1 & 1<=p166]] U ~ [E [true U ~ [[p289<=1 & 1<=p289]]]]]] & [~ [EG [E [true U ~ [[p152<=0 & 0<=p152]]]]] & ~ [E [E [true U ~ [[p152<=0 & 0<=p152]]] U [EG [~ [[p429<=0 & 0<=p429]]] & E [true U ~ [[p152<=0 & 0<=p152]]]]]]]]]]
abstracting: (0<=p152)
states: 968,203,041 (8)
abstracting: (p152<=0)
states: 955,950,339 (8)
abstracting: (0<=p429)
states: 968,203,041 (8)
abstracting: (p429<=0)
states: 955,723,665 (8)
...................................................................................................
EG iterations: 99
abstracting: (0<=p152)
states: 968,203,041 (8)
abstracting: (p152<=0)
states: 955,950,339 (8)
MC time: 5m12.000sec
checking: EF [[[p397<=1 & 1<=p397] & AF [[A [EX [[p124<=1 & 1<=p124]] U EX [[p424<=0 & 0<=p424]]] & [AF [[p420<=1 & 1<=p420]] | [p297<=0 & 0<=p297]]]]]]
normalized: E [true U [~ [EG [~ [[[[p297<=0 & 0<=p297] | ~ [EG [~ [[p420<=1 & 1<=p420]]]]] & [~ [EG [~ [EX [[p424<=0 & 0<=p424]]]]] & ~ [E [~ [EX [[p424<=0 & 0<=p424]]] U [~ [EX [[p124<=1 & 1<=p124]]] & ~ [EX [[p424<=0 & 0<=p424]]]]]]]]]]] & [p397<=1 & 1<=p397]]]
abstracting: (1<=p397)
states: 12,479,376 (7)
abstracting: (p397<=1)
states: 968,203,041 (8)
abstracting: (0<=p424)
states: 968,203,041 (8)
abstracting: (p424<=0)
states: 955,723,665 (8)
.abstracting: (1<=p124)
states: 5,150,880 (6)
abstracting: (p124<=1)
states: 968,203,041 (8)
.abstracting: (0<=p424)
states: 968,203,041 (8)
abstracting: (p424<=0)
states: 955,723,665 (8)
.abstracting: (0<=p424)
states: 968,203,041 (8)
abstracting: (p424<=0)
states: 955,723,665 (8)
...
EG iterations: 2
abstracting: (1<=p420)
states: 12,479,376 (7)
abstracting: (p420<=1)
states: 968,203,041 (8)
..............................
before gc: list nodes free: 5065267
after gc: idd nodes used:293108, unused:63706892; list nodes free:298578729
...........................................................................
EG iterations: 105
abstracting: (0<=p297)
states: 968,203,041 (8)
abstracting: (p297<=0)
states: 963,539,193 (8)
.......................................................
EG iterations: 55
-> the formula is TRUE
FORMULA StigmergyElection-PT-04b-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m47.762sec
checking: EF [AG [AX [[AG [[p177<=0 & 0<=p177]] | [[[p359<=0 & 0<=p359] & [p124<=1 & 1<=p124]] | [[p173<=0 & 0<=p173] & [p434<=1 & 1<=p434]]]]]]]
normalized: E [true U ~ [E [true U EX [~ [[[[[p434<=1 & 1<=p434] & [p173<=0 & 0<=p173]] | [[p124<=1 & 1<=p124] & [p359<=0 & 0<=p359]]] | ~ [E [true U ~ [[p177<=0 & 0<=p177]]]]]]]]]]
abstracting: (0<=p177)
states: 968,203,041 (8)
abstracting: (p177<=0)
states: 963,539,193 (8)
abstracting: (0<=p359)
states: 968,203,041 (8)
abstracting: (p359<=0)
states: 963,122,721 (8)
abstracting: (1<=p124)
states: 5,150,880 (6)
abstracting: (p124<=1)
states: 968,203,041 (8)
abstracting: (0<=p173)
states: 968,203,041 (8)
abstracting: (p173<=0)
states: 963,539,193 (8)
abstracting: (1<=p434)
states: 12,479,376 (7)
abstracting: (p434<=1)
states: 968,203,041 (8)
.
before gc: list nodes free: 2734609
after gc: idd nodes used:199778, unused:63800222; list nodes free:298982918
-> the formula is TRUE
FORMULA StigmergyElection-PT-04b-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m23.144sec
checking: [AX [1<=0] | ~ [E [~ [[[[p158<=0 & 0<=p158] | [p50<=1 & 1<=p50]] & ~ [[[[p7<=0 & 0<=p7] | [p223<=1 & 1<=p223]] & ~ [[p237<=1 & 1<=p237]]]]]] U [p466<=0 & 0<=p466]]]]
normalized: [~ [E [~ [[~ [[~ [[p237<=1 & 1<=p237]] & [[p223<=1 & 1<=p223] | [p7<=0 & 0<=p7]]]] & [[p50<=1 & 1<=p50] | [p158<=0 & 0<=p158]]]] U [p466<=0 & 0<=p466]]] | ~ [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
.abstracting: (0<=p466)
states: 968,203,041 (8)
abstracting: (p466<=0)
states: 963,669,603 (8)
abstracting: (0<=p158)
states: 968,203,041 (8)
abstracting: (p158<=0)
states: 955,950,339 (8)
abstracting: (1<=p50)
states: 4,532,472 (6)
abstracting: (p50<=1)
states: 968,203,041 (8)
abstracting: (0<=p7)
states: 968,203,041 (8)
abstracting: (p7<=0)
states: 963,052,161 (8)
abstracting: (1<=p223)
states: 4,599,126 (6)
abstracting: (p223<=1)
states: 968,203,041 (8)
abstracting: (1<=p237)
states: 4,532,472 (6)
abstracting: (p237<=1)
states: 968,203,041 (8)
-> the formula is FALSE
FORMULA StigmergyElection-PT-04b-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.894sec
checking: [AF [[AX [[[[p299<=0 & 0<=p299] & [p288<=1 & 1<=p288]] | [p295<=1 & 1<=p295]]] & [[p407<=0 & 0<=p407] | [p224<=1 & 1<=p224]]]] & AX [[[p447<=0 & 0<=p447] | [p312<=1 & 1<=p312]]]]
normalized: [~ [EX [~ [[[p312<=1 & 1<=p312] | [p447<=0 & 0<=p447]]]]] & ~ [EG [~ [[[[p224<=1 & 1<=p224] | [p407<=0 & 0<=p407]] & ~ [EX [~ [[[p295<=1 & 1<=p295] | [[p288<=1 & 1<=p288] & [p299<=0 & 0<=p299]]]]]]]]]]]
abstracting: (0<=p299)
states: 968,203,041 (8)
abstracting: (p299<=0)
states: 963,539,193 (8)
abstracting: (1<=p288)
states: 4,663,848 (6)
abstracting: (p288<=1)
states: 968,203,041 (8)
abstracting: (1<=p295)
states: 4,663,848 (6)
abstracting: (p295<=1)
states: 968,203,041 (8)
.abstracting: (0<=p407)
states: 968,203,041 (8)
abstracting: (p407<=0)
states: 963,470,607 (8)
abstracting: (1<=p224)
states: 4,599,126 (6)
abstracting: (p224<=1)
states: 968,203,041 (8)
..........................
before gc: list nodes free: 562951
after gc: idd nodes used:698474, unused:63301526; list nodes free:296759263
.......MC time: 5m38.016sec
checking: AG [A [[~ [AF [[[p127<=0 & 0<=p127] | [p172<=1 & 1<=p172]]]] & [[p166<=0 & 0<=p166] | [p66<=1 & 1<=p66]]] U AG [[[p212<=0 & 0<=p212] & [[p69<=0 & 0<=p69] | [p144<=1 & 1<=p144]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [E [true U ~ [[[[p144<=1 & 1<=p144] | [p69<=0 & 0<=p69]] & [p212<=0 & 0<=p212]]]]]] & ~ [E [E [true U ~ [[[[p144<=1 & 1<=p144] | [p69<=0 & 0<=p69]] & [p212<=0 & 0<=p212]]]] U [~ [[[[p66<=1 & 1<=p66] | [p166<=0 & 0<=p166]] & EG [~ [[[p172<=1 & 1<=p172] | [p127<=0 & 0<=p127]]]]]] & E [true U ~ [[[[p144<=1 & 1<=p144] | [p69<=0 & 0<=p69]] & [p212<=0 & 0<=p212]]]]]]]]]]]
abstracting: (0<=p212)
states: 968,203,041 (8)
abstracting: (p212<=0)
states: 963,603,915 (8)
abstracting: (0<=p69)
states: 968,203,041 (8)
abstracting: (p69<=0)
states: 955,973,509 (8)
abstracting: (1<=p144)
states: 12,252,702 (7)
abstracting: (p144<=1)
states: 968,203,041 (8)
abstracting: (0<=p127)
states: 968,203,041 (8)
abstracting: (p127<=0)
states: 963,052,161 (8)
abstracting: (1<=p172)
states: 4,663,848 (6)
abstracting: (p172<=1)
states: 968,203,041 (8)
....................................................
EG iterations: 52
abstracting: (0<=p166)
states: 968,203,041 (8)
abstracting: (p166<=0)
states: 955,950,339 (8)
abstracting: (1<=p66)
states: 12,229,532 (7)
abstracting: (p66<=1)
states: 968,203,041 (8)
abstracting: (0<=p212)
states: 968,203,041 (8)
abstracting: (p212<=0)
states: 963,603,915 (8)
abstracting: (0<=p69)
states: 968,203,041 (8)
abstracting: (p69<=0)
states: 955,973,509 (8)
abstracting: (1<=p144)
states: 12,252,702 (7)
abstracting: (p144<=1)
states: 968,203,041 (8)
abstracting: (0<=p212)
states: 968,203,041 (8)
abstracting: (p212<=0)
states: 963,603,915 (8)
abstracting: (0<=p69)
states: 968,203,041 (8)
abstracting: (p69<=0)
states: 955,973,509 (8)
abstracting: (1<=p144)
states: 12,252,702 (7)
abstracting: (p144<=1)
states: 968,203,041 (8)
before gc: list nodes free: 5094314
after gc: idd nodes used:339877, unused:63660123; list nodes free:298319979
.......................MC time: 4m49.016sec
checking: E [EX [[EX [AG [[[p437<=0 & 0<=p437] | [p315<=1 & 1<=p315]]]] & [EF [[p395<=0 & 0<=p395]] & [p475<=0 & 0<=p475]]]] U ~ [[AF [AX [[[[p350<=0 & 0<=p350] | [p383<=1 & 1<=p383]] & [p352<=0 & 0<=p352]]]] & [[p75<=0 & 0<=p75] | [p156<=1 & 1<=p156]]]]]
normalized: E [EX [[[[p475<=0 & 0<=p475] & E [true U [p395<=0 & 0<=p395]]] & EX [~ [E [true U ~ [[[p315<=1 & 1<=p315] | [p437<=0 & 0<=p437]]]]]]]] U ~ [[[[p156<=1 & 1<=p156] | [p75<=0 & 0<=p75]] & ~ [EG [EX [~ [[[p352<=0 & 0<=p352] & [[p383<=1 & 1<=p383] | [p350<=0 & 0<=p350]]]]]]]]]]
abstracting: (0<=p350)
states: 968,203,041 (8)
abstracting: (p350<=0)
states: 963,602,949 (8)
abstracting: (1<=p383)
states: 12,479,376 (7)
abstracting: (p383<=1)
states: 968,203,041 (8)
abstracting: (0<=p352)
states: 968,203,041 (8)
abstracting: (p352<=0)
states: 963,602,949 (8)
.....................................................................................................
EG iterations: 100
abstracting: (0<=p75)
states: 968,203,041 (8)
abstracting: (p75<=0)
states: 963,670,569 (8)
abstracting: (1<=p156)
states: 12,252,702 (7)
abstracting: (p156<=1)
states: 968,203,041 (8)
abstracting: (0<=p437)
states: 968,203,041 (8)
abstracting: (p437<=0)
states: 955,723,665 (8)
abstracting: (1<=p315)
states: 12,534,144 (7)
abstracting: (p315<=1)
states: 968,203,041 (8)
before gc: list nodes free: 5377339
after gc: idd nodes used:264655, unused:63735345; list nodes free:298674820
.abstracting: (0<=p395)
states: 968,203,041 (8)
abstracting: (p395<=0)
states: 955,723,665 (8)
abstracting: (0<=p475)
states: 968,203,041 (8)
abstracting: (p475<=0)
states: 899,045,681 (8)
.-> the formula is FALSE
FORMULA StigmergyElection-PT-04b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m58.755sec
checking: [AF [[AX [EX [[p178<=0 & 0<=p178]]] | [E [[[[p137<=1 & 1<=p137] | [p110<=1 & 1<=p110]] & ~ [[[p418<=0 & 0<=p418] | [p52<=1 & 1<=p52]]]] U ~ [AF [[p358<=1 & 1<=p358]]]] & A [[EF [[p197<=0 & 0<=p197]] & ~ [[p359<=1 & 1<=p359]]] U [AF [[[p233<=0 & 0<=p233] | [p169<=1 & 1<=p169]]] & [[p470<=0 & 0<=p470] | [[p244<=1 & 1<=p244] | [p467<=1 & 1<=p467]]]]]]]] & EF [[[p78<=0 & 0<=p78] & [p385<=1 & 1<=p385]]]]
normalized: [E [true U [[p385<=1 & 1<=p385] & [p78<=0 & 0<=p78]]] & ~ [EG [~ [[[[~ [EG [~ [[[[[p467<=1 & 1<=p467] | [p244<=1 & 1<=p244]] | [p470<=0 & 0<=p470]] & ~ [EG [~ [[[p169<=1 & 1<=p169] | [p233<=0 & 0<=p233]]]]]]]]] & ~ [E [~ [[[[[p467<=1 & 1<=p467] | [p244<=1 & 1<=p244]] | [p470<=0 & 0<=p470]] & ~ [EG [~ [[[p169<=1 & 1<=p169] | [p233<=0 & 0<=p233]]]]]]] U [~ [[~ [[p359<=1 & 1<=p359]] & E [true U [p197<=0 & 0<=p197]]]] & ~ [[[[[p467<=1 & 1<=p467] | [p244<=1 & 1<=p244]] | [p470<=0 & 0<=p470]] & ~ [EG [~ [[[p169<=1 & 1<=p169] | [p233<=0 & 0<=p233]]]]]]]]]]] & E [[~ [[[p52<=1 & 1<=p52] | [p418<=0 & 0<=p418]]] & [[p110<=1 & 1<=p110] | [p137<=1 & 1<=p137]]] U EG [~ [[p358<=1 & 1<=p358]]]]] | ~ [EX [~ [EX [[p178<=0 & 0<=p178]]]]]]]]]]
abstracting: (0<=p178)
states: 968,203,041 (8)
abstracting: (p178<=0)
states: 963,539,193 (8)
..abstracting: (1<=p358)
states: 5,080,320 (6)
abstracting: (p358<=1)
states: 968,203,041 (8)
.
EG iterations: 1
abstracting: (1<=p137)
states: 5,150,880 (6)
abstracting: (p137<=1)
states: 968,203,041 (8)
abstracting: (1<=p110)
states: 4,532,472 (6)
abstracting: (p110<=1)
states: 968,203,041 (8)
abstracting: (0<=p418)
states: 968,203,041 (8)
abstracting: (p418<=0)
states: 955,723,665 (8)
abstracting: (1<=p52)
states: 4,532,472 (6)
abstracting: (p52<=1)
states: 968,203,041 (8)
abstracting: (0<=p233)
states: 968,203,041 (8)
abstracting: (p233<=0)
states: 963,670,569 (8)
abstracting: (1<=p169)
states: 4,663,848 (6)
abstracting: (p169<=1)
states: 968,203,041 (8)
.................................................................................................
EG iterations: 97
abstracting: (0<=p470)
states: 968,203,041 (8)
abstracting: (p470<=0)
states: 963,669,603 (8)
abstracting: (1<=p244)
states: 5,298,048 (6)
abstracting: (p244<=1)
states: 968,203,041 (8)
abstracting: (1<=p467)
states: 4,533,438 (6)
abstracting: (p467<=1)
states: 968,203,041 (8)
abstracting: (0<=p197)
states: 968,203,041 (8)
abstracting: (p197<=0)
states: 955,950,339 (8)
abstracting: (1<=p359)
states: 5,080,320 (6)
abstracting: (p359<=1)
states: 968,203,041 (8)
abstracting: (0<=p233)
states: 968,203,041 (8)
abstracting: (p233<=0)
states: 963,670,569 (8)
abstracting: (1<=p169)
states: 4,663,848 (6)
abstracting: (p169<=1)
states: 968,203,041 (8)
.................................................................................................
EG iterations: 97
abstracting: (0<=p470)
states: 968,203,041 (8)
abstracting: (p470<=0)
states: 963,669,603 (8)
abstracting: (1<=p244)
states: 5,298,048 (6)
abstracting: (p244<=1)
states: 968,203,041 (8)
abstracting: (1<=p467)
states: 4,533,438 (6)
abstracting: (p467<=1)
states: 968,203,041 (8)
abstracting: (0<=p233)
states: 968,203,041 (8)
abstracting: (p233<=0)
states: 963,670,569 (8)
abstracting: (1<=p169)
states: 4,663,848 (6)
abstracting: (p169<=1)
states: 968,203,041 (8)
.................................................................................................
EG iterations: 97
abstracting: (0<=p470)
states: 968,203,041 (8)
abstracting: (p470<=0)
states: 963,669,603 (8)
abstracting: (1<=p244)
states: 5,298,048 (6)
abstracting: (p244<=1)
states: 968,203,041 (8)
abstracting: (1<=p467)
states: 4,533,438 (6)
abstracting: (p467<=1)
states: 968,203,041 (8)
...................................................................................................
EG iterations: 99
.
EG iterations: 1
abstracting: (0<=p78)
states: 968,203,041 (8)
abstracting: (p78<=0)
states: 955,973,509 (8)
abstracting: (1<=p385)
states: 12,479,376 (7)
abstracting: (p385<=1)
states: 968,203,041 (8)
-> the formula is TRUE
FORMULA StigmergyElection-PT-04b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m35.641sec
checking: [AG [[[EG [E [[[p267<=0 & 0<=p267] | [p329<=1 & 1<=p329]] U [p49<=0 & 0<=p49]]] & EF [AG [[p212<=0 & 0<=p212]]]] & EG [[[0<=p164 & p164<=0] | [1<=p78 & p78<=1]]]]] & [EX [EX [AX [E [[[p87<=0 & 0<=p87] | [p228<=1 & 1<=p228]] U [p242<=1 & 1<=p242]]]]] | E [AF [EX [[p76<=0 & 0<=p76]]] U [AF [EG [[[p140<=0 & 0<=p140] | [p151<=1 & 1<=p151]]]] | [[p18<=1 & 1<=p18] | [~ [[p159<=0 & 0<=p159]] & E [[p371<=1 & 1<=p371] U [p291<=1 & 1<=p291]]]]]]]]
normalized: [[E [~ [EG [~ [EX [[p76<=0 & 0<=p76]]]]] U [[[E [[p371<=1 & 1<=p371] U [p291<=1 & 1<=p291]] & ~ [[p159<=0 & 0<=p159]]] | [p18<=1 & 1<=p18]] | ~ [EG [~ [EG [[[p151<=1 & 1<=p151] | [p140<=0 & 0<=p140]]]]]]]] | EX [EX [~ [EX [~ [E [[[p228<=1 & 1<=p228] | [p87<=0 & 0<=p87]] U [p242<=1 & 1<=p242]]]]]]]] & ~ [E [true U ~ [[EG [[[1<=p78 & p78<=1] | [0<=p164 & p164<=0]]] & [E [true U ~ [E [true U ~ [[p212<=0 & 0<=p212]]]]] & EG [E [[[p329<=1 & 1<=p329] | [p267<=0 & 0<=p267]] U [p49<=0 & 0<=p49]]]]]]]]]
abstracting: (0<=p49)
states: 968,203,041 (8)
abstracting: (p49<=0)
states: 955,973,509 (8)
abstracting: (0<=p267)
states: 968,203,041 (8)
abstracting: (p267<=0)
states: 955,668,897 (8)
abstracting: (1<=p329)
states: 4,665,780 (6)
abstracting: (p329<=1)
states: 968,203,041 (8)
.
EG iterations: 1
abstracting: (0<=p212)
states: 968,203,041 (8)
abstracting: (p212<=0)
states: 963,603,915 (8)
abstracting: (p164<=0)
states: 955,950,339 (8)
abstracting: (0<=p164)
states: 968,203,041 (8)
abstracting: (p78<=1)
states: 968,203,041 (8)
abstracting: (1<=p78)
states: 12,229,532 (7)
.
EG iterations: 1
MC time: 4m40.000sec
checking: EG [EX [[p247<=0 & 0<=p247]]]
normalized: EG [EX [[p247<=0 & 0<=p247]]]
abstracting: (0<=p247)
states: 968,203,041 (8)
abstracting: (p247<=0)
states: 962,904,993 (8)
....
before gc: list nodes free: 8540844
after gc: idd nodes used:408101, unused:63591899; list nodes free:298016280
..........................
before gc: list nodes free: 936119
after gc: idd nodes used:779021, unused:63220979; list nodes free:296365903
...........
before gc: list nodes free: 2956422
after gc: idd nodes used:1014350, unused:62985650; list nodes free:295274846
.................
before gc: list nodes free: 499409
after gc: idd nodes used:627824, unused:63372176; list nodes free:299143297
...............................
EG iterations: 88
-> the formula is TRUE
FORMULA StigmergyElection-PT-04b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 13m35.585sec
checking: EX [EG [[A [AF [[p429<=0 & 0<=p429]] U AG [[p152<=0 & 0<=p152]]] & [E [~ [[p166<=1 & 1<=p166]] U AG [[p289<=1 & 1<=p289]]] | [p71<=1 & 1<=p71]]]]]
normalized: EX [EG [[[E [~ [[p166<=1 & 1<=p166]] U ~ [E [true U ~ [[p289<=1 & 1<=p289]]]]] | [p71<=1 & 1<=p71]] & [~ [EG [E [true U ~ [[p152<=0 & 0<=p152]]]]] & ~ [E [E [true U ~ [[p152<=0 & 0<=p152]]] U [EG [~ [[p429<=0 & 0<=p429]]] & E [true U ~ [[p152<=0 & 0<=p152]]]]]]]]]]
abstracting: (0<=p152)
states: 968,203,041 (8)
abstracting: (p152<=0)
states: 955,950,339 (8)
abstracting: (0<=p429)
states: 968,203,041 (8)
abstracting: (p429<=0)
states: 955,723,665 (8)
................................................................
before gc: list nodes free: 1395618
after gc: idd nodes used:400371, unused:63599629; list nodes free:300146929
...................................
EG iterations: 99
abstracting: (0<=p152)
states: 968,203,041 (8)
abstracting: (p152<=0)
states: 955,950,339 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5989432 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100476 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.003sec
22930 24962 26161 28116 32014
iterations count:558055 (794), effective:18929 (26)
initing FirstDep: 0m 0.003sec
net_ddint.h:600: Timeout: after 273 sec
iterations count:866 (1), effective:11 (0)
iterations count:867 (1), effective:12 (0)
29849
iterations count:184288 (262), effective:5312 (7)
iterations count:753 (1), effective:1 (0)
42256 47468 47311 47427 59611 60266 60819 58370 67732 65172
iterations count:1022274 (1456), effective:21350 (30)
41170 49266 45372 56514 60779 57749 63363
iterations count:772737 (1100), effective:16123 (22)
41170 49266 45372 56514 60779 57749 63363
iterations count:772737 (1100), effective:16123 (22)
48644 55346 60996 61176 80161
sat_reach.icc:155: Timeout: after 311 sec
iterations count:702 (1), effective:0 (0)
42046 42650 43786 54461 54065 57169 57785
iterations count:788292 (1122), effective:16671 (23)
30065 35341 37821 46733 49156 54528 54041 63115 60325
iterations count:935659 (1332), effective:19763 (28)
iterations count:708 (1), effective:2 (0)
36659
iterations count:180037 (256), effective:5359 (7)
iterations count:704 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 337 sec
38456 43490 43577 56287 56436 57477 62137
iterations count:787334 (1121), effective:16664 (23)
38456 43490 43577 56287 56436 57477 62137
iterations count:787334 (1121), effective:16664 (23)
iterations count:1195 (1), effective:42 (0)
38456 43490 43577 56287 56436 57477 62137
iterations count:787334 (1121), effective:16664 (23)
net_ddint.h:600: Timeout: after 288 sec
42046 42678 43627 54500 54784 57169 57827
iterations count:788231 (1122), effective:16686 (23)
iterations count:704 (1), effective:1 (0)
iterations count:704 (1), effective:1 (0)
iterations count:702 (1), effective:0 (0)
iterations count:704 (1), effective:1 (0)
42046 42678 43629 54392 54668 57093 57711
iterations count:788095 (1122), effective:16634 (23)
iterations count:704 (1), effective:1 (0)
30287 38116 41392 42481 55364 53145 57518 55289 62585
iterations count:979722 (1395), effective:20040 (28)
36659
iterations count:180004 (256), effective:5355 (7)
49830 57727 54805 68434
sat_reach.icc:155: Timeout: after 279 sec
41170 49266 45372 56514 60779 57749 63363
iterations count:772737 (1100), effective:16123 (22)
41170 49266 45372
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-04b"
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-04b, 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-167912650500593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04b.tgz
mv StigmergyElection-PT-04b 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 '
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 ;