Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K 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.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717368237152

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:43:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:43:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:44:00] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-02 22:44:00] [INFO ] Transformed 252 places.
[2024-06-02 22:44:00] [INFO ] Transformed 543 transitions.
[2024-06-02 22:44:00] [INFO ] Found NUPN structural information;
[2024-06-02 22:44:00] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 106 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 228 transition count 501
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 228 transition count 501
Applied a total of 48 rules in 80 ms. Remains 228 /252 variables (removed 24) and now considering 501/541 (removed 40) transitions.
// Phase 1: matrix 501 rows 228 cols
[2024-06-02 22:44:00] [INFO ] Computed 7 invariants in 44 ms
[2024-06-02 22:44:01] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-06-02 22:44:01] [INFO ] Invariant cache hit.
[2024-06-02 22:44:02] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-02 22:44:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 22:44:11] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 38 ms to minimize.
[2024-06-02 22:44:11] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 5 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 4 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 4 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 4 ms to minimize.
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 3 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 5 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 3 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 4 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 2 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 2 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-06-02 22:44:14] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 3 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 34 places in 304 ms of which 4 ms to minimize.
[2024-06-02 22:44:15] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 3 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 4 ms to minimize.
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 22:44:16] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2024-06-02 22:44:17] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 3 ms to minimize.
[2024-06-02 22:44:17] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 4 ms to minimize.
[2024-06-02 22:44:17] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 4 ms to minimize.
[2024-06-02 22:44:18] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 4 ms to minimize.
[2024-06-02 22:44:18] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 3 ms to minimize.
[2024-06-02 22:44:18] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:44:18] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-02 22:44:19] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-06-02 22:44:19] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 4 ms to minimize.
[2024-06-02 22:44:19] [INFO ] Deduced a trap composed of 136 places in 210 ms of which 3 ms to minimize.
[2024-06-02 22:44:20] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 4 ms to minimize.
[2024-06-02 22:44:20] [INFO ] Deduced a trap composed of 152 places in 225 ms of which 3 ms to minimize.
[2024-06-02 22:44:20] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 5 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 4 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 4 ms to minimize.
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 4 ms to minimize.
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 4 ms to minimize.
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 22:44:29] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 4 ms to minimize.
[2024-06-02 22:44:30] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 3 ms to minimize.
[2024-06-02 22:44:30] [INFO ] Deduced a trap composed of 146 places in 324 ms of which 4 ms to minimize.
[2024-06-02 22:44:30] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 4 ms to minimize.
[2024-06-02 22:44:31] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:44:31] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 4 ms to minimize.
[2024-06-02 22:44:32] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 3 ms to minimize.
[2024-06-02 22:44:32] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 4 ms to minimize.
[2024-06-02 22:44:32] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2024-06-02 22:44:33] [INFO ] Deduced a trap composed of 137 places in 315 ms of which 4 ms to minimize.
[2024-06-02 22:44:33] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 5 ms to minimize.
SMT process timed out in 31349ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 31402ms
Starting structural reductions in LTL mode, iteration 1 : 228/252 places, 501/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32899 ms. Remains : 228/252 places, 501/541 transitions.
Support contains 106 out of 228 places after structural reductions.
[2024-06-02 22:44:34] [INFO ] Flatten gal took : 166 ms
[2024-06-02 22:44:34] [INFO ] Flatten gal took : 95 ms
[2024-06-02 22:44:34] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 104 out of 228 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (1533 resets) in 2427 ms. (16 steps per ms) remains 56/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 63 ms. (62 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 43 ms. (90 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 56 ms. (70 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 71 ms. (55 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 134 ms. (29 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 42 ms. (93 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 25 ms. (154 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (33 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (34 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (34 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (44 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (34 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (38 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (35 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (34 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 39 ms. (100 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (43 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
[2024-06-02 22:44:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 138/228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 501/729 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/729 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 22:44:38] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 4 ms to minimize.
Problem AtomicPropp26 is UNSAT
At refinement iteration 5 (OVERLAPS) 0/729 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/729 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 729/729 variables, and 236 constraints, problems are : Problem set: 1 solved, 54 unsolved in 4931 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 54 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 140/228 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 22:44:41] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-06-02 22:44:41] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:44:41] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
[2024-06-02 22:44:42] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 3 ms to minimize.
[2024-06-02 22:44:43] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:44:43] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 3 ms to minimize.
[2024-06-02 22:44:43] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 2 ms to minimize.
[2024-06-02 22:44:43] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 3 ms to minimize.
[2024-06-02 22:44:43] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 2 ms to minimize.
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:44:44] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 3 ms to minimize.
[2024-06-02 22:44:45] [INFO ] Deduced a trap composed of 151 places in 321 ms of which 4 ms to minimize.
[2024-06-02 22:44:45] [INFO ] Deduced a trap composed of 140 places in 310 ms of which 4 ms to minimize.
[2024-06-02 22:44:45] [INFO ] Deduced a trap composed of 134 places in 295 ms of which 3 ms to minimize.
[2024-06-02 22:44:46] [INFO ] Deduced a trap composed of 147 places in 289 ms of which 4 ms to minimize.
SMT process timed out in 10230ms, After SMT, problems are : Problem set: 2 solved, 53 unsolved
Fused 53 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 85 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 501/501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 228 transition count 485
Reduce places removed 16 places and 0 transitions.
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 1 with 18 rules applied. Total rules applied 34 place count 212 transition count 483
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 41 place count 211 transition count 477
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 47 place count 205 transition count 477
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 47 place count 205 transition count 473
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 55 place count 201 transition count 473
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 198 transition count 469
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 198 transition count 469
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 95 place count 181 transition count 452
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -30
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 111 place count 173 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 134 place count 173 transition count 459
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 172 transition count 458
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 172 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 170 transition count 456
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 153 place count 170 transition count 443
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 166 place count 157 transition count 443
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 157 transition count 443
Applied a total of 168 rules in 288 ms. Remains 157 /228 variables (removed 71) and now considering 443/501 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 157/228 places, 443/501 transitions.
RANDOM walk for 40000 steps (17 resets) in 766 ms. (52 steps per ms) remains 50/53 properties
BEST_FIRST walk for 4001 steps (21 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (13 resets) in 65 ms. (60 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (26 resets) in 51 ms. (76 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4000 steps (12 resets) in 54 ms. (72 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (40 resets) in 47 ms. (83 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (13 resets) in 61 ms. (64 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (11 resets) in 45 ms. (86 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (39 resets) in 76 ms. (51 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (36 resets) in 44 ms. (88 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (12 resets) in 68 ms. (57 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (22 resets) in 70 ms. (56 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (22 resets) in 69 ms. (57 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (17 resets) in 49 ms. (80 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (16 resets) in 66 ms. (59 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (29 resets) in 51 ms. (76 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (35 resets) in 40 ms. (97 steps per ms) remains 45/49 properties
BEST_FIRST walk for 4000 steps (21 resets) in 53 ms. (74 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (28 resets) in 53 ms. (74 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (14 resets) in 54 ms. (72 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (23 resets) in 76 ms. (51 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (11 resets) in 83 ms. (47 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (23 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 68 ms. (57 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (21 resets) in 90 ms. (43 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (14 resets) in 64 ms. (61 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (16 resets) in 52 ms. (75 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (19 resets) in 72 ms. (54 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (12 resets) in 62 ms. (63 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (33 resets) in 97 ms. (40 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (24 resets) in 60 ms. (65 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (46 resets) in 45 ms. (86 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (44 resets) in 48 ms. (81 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (18 resets) in 66 ms. (59 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (34 resets) in 51 ms. (76 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (24 resets) in 57 ms. (68 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (29 resets) in 49 ms. (80 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (25 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (17 resets) in 37 ms. (105 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (29 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (16 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (16 resets) in 35 ms. (111 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4000 steps (24 resets) in 34 ms. (114 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (147 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4000 steps (32 resets) in 38 ms. (102 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (17 resets) in 35 ms. (111 steps per ms) remains 42/43 properties
// Phase 1: matrix 443 rows 157 cols
[2024-06-02 22:44:48] [INFO ] Computed 7 invariants in 10 ms
[2024-06-02 22:44:48] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 84/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 5/157 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 443/600 variables, 157/164 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 71/235 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/600 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 235 constraints, problems are : Problem set: 0 solved, 42 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 84/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-02 22:44:51] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:44:51] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 2 ms to minimize.
[2024-06-02 22:44:51] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-02 22:44:51] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:44:51] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
[2024-06-02 22:44:52] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-06-02 22:44:52] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:44:52] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-06-02 22:44:52] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 2 ms to minimize.
Problem AtomicPropp33 is UNSAT
[2024-06-02 22:44:52] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 1 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2024-06-02 22:44:53] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 17/23 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 2 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-06-02 22:44:55] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2024-06-02 22:44:55] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 8/31 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:44:55] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-06-02 22:44:55] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:44:56] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:44:56] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 5/157 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:44:57] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:44:57] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 2 ms to minimize.
[2024-06-02 22:44:57] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:44:57] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 2 ms to minimize.
[2024-06-02 22:44:58] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:44:58] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:44:58] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 3 ms to minimize.
[2024-06-02 22:44:58] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:44:59] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 3 ms to minimize.
[2024-06-02 22:44:59] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-06-02 22:44:59] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 11/47 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:45:00] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:45:00] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 3 ms to minimize.
[2024-06-02 22:45:00] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 2/50 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 84 places in 250 ms of which 3 ms to minimize.
[2024-06-02 22:45:01] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2024-06-02 22:45:02] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 4/54 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 443/600 variables, 157/211 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/600 variables, 71/282 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/600 variables, 41/323 constraints. Problems are: Problem set: 1 solved, 41 unsolved
[2024-06-02 22:45:05] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-06-02 22:45:05] [INFO ] Deduced a trap composed of 107 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 3 ms to minimize.
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 96 places in 207 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/600 variables, 4/327 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 327 constraints, problems are : Problem set: 1 solved, 41 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 41/42 constraints, Known Traps: 51/51 constraints]
After SMT, in 47599ms problems are : Problem set: 1 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 443/443 transitions.
Graph (trivial) has 51 edges and 157 vertex of which 2 / 157 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 440
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 155 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 153 transition count 438
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 153 transition count 436
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 151 transition count 436
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 25 place count 144 transition count 429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 142 transition count 441
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 142 transition count 435
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 42 place count 136 transition count 434
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 136 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 136 transition count 433
Applied a total of 45 rules in 121 ms. Remains 136 /157 variables (removed 21) and now considering 433/443 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 136/157 places, 433/443 transitions.
RANDOM walk for 40000 steps (1938 resets) in 807 ms. (49 steps per ms) remains 8/41 properties
BEST_FIRST walk for 40001 steps (601 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (615 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (584 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (578 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (578 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (587 resets) in 94 ms. (421 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (598 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (571 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
[2024-06-02 22:45:36] [INFO ] Flow matrix only has 428 transitions (discarded 5 similar events)
// Phase 1: matrix 428 rows 136 cols
[2024-06-02 22:45:36] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:45:36] [INFO ] State equation strengthened by 169 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 52/136 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 428/564 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 169/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 312 constraints, problems are : Problem set: 0 solved, 6 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 52/136 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 3 ms to minimize.
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 2 ms to minimize.
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 3 ms to minimize.
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 428/564 variables, 136/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 169/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:45:39] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/564 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 329 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 3230ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 2515 ms.
Support contains 7 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 433/433 transitions.
Graph (trivial) has 130 edges and 136 vertex of which 4 / 136 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 134 transition count 411
Reduce places removed 18 places and 0 transitions.
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 1 with 20 rules applied. Total rules applied 39 place count 116 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 115 transition count 409
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 40 place count 115 transition count 405
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 111 transition count 405
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 58 place count 101 transition count 387
Iterating global reduction 3 with 10 rules applied. Total rules applied 68 place count 101 transition count 387
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 88 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 88 transition count 373
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 87 transition count 371
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 87 transition count 371
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 125 place count 73 transition count 425
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 138 place count 73 transition count 412
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 72 transition count 406
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 72 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 156 place count 72 transition count 390
Free-agglomeration rule applied 11 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 167 place count 72 transition count 373
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 191 place count 61 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 208 place count 61 transition count 343
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 61 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 60 transition count 357
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 211 place count 60 transition count 357
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 212 place count 60 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 213 place count 59 transition count 355
Applied a total of 213 rules in 137 ms. Remains 59 /136 variables (removed 77) and now considering 355/433 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 59/136 places, 355/433 transitions.
RANDOM walk for 40000 steps (3686 resets) in 901 ms. (44 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (951 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2024-06-02 22:45:42] [INFO ] Flow matrix only has 309 transitions (discarded 46 similar events)
// Phase 1: matrix 309 rows 59 cols
[2024-06-02 22:45:42] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:45:42] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/232 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/353 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 102/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/360 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/368 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 8/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/368 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 205/232 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/353 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 102/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/360 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/368 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 355/355 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 339
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 339
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 4 place count 57 transition count 338
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 10 place count 54 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 54 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 54 transition count 336
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 54 transition count 334
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 29 place count 52 transition count 327
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 30 place count 52 transition count 326
Applied a total of 30 rules in 46 ms. Remains 52 /59 variables (removed 7) and now considering 326/355 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 52/59 places, 326/355 transitions.
RANDOM walk for 40000 steps (3776 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (994 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16478 steps, run visited all 1 properties in 82 ms. (steps per millisecond=200 )
Probabilistic random walk after 16478 steps, saw 4231 distinct states, run finished after 89 ms. (steps per millisecond=185 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2024-06-02 22:45:43] [INFO ] Flatten gal took : 49 ms
[2024-06-02 22:45:43] [INFO ] Flatten gal took : 48 ms
[2024-06-02 22:45:43] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 95 out of 228 places (down from 98) after GAL structural reductions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 211 transition count 474
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 211 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 209 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 209 transition count 472
Applied a total of 38 rules in 10 ms. Remains 209 /228 variables (removed 19) and now considering 472/501 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 209/228 places, 472/501 transitions.
[2024-06-02 22:45:43] [INFO ] Flatten gal took : 39 ms
[2024-06-02 22:45:43] [INFO ] Flatten gal took : 37 ms
[2024-06-02 22:45:43] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 9 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-02 22:45:43] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:45:43] [INFO ] Flatten gal took : 33 ms
[2024-06-02 22:45:43] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 220 edges and 228 vertex of which 9 / 228 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 221 transition count 454
Reduce places removed 40 places and 0 transitions.
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 1 with 42 rules applied. Total rules applied 83 place count 181 transition count 452
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 180 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 178 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 88 place count 178 transition count 443
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 102 place count 171 transition count 443
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 121 place count 152 transition count 408
Iterating global reduction 4 with 19 rules applied. Total rules applied 140 place count 152 transition count 408
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 1 rules applied. Total rules applied 141 place count 152 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 151 transition count 407
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 143 place count 150 transition count 405
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 150 transition count 405
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 149 transition count 403
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 149 transition count 403
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 182 place count 131 transition count 385
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 186 place count 127 transition count 353
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 127 transition count 353
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 126 transition count 351
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 126 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 201 place count 126 transition count 342
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 1 rules applied. Total rules applied 202 place count 126 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 203 place count 125 transition count 341
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 213 place count 120 transition count 336
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 214 place count 119 transition count 332
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 119 transition count 332
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 216 place count 118 transition count 330
Iterating global reduction 8 with 1 rules applied. Total rules applied 217 place count 118 transition count 330
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 219 place count 118 transition count 330
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 220 place count 117 transition count 329
Iterating global reduction 8 with 1 rules applied. Total rules applied 221 place count 117 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 222 place count 117 transition count 328
Applied a total of 222 rules in 96 ms. Remains 117 /228 variables (removed 111) and now considering 328/501 (removed 173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 117/228 places, 328/501 transitions.
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:45:44] [INFO ] Input system was already deterministic with 328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 205 transition count 464
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 205 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 203 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 203 transition count 462
Applied a total of 50 rules in 10 ms. Remains 203 /228 variables (removed 25) and now considering 462/501 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 203/228 places, 462/501 transitions.
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:45:44] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 249 edges and 228 vertex of which 13 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 217 transition count 441
Reduce places removed 49 places and 0 transitions.
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 1 with 53 rules applied. Total rules applied 103 place count 168 transition count 437
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 166 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 165 transition count 436
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 107 place count 165 transition count 428
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 123 place count 157 transition count 428
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 146 place count 134 transition count 387
Iterating global reduction 4 with 23 rules applied. Total rules applied 169 place count 134 transition count 387
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 1 rules applied. Total rules applied 170 place count 134 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 133 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 171 place count 133 transition count 385
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 173 place count 132 transition count 385
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 131 transition count 383
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 130 transition count 381
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 130 transition count 381
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 213 place count 112 transition count 363
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 218 place count 107 transition count 329
Iterating global reduction 6 with 5 rules applied. Total rules applied 223 place count 107 transition count 329
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 106 transition count 327
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 106 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 237 place count 106 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 237 place count 106 transition count 313
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 241 place count 104 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 253 place count 98 transition count 307
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 255 place count 96 transition count 299
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 96 transition count 299
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 259 place count 94 transition count 295
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 94 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 93 transition count 294
Applied a total of 262 rules in 71 ms. Remains 93 /228 variables (removed 135) and now considering 294/501 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 93/228 places, 294/501 transitions.
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:45:44] [INFO ] Input system was already deterministic with 294 transitions.
RANDOM walk for 40000 steps (6875 resets) in 370 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1985 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4254 steps, run visited all 1 properties in 15 ms. (steps per millisecond=283 )
Probabilistic random walk after 4254 steps, saw 1720 distinct states, run finished after 15 ms. (steps per millisecond=283 ) properties seen :1
FORMULA MedleyA-PT-18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 233 edges and 228 vertex of which 8 / 228 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 221 transition count 448
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 49 rules applied. Total rules applied 96 place count 175 transition count 445
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 174 transition count 442
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 103 place count 171 transition count 442
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 103 place count 171 transition count 434
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 119 place count 163 transition count 434
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 138 place count 144 transition count 400
Iterating global reduction 4 with 19 rules applied. Total rules applied 157 place count 144 transition count 400
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 1 rules applied. Total rules applied 158 place count 144 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 143 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 159 place count 143 transition count 398
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 142 transition count 398
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 141 transition count 396
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 141 transition count 396
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 140 transition count 394
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 140 transition count 394
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 203 place count 121 transition count 375
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 208 place count 116 transition count 341
Iterating global reduction 6 with 5 rules applied. Total rules applied 213 place count 116 transition count 341
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 214 place count 115 transition count 339
Iterating global reduction 6 with 1 rules applied. Total rules applied 215 place count 115 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 226 place count 115 transition count 328
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 226 place count 115 transition count 327
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 228 place count 114 transition count 327
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 240 place count 108 transition count 321
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 242 place count 106 transition count 313
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 106 transition count 313
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 246 place count 104 transition count 309
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 104 transition count 309
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 104 transition count 309
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 103 transition count 308
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 103 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 102 transition count 307
Applied a total of 252 rules in 76 ms. Remains 102 /228 variables (removed 126) and now considering 307/501 (removed 194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 102/228 places, 307/501 transitions.
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:45:44] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 206 transition count 466
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 206 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 204 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 204 transition count 464
Applied a total of 48 rules in 11 ms. Remains 204 /228 variables (removed 24) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 204/228 places, 464/501 transitions.
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:45:44] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:45:44] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 10 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 460
Applied a total of 52 rules in 9 ms. Remains 202 /228 variables (removed 26) and now considering 460/501 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 202/228 places, 460/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 9 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 246 edges and 228 vertex of which 13 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 217 transition count 439
Reduce places removed 51 places and 0 transitions.
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 1 with 55 rules applied. Total rules applied 107 place count 166 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 164 transition count 435
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 109 place count 164 transition count 426
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 127 place count 155 transition count 426
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 149 place count 133 transition count 387
Iterating global reduction 3 with 22 rules applied. Total rules applied 171 place count 133 transition count 387
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 3 with 1 rules applied. Total rules applied 172 place count 133 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 132 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 173 place count 132 transition count 385
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 175 place count 131 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 130 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 130 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 129 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 129 transition count 381
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 215 place count 111 transition count 363
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 220 place count 106 transition count 329
Iterating global reduction 5 with 5 rules applied. Total rules applied 225 place count 106 transition count 329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 226 place count 105 transition count 327
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 105 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 239 place count 105 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 239 place count 105 transition count 313
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 243 place count 103 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 255 place count 97 transition count 307
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 257 place count 95 transition count 299
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 95 transition count 299
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 261 place count 93 transition count 295
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 93 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 92 transition count 294
Applied a total of 264 rules in 66 ms. Remains 92 /228 variables (removed 136) and now considering 294/501 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 92/228 places, 294/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Graph (trivial) has 249 edges and 228 vertex of which 13 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 217 transition count 439
Reduce places removed 51 places and 0 transitions.
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 1 with 55 rules applied. Total rules applied 107 place count 166 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 164 transition count 435
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 109 place count 164 transition count 426
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 127 place count 155 transition count 426
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 149 place count 133 transition count 387
Iterating global reduction 3 with 22 rules applied. Total rules applied 171 place count 133 transition count 387
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 3 with 1 rules applied. Total rules applied 172 place count 133 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 132 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 173 place count 132 transition count 385
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 175 place count 131 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 130 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 130 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 129 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 129 transition count 381
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 215 place count 111 transition count 363
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 220 place count 106 transition count 329
Iterating global reduction 5 with 5 rules applied. Total rules applied 225 place count 106 transition count 329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 226 place count 105 transition count 327
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 105 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 240 place count 105 transition count 314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 240 place count 105 transition count 312
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 103 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 256 place count 97 transition count 306
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 258 place count 95 transition count 298
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 95 transition count 298
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 93 transition count 294
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 93 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 92 transition count 293
Applied a total of 265 rules in 65 ms. Remains 92 /228 variables (removed 136) and now considering 293/501 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 92/228 places, 293/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 293 transitions.
RANDOM walk for 124 steps (24 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 460
Applied a total of 52 rules in 9 ms. Remains 202 /228 variables (removed 26) and now considering 460/501 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 202/228 places, 460/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 203 transition count 460
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 201 transition count 458
Applied a total of 54 rules in 9 ms. Remains 201 /228 variables (removed 27) and now considering 458/501 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 201/228 places, 458/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:45:45] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 207 transition count 465
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 207 transition count 465
Applied a total of 42 rules in 6 ms. Remains 207 /228 variables (removed 21) and now considering 465/501 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 207/228 places, 465/501 transitions.
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:45:45] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:45:46] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 204 transition count 462
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 202 transition count 460
Applied a total of 52 rules in 10 ms. Remains 202 /228 variables (removed 26) and now considering 460/501 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 202/228 places, 460/501 transitions.
[2024-06-02 22:45:46] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:45:46] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:45:46] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-02 22:45:46] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:45:46] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:45:46] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-02 22:45:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 501 transitions and 2352 arcs took 6 ms.
Total runtime 106590 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-18

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 990
MODEL NAME: /home/mcc/execution/412/model
228 places, 501 transitions.

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

BK_STOP 1717369715686

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-18"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-18, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919700137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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