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

About the Execution of Marcie+red for StigmergyCommit-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5482.184 17557.00 29358.00 767.50 FFFFFFFTFFFFTFFF 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-167912650200410.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 StigmergyCommit-PT-03a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650200410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 98K 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 StigmergyCommit-PT-03a-CTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679443984531

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 00:13:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:13:07] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-22 00:13:08] [INFO ] Transformed 148 places.
[2023-03-22 00:13:08] [INFO ] Transformed 332 transitions.
[2023-03-22 00:13:08] [INFO ] Found NUPN structural information;
[2023-03-22 00:13:08] [INFO ] Parsed PT model containing 148 places and 332 transitions and 1538 arcs in 864 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
Support contains 54 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 222/222 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 133 transition count 207
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 133 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 133 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 128 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 128 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 128 transition count 200
Applied a total of 42 rules in 45 ms. Remains 128 /148 variables (removed 20) and now considering 200/222 (removed 22) transitions.
[2023-03-22 00:13:08] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
// Phase 1: matrix 190 rows 128 cols
[2023-03-22 00:13:08] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-22 00:13:08] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-22 00:13:08] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2023-03-22 00:13:08] [INFO ] Invariant cache hit.
[2023-03-22 00:13:08] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 00:13:08] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-22 00:13:08] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2023-03-22 00:13:08] [INFO ] Invariant cache hit.
[2023-03-22 00:13:09] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/148 places, 200/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1044 ms. Remains : 128/148 places, 200/222 transitions.
Support contains 54 out of 128 places after structural reductions.
[2023-03-22 00:13:09] [INFO ] Flatten gal took : 94 ms
[2023-03-22 00:13:09] [INFO ] Flatten gal took : 34 ms
[2023-03-22 00:13:09] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 51 out of 128 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 51) seen :41
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 00:13:11] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2023-03-22 00:13:11] [INFO ] Invariant cache hit.
[2023-03-22 00:13:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 00:13:11] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:3
[2023-03-22 00:13:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 00:13:11] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2023-03-22 00:13:11] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 00:13:11] [INFO ] After 53ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :8 sat :2
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 8 ms to minimize.
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-03-22 00:13:11] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 00:13:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 622 ms
[2023-03-22 00:13:12] [INFO ] After 683ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :0
[2023-03-22 00:13:12] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2023-03-22 00:13:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 16 ms
[2023-03-22 00:13:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyCommit-PT-03a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 15 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 31 out of 128 places (down from 39) after GAL structural reductions.
Computed a total of 28 stabilizing places and 27 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 126 transition count 135
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 75 rules applied. Total rules applied 140 place count 62 transition count 124
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 148 place count 58 transition count 120
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 148 place count 58 transition count 108
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 172 place count 46 transition count 108
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 192 place count 26 transition count 84
Iterating global reduction 3 with 20 rules applied. Total rules applied 212 place count 26 transition count 84
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 222 place count 26 transition count 74
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 226 place count 22 transition count 66
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 22 transition count 66
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 245 place count 22 transition count 51
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 249 place count 22 transition count 47
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 257 place count 18 transition count 43
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 18 transition count 43
Applied a total of 259 rules in 33 ms. Remains 18 /128 variables (removed 110) and now considering 43/200 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 18/128 places, 43/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 111 transition count 180
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 111 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 111 transition count 177
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 100 transition count 163
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 100 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 100 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 96 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 96 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 92 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 92 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 88 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 88 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 88 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 85 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 85 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 85 transition count 141
Applied a total of 96 rules in 37 ms. Remains 85 /128 variables (removed 43) and now considering 141/200 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 85/128 places, 141/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 9 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 10 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 112 transition count 180
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 112 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 112 transition count 177
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 102 transition count 163
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 102 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 102 transition count 160
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 99 transition count 157
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 99 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 96 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 96 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 93 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 93 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 93 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 91 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 91 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 91 transition count 146
Applied a total of 83 rules in 25 ms. Remains 91 /128 variables (removed 37) and now considering 146/200 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 91/128 places, 146/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 9 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 10 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 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 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 196
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 124 transition count 194
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 10 place count 124 transition count 166
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 66 place count 96 transition count 166
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 83 place count 79 transition count 145
Iterating global reduction 2 with 17 rules applied. Total rules applied 100 place count 79 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 79 transition count 140
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 116 place count 68 transition count 125
Iterating global reduction 3 with 11 rules applied. Total rules applied 127 place count 68 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 68 transition count 122
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 64 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 64 transition count 118
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 145 place count 64 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 63 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 63 transition count 110
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 155 place count 59 transition count 106
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 158 place count 56 transition count 103
Iterating global reduction 5 with 3 rules applied. Total rules applied 161 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 164 place count 53 transition count 100
Iterating global reduction 5 with 3 rules applied. Total rules applied 167 place count 53 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 170 place count 53 transition count 97
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 174 place count 53 transition count 93
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 6 with 8 rules applied. Total rules applied 182 place count 49 transition count 89
Applied a total of 182 rules in 43 ms. Remains 49 /128 variables (removed 79) and now considering 89/200 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 49/128 places, 89/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 7 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 8 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 110 transition count 178
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 110 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 110 transition count 175
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 98 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 98 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 98 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 94 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 94 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 90 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 90 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 86 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 86 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 86 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 83 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 83 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 83 transition count 137
Applied a total of 100 rules in 11 ms. Remains 83 /128 variables (removed 45) and now considering 137/200 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 83/128 places, 137/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 9 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 13 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 111 transition count 179
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 111 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 111 transition count 176
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 100 transition count 161
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 100 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 100 transition count 158
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 96 transition count 154
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 96 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 92 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 92 transition count 150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 88 transition count 146
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 88 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 88 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 85 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 85 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 85 transition count 139
Applied a total of 96 rules in 12 ms. Remains 85 /128 variables (removed 43) and now considering 139/200 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 85/128 places, 139/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 8 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 9 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 128 transition count 190
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 24 place count 118 transition count 186
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 24 place count 118 transition count 159
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 78 place count 91 transition count 159
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 78 transition count 142
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 78 transition count 142
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 115 place count 67 transition count 127
Iterating global reduction 2 with 11 rules applied. Total rules applied 126 place count 67 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 67 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 134 place count 62 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 62 transition count 119
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 154 place count 62 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 61 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 61 transition count 103
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 172 place count 53 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 175 place count 53 transition count 92
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 182 place count 46 transition count 85
Iterating global reduction 5 with 7 rules applied. Total rules applied 189 place count 46 transition count 85
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 196 place count 39 transition count 78
Iterating global reduction 5 with 7 rules applied. Total rules applied 203 place count 39 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 207 place count 39 transition count 74
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 209 place count 37 transition count 72
Iterating global reduction 6 with 2 rules applied. Total rules applied 211 place count 37 transition count 72
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 216 place count 37 transition count 67
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 6 with 8 rules applied. Total rules applied 224 place count 33 transition count 63
Applied a total of 224 rules in 40 ms. Remains 33 /128 variables (removed 95) and now considering 63/200 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 33/128 places, 63/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 126 transition count 134
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 76 rules applied. Total rules applied 142 place count 61 transition count 123
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 150 place count 57 transition count 119
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 150 place count 57 transition count 107
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 174 place count 45 transition count 107
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 194 place count 25 transition count 83
Iterating global reduction 3 with 20 rules applied. Total rules applied 214 place count 25 transition count 83
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 225 place count 25 transition count 72
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 229 place count 21 transition count 64
Iterating global reduction 4 with 4 rules applied. Total rules applied 233 place count 21 transition count 64
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 248 place count 21 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 21 transition count 45
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 260 place count 17 transition count 41
Applied a total of 260 rules in 20 ms. Remains 17 /128 variables (removed 111) and now considering 41/200 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 17/128 places, 41/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 2 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA StigmergyCommit-PT-03a-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 110 transition count 178
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 110 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 110 transition count 175
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 98 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 98 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 98 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 94 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 94 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 90 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 90 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 86 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 86 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 86 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 83 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 83 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 83 transition count 137
Applied a total of 100 rules in 15 ms. Remains 83 /128 variables (removed 45) and now considering 137/200 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 83/128 places, 137/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 8 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 8 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 112 transition count 181
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 112 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 112 transition count 178
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 102 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 102 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 102 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 99 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 99 transition count 160
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 96 transition count 157
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 96 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 93 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 93 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 90 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 90 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 90 transition count 148
Applied a total of 84 rules in 13 ms. Remains 90 /128 variables (removed 38) and now considering 148/200 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 90/128 places, 148/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 8 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 8 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 126 transition count 140
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 66 rules applied. Total rules applied 126 place count 67 transition count 133
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 136 place count 64 transition count 126
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 142 place count 60 transition count 124
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 142 place count 60 transition count 112
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 166 place count 48 transition count 112
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 186 place count 28 transition count 88
Iterating global reduction 4 with 20 rules applied. Total rules applied 206 place count 28 transition count 88
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 217 place count 28 transition count 77
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 221 place count 24 transition count 69
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 24 transition count 69
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 240 place count 24 transition count 54
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 242 place count 23 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 23 transition count 52
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 247 place count 23 transition count 48
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 255 place count 19 transition count 44
Applied a total of 255 rules in 20 ms. Remains 19 /128 variables (removed 109) and now considering 44/200 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 19/128 places, 44/200 transitions.
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:13:12] [INFO ] Flatten gal took : 4 ms
[2023-03-22 00:13:12] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 112 transition count 180
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 112 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 112 transition count 179
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 100 transition count 163
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 100 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 100 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 96 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 96 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 92 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 92 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 88 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 88 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 88 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 85 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 85 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 85 transition count 141
Applied a total of 94 rules in 14 ms. Remains 85 /128 variables (removed 43) and now considering 141/200 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 85/128 places, 141/200 transitions.
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 7 ms
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 6 ms
[2023-03-22 00:13:13] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 110 transition count 178
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 110 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 110 transition count 175
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 98 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 98 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 98 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 94 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 94 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 90 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 90 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 86 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 86 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 86 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 83 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 83 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 83 transition count 137
Applied a total of 100 rules in 13 ms. Remains 83 /128 variables (removed 45) and now considering 137/200 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 83/128 places, 137/200 transitions.
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 5 ms
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 6 ms
[2023-03-22 00:13:13] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 111 transition count 180
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 111 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 111 transition count 177
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 101 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 101 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 101 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 97 transition count 158
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 97 transition count 158
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 93 transition count 154
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 93 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 89 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 89 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 89 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 87 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 87 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 87 transition count 145
Applied a total of 91 rules in 16 ms. Remains 87 /128 variables (removed 41) and now considering 145/200 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 87/128 places, 145/200 transitions.
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 7 ms
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 7 ms
[2023-03-22 00:13:13] [INFO ] Input system was already deterministic with 145 transitions.
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 9 ms
[2023-03-22 00:13:13] [INFO ] Flatten gal took : 9 ms
[2023-03-22 00:13:13] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 00:13:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 200 transitions and 708 arcs took 1 ms.
Total runtime 6037 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 128 NrTr: 200 NrArc: 708)

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

net check time: 0m 0.000sec

init dd package: 0m 3.543sec


RS generation: 0m 0.169sec


-> reachability set: #nodes 2405 (2.4e+03) #states 4,037 (3)



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

checking: E [AF [AG [EF [[p14<=1 & 1<=p14]]]] U AX [[p104<=1 & 1<=p104]]]
normalized: E [~ [EG [E [true U ~ [E [true U [p14<=1 & 1<=p14]]]]]] U ~ [EX [~ [[p104<=1 & 1<=p104]]]]]

abstracting: (1<=p104)
states: 1
abstracting: (p104<=1)
states: 4,037 (3)
.abstracting: (1<=p14)
states: 1
abstracting: (p14<=1)
states: 4,037 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.396sec

checking: EG [[[p62<=0 & 0<=p62] | [p127<=0 & 0<=p127]]]
normalized: EG [[[p62<=0 & 0<=p62] | [p127<=0 & 0<=p127]]]

abstracting: (0<=p127)
states: 4,037 (3)
abstracting: (p127<=0)
states: 1
abstracting: (0<=p62)
states: 4,037 (3)
abstracting: (p62<=0)
states: 3,596 (3)
.......................
EG iterations: 23
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.298sec

checking: EF [[AF [EX [[p117<=0 & 0<=p117]]] | [AG [[p119<=1 & 1<=p119]] & AX [[[p26<=0 & 0<=p26] | [p127<=0 & 0<=p127]]]]]]
normalized: E [true U [[~ [EX [~ [[[p127<=0 & 0<=p127] | [p26<=0 & 0<=p26]]]]] & ~ [E [true U ~ [[p119<=1 & 1<=p119]]]]] | ~ [EG [~ [EX [[p117<=0 & 0<=p117]]]]]]]

abstracting: (0<=p117)
states: 4,037 (3)
abstracting: (p117<=0)
states: 4,036 (3)
..
EG iterations: 1
abstracting: (1<=p119)
states: 343
abstracting: (p119<=1)
states: 4,037 (3)
abstracting: (0<=p26)
states: 4,037 (3)
abstracting: (p26<=0)
states: 3,596 (3)
abstracting: (0<=p127)
states: 4,037 (3)
abstracting: (p127<=0)
states: 1
.-> the formula is TRUE

FORMULA StigmergyCommit-PT-03a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: AX [EG [[[[p25<=0 & 0<=p25] | [p57<=0 & 0<=p57]] | [[p88<=0 & 0<=p88] | [p118<=0 & 0<=p118]]]]]
normalized: ~ [EX [~ [EG [[[[p118<=0 & 0<=p118] | [p88<=0 & 0<=p88]] | [[p57<=0 & 0<=p57] | [p25<=0 & 0<=p25]]]]]]]

abstracting: (0<=p25)
states: 4,037 (3)
abstracting: (p25<=0)
states: 3,356 (3)
abstracting: (0<=p57)
states: 4,037 (3)
abstracting: (p57<=0)
states: 3,358 (3)
abstracting: (0<=p88)
states: 4,037 (3)
abstracting: (p88<=0)
states: 3,356 (3)
abstracting: (0<=p118)
states: 4,037 (3)
abstracting: (p118<=0)
states: 3,454 (3)
............................
EG iterations: 28
.-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.619sec

checking: AF [[[AX [AG [[p1<=1 & 1<=p1]]] & [p25<=1 & 1<=p25]] & [[p57<=1 & 1<=p57] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]
normalized: ~ [EG [~ [[[~ [EX [E [true U ~ [[p1<=1 & 1<=p1]]]]] & [p25<=1 & 1<=p25]] & [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [p57<=1 & 1<=p57]]]]]]

abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p1)
states: 125
abstracting: (p1<=1)
states: 4,037 (3)
.
EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: E [~ [E [AX [1<=0] U ~ [EF [[p124<=1 & 1<=p124]]]]] U [[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]
normalized: E [~ [E [~ [EX [~ [1<=0]]] U ~ [E [true U [p124<=1 & 1<=p124]]]]] U [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]

abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p124)
states: 343
abstracting: (p124<=1)
states: 4,037 (3)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: EF [EG [[EF [~ [[p79<=1 & 1<=p79]]] & ~ [E [[p87<=1 & 1<=p87] U [[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]]]]
normalized: E [true U EG [[~ [E [[p87<=1 & 1<=p87] U [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]] & E [true U ~ [[p79<=1 & 1<=p79]]]]]]

abstracting: (1<=p79)
states: 1
abstracting: (p79<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 4,037 (3)
............................
EG iterations: 28
-> the formula is TRUE

FORMULA StigmergyCommit-PT-03a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: AX [AF [[[AG [[p36<=1 & 1<=p36]] & AF [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]] & [AX [EG [[p42<=1 & 1<=p42]]] & EX [AG [[[p78<=1 & 1<=p78] & [p127<=1 & 1<=p127]]]]]]]]
normalized: ~ [EX [EG [~ [[[EX [~ [E [true U ~ [[[p127<=1 & 1<=p127] & [p78<=1 & 1<=p78]]]]]] & ~ [EX [~ [EG [[p42<=1 & 1<=p42]]]]]] & [~ [EG [~ [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]]] & ~ [E [true U ~ [[p36<=1 & 1<=p36]]]]]]]]]]

abstracting: (1<=p36)
states: 64
abstracting: (p36<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
............................
EG iterations: 28
abstracting: (1<=p42)
states: 1
abstracting: (p42<=1)
states: 4,037 (3)
..
EG iterations: 2
.abstracting: (1<=p78)
states: 1
abstracting: (p78<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
.
EG iterations: 0
.-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AF [E [[EG [[[[1<=p25 & p25<=1] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]] & ~ [EG [[p105<=1 & 1<=p105]]]] U AG [AF [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]]]
normalized: ~ [EG [~ [E [[~ [EG [[p105<=1 & 1<=p105]]] & EG [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [1<=p25 & p25<=1]]]]] U ~ [E [true U EG [~ [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]]]]]]]]

abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
............................
EG iterations: 28
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
.
EG iterations: 1
abstracting: (1<=p105)
states: 1
abstracting: (p105<=1)
states: 4,037 (3)
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AF [~ [E [[[p82<=1 & 1<=p82] & [p127<=1 & 1<=p127]] U [EF [[[p35<=1 & 1<=p35] & [p127<=1 & 1<=p127]]] | [~ [EG [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]] | AG [~ [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]]]]]]
normalized: ~ [EG [E [[[p127<=1 & 1<=p127] & [p82<=1 & 1<=p82]] U [[~ [E [true U [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]] | ~ [EG [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]]] | E [true U [[p127<=1 & 1<=p127] & [p35<=1 & 1<=p35]]]]]]]

abstracting: (1<=p35)
states: 125
abstracting: (p35<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p82)
states: 1
abstracting: (p82<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: [AF [[[[AG [[p87<=1 & 1<=p87]] & [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]] | [p66<=1 & 1<=p66]]] | AX [[p117<=1 & 1<=p117]]] & AG [[[p92<=1 & 1<=p92] | [p87<=1 & 1<=p87]]]]] & AX [EF [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]]
normalized: [~ [EX [~ [E [true U [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]]]] & ~ [EG [~ [[~ [E [true U ~ [[[p87<=1 & 1<=p87] | [p92<=1 & 1<=p92]]]]] & [~ [EX [~ [[p117<=1 & 1<=p117]]]] | [[[p66<=1 & 1<=p66] | [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]] & ~ [E [true U ~ [[p87<=1 & 1<=p87]]]]]]]]]]]

abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p66)
states: 125
abstracting: (p66<=1)
states: 4,037 (3)
abstracting: (1<=p117)
states: 1
abstracting: (p117<=1)
states: 4,037 (3)
.abstracting: (1<=p92)
states: 441
abstracting: (p92<=1)
states: 4,037 (3)
abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 4,037 (3)

EG iterations: 0
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
.-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: A [~ [[~ [[[[p4<=1 & 1<=p4] & [p127<=1 & 1<=p127]] | EX [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]] & ~ [[AG [[p1<=1 & 1<=p1]] & EF [[p96<=1 & 1<=p96]]]]]] U AF [~ [E [~ [E [[[p101<=1 & 1<=p101] & [p127<=1 & 1<=p127]] U [p117<=1 & 1<=p117]]] U E [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]] U [[p23<=1 & 1<=p23] & [p127<=1 & 1<=p127]]]]]]]
normalized: [~ [EG [EG [E [~ [E [[[p127<=1 & 1<=p127] & [p101<=1 & 1<=p101]] U [p117<=1 & 1<=p117]]] U E [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]] U [[p127<=1 & 1<=p127] & [p23<=1 & 1<=p23]]]]]]] & ~ [E [EG [E [~ [E [[[p127<=1 & 1<=p127] & [p101<=1 & 1<=p101]] U [p117<=1 & 1<=p117]]] U E [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]] U [[p127<=1 & 1<=p127] & [p23<=1 & 1<=p23]]]]] U [[~ [[E [true U [p96<=1 & 1<=p96]] & ~ [E [true U ~ [[p1<=1 & 1<=p1]]]]]] & ~ [[EX [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]] | [[p127<=1 & 1<=p127] & [p4<=1 & 1<=p4]]]]] & EG [E [~ [E [[[p127<=1 & 1<=p127] & [p101<=1 & 1<=p101]] U [p117<=1 & 1<=p117]]] U E [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]] U [[p127<=1 & 1<=p127] & [p23<=1 & 1<=p23]]]]]]]]]

abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p117)
states: 1
abstracting: (p117<=1)
states: 4,037 (3)
abstracting: (1<=p101)
states: 64
abstracting: (p101<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
.
EG iterations: 1
abstracting: (1<=p4)
states: 125
abstracting: (p4<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
.abstracting: (1<=p1)
states: 125
abstracting: (p1<=1)
states: 4,037 (3)
abstracting: (1<=p96)
states: 125
abstracting: (p96<=1)
states: 4,037 (3)
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p117)
states: 1
abstracting: (p117<=1)
states: 4,037 (3)
abstracting: (1<=p101)
states: 64
abstracting: (p101<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
.
EG iterations: 1
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p117)
states: 1
abstracting: (p117<=1)
states: 4,037 (3)
abstracting: (1<=p101)
states: 64
abstracting: (p101<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.170sec

checking: A [E [AG [[EG [[p110<=1 & 1<=p110]] | [[A [[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]] U [[p70<=1 & 1<=p70] & [p127<=1 & 1<=p127]]] & [p25<=1 & 1<=p25]] & [[p57<=1 & 1<=p57] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]]]]] U ~ [[[[[p25<=1 & 1<=p25] & [p57<=1 & 1<=p57]] & [[p88<=1 & 1<=p88] & [p118<=1 & 1<=p118]]] | [p56<=1 & 1<=p56]]]] U ~ [[AX [AG [[p87<=1 & 1<=p87]]] | AX [~ [[p81<=1 & 1<=p81]]]]]]
normalized: [~ [EG [[~ [EX [[p81<=1 & 1<=p81]]] | ~ [EX [E [true U ~ [[p87<=1 & 1<=p87]]]]]]]] & ~ [E [[~ [EX [[p81<=1 & 1<=p81]]] | ~ [EX [E [true U ~ [[p87<=1 & 1<=p87]]]]]] U [~ [E [~ [E [true U ~ [[[[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [p57<=1 & 1<=p57]] & [[p25<=1 & 1<=p25] & [~ [EG [~ [[[p127<=1 & 1<=p127] & [p70<=1 & 1<=p70]]]]] & ~ [E [~ [[[p127<=1 & 1<=p127] & [p70<=1 & 1<=p70]]] U [~ [[[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]] & ~ [[[p127<=1 & 1<=p127] & [p70<=1 & 1<=p70]]]]]]]]] | EG [[p110<=1 & 1<=p110]]]]]] U ~ [[[p56<=1 & 1<=p56] | [[[p118<=1 & 1<=p118] & [p88<=1 & 1<=p88]] & [[p57<=1 & 1<=p57] & [p25<=1 & 1<=p25]]]]]]] & [~ [EX [[p81<=1 & 1<=p81]]] | ~ [EX [E [true U ~ [[p87<=1 & 1<=p87]]]]]]]]]]

abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 4,037 (3)
.abstracting: (1<=p81)
states: 1
abstracting: (p81<=1)
states: 4,037 (3)
.abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p56)
states: 1
abstracting: (p56<=1)
states: 4,037 (3)
abstracting: (1<=p110)
states: 1
abstracting: (p110<=1)
states: 4,037 (3)
..
EG iterations: 2
abstracting: (1<=p70)
states: 64
abstracting: (p70<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p70)
states: 64
abstracting: (p70<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
abstracting: (1<=p70)
states: 64
abstracting: (p70<=1)
states: 4,037 (3)
abstracting: (1<=p127)
states: 4,036 (3)
abstracting: (p127<=1)
states: 4,037 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 681
abstracting: (p25<=1)
states: 4,037 (3)
abstracting: (1<=p57)
states: 679
abstracting: (p57<=1)
states: 4,037 (3)
abstracting: (1<=p88)
states: 681
abstracting: (p88<=1)
states: 4,037 (3)
abstracting: (1<=p118)
states: 583
abstracting: (p118<=1)
states: 4,037 (3)
abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 4,037 (3)
.abstracting: (1<=p81)
states: 1
abstracting: (p81<=1)
states: 4,037 (3)
.abstracting: (1<=p87)
states: 1
abstracting: (p87<=1)
states: 4,037 (3)
.abstracting: (1<=p81)
states: 1
abstracting: (p81<=1)
states: 4,037 (3)
..
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyCommit-PT-03a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

totally nodes used: 723012 (7.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1274072 4706392 5980464
used/not used/entry size/cache size: 5173852 61935012 16 1024MB
basic ops cache: hits/miss/sum: 131781 368248 500029
used/not used/entry size/cache size: 596903 16180313 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: 1607 6757 8364
used/not used/entry size/cache size: 6753 8381855 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 66468601
1 569645
2 60055
3 9168
4 1239
5 140
6 15
7 1
8 0
9 0
>= 10 0

Total processing time: 0m 7.555sec


BK_STOP 1679444002088

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:6430 (32), effective:164 (0)

initing FirstDep: 0m 0.000sec


iterations count:5054 (25), effective:121 (0)

iterations count:5359 (26), effective:122 (0)

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

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

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

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

iterations count:292 (1), effective:3 (0)

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

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

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

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

iterations count:3536 (17), effective:90 (0)

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

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

iterations count:3536 (17), effective:90 (0)

iterations count:4984 (24), effective:121 (0)

iterations count:5050 (25), effective:121 (0)

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

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

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

iterations count:5050 (25), effective:121 (0)

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

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

iterations count:5124 (25), effective:120 (0)

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

iterations count:5036 (25), effective:121 (0)

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

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

iterations count:5124 (25), effective:120 (0)

iterations count:2885 (14), effective:37 (0)

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

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

iterations count:5124 (25), effective:120 (0)

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

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

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

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

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

iterations count:5046 (25), effective:119 (0)

iterations count:201 (1), effective:1 (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="StigmergyCommit-PT-03a"
export BK_EXAMINATION="CTLFireability"
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 StigmergyCommit-PT-03a, examination is CTLFireability"
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-167912650200410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03a.tgz
mv StigmergyCommit-PT-03a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;