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.r025-smll-171620166300289.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 AutonomousCar-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 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 AutonomousCar-PT-05b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716346416691

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:53:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 02:53:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:53:39] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-22 02:53:39] [INFO ] Transformed 255 places.
[2024-05-22 02:53:39] [INFO ] Transformed 490 transitions.
[2024-05-22 02:53:39] [INFO ] Found NUPN structural information;
[2024-05-22 02:53:39] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 527 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Support contains 109 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 241 transition count 476
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 241 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 240 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 240 transition count 475
Applied a total of 30 rules in 117 ms. Remains 240 /255 variables (removed 15) and now considering 475/490 (removed 15) transitions.
// Phase 1: matrix 475 rows 240 cols
[2024-05-22 02:53:40] [INFO ] Computed 10 invariants in 38 ms
[2024-05-22 02:53:40] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-22 02:53:40] [INFO ] Invariant cache hit.
[2024-05-22 02:53:41] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2024-05-22 02:53:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 02:53:52] [INFO ] Deduced a trap composed of 19 places in 436 ms of which 51 ms to minimize.
[2024-05-22 02:53:52] [INFO ] Deduced a trap composed of 29 places in 342 ms of which 6 ms to minimize.
[2024-05-22 02:53:53] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 3 ms to minimize.
[2024-05-22 02:53:53] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 3 ms to minimize.
[2024-05-22 02:53:53] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2024-05-22 02:53:54] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 4 ms to minimize.
[2024-05-22 02:53:54] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 2 ms to minimize.
[2024-05-22 02:53:54] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 4 ms to minimize.
[2024-05-22 02:53:54] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 4 ms to minimize.
[2024-05-22 02:53:55] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 4 ms to minimize.
[2024-05-22 02:53:55] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 4 ms to minimize.
[2024-05-22 02:53:55] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 3 ms to minimize.
[2024-05-22 02:53:55] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 4 ms to minimize.
[2024-05-22 02:53:56] [INFO ] Deduced a trap composed of 44 places in 424 ms of which 5 ms to minimize.
[2024-05-22 02:53:56] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-05-22 02:53:57] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2024-05-22 02:53:57] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 3 ms to minimize.
[2024-05-22 02:53:57] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-05-22 02:53:57] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 3 ms to minimize.
[2024-05-22 02:53:58] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 02:53:58] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 4 ms to minimize.
[2024-05-22 02:53:59] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2024-05-22 02:53:59] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 4 ms to minimize.
[2024-05-22 02:53:59] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 5 ms to minimize.
[2024-05-22 02:54:00] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 4 ms to minimize.
[2024-05-22 02:54:00] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 3 ms to minimize.
[2024-05-22 02:54:01] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 3 ms to minimize.
[2024-05-22 02:54:01] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 3 ms to minimize.
[2024-05-22 02:54:01] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-05-22 02:54:02] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-22 02:54:02] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-22 02:54:02] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-22 02:54:02] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-22 02:54:02] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 4 ms to minimize.
[2024-05-22 02:54:03] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 4 ms to minimize.
[2024-05-22 02:54:03] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-22 02:54:03] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-22 02:54:04] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 4 ms to minimize.
[2024-05-22 02:54:04] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-22 02:54:04] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 02:54:11] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 3 ms to minimize.
[2024-05-22 02:54:11] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-05-22 02:54:11] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 4 ms to minimize.
[2024-05-22 02:54:12] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 4 ms to minimize.
[2024-05-22 02:54:12] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-05-22 02:54:12] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 3 ms to minimize.
[2024-05-22 02:54:13] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 3 ms to minimize.
[2024-05-22 02:54:13] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/715 variables, and 58 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 02:54:19] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 4 ms to minimize.
[2024-05-22 02:54:20] [INFO ] Deduced a trap composed of 36 places in 298 ms of which 4 ms to minimize.
[2024-05-22 02:54:20] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 4 ms to minimize.
[2024-05-22 02:54:20] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-05-22 02:54:21] [INFO ] Deduced a trap composed of 34 places in 265 ms of which 3 ms to minimize.
[2024-05-22 02:54:21] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 4 ms to minimize.
[2024-05-22 02:54:22] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 4 ms to minimize.
[2024-05-22 02:54:22] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 3 ms to minimize.
[2024-05-22 02:54:22] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 02:54:27] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2024-05-22 02:54:27] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-22 02:54:27] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-22 02:54:28] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-05-22 02:54:35] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 474 unsolved
SMT process timed out in 62349ms, After SMT, problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 62406ms
Starting structural reductions in LTL mode, iteration 1 : 240/255 places, 475/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63861 ms. Remains : 240/255 places, 475/490 transitions.
Support contains 109 out of 240 places after structural reductions.
[2024-05-22 02:54:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 02:54:44] [INFO ] Flatten gal took : 164 ms
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 02:54:44] [INFO ] Flatten gal took : 93 ms
[2024-05-22 02:54:44] [INFO ] Input system was already deterministic with 475 transitions.
Support contains 101 out of 240 places (down from 109) after GAL structural reductions.
RANDOM walk for 40000 steps (129 resets) in 3033 ms. (13 steps per ms) remains 9/71 properties
BEST_FIRST walk for 40003 steps (60 resets) in 401 ms. (99 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (73 resets) in 209 ms. (190 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (47 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (62 resets) in 179 ms. (222 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40000 steps (14 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (31 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
[2024-05-22 02:54:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 197/213 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/240 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 475/715 variables, 240/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/715 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 250 constraints, problems are : Problem set: 0 solved, 4 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 197/213 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/240 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 475/715 variables, 240/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:54:47] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 4 ms to minimize.
[2024-05-22 02:54:47] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 5 ms to minimize.
[2024-05-22 02:54:48] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 3 ms to minimize.
[2024-05-22 02:54:48] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2024-05-22 02:54:48] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 3 ms to minimize.
[2024-05-22 02:54:48] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 3 ms to minimize.
[2024-05-22 02:54:49] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 3 ms to minimize.
[2024-05-22 02:54:49] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 3 ms to minimize.
[2024-05-22 02:54:49] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 4 ms to minimize.
[2024-05-22 02:54:49] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:54:50] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 02:54:50] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 3 ms to minimize.
[2024-05-22 02:54:50] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/715 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/715 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 715/715 variables, and 267 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4229 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 4757ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3616 ms.
Support contains 16 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 197 edges and 240 vertex of which 2 / 240 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 746 edges and 239 vertex of which 236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 236 transition count 391
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 103 rules applied. Total rules applied 185 place count 156 transition count 368
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 203 place count 145 transition count 361
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 210 place count 138 transition count 361
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 210 place count 138 transition count 356
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 220 place count 133 transition count 356
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 238 place count 115 transition count 338
Iterating global reduction 4 with 18 rules applied. Total rules applied 256 place count 115 transition count 338
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 102 rules applied. Total rules applied 358 place count 115 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 114 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 359 place count 114 transition count 234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 363 place count 112 transition count 234
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 367 place count 108 transition count 218
Iterating global reduction 6 with 4 rules applied. Total rules applied 371 place count 108 transition count 218
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 439 place count 74 transition count 184
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 446 place count 67 transition count 144
Iterating global reduction 6 with 7 rules applied. Total rules applied 453 place count 67 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 454 place count 67 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 455 place count 67 transition count 142
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 461 place count 67 transition count 136
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 467 place count 61 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 469 place count 61 transition count 134
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 471 place count 61 transition count 134
Applied a total of 471 rules in 201 ms. Remains 61 /240 variables (removed 179) and now considering 134/475 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 61/240 places, 134/475 transitions.
RANDOM walk for 40000 steps (240 resets) in 646 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (411 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (363 resets) in 216 ms. (184 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (426 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (72 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 944796 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :2 out of 4
Probabilistic random walk after 944796 steps, saw 150949 distinct states, run finished after 3006 ms. (steps per millisecond=314 ) properties seen :2
// Phase 1: matrix 134 rows 61 cols
[2024-05-22 02:54:58] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:54:58] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/58 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/192 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 53/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/195 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/58 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/192 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 53/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/195 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 344 ms.
Support contains 9 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 134/134 transitions.
Graph (trivial) has 28 edges and 61 vertex of which 2 / 61 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 346 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 59 transition count 127
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 54 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 54 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 53 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 53 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 53 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 50 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 50 transition count 120
Applied a total of 23 rules in 28 ms. Remains 50 /61 variables (removed 11) and now considering 120/134 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 50/61 places, 120/134 transitions.
RANDOM walk for 40000 steps (1627 resets) in 350 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (491 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (172 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 531577 steps, run visited all 2 properties in 1616 ms. (steps per millisecond=328 )
Probabilistic random walk after 531577 steps, saw 86531 distinct states, run finished after 1621 ms. (steps per millisecond=327 ) properties seen :2
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 39 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 41 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 475 transitions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 216 transition count 451
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 216 transition count 451
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 148 place count 216 transition count 351
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 152 place count 212 transition count 347
Iterating global reduction 1 with 4 rules applied. Total rules applied 156 place count 212 transition count 347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 211 transition count 346
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 211 transition count 346
Applied a total of 158 rules in 23 ms. Remains 211 /240 variables (removed 29) and now considering 346/475 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 211/240 places, 346/475 transitions.
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 21 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 21 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 346 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 219 transition count 454
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 219 transition count 454
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 219 transition count 354
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 217 transition count 352
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 217 transition count 352
Applied a total of 146 rules in 16 ms. Remains 217 /240 variables (removed 23) and now considering 352/475 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 217/240 places, 352/475 transitions.
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 18 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 18 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 352 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 199 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 237 transition count 385
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 109 rules applied. Total rules applied 197 place count 150 transition count 363
Reduce places removed 12 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 18 rules applied. Total rules applied 215 place count 138 transition count 357
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 225 place count 132 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 227 place count 130 transition count 353
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 227 place count 130 transition count 347
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 239 place count 124 transition count 347
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 255 place count 108 transition count 331
Iterating global reduction 5 with 16 rules applied. Total rules applied 271 place count 108 transition count 331
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 372 place count 108 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 372 place count 108 transition count 229
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 374 place count 107 transition count 229
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 377 place count 104 transition count 218
Iterating global reduction 6 with 3 rules applied. Total rules applied 380 place count 104 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 382 place count 104 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 383 place count 103 transition count 216
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 435 place count 77 transition count 190
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 439 place count 73 transition count 167
Iterating global reduction 8 with 4 rules applied. Total rules applied 443 place count 73 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 73 transition count 166
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 447 place count 73 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 71 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 450 place count 70 transition count 164
Applied a total of 450 rules in 108 ms. Remains 70 /240 variables (removed 170) and now considering 164/475 (removed 311) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 70/240 places, 164/475 transitions.
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 228 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 237 transition count 369
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 137 rules applied. Total rules applied 241 place count 134 transition count 335
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 261 place count 114 transition count 335
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 261 place count 114 transition count 330
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 271 place count 109 transition count 330
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 287 place count 93 transition count 314
Iterating global reduction 3 with 16 rules applied. Total rules applied 303 place count 93 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 303 place count 93 transition count 313
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 305 place count 92 transition count 313
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 309 place count 88 transition count 282
Iterating global reduction 3 with 4 rules applied. Total rules applied 313 place count 88 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 6 rules applied. Total rules applied 319 place count 88 transition count 276
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 322 place count 85 transition count 276
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 380 place count 56 transition count 247
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 387 place count 49 transition count 172
Iterating global reduction 5 with 7 rules applied. Total rules applied 394 place count 49 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 4 rules applied. Total rules applied 398 place count 49 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 400 place count 47 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 47 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 45 transition count 165
Applied a total of 403 rules in 83 ms. Remains 45 /240 variables (removed 195) and now considering 165/475 (removed 310) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 45/240 places, 165/475 transitions.
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 227 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 237 transition count 371
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 135 rules applied. Total rules applied 237 place count 136 transition count 337
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 258 place count 116 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 115 transition count 336
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 259 place count 115 transition count 331
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 269 place count 110 transition count 331
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 286 place count 93 transition count 314
Iterating global reduction 4 with 17 rules applied. Total rules applied 303 place count 93 transition count 314
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 403 place count 93 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 403 place count 93 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 407 place count 91 transition count 212
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 411 place count 87 transition count 196
Iterating global reduction 5 with 4 rules applied. Total rules applied 415 place count 87 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 6 rules applied. Total rules applied 421 place count 87 transition count 190
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 424 place count 84 transition count 190
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 480 place count 56 transition count 162
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 487 place count 49 transition count 122
Iterating global reduction 7 with 7 rules applied. Total rules applied 494 place count 49 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 4 rules applied. Total rules applied 498 place count 49 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 500 place count 47 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 501 place count 47 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 503 place count 45 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 504 place count 44 transition count 116
Applied a total of 504 rules in 60 ms. Remains 44 /240 variables (removed 196) and now considering 116/475 (removed 359) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 44/240 places, 116/475 transitions.
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 213 transition count 448
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 213 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 208 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 207 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 207 transition count 342
Applied a total of 166 rules in 21 ms. Remains 207 /240 variables (removed 33) and now considering 342/475 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 207/240 places, 342/475 transitions.
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 16 ms
[2024-05-22 02:55:01] [INFO ] Flatten gal took : 17 ms
[2024-05-22 02:55:01] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 217 transition count 452
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 217 transition count 452
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 146 place count 217 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 214 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 214 transition count 349
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 213 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 213 transition count 348
Applied a total of 154 rules in 20 ms. Remains 213 /240 variables (removed 27) and now considering 348/475 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 213/240 places, 348/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 16 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 215 transition count 450
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 215 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 150 place count 215 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 155 place count 210 transition count 345
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 210 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 209 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 209 transition count 344
Applied a total of 162 rules in 20 ms. Remains 209 /240 variables (removed 31) and now considering 344/475 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 209/240 places, 344/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 16 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 226 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 237 transition count 372
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 132 rules applied. Total rules applied 233 place count 137 transition count 340
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 253 place count 118 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 117 transition count 339
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 254 place count 117 transition count 332
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 268 place count 110 transition count 332
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 284 place count 94 transition count 316
Iterating global reduction 4 with 16 rules applied. Total rules applied 300 place count 94 transition count 316
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 400 place count 94 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 400 place count 94 transition count 215
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 93 transition count 215
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 406 place count 89 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 410 place count 89 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 6 rules applied. Total rules applied 416 place count 89 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 419 place count 86 transition count 193
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 473 place count 59 transition count 166
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 480 place count 52 transition count 126
Iterating global reduction 7 with 7 rules applied. Total rules applied 487 place count 52 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 4 rules applied. Total rules applied 491 place count 52 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 493 place count 50 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 494 place count 50 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 496 place count 48 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 497 place count 47 transition count 119
Applied a total of 497 rules in 40 ms. Remains 47 /240 variables (removed 193) and now considering 119/475 (removed 356) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 47/240 places, 119/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 208 edges and 240 vertex of which 2 / 240 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 238 transition count 383
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 116 rules applied. Total rules applied 207 place count 148 transition count 357
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 223 place count 134 transition count 355
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 225 place count 132 transition count 355
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 225 place count 132 transition count 347
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 241 place count 124 transition count 347
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 258 place count 107 transition count 330
Iterating global reduction 4 with 17 rules applied. Total rules applied 275 place count 107 transition count 330
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 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 4 with 102 rules applied. Total rules applied 377 place count 107 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 378 place count 106 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 378 place count 106 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 382 place count 104 transition count 226
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 386 place count 100 transition count 210
Iterating global reduction 6 with 4 rules applied. Total rules applied 390 place count 100 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 392 place count 100 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 393 place count 99 transition count 208
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 441 place count 75 transition count 184
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 447 place count 69 transition count 150
Iterating global reduction 8 with 6 rules applied. Total rules applied 453 place count 69 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 with 4 rules applied. Total rules applied 457 place count 69 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 459 place count 67 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 460 place count 67 transition count 145
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 10 with 1 rules applied. Total rules applied 461 place count 67 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 462 place count 66 transition count 144
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 464 place count 66 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 466 place count 64 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 467 place count 63 transition count 142
Applied a total of 467 rules in 49 ms. Remains 63 /240 variables (removed 177) and now considering 142/475 (removed 333) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 63/240 places, 142/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 219 transition count 454
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 219 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 216 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 216 transition count 451
Applied a total of 48 rules in 15 ms. Remains 216 /240 variables (removed 24) and now considering 451/475 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 216/240 places, 451/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 22 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 451 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Graph (trivial) has 184 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 238 transition count 398
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 91 rules applied. Total rules applied 167 place count 163 transition count 382
Reduce places removed 7 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 18 rules applied. Total rules applied 185 place count 156 transition count 371
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 13 rules applied. Total rules applied 198 place count 145 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 144 transition count 369
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 199 place count 144 transition count 362
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 213 place count 137 transition count 362
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 227 place count 123 transition count 348
Iterating global reduction 5 with 14 rules applied. Total rules applied 241 place count 123 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 243 place count 123 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 122 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 244 place count 122 transition count 345
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 246 place count 121 transition count 345
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 247 place count 120 transition count 344
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 120 transition count 344
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 308 place count 90 transition count 314
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 314 place count 84 transition count 250
Iterating global reduction 7 with 6 rules applied. Total rules applied 320 place count 84 transition count 250
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 326 place count 84 transition count 250
Applied a total of 326 rules in 46 ms. Remains 84 /240 variables (removed 156) and now considering 250/475 (removed 225) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 84/240 places, 250/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 17 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 18 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 213 transition count 448
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 213 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 208 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 208 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 207 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 207 transition count 342
Applied a total of 166 rules in 14 ms. Remains 207 /240 variables (removed 33) and now considering 342/475 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 207/240 places, 342/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 214 transition count 449
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 214 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 152 place count 214 transition count 349
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 209 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 208 transition count 343
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 208 transition count 343
Applied a total of 164 rules in 16 ms. Remains 208 /240 variables (removed 32) and now considering 343/475 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 208/240 places, 343/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 214 transition count 449
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 214 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 152 place count 214 transition count 349
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 209 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 209 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 208 transition count 343
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 208 transition count 343
Applied a total of 164 rules in 15 ms. Remains 208 /240 variables (removed 32) and now considering 343/475 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 208/240 places, 343/475 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:55:02] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:55:02] [INFO ] Flatten gal took : 21 ms
[2024-05-22 02:55:02] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-05-22 02:55:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 475 transitions and 2497 arcs took 6 ms.
Total runtime 83744 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 240
TRANSITIONS: 475
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.016s, Sys 0.001s]


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


----------------------------------------------------------------------
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: 800
MODEL NAME: /home/mcc/execution/414/model
240 places, 475 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 AutonomousCar-PT-05b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716346784243

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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="AutonomousCar-PT-05b"
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 AutonomousCar-PT-05b, 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 r025-smll-171620166300289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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