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

About the Execution of Marcie+red for MultiwaySync-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10057.831 3600000.00 3629840.00 8538.00 FFFTFFFFFTTTTT?T 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.r266-smll-167863540300001.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 MultiwaySync-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540300001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.4K Feb 25 22:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 22:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 22:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 22:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 111K Mar 5 18:22 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 MultiwaySync-PT-none-CTLCardinality-00
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-01
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-02
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-03
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-04
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-05
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-06
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-07
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-08
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-09
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-10
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-11
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-12
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-13
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-14
FORMULA_NAME MultiwaySync-PT-none-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678726557763

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=MultiwaySync-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:56:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:56:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:56:00] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-13 16:56:00] [INFO ] Transformed 222 places.
[2023-03-13 16:56:00] [INFO ] Transformed 472 transitions.
[2023-03-13 16:56:00] [INFO ] Found NUPN structural information;
[2023-03-13 16:56:01] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
Support contains 96 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 218 transition count 385
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 218 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 218 transition count 383
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 216 transition count 377
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 216 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 216 transition count 376
Applied a total of 15 rules in 48 ms. Remains 216 /222 variables (removed 6) and now considering 376/389 (removed 13) transitions.
[2023-03-13 16:56:01] [INFO ] Flow matrix only has 371 transitions (discarded 5 similar events)
// Phase 1: matrix 371 rows 216 cols
[2023-03-13 16:56:01] [INFO ] Computed 25 place invariants in 24 ms
[2023-03-13 16:56:01] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-13 16:56:01] [INFO ] Flow matrix only has 371 transitions (discarded 5 similar events)
[2023-03-13 16:56:01] [INFO ] Invariant cache hit.
[2023-03-13 16:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 16:56:02] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2023-03-13 16:56:02] [INFO ] Flow matrix only has 371 transitions (discarded 5 similar events)
[2023-03-13 16:56:02] [INFO ] Invariant cache hit.
[2023-03-13 16:56:02] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/222 places, 376/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 216/222 places, 376/389 transitions.
Support contains 96 out of 216 places after structural reductions.
[2023-03-13 16:56:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 16:56:03] [INFO ] Flatten gal took : 130 ms
FORMULA MultiwaySync-PT-none-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:56:03] [INFO ] Flatten gal took : 64 ms
[2023-03-13 16:56:03] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 78 out of 216 places (down from 96) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1015 ms. (steps per millisecond=9 ) properties (out of 50) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-13 16:56:04] [INFO ] Flow matrix only has 371 transitions (discarded 5 similar events)
[2023-03-13 16:56:04] [INFO ] Invariant cache hit.
[2023-03-13 16:56:04] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:56:05] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-13 16:56:05] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:56:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 16:56:05] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 16:56:05] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 8 ms to minimize.
[2023-03-13 16:56:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-13 16:56:05] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-13 16:56:05] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 376/376 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 216 transition count 375
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 215 transition count 375
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 605 edges and 215 vertex of which 94 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.2 ms
Discarding 121 places :
Also discarding 123 output transitions
Drop transitions removed 123 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 94 transition count 244
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 92 place count 92 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 92 place count 92 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 91 transition count 164
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 87 transition count 160
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 87 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 87 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 85 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 85 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 85 transition count 151
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 121 place count 79 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 78 transition count 152
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 4 with 37 rules applied. Total rules applied 160 place count 78 transition count 115
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 160 place count 78 transition count 112
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 166 place count 75 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 74 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 74 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 168 place count 74 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 73 transition count 110
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 171 place count 73 transition count 109
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 189 place count 64 transition count 100
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 197 place count 64 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 198 place count 63 transition count 92
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 200 place count 61 transition count 90
Iterating global reduction 7 with 2 rules applied. Total rules applied 202 place count 61 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 210 place count 57 transition count 86
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 211 place count 56 transition count 79
Iterating global reduction 7 with 1 rules applied. Total rules applied 212 place count 56 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 214 place count 55 transition count 83
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 215 place count 55 transition count 82
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 218 place count 55 transition count 79
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 220 place count 55 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 222 place count 53 transition count 77
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 224 place count 53 transition count 77
Applied a total of 224 rules in 298 ms. Remains 53 /216 variables (removed 163) and now considering 77/376 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 53/216 places, 77/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 53 cols
[2023-03-13 16:56:06] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 16:56:06] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:56:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:56:06] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:56:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-13 16:56:06] [INFO ] After 8ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:56:06] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 16:56:06] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 77/77 transitions.
Graph (complete) has 165 edges and 53 vertex of which 23 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 23 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 22 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 9 edges and 21 vertex of which 4 / 21 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 18 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 30 place count 17 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 16 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 16 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 16 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 15 edges and 14 vertex of which 12 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 37 place count 3 transition count 17
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 51 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 51 place count 3 transition count 2
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 53 place count 2 transition count 2
Applied a total of 53 rules in 14 ms. Remains 2 /53 variables (removed 51) and now considering 2/77 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 2/53 places, 2/77 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
[2023-03-13 16:56:06] [INFO ] Flatten gal took : 34 ms
[2023-03-13 16:56:06] [INFO ] Flatten gal took : 32 ms
[2023-03-13 16:56:06] [INFO ] Input system was already deterministic with 376 transitions.
Computed a total of 11 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 369
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 209 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 206 transition count 357
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 206 transition count 357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 206 transition count 354
Applied a total of 26 rules in 31 ms. Remains 206 /216 variables (removed 10) and now considering 354/376 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 206/216 places, 354/376 transitions.
[2023-03-13 16:56:06] [INFO ] Flatten gal took : 34 ms
[2023-03-13 16:56:06] [INFO ] Flatten gal took : 40 ms
[2023-03-13 16:56:06] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 369
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 209 transition count 366
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 205 transition count 354
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 205 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 205 transition count 351
Applied a total of 28 rules in 17 ms. Remains 205 /216 variables (removed 11) and now considering 351/376 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 205/216 places, 351/376 transitions.
[2023-03-13 16:56:06] [INFO ] Flatten gal took : 32 ms
[2023-03-13 16:56:06] [INFO ] Flatten gal took : 36 ms
[2023-03-13 16:56:06] [INFO ] Input system was already deterministic with 351 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 208 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 205 transition count 355
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 205 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 205 transition count 352
Applied a total of 29 rules in 15 ms. Remains 205 /216 variables (removed 11) and now considering 352/376 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 205/216 places, 352/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 27 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 28 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 352 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 211 transition count 371
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 211 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 211 transition count 368
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 209 transition count 362
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 209 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 209 transition count 361
Applied a total of 18 rules in 11 ms. Remains 209 /216 variables (removed 7) and now considering 361/376 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 209/216 places, 361/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 18 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 19 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 208 transition count 364
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 204 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 204 transition count 349
Applied a total of 31 rules in 10 ms. Remains 204 /216 variables (removed 12) and now considering 349/376 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 204/216 places, 349/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 17 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 18 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 370
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 210 transition count 367
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 207 transition count 358
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 207 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 207 transition count 356
Applied a total of 23 rules in 10 ms. Remains 207 /216 variables (removed 9) and now considering 356/376 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 207/216 places, 356/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 16 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 17 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 215 transition count 373
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 212 transition count 373
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 214 edges and 212 vertex of which 112 / 212 are part of one of the 32 SCC in 0 ms
Free SCC test removed 80 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 80 rules applied. Total rules applied 85 place count 132 transition count 294
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 237 place count 101 transition count 173
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 253 place count 85 transition count 145
Iterating global reduction 2 with 16 rules applied. Total rules applied 269 place count 85 transition count 145
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 279 place count 75 transition count 114
Iterating global reduction 2 with 10 rules applied. Total rules applied 289 place count 75 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 298 place count 75 transition count 105
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 320 place count 64 transition count 94
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 64 transition count 82
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 344 place count 58 transition count 76
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 350 place count 52 transition count 57
Iterating global reduction 3 with 6 rules applied. Total rules applied 356 place count 52 transition count 57
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 361 place count 52 transition count 52
Applied a total of 361 rules in 38 ms. Remains 52 /216 variables (removed 164) and now considering 52/376 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 52/216 places, 52/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 208 transition count 364
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 204 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 204 transition count 349
Applied a total of 31 rules in 15 ms. Remains 204 /216 variables (removed 12) and now considering 349/376 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 204/216 places, 349/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 15 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 16 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 208 transition count 364
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 204 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 204 transition count 349
Applied a total of 31 rules in 11 ms. Remains 204 /216 variables (removed 12) and now considering 349/376 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 204/216 places, 349/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 15 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 17 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 215 transition count 373
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 212 transition count 373
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 209 edges and 212 vertex of which 106 / 212 are part of one of the 31 SCC in 1 ms
Free SCC test removed 75 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 81 rules applied. Total rules applied 86 place count 137 transition count 293
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 145 rules applied. Total rules applied 231 place count 106 transition count 179
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 235 place count 104 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 235 place count 104 transition count 176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 103 transition count 176
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 253 place count 87 transition count 148
Iterating global reduction 3 with 16 rules applied. Total rules applied 269 place count 87 transition count 148
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 279 place count 77 transition count 117
Iterating global reduction 3 with 10 rules applied. Total rules applied 289 place count 77 transition count 117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 297 place count 77 transition count 109
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 319 place count 66 transition count 98
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 332 place count 66 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 344 place count 60 transition count 79
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 350 place count 54 transition count 60
Iterating global reduction 4 with 6 rules applied. Total rules applied 356 place count 54 transition count 60
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 362 place count 54 transition count 54
Applied a total of 362 rules in 54 ms. Remains 54 /216 variables (removed 162) and now considering 54/376 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 54/216 places, 54/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 208 transition count 364
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 204 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 204 transition count 349
Applied a total of 31 rules in 15 ms. Remains 204 /216 variables (removed 12) and now considering 349/376 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 204/216 places, 349/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 22 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 26 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 208 transition count 364
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 204 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 204 transition count 349
Applied a total of 31 rules in 16 ms. Remains 204 /216 variables (removed 12) and now considering 349/376 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 204/216 places, 349/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 23 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 25 ms
[2023-03-13 16:56:07] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 369
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 209 transition count 365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 206 transition count 356
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 206 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 206 transition count 354
Applied a total of 26 rules in 14 ms. Remains 206 /216 variables (removed 10) and now considering 354/376 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 206/216 places, 354/376 transitions.
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 22 ms
[2023-03-13 16:56:07] [INFO ] Flatten gal took : 22 ms
[2023-03-13 16:56:08] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 376/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 370
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 370
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 210 transition count 366
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 208 transition count 360
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 208 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 208 transition count 359
Applied a total of 21 rules in 9 ms. Remains 208 /216 variables (removed 8) and now considering 359/376 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 208/216 places, 359/376 transitions.
[2023-03-13 16:56:08] [INFO ] Flatten gal took : 14 ms
[2023-03-13 16:56:08] [INFO ] Flatten gal took : 15 ms
[2023-03-13 16:56:08] [INFO ] Input system was already deterministic with 359 transitions.
[2023-03-13 16:56:08] [INFO ] Flatten gal took : 16 ms
[2023-03-13 16:56:08] [INFO ] Flatten gal took : 16 ms
[2023-03-13 16:56:08] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 16:56:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 216 places, 376 transitions and 1246 arcs took 3 ms.
Total runtime 7438 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: 216 NrTr: 376 NrArc: 1246)

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

net check time: 0m 0.000sec

init dd package: 0m 3.778sec


RS generation: 0m28.777sec


-> reachability set: #nodes 118324 (1.2e+05) #states 37,928,329,501,087,872,001 (19)



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

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

abstracting: (1<=p181)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p181<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA MultiwaySync-PT-none-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.079sec

checking: AF [AG [[p64<=0 & 0<=p64]]]
normalized: ~ [EG [E [true U ~ [[p64<=0 & 0<=p64]]]]]

abstracting: (0<=p64)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p64<=0)
states: 35,399,774,201,015,347,201 (19)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49.347sec

checking: EF [EG [AF [[[p193<=0 & 0<=p193] | [p14<=1 & 1<=p14]]]]]
normalized: E [true U EG [~ [EG [~ [[[p14<=1 & 1<=p14] | [p193<=0 & 0<=p193]]]]]]]

abstracting: (0<=p193)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p193<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p14)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p14<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.218sec

checking: AG [AX [[EF [[p67<=0 & 0<=p67]] | [[p152<=0 & 0<=p152] & [p53<=1 & 1<=p53]]]]]
normalized: ~ [E [true U EX [~ [[[[p53<=1 & 1<=p53] & [p152<=0 & 0<=p152]] | E [true U [p67<=0 & 0<=p67]]]]]]]

abstracting: (0<=p67)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p67<=0)
states: 37,085,477,734,397,030,401 (19)
abstracting: (0<=p152)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p152<=0)
states: 30,539,693,883,992,832,001 (19)
abstracting: (1<=p53)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p53<=1)
states: 37,928,329,501,087,872,001 (19)
.-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.038sec

checking: AF [[AX [1<=0] & A [AG [~ [[[p207<=1 & 1<=p207] | [p196<=1 & 1<=p196]]]] U ~ [AG [[[p13<=1 & 1<=p13] & [p204<=0 & 0<=p204]]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [E [true U ~ [[[p204<=0 & 0<=p204] & [p13<=1 & 1<=p13]]]]]]] & ~ [E [~ [E [true U ~ [[[p204<=0 & 0<=p204] & [p13<=1 & 1<=p13]]]]] U [E [true U [[p196<=1 & 1<=p196] | [p207<=1 & 1<=p207]]] & ~ [E [true U ~ [[[p204<=0 & 0<=p204] & [p13<=1 & 1<=p13]]]]]]]]] & ~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p13)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p13<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p204)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p204<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p207)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p207<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p196)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p196<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p13)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p13<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p204)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p204<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p13)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p13<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p204)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p204<=0)
states: 25,285,553,000,725,248,001 (19)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.863sec

checking: EF [[AG [[~ [[p28<=0 & 0<=p28]] | ~ [[p139<=1 & 1<=p139]]]] & A [EX [[p163<=1 & 1<=p163]] U EG [[[p52<=0 & 0<=p52] | [p197<=1 & 1<=p197]]]]]]
normalized: E [true U [[~ [EG [~ [EG [[[p197<=1 & 1<=p197] | [p52<=0 & 0<=p52]]]]]] & ~ [E [~ [EG [[[p197<=1 & 1<=p197] | [p52<=0 & 0<=p52]]]] U [~ [EX [[p163<=1 & 1<=p163]]] & ~ [EG [[[p197<=1 & 1<=p197] | [p52<=0 & 0<=p52]]]]]]]] & ~ [E [true U ~ [[~ [[p139<=1 & 1<=p139]] | ~ [[p28<=0 & 0<=p28]]]]]]]]

abstracting: (0<=p28)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p28<=0)
states: 32,239,080,075,924,691,201 (19)
abstracting: (1<=p139)
states: 882,054,174,443,904,000 (17)
abstracting: (p139<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p52)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p52<=0)
states: 35,715,843,613,524,412,801 (19)
abstracting: (1<=p197)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p197<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (1<=p163)
states: 985,151,415,612,672,000 (17)
abstracting: (p163<=1)
states: 37,928,329,501,087,872,001 (19)
.abstracting: (0<=p52)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p52<=0)
states: 35,715,843,613,524,412,801 (19)
abstracting: (1<=p197)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p197<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (0<=p52)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p52<=0)
states: 35,715,843,613,524,412,801 (19)
abstracting: (1<=p197)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p197<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m44.960sec

checking: AF [[EX [EG [~ [[p185<=1 & 1<=p185]]]] & [EF [[[p170<=0 & 0<=p170] | [p135<=1 & 1<=p135]]] & [[p65<=0 & 0<=p65] | EF [EG [[[p29<=0 & 0<=p29] | [p107<=1 & 1<=p107]]]]]]]]
normalized: ~ [EG [~ [[[[E [true U EG [[[p107<=1 & 1<=p107] | [p29<=0 & 0<=p29]]]] | [p65<=0 & 0<=p65]] & E [true U [[p135<=1 & 1<=p135] | [p170<=0 & 0<=p170]]]] & EX [EG [~ [[p185<=1 & 1<=p185]]]]]]]]

abstracting: (1<=p185)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p185<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
.abstracting: (0<=p170)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p170<=0)
states: 35,465,450,962,056,192,001 (19)
abstracting: (1<=p135)
states: 2,205,135,436,109,760,000 (18)
abstracting: (p135<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p65)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p65<=0)
states: 35,399,774,201,015,347,201 (19)
abstracting: (0<=p29)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p29<=0)
states: 32,239,080,075,924,691,201 (19)
abstracting: (1<=p107)
states: 1,231,439,269,515,840,000 (18)
abstracting: (p107<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1

before gc: list nodes free: 1162673

after gc: idd nodes used:1608693, unused:62391307; list nodes free:278049216
...
before gc: list nodes free: 1852444

after gc: idd nodes used:2834524, unused:61165476; list nodes free:274606614
.
before gc: list nodes free: 2788286

after gc: idd nodes used:3392298, unused:60607702; list nodes free:272110780
.
before gc: list nodes free: 1536630

after gc: idd nodes used:3591497, unused:60408503; list nodes free:271469614

before gc: list nodes free: 4939626

after gc: idd nodes used:4297959, unused:59702041; list nodes free:267770029
MC time: 6m56.005sec

checking: EX [AG [[EG [AX [[p142<=1 & 1<=p142]]] & [A [[[p194<=0 & 0<=p194] | [p23<=1 & 1<=p23]] U [p41<=1 & 1<=p41]] & [EX [[p99<=1 & 1<=p99]] | [[p89<=1 & 1<=p89] & [[p18<=0 & 0<=p18] | [p184<=1 & 1<=p184]]]]]]]]
normalized: EX [~ [E [true U ~ [[[[[[[p184<=1 & 1<=p184] | [p18<=0 & 0<=p18]] & [p89<=1 & 1<=p89]] | EX [[p99<=1 & 1<=p99]]] & [~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [~ [[[p23<=1 & 1<=p23] | [p194<=0 & 0<=p194]]] & ~ [[p41<=1 & 1<=p41]]]]]]] & EG [~ [EX [~ [[p142<=1 & 1<=p142]]]]]]]]]]

abstracting: (1<=p142)
states: 1,323,081,261,665,856,000 (18)
abstracting: (p142<=1)
states: 37,928,329,501,087,872,001 (19)
..
EG iterations: 1
abstracting: (1<=p41)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p41<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p194)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p194<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p23)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p23<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p41)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p41<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p41)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p41<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (1<=p99)
states: 2,216,590,685,128,512,000 (18)
abstracting: (p99<=1)
states: 37,928,329,501,087,872,001 (19)
.abstracting: (1<=p89)
states: 1,970,302,831,225,344,000 (18)
abstracting: (p89<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p18)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p18<=0)
states: 36,980,121,263,560,675,201 (19)
abstracting: (1<=p184)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p184<=1)
states: 37,928,329,501,087,872,001 (19)
.-> the formula is FALSE

FORMULA MultiwaySync-PT-none-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.421sec

checking: EG [[EX [[p66<=0 & 0<=p66]] & [[[p70<=1 & 1<=p70] | [p64<=0 & 0<=p64]] | [[p189<=1 & 1<=p189] | [EF [[p67<=1 & 1<=p67]] & [EG [[[p8<=0 & 0<=p8] | [p176<=1 & 1<=p176]]] | [p37<=0 & 0<=p37]]]]]]]
normalized: EG [[[[[[[p37<=0 & 0<=p37] | EG [[[p176<=1 & 1<=p176] | [p8<=0 & 0<=p8]]]] & E [true U [p67<=1 & 1<=p67]]] | [p189<=1 & 1<=p189]] | [[p64<=0 & 0<=p64] | [p70<=1 & 1<=p70]]] & EX [[p66<=0 & 0<=p66]]]]

abstracting: (0<=p66)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p66<=0)
states: 37,085,477,734,397,030,401 (19)
.abstracting: (1<=p70)
states: 842,851,766,690,841,600 (17)
abstracting: (p70<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p64)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p64<=0)
states: 35,399,774,201,015,347,201 (19)
abstracting: (1<=p189)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p189<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p67)
states: 842,851,766,690,841,600 (17)
abstracting: (p67<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p8)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p8<=0)
states: 35,715,843,613,524,412,801 (19)
abstracting: (1<=p176)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p176<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (0<=p37)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p37<=0)
states: 36,664,051,851,051,609,601 (19)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.196sec

checking: [AG [[[p64<=1 & 1<=p64] & EX [AF [[[p114<=1 & 1<=p114] & [p89<=1 & 1<=p89]]]]]] | AF [[[[[p148<=0 & 0<=p148] | [p10<=1 & 1<=p10]] & [~ [[p113<=0 & 0<=p113]] & ~ [[p38<=1 & 1<=p38]]]] & [~ [[p209<=0 & 0<=p209]] & [~ [[p66<=1 & 1<=p66]] & [p53<=1 & 1<=p53]]]]]]
normalized: [~ [EG [~ [[[[[p53<=1 & 1<=p53] & ~ [[p66<=1 & 1<=p66]]] & ~ [[p209<=0 & 0<=p209]]] & [[~ [[p38<=1 & 1<=p38]] & ~ [[p113<=0 & 0<=p113]]] & [[p10<=1 & 1<=p10] | [p148<=0 & 0<=p148]]]]]]] | ~ [E [true U ~ [[EX [~ [EG [~ [[[p89<=1 & 1<=p89] & [p114<=1 & 1<=p114]]]]]] & [p64<=1 & 1<=p64]]]]]]

abstracting: (1<=p64)
states: 2,528,555,300,072,524,800 (18)
abstracting: (p64<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p114)
states: 2,646,162,523,331,712,000 (18)
abstracting: (p114<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p89)
states: 1,970,302,831,225,344,000 (18)
abstracting: (p89<=1)
states: 37,928,329,501,087,872,001 (19)

before gc: list nodes free: 150341

after gc: idd nodes used:2533063, unused:61466937; list nodes free:276040008
.
EG iterations: 1
.abstracting: (0<=p148)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p148<=0)
states: 35,723,194,064,978,112,001 (19)
abstracting: (1<=p10)
states: 1,264,277,650,036,262,400 (18)
abstracting: (p10<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p113)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p113<=0)
states: 35,711,738,815,959,360,001 (19)
abstracting: (1<=p38)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p38<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p209)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p209<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p66)
states: 842,851,766,690,841,600 (17)
abstracting: (p66<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p53)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p53<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MultiwaySync-PT-none-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m49.782sec

checking: EX [[[EF [[[AG [[[p44<=1 & 1<=p44] | [p36<=0 & 0<=p36]]] | [[p191<=0 & 0<=p191] & [p7<=1 & 1<=p7]]] & [[p166<=1 & 1<=p166] | [p4<=0 & 0<=p4]]]] | EG [[[p67<=0 & 0<=p67] | AF [[[p137<=0 & 0<=p137] | [p67<=1 & 1<=p67]]]]]] & AF [[p133<=1 & 1<=p133]]]]
normalized: EX [[~ [EG [~ [[p133<=1 & 1<=p133]]]] & [EG [[~ [EG [~ [[[p67<=1 & 1<=p67] | [p137<=0 & 0<=p137]]]]] | [p67<=0 & 0<=p67]]] | E [true U [[[p4<=0 & 0<=p4] | [p166<=1 & 1<=p166]] & [[[p7<=1 & 1<=p7] & [p191<=0 & 0<=p191]] | ~ [E [true U ~ [[[p36<=0 & 0<=p36] | [p44<=1 & 1<=p44]]]]]]]]]]]

abstracting: (1<=p44)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p44<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p36)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p36<=0)
states: 36,664,051,851,051,609,601 (19)
abstracting: (0<=p191)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p191<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p7)
states: 5,057,110,600,145,049,600 (18)
abstracting: (p7<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p166)
states: 985,151,415,612,672,000 (17)
abstracting: (p166<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p4)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p4<=0)
states: 32,239,080,075,924,691,201 (19)
abstracting: (0<=p67)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p67<=0)
states: 37,085,477,734,397,030,401 (19)
abstracting: (0<=p137)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p137<=0)
states: 35,723,194,064,978,112,001 (19)
abstracting: (1<=p67)
states: 842,851,766,690,841,600 (17)
abstracting: (p67<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p133)
states: 2,205,135,436,109,760,000 (18)
abstracting: (p133<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA MultiwaySync-PT-none-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m46.178sec

checking: EF [AX [[[AF [[p141<=1 & 1<=p141]] & [EX [[p31<=1 & 1<=p31]] & AG [AF [[[p37<=0 & 0<=p37] | [p71<=1 & 1<=p71]]]]]] & [[[p81<=0 & 0<=p81] | [p93<=1 & 1<=p93]] & [[[p17<=0 & 0<=p17] | [p115<=1 & 1<=p115]] & [[p0<=0 & 0<=p0] | [p160<=1 & 1<=p160]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[p160<=1 & 1<=p160] | [p0<=0 & 0<=p0]] & [[p115<=1 & 1<=p115] | [p17<=0 & 0<=p17]]] & [[p93<=1 & 1<=p93] | [p81<=0 & 0<=p81]]] & [[~ [E [true U EG [~ [[[p71<=1 & 1<=p71] | [p37<=0 & 0<=p37]]]]]] & EX [[p31<=1 & 1<=p31]]] & ~ [EG [~ [[p141<=1 & 1<=p141]]]]]]]]]]

abstracting: (1<=p141)
states: 2,205,135,436,109,760,000 (18)
abstracting: (p141<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (1<=p31)
states: 5,689,249,425,163,180,800 (18)
abstracting: (p31<=1)
states: 37,928,329,501,087,872,001 (19)
.abstracting: (0<=p37)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p37<=0)
states: 36,664,051,851,051,609,601 (19)
abstracting: (1<=p71)
states: 2,528,555,300,072,524,800 (18)
abstracting: (p71<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (0<=p81)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p81<=0)
states: 35,711,738,815,959,360,001 (19)
abstracting: (1<=p93)
states: 1,970,302,831,225,344,000 (18)
abstracting: (p93<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p17)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p17<=0)
states: 35,715,843,613,524,412,801 (19)
abstracting: (1<=p115)
states: 2,646,162,523,331,712,000 (18)
abstracting: (p115<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p0)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p0<=0)
states: 37,928,329,501,087,872,000 (19)
abstracting: (1<=p160)
states: 2,462,878,539,031,680,000 (18)
abstracting: (p160<=1)
states: 37,928,329,501,087,872,001 (19)
.-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m42.926sec

checking: EF [AX [[[[p215<=0 & 0<=p215] & [p176<=1 & 1<=p176]] & [[p6<=0 & 0<=p6] & [[[p69<=0 & 0<=p69] | [[p44<=1 & 1<=p44] | [p186<=1 & 1<=p186]]] | [EG [[[p90<=0 & 0<=p90] | [p197<=1 & 1<=p197]]] | [[[p194<=0 & 0<=p194] & [p54<=1 & 1<=p54]] | [AF [[p116<=0 & 0<=p116]] & AX [[p183<=1 & 1<=p183]]]]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[[~ [EX [~ [[p183<=1 & 1<=p183]]]] & ~ [EG [~ [[p116<=0 & 0<=p116]]]]] | [[p54<=1 & 1<=p54] & [p194<=0 & 0<=p194]]] | EG [[[p197<=1 & 1<=p197] | [p90<=0 & 0<=p90]]]] | [[[p186<=1 & 1<=p186] | [p44<=1 & 1<=p44]] | [p69<=0 & 0<=p69]]] & [p6<=0 & 0<=p6]] & [[p176<=1 & 1<=p176] & [p215<=0 & 0<=p215]]]]]]]

abstracting: (0<=p215)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p215<=0)
states: 18,964,164,750,543,936,001 (19)
abstracting: (1<=p176)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p176<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p6)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p6<=0)
states: 32,239,080,075,924,691,201 (19)
abstracting: (0<=p69)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p69<=0)
states: 37,085,477,734,397,030,401 (19)
abstracting: (1<=p44)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p44<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p186)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p186<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p90)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p90<=0)
states: 35,711,738,815,959,360,001 (19)
abstracting: (1<=p197)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p197<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (0<=p194)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p194<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p54)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p54<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p116)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p116<=0)
states: 35,576,185,035,904,128,001 (19)
.
EG iterations: 1
abstracting: (1<=p183)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p183<=1)
states: 37,928,329,501,087,872,001 (19)
..
before gc: list nodes free: 4726589

after gc: idd nodes used:3816051, unused:60183949; list nodes free:270270752
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m59.290sec

checking: [AG [[[AF [[[p176<=0 & 0<=p176] | [p133<=1 & 1<=p133]]] | E [[[p152<=0 & 0<=p152] | [p63<=1 & 1<=p63]] U [p111<=0 & 0<=p111]]] | [[p54<=1 & 1<=p54] | [[p151<=0 & 0<=p151] | [p4<=1 & 1<=p4]]]]] | E [[~ [EG [[[[p142<=0 & 0<=p142] | [[p96<=1 & 1<=p96] | [p203<=1 & 1<=p203]]] & ~ [[p118<=1 & 1<=p118]]]]] & AX [[EG [[p205<=1 & 1<=p205]] | [p83<=0 & 0<=p83]]]] U EX [[AG [[[p211<=0 & 0<=p211] | [p42<=1 & 1<=p42]]] | [~ [[p63<=1 & 1<=p63]] & ~ [[[p180<=0 & 0<=p180] | [p38<=0 & 0<=p38]]]]]]]]
normalized: [E [[~ [EX [~ [[[p83<=0 & 0<=p83] | EG [[p205<=1 & 1<=p205]]]]]] & ~ [EG [[~ [[p118<=1 & 1<=p118]] & [[[p203<=1 & 1<=p203] | [p96<=1 & 1<=p96]] | [p142<=0 & 0<=p142]]]]]] U EX [[[~ [[[p38<=0 & 0<=p38] | [p180<=0 & 0<=p180]]] & ~ [[p63<=1 & 1<=p63]]] | ~ [E [true U ~ [[[p42<=1 & 1<=p42] | [p211<=0 & 0<=p211]]]]]]]] | ~ [E [true U ~ [[[[[p4<=1 & 1<=p4] | [p151<=0 & 0<=p151]] | [p54<=1 & 1<=p54]] | [E [[[p63<=1 & 1<=p63] | [p152<=0 & 0<=p152]] U [p111<=0 & 0<=p111]] | ~ [EG [~ [[[p133<=1 & 1<=p133] | [p176<=0 & 0<=p176]]]]]]]]]]]

abstracting: (0<=p176)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p176<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p133)
states: 2,205,135,436,109,760,000 (18)
abstracting: (p133<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (0<=p111)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p111<=0)
states: 35,711,738,815,959,360,001 (19)
abstracting: (0<=p152)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p152<=0)
states: 30,539,693,883,992,832,001 (19)
abstracting: (1<=p63)
states: 2,528,555,300,072,524,800 (18)
abstracting: (p63<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p54)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p54<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p151)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p151<=0)
states: 29,554,542,468,380,160,001 (19)
abstracting: (1<=p4)
states: 5,689,249,425,163,180,800 (18)
abstracting: (p4<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p211)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p211<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (1<=p42)
states: 2,212,485,887,563,459,200 (18)
abstracting: (p42<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p63)
states: 2,528,555,300,072,524,800 (18)
abstracting: (p63<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p180)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p180<=0)
states: 25,285,553,000,725,248,001 (19)
abstracting: (0<=p38)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p38<=0)
states: 35,715,843,613,524,412,801 (19)
.abstracting: (0<=p142)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p142<=0)
states: 36,605,248,239,422,016,001 (19)
abstracting: (1<=p96)
states: 1,231,439,269,515,840,000 (18)
abstracting: (p96<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p203)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p203<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (1<=p118)
states: 2,352,144,465,183,744,000 (18)
abstracting: (p118<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (1<=p205)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p205<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
abstracting: (0<=p83)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p83<=0)
states: 35,711,738,815,959,360,001 (19)
.-> the formula is TRUE

FORMULA MultiwaySync-PT-none-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m57.768sec

checking: AF [[EX [EG [~ [[p185<=1 & 1<=p185]]]] & [EF [[[p170<=0 & 0<=p170] | [p135<=1 & 1<=p135]]] & [[p65<=0 & 0<=p65] | EF [EG [[[p29<=0 & 0<=p29] | [p107<=1 & 1<=p107]]]]]]]]
normalized: ~ [EG [~ [[[[E [true U EG [[[p107<=1 & 1<=p107] | [p29<=0 & 0<=p29]]]] | [p65<=0 & 0<=p65]] & E [true U [[p135<=1 & 1<=p135] | [p170<=0 & 0<=p170]]]] & EX [EG [~ [[p185<=1 & 1<=p185]]]]]]]]

abstracting: (1<=p185)
states: 12,642,776,500,362,624,000 (19)
abstracting: (p185<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
.abstracting: (0<=p170)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p170<=0)
states: 35,465,450,962,056,192,001 (19)
abstracting: (1<=p135)
states: 2,205,135,436,109,760,000 (18)
abstracting: (p135<=1)
states: 37,928,329,501,087,872,001 (19)
abstracting: (0<=p65)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p65<=0)
states: 35,399,774,201,015,347,201 (19)
abstracting: (0<=p29)
states: 37,928,329,501,087,872,001 (19)
abstracting: (p29<=0)
states: 32,239,080,075,924,691,201 (19)
abstracting: (1<=p107)
states: 1,231,439,269,515,840,000 (18)
abstracting: (p107<=1)
states: 37,928,329,501,087,872,001 (19)
.
EG iterations: 1
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6089392 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100224 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.001sec

123661
iterations count:115155 (306), effective:1406 (3)

initing FirstDep: 0m 0.001sec


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

iterations count:1967 (5), effective:28 (0)

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

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

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

iterations count:800 (2), effective:5 (0)

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

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

iterations count:27336 (72), effective:274 (0)

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

iterations count:23481 (62), effective:271 (0)

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

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

net_ddint.h:600: Timeout: after 414 sec


iterations count:712 (1), effective:6 (0)

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

iterations count:1268 (3), effective:13 (0)

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

iterations count:8325 (22), effective:98 (0)

iterations count:7777 (20), effective:129 (0)

iterations count:8357 (22), effective:99 (0)

iterations count:29853 (79), effective:345 (0)

iterations count:18533 (49), effective:291 (0)

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

iterations count:873 (2), effective:7 (0)

iterations count:7254 (19), effective:91 (0)

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

iterations count:377 (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="MultiwaySync-PT-none"
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 MultiwaySync-PT-none, 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 r266-smll-167863540300001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiwaySync-PT-none.tgz
mv MultiwaySync-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;