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.r579-smll-171734921200081.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 ltsminxred
Input is MedleyA-PT-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 160K 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-11-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-11-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717356098168

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:21:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:21:41] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-06-02 19:21:41] [INFO ] Transformed 150 places.
[2024-06-02 19:21:41] [INFO ] Transformed 478 transitions.
[2024-06-02 19:21:41] [INFO ] Found NUPN structural information;
[2024-06-02 19:21:41] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 79 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 436
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 129 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 129 transition count 425
Applied a total of 42 rules in 81 ms. Remains 129 /150 variables (removed 21) and now considering 425/469 (removed 44) transitions.
[2024-06-02 19:21:41] [INFO ] Flow matrix only has 353 transitions (discarded 72 similar events)
// Phase 1: matrix 353 rows 129 cols
[2024-06-02 19:21:41] [INFO ] Computed 23 invariants in 55 ms
[2024-06-02 19:21:42] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-06-02 19:21:42] [INFO ] Flow matrix only has 353 transitions (discarded 72 similar events)
[2024-06-02 19:21:42] [INFO ] Invariant cache hit.
[2024-06-02 19:21:42] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-06-02 19:21:42] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-06-02 19:21:42] [INFO ] Flow matrix only has 353 transitions (discarded 72 similar events)
[2024-06-02 19:21:42] [INFO ] Invariant cache hit.
[2024-06-02 19:21:42] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/129 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 19:21:50] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 35 ms to minimize.
[2024-06-02 19:21:50] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:21:50] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-02 19:21:50] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:21:50] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:21:51] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:21:52] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 19:21:54] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:21:54] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-06-02 19:21:54] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-06-02 19:21:55] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 3 ms to minimize.
[2024-06-02 19:21:55] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 2 ms to minimize.
[2024-06-02 19:21:55] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2024-06-02 19:21:55] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 3 ms to minimize.
[2024-06-02 19:21:56] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 2 ms to minimize.
[2024-06-02 19:21:56] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 2 ms to minimize.
[2024-06-02 19:21:56] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2024-06-02 19:21:56] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:21:56] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:21:56] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:21:57] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:21:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:21:58] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:21:58] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-06-02 19:21:58] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
[2024-06-02 19:21:58] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:21:58] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/63 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 19:21:59] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:21:59] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:22:00] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:22:01] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 5/68 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 19:22:02] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-06-02 19:22:03] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:22:03] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:22:03] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:22:04] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:22:04] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 4 ms to minimize.
[2024-06-02 19:22:04] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-06-02 19:22:05] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 8/76 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 2 ms to minimize.
[2024-06-02 19:22:07] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 5 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 5 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:22:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 7/83 constraints. Problems are: Problem set: 108 solved, 316 unsolved
[2024-06-02 19:22:11] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2024-06-02 19:22:11] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 2/85 constraints. Problems are: Problem set: 108 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/85 constraints. Problems are: Problem set: 108 solved, 316 unsolved
SMT process timed out in 31482ms, After SMT, problems are : Problem set: 108 solved, 316 unsolved
Search for dead transitions found 108 dead transitions in 31518ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 129/150 places, 317/469 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 317
Applied a total of 1 rules in 9 ms. Remains 128 /129 variables (removed 1) and now considering 317/317 (removed 0) transitions.
// Phase 1: matrix 317 rows 128 cols
[2024-06-02 19:22:14] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 19:22:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 19:22:14] [INFO ] Invariant cache hit.
[2024-06-02 19:22:14] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-02 19:22:14] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/150 places, 317/469 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33209 ms. Remains : 128/150 places, 317/469 transitions.
Support contains 79 out of 128 places after structural reductions.
[2024-06-02 19:22:15] [INFO ] Flatten gal took : 121 ms
[2024-06-02 19:22:15] [INFO ] Flatten gal took : 59 ms
[2024-06-02 19:22:15] [INFO ] Input system was already deterministic with 317 transitions.
RANDOM walk for 40000 steps (3128 resets) in 3578 ms. (11 steps per ms) remains 23/71 properties
BEST_FIRST walk for 4003 steps (46 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (56 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (52 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (50 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (54 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (55 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (51 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (55 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (48 resets) in 17 ms. (222 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4003 steps (54 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2024-06-02 19:22:16] [INFO ] Invariant cache hit.
[2024-06-02 19:22:16] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 9/82 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 37/119 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 6/125 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 315/440 variables, 125/147 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 131/278 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 5/445 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/445 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 281 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 128/128 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 44/73 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-02 19:22:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:22:18] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:22:18] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/82 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 6 (OVERLAPS) 37/119 variables, 9/23 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:22:19] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:22:20] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 20/43 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:22:21] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:22:22] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 13/56 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-02 19:22:23] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-02 19:22:23] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 2 ms to minimize.
SMT process timed out in 6460ms, After SMT, problems are : Problem set: 2 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 614 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 315
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 106 transition count 271
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 106 transition count 271
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 103 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 103 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 102 transition count 257
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 98 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 74 place count 98 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 97 transition count 266
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 97 transition count 263
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 92 place count 89 transition count 263
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 89 transition count 263
Applied a total of 97 rules in 173 ms. Remains 89 /128 variables (removed 39) and now considering 263/317 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 89/128 places, 263/317 transitions.
RANDOM walk for 40000 steps (5500 resets) in 981 ms. (40 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (1123 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1132 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1067 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1108 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1144 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1134 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1114 resets) in 99 ms. (400 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (1134 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1121 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1149 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
// Phase 1: matrix 263 rows 89 cols
[2024-06-02 19:22:24] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 19:22:24] [INFO ] State equation strengthened by 124 read => feed constraints.
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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/88 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 263/351 variables, 88/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 124/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/352 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/352 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 233 constraints, problems are : Problem set: 0 solved, 9 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:22:25] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 10/88 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 263/351 variables, 88/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 124/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 7/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:22:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:22:25] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:22:26] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:22:26] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/352 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:22:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/352 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 248 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3516 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 4163ms problems are : Problem set: 0 solved, 9 unsolved
Finished Parikh walk after 780 steps, including 33 resets, run visited all 1 properties in 5 ms. (steps per millisecond=156 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 457 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 19:22:28] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 317 transitions.
Computed a total of 29 stabilizing places and 133 stable transitions
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 104 transition count 266
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 104 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 43 place count 100 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 100 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 49 place count 98 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 51 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 98 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 96 transition count 235
Applied a total of 58 rules in 56 ms. Remains 96 /128 variables (removed 32) and now considering 235/317 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 96/128 places, 235/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 100 transition count 257
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 100 transition count 257
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 93 transition count 223
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 93 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 91 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 91 transition count 215
Applied a total of 72 rules in 16 ms. Remains 91 /128 variables (removed 37) and now considering 215/317 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 91/128 places, 215/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 100 transition count 257
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 100 transition count 257
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 93 transition count 223
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 93 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 91 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 91 transition count 215
Applied a total of 72 rules in 16 ms. Remains 91 /128 variables (removed 37) and now considering 215/317 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 91/128 places, 215/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 103 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 103 transition count 265
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 98 transition count 241
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 98 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 96 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 96 transition count 233
Applied a total of 62 rules in 12 ms. Remains 96 /128 variables (removed 32) and now considering 233/317 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 96/128 places, 233/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 101 transition count 258
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 101 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 95 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 95 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 94 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 94 transition count 224
Applied a total of 66 rules in 12 ms. Remains 94 /128 variables (removed 34) and now considering 224/317 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 94/128 places, 224/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 100 transition count 259
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 100 transition count 259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 50 place count 95 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 55 place count 95 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 94 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 94 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 93 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 93 transition count 228
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 0 with 6 rules applied. Total rules applied 68 place count 90 transition count 225
Applied a total of 68 rules in 41 ms. Remains 90 /128 variables (removed 38) and now considering 225/317 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 90/128 places, 225/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 105 transition count 270
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 105 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 100 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 100 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 98 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 98 transition count 238
Applied a total of 58 rules in 8 ms. Remains 98 /128 variables (removed 30) and now considering 238/317 (removed 79) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 98/128 places, 238/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 101 transition count 259
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 101 transition count 259
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 95 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 94 transition count 226
Applied a total of 66 rules in 9 ms. Remains 94 /128 variables (removed 34) and now considering 226/317 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 94/128 places, 226/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 102 transition count 259
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 102 transition count 259
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 95 transition count 225
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 95 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 93 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 93 transition count 217
Applied a total of 68 rules in 8 ms. Remains 93 /128 variables (removed 35) and now considering 217/317 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 93/128 places, 217/317 transitions.
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:22:29] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:22:29] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 102 transition count 268
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 102 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 96 transition count 238
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 55 place count 94 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 94 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 93 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 93 transition count 226
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 0 with 6 rules applied. Total rules applied 68 place count 90 transition count 223
Applied a total of 68 rules in 38 ms. Remains 90 /128 variables (removed 38) and now considering 223/317 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 90/128 places, 223/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 101 transition count 258
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 101 transition count 258
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 94 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 94 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 92 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 92 transition count 216
Applied a total of 70 rules in 6 ms. Remains 92 /128 variables (removed 36) and now considering 216/317 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 92/128 places, 216/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 99 transition count 257
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 99 transition count 257
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 53 place count 93 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 59 place count 93 transition count 229
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 61 place count 91 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 63 place count 91 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 90 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 90 transition count 217
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 0 with 6 rules applied. Total rules applied 74 place count 87 transition count 214
Applied a total of 74 rules in 26 ms. Remains 87 /128 variables (removed 41) and now considering 214/317 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 87/128 places, 214/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 103 transition count 265
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 103 transition count 265
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 98 transition count 241
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 98 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 96 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 96 transition count 233
Applied a total of 62 rules in 5 ms. Remains 96 /128 variables (removed 32) and now considering 233/317 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 96/128 places, 233/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 125 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 98 transition count 255
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 98 transition count 255
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 56 place count 91 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 63 place count 91 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 90 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 90 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 67 place count 89 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 89 transition count 213
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 0 with 6 rules applied. Total rules applied 76 place count 86 transition count 210
Applied a total of 76 rules in 22 ms. Remains 86 /128 variables (removed 42) and now considering 210/317 (removed 107) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 86/128 places, 210/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Graph (complete) has 778 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 103 transition count 261
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 103 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 97 transition count 233
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 97 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 54 place count 96 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 96 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 95 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 95 transition count 225
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 0 with 6 rules applied. Total rules applied 66 place count 92 transition count 222
Applied a total of 66 rules in 21 ms. Remains 92 /128 variables (removed 36) and now considering 222/317 (removed 95) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 92/128 places, 222/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 317/317 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 317
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 105 transition count 269
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 105 transition count 269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 99 transition count 239
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 98 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 98 transition count 235
Applied a total of 58 rules in 6 ms. Remains 98 /128 variables (removed 30) and now considering 235/317 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 98/128 places, 235/317 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:22:30] [INFO ] Input system was already deterministic with 235 transitions.
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:22:30] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:22:30] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-02 19:22:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 317 transitions and 1657 arcs took 7 ms.
Total runtime 49885 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-00
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-02
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-03
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-04
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-05
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-06
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-07
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-08
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-09
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-10
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-11
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-14
Could not compute solution for formula : MedleyA-PT-11-CTLCardinality-2024-15

BK_STOP 1717356151083

--------------------
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
mcc2024
ctl formula name MedleyA-PT-11-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/865/ctl_0_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/865/ctl_1_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/865/ctl_2_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/865/ctl_3_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/865/ctl_4_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/865/ctl_5_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/865/ctl_6_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/865/ctl_7_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/865/ctl_8_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/865/ctl_9_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/865/ctl_10_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/865/ctl_11_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/865/ctl_12_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/865/ctl_13_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/865/ctl_14_
ctl formula name MedleyA-PT-11-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/865/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-11"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-11, 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 r579-smll-171734921200081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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