fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r575-smll-171734919700153
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for MedleyA-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11822.319 1036622.00 3481036.00 953.40 FFTFTTTFFT?FFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919700153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 130K Jun 2 16:33 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 MedleyA-PT-20-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717375182829

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-03 00:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:39:45] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-06-03 00:39:45] [INFO ] Transformed 273 places.
[2024-06-03 00:39:45] [INFO ] Transformed 518 transitions.
[2024-06-03 00:39:45] [INFO ] Found NUPN structural information;
[2024-06-03 00:39:45] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
FORMULA MedleyA-PT-20-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 196 transition count 441
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 196 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 156 place count 196 transition count 439
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 175 place count 177 transition count 384
Iterating global reduction 1 with 19 rules applied. Total rules applied 194 place count 177 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 198 place count 173 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 173 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 173 transition count 375
Applied a total of 203 rules in 130 ms. Remains 173 /273 variables (removed 100) and now considering 375/518 (removed 143) transitions.
// Phase 1: matrix 375 rows 173 cols
[2024-06-03 00:39:46] [INFO ] Computed 11 invariants in 41 ms
[2024-06-03 00:39:46] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-03 00:39:46] [INFO ] Invariant cache hit.
[2024-06-03 00:39:47] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-06-03 00:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:39:52] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 31 ms to minimize.
[2024-06-03 00:39:53] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-06-03 00:39:53] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 4 ms to minimize.
[2024-06-03 00:39:53] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:39:53] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:39:53] [INFO ] Deduced a trap composed of 98 places in 208 ms of which 4 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 4 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 4 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 4 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 3 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:39:55] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:39:55] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 4 ms to minimize.
[2024-06-03 00:39:55] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:39:55] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:39:56] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:00] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-06-03 00:40:00] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 4 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 3 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 3 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 3 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 105 places in 177 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:04] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 3 ms to minimize.
[2024-06-03 00:40:05] [INFO ] Deduced a trap composed of 96 places in 211 ms of which 4 ms to minimize.
[2024-06-03 00:40:05] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-06-03 00:40:05] [INFO ] Deduced a trap composed of 87 places in 179 ms of which 3 ms to minimize.
[2024-06-03 00:40:06] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:08] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:40:09] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (OVERLAPS) 375/548 variables, 173/217 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:17] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/548 variables, and 218 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:22] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 6 ms to minimize.
[2024-06-03 00:40:22] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:24] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-06-03 00:40:24] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-03 00:40:24] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 3 ms to minimize.
[2024-06-03 00:40:25] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:28] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (OVERLAPS) 375/548 variables, 173/225 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 374/599 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 00:40:39] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 2 ms to minimize.
[2024-06-03 00:40:39] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:40:40] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 3 ms to minimize.
[2024-06-03 00:40:40] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 4/603 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 603 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 45/45 constraints]
After SMT, in 60720ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Starting structural reductions in LTL mode, iteration 1 : 173/273 places, 375/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62056 ms. Remains : 173/273 places, 375/518 transitions.
Support contains 59 out of 173 places after structural reductions.
[2024-06-03 00:40:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-03 00:40:48] [INFO ] Flatten gal took : 139 ms
FORMULA MedleyA-PT-20-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 00:40:48] [INFO ] Flatten gal took : 61 ms
[2024-06-03 00:40:48] [INFO ] Input system was already deterministic with 375 transitions.
Support contains 46 out of 173 places (down from 59) after GAL structural reductions.
RANDOM walk for 40000 steps (57 resets) in 2925 ms. (13 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40003 steps (30 resets) in 186 ms. (213 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (44 resets) in 118 ms. (336 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (38 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
[2024-06-03 00:40:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/130 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 375/548 variables, 173/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/130 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 375/548 variables, 173/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 142 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 4 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 5 place count 156 transition count 341
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 11 place count 152 transition count 339
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 152 transition count 335
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 148 transition count 335
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 52 place count 115 transition count 275
Iterating global reduction 2 with 33 rules applied. Total rules applied 85 place count 115 transition count 275
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 95 place count 115 transition count 265
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 101 place count 112 transition count 262
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 101 place count 112 transition count 256
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 113 place count 106 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 116 place count 106 transition count 253
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 118 place count 104 transition count 247
Iterating global reduction 5 with 2 rules applied. Total rules applied 120 place count 104 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 122 place count 104 transition count 245
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 152 place count 89 transition count 230
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 160 place count 81 transition count 206
Iterating global reduction 6 with 8 rules applied. Total rules applied 168 place count 81 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 173 place count 81 transition count 201
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 189 place count 73 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 195 place count 73 transition count 209
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 197 place count 71 transition count 203
Iterating global reduction 7 with 2 rules applied. Total rules applied 199 place count 71 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 201 place count 71 transition count 201
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 221 place count 71 transition count 181
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 247 place count 51 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 253 place count 48 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 256 place count 48 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 257 place count 47 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 258 place count 46 transition count 168
Applied a total of 258 rules in 136 ms. Remains 46 /173 variables (removed 127) and now considering 168/375 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 46/173 places, 168/375 transitions.
RANDOM walk for 530 steps (6 resets) in 26 ms. (19 steps per ms) remains 0/1 properties
[2024-06-03 00:40:50] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:40:50] [INFO ] Flatten gal took : 31 ms
[2024-06-03 00:40:50] [INFO ] Input system was already deterministic with 375 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 134 transition count 306
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 134 transition count 300
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 120 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 120 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 120 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 116 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 116 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 116 transition count 249
Applied a total of 127 rules in 11 ms. Remains 116 /173 variables (removed 57) and now considering 249/375 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 116/173 places, 249/375 transitions.
[2024-06-03 00:40:50] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:40:50] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:40:50] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 142 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 155 transition count 344
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 152 transition count 342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 152 transition count 338
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 148 transition count 338
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 51 place count 114 transition count 275
Iterating global reduction 2 with 34 rules applied. Total rules applied 85 place count 114 transition count 275
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 95 place count 114 transition count 265
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 101 place count 111 transition count 262
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 101 place count 111 transition count 256
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 113 place count 105 transition count 256
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 103 transition count 250
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 103 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 103 transition count 248
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 145 place count 90 transition count 235
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 153 place count 82 transition count 211
Iterating global reduction 5 with 8 rules applied. Total rules applied 161 place count 82 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 166 place count 82 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 169 place count 82 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 175 place count 79 transition count 200
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 178 place count 76 transition count 191
Iterating global reduction 6 with 3 rules applied. Total rules applied 181 place count 76 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 184 place count 76 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 74 transition count 186
Applied a total of 186 rules in 75 ms. Remains 74 /173 variables (removed 99) and now considering 186/375 (removed 189) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 74/173 places, 186/375 transitions.
[2024-06-03 00:40:50] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 186 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 134 transition count 306
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 134 transition count 300
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 120 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 120 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 120 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 116 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 116 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 116 transition count 249
Applied a total of 127 rules in 10 ms. Remains 116 /173 variables (removed 57) and now considering 249/375 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 116/173 places, 249/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 136 transition count 311
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 136 transition count 311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 80 place count 136 transition count 305
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 94 place count 122 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 108 place count 122 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 112 place count 122 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 118 transition count 257
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 118 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 118 transition count 255
Applied a total of 122 rules in 10 ms. Remains 118 /173 variables (removed 55) and now considering 255/375 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 118/173 places, 255/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 143 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 5 place count 155 transition count 343
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 11 place count 151 transition count 341
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 151 transition count 337
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 147 transition count 337
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 53 place count 113 transition count 276
Iterating global reduction 2 with 34 rules applied. Total rules applied 87 place count 113 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 113 transition count 268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 111 transition count 266
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 99 place count 111 transition count 260
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 111 place count 105 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 103 transition count 254
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 103 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 103 transition count 252
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 143 place count 90 transition count 239
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 151 place count 82 transition count 215
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 82 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 164 place count 82 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 168 place count 82 transition count 206
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 174 place count 79 transition count 203
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 177 place count 76 transition count 194
Iterating global reduction 6 with 3 rules applied. Total rules applied 180 place count 76 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 183 place count 76 transition count 191
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 76 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 74 transition count 189
Applied a total of 186 rules in 75 ms. Remains 74 /173 variables (removed 99) and now considering 189/375 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 74/173 places, 189/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 138 transition count 314
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 138 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 75 place count 138 transition count 309
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 87 place count 126 transition count 278
Iterating global reduction 1 with 12 rules applied. Total rules applied 99 place count 126 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 103 place count 126 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 123 transition count 267
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 123 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 123 transition count 265
Applied a total of 111 rules in 10 ms. Remains 123 /173 variables (removed 50) and now considering 265/375 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 123/173 places, 265/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 135 transition count 309
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 135 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 81 place count 135 transition count 304
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 95 place count 121 transition count 270
Iterating global reduction 1 with 14 rules applied. Total rules applied 109 place count 121 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 113 place count 121 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 117 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 117 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 117 transition count 253
Applied a total of 124 rules in 10 ms. Remains 117 /173 variables (removed 56) and now considering 253/375 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 117/173 places, 253/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 136 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 5 place count 156 transition count 344
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 11 place count 152 transition count 342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 152 transition count 338
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 148 transition count 338
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 46 place count 121 transition count 288
Iterating global reduction 2 with 27 rules applied. Total rules applied 73 place count 121 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 82 place count 121 transition count 279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 88 place count 118 transition count 276
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 88 place count 118 transition count 272
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 96 place count 114 transition count 272
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 113 transition count 269
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 113 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 113 transition count 268
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 129 place count 98 transition count 253
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 135 place count 92 transition count 235
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 92 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 146 place count 92 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 149 place count 92 transition count 227
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 155 place count 89 transition count 224
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 158 place count 86 transition count 215
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 86 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 164 place count 86 transition count 212
Applied a total of 164 rules in 59 ms. Remains 86 /173 variables (removed 87) and now considering 212/375 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 86/173 places, 212/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 141 edges and 173 vertex of which 18 / 173 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 5 place count 157 transition count 346
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 11 place count 153 transition count 344
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 153 transition count 340
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 149 transition count 340
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 54 place count 114 transition count 276
Iterating global reduction 2 with 35 rules applied. Total rules applied 89 place count 114 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 99 place count 114 transition count 266
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 104 place count 111 transition count 264
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 104 place count 111 transition count 258
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 116 place count 105 transition count 258
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 103 transition count 252
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 103 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 103 transition count 250
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 148 place count 90 transition count 237
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 156 place count 82 transition count 213
Iterating global reduction 5 with 8 rules applied. Total rules applied 164 place count 82 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 169 place count 82 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 173 place count 82 transition count 204
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 179 place count 79 transition count 201
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 182 place count 76 transition count 192
Iterating global reduction 6 with 3 rules applied. Total rules applied 185 place count 76 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 188 place count 76 transition count 189
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 76 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 74 transition count 187
Applied a total of 191 rules in 65 ms. Remains 74 /173 variables (removed 99) and now considering 187/375 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 74/173 places, 187/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 9 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 137 transition count 309
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 137 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 137 transition count 304
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 89 place count 125 transition count 273
Iterating global reduction 1 with 12 rules applied. Total rules applied 101 place count 125 transition count 273
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 105 place count 125 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 122 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 122 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 122 transition count 260
Applied a total of 113 rules in 10 ms. Remains 122 /173 variables (removed 51) and now considering 260/375 (removed 115) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 122/173 places, 260/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 134 transition count 306
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 134 transition count 300
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 120 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 120 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 120 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 116 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 116 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 116 transition count 249
Applied a total of 127 rules in 10 ms. Remains 116 /173 variables (removed 57) and now considering 249/375 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 116/173 places, 249/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 138 transition count 312
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 138 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 138 transition count 306
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 125 transition count 275
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 125 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 125 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 121 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 121 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 121 transition count 258
Applied a total of 117 rules in 10 ms. Remains 121 /173 variables (removed 52) and now considering 258/375 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 121/173 places, 258/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:40:51] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 131 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 5 place count 155 transition count 343
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 11 place count 151 transition count 341
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 151 transition count 337
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 147 transition count 337
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 49 place count 117 transition count 284
Iterating global reduction 2 with 30 rules applied. Total rules applied 79 place count 117 transition count 284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 117 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 116 transition count 278
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 86 place count 116 transition count 274
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 94 place count 112 transition count 274
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 110 transition count 268
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 110 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 110 transition count 266
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 126 place count 97 transition count 253
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 133 place count 90 transition count 232
Iterating global reduction 5 with 7 rules applied. Total rules applied 140 place count 90 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 144 place count 90 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 149 place count 90 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 155 place count 87 transition count 220
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 157 place count 85 transition count 214
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 85 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 85 transition count 212
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 163 place count 85 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 165 place count 83 transition count 210
Applied a total of 165 rules in 53 ms. Remains 83 /173 variables (removed 90) and now considering 210/375 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 83/173 places, 210/375 transitions.
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:40:51] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:40:52] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-03 00:40:52] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:40:52] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:40:52] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-03 00:40:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 375 transitions and 1323 arcs took 5 ms.
Total runtime 66847 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 173
TRANSITIONS: 375
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 698
MODEL NAME: /home/mcc/execution/412/model
173 places, 375 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-20-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-20-CTLCardinality-2024-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717376219451

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="MedleyA-PT-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-20, 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 r575-smll-171734919700153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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