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.r530-tall-171683778800198.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-040B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683778800198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 686K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717223640161

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:34:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 06:34:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:34:01] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-06-01 06:34:01] [INFO ] Transformed 2803 places.
[2024-06-01 06:34:01] [INFO ] Transformed 2603 transitions.
[2024-06-01 06:34:01] [INFO ] Found NUPN structural information;
[2024-06-01 06:34:01] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 387 ms.
Structural test allowed to assert that 1122 places are NOT stable. Took 23 ms.
RANDOM walk for 40000 steps (8 resets) in 4864 ms. (8 steps per ms) remains 822/1681 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 822/822 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 822/822 properties
// Phase 1: matrix 2603 rows 2803 cols
[2024-06-01 06:34:03] [INFO ] Computed 361 invariants in 45 ms
Error getting values : (error "ParserException while parsing response: ((s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s95 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s104 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s129 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s138 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s154 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s228 (/ 1.0 2.0))
(s229 (/ 1.0 2.0))
(s230 (/ 1.0 2.0))
(s231 (/ 1.0 2.0))
(s232 (/ 1.0 2.0))
(s233 (/ 1.0 2.0))
(s234 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s265 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s287 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s290 (/ 1.0 2.0))
(s291 (/ 1.0 2.0))
(s292 (/ 1.0 2.0))
(s297 (/ 1.0 2.0))
(s298 (/ 1.0 2.0))
(s299 (/ 1.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 1.0 2.0))
(s302 (/ 1.0 2.0))
(s303 (/ 1.0 2.0))
(s304 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 1.0 2.0))
(s313 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s316 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s333 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s341 (/ 1.0 2.0))
(s342 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s347 (/ 1.0 2.0))
(s348 (/ 1.0 2.0))
(s349 (/ 1.0 2.0))
(s350 (/ 1.0 2.0))
(s351 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s358 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s360 (/ 1.0 2.0))
(s361 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s367 (/ 1.0 2.0))
(s368 (/ 1.0 2.0))
(s369 (/ 1.0 2.0))
(s370 (/ 1.0 2.0))
(s371 (/ 1.0 2.0))
(s372 (/ 1.0 2.0))
(s373 (/ 1.0 2.0))
(s378 (/ 1.0 2.0))
(s379 (/ 1.0 2.0))
(s380 (/ 1.0 2.0))
(s381 (/ 1.0 2.0))
(s382 (/ 1.0 2.0))
(s383 (/ 1.0 2.0))
(s384 (/ 1.0 2.0))
(s385 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s398 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s401 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s413 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s419 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s426 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s453 (/ 1.0 2.0))
(s454 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s469 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s476 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s487 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s494 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s510 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s520 (/ 1.0 2.0))
(s521 (/ 1.0 2.0))
(s522 (/ 1.0 2.0))
(s523 (/ 1.0 2.0))
(s535 (/ 1.0 2.0))
(s536 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s540 (/ 1.0 2.0))
(s541 (/ 1.0 2.0))
(s542 (/ 1.0 2.0))
(s543 (/ 1.0 2.0))
(s545 (/ 1.0 2.0))
(s546 (/ 1.0 2.0))
(s548 (/ 1.0 2.0))
(s549 (/ 1.0 2.0))
(s551 (/ 1.0 2.0))
(s552 (/ 1.0 2.0))
(s553 (/ 1.0 2.0))
(s554 (/ 1.0 2.0))
(s555 (/ 1.0 2.0))
(s556 (/ 1.0 2.0))
(s557 (/ 1.0 2.0))
(s558 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 (/ 1.0 2.0))
(s568 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 (/ 1.0 2.0))
(s579 (/ 1.0 2.0))
(s580 (/ 1.0 2.0))
(s585 (/ 1.0 2.0))
(s586 (/ 1.0 2.0))
(s587 (/ 1.0 2.0))
(s588 (/ 1.0 2.0))
(s589 (/ 1.0 2.0))
(s590 (/ 1.0 2.0))
(s591 (/ 1.0 2.0))
(s592 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s605 (/ 1.0 2.0))
(s607 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s609 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s614 (/ 1.0 2.0))
(s615 (/ 1.0 2.0))
(s617 (/ 1.0 2.0))
(s618 (/ 1.0 2.0))
(s620 (/ 1.0 2.0))
(s621 (/ 1.0 2.0))
(s622 (/ 1.0 2.0))
(s623 (/ 1.0 2.0))
(s624 (/ 1.0 2.0))
(s625 (/ 1.0 2.0))
(s626 (/ 1.0 2.0))
(s627 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 822/822 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/5406 variables, and 822 constraints, problems are : Problem set: 0 solved, 822 unsolved in 5120 ms.
Refiners :[Domain max(s): 822/2803 constraints, Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2803 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 822/822 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Error getting values : (error "ParserException while parsing response: ((s41 1)
(s42 1)
(s52 1)
(s53 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s62 1)
(s63 1)
(s65 1)
(s66 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s121 1)
(s122 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s131 1)
(s132 1)
(s134 1)
(s135 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s190 1)
(s191 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s200 1)
(s201 1)
(s203 1)
(s204 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s259 1)
(s260 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s269 1)
(s270 1)
(s272 1)
(s273 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s328 1)
(s329 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s338 1)
(s339 1)
(s341 1)
(s342 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s397 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/5406 variables, and 822 constraints, problems are : Problem set: 0 solved, 822 unsolved in 5020 ms.
Refiners :[Domain max(s): 822/2803 constraints, Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2803 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 0/0 constraints]
After SMT, in 10538ms problems are : Problem set: 0 solved, 822 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 822 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 497 rules applied. Total rules applied 497 place count 2803 transition count 2106
Reduce places removed 497 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 499 rules applied. Total rules applied 996 place count 2306 transition count 2104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 997 place count 2305 transition count 2104
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 997 place count 2305 transition count 2016
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1173 place count 2217 transition count 2016
Discarding 138 places :
Symmetric choice reduction at 3 with 138 rule applications. Total rules 1311 place count 2079 transition count 1878
Iterating global reduction 3 with 138 rules applied. Total rules applied 1449 place count 2079 transition count 1878
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 1449 place count 2079 transition count 1823
Deduced a syphon composed of 55 places in 18 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 1559 place count 2024 transition count 1823
Performed 584 Post agglomeration using F-continuation condition.Transition count delta: 584
Deduced a syphon composed of 584 places in 5 ms
Reduce places removed 584 places and 0 transitions.
Iterating global reduction 3 with 1168 rules applied. Total rules applied 2727 place count 1440 transition count 1239
Renaming transitions due to excessive name length > 1024 char.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 53 places in 5 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 2833 place count 1387 transition count 1271
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2834 place count 1387 transition count 1270
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 2849 place count 1387 transition count 1255
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 2864 place count 1372 transition count 1255
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 2886 place count 1372 transition count 1255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2887 place count 1371 transition count 1254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2889 place count 1369 transition count 1254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2889 place count 1369 transition count 1253
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2891 place count 1368 transition count 1253
Applied a total of 2891 rules in 917 ms. Remains 1368 /2803 variables (removed 1435) and now considering 1253/2603 (removed 1350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 928 ms. Remains : 1368/2803 places, 1253/2603 transitions.
RANDOM walk for 2105651 steps (4 resets) in 120004 ms. (17 steps per ms) remains 612/822 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 612/612 properties
// Phase 1: matrix 1253 rows 1368 cols
[2024-06-01 06:34:46] [INFO ] Computed 359 invariants in 4 ms
[2024-06-01 06:34:46] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 174/786 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 3 (OVERLAPS) 718/1504 variables, 786/925 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/2621 variables, and 925 constraints, problems are : Problem set: 0 solved, 612 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 139/359 constraints, State Equation: 786/1368 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 174/786 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 20 ms to minimize.
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:35:41] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 5 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 4 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:35:47] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 4 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 4 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 4 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 4 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 4 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 4 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 176 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/786 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:35:57] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 4 ms to minimize.
[2024-06-01 06:35:57] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:36:00] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:36:04] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 4 ms to minimize.
[2024-06-01 06:36:06] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 4 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/786 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 5 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/2621 variables, and 176 constraints, problems are : Problem set: 0 solved, 612 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 139/359 constraints, State Equation: 0/1368 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/612 constraints, Known Traps: 37/37 constraints]
After SMT, in 90224ms problems are : Problem set: 0 solved, 612 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 612 out of 1368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1368/1368 places, 1253/1253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 1368 transition count 1197
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 1312 transition count 1197
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 112 place count 1312 transition count 1179
Deduced a syphon composed of 18 places in 9 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 148 place count 1294 transition count 1179
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 154 place count 1288 transition count 1173
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 1288 transition count 1173
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 160 place count 1288 transition count 1167
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 172 place count 1282 transition count 1167
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 288 place count 1224 transition count 1109
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 314 place count 1211 transition count 1115
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 1211 transition count 1113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 318 place count 1209 transition count 1113
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 1209 transition count 1113
Applied a total of 319 rules in 238 ms. Remains 1209 /1368 variables (removed 159) and now considering 1113/1253 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 1209/1368 places, 1113/1253 transitions.
RANDOM walk for 2646797 steps (5 resets) in 120004 ms. (22 steps per ms) remains 550/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 550/550 properties
// Phase 1: matrix 1113 rows 1209 cols
[2024-06-01 06:36:47] [INFO ] Computed 359 invariants in 3 ms
[2024-06-01 06:36:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 149/699 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 643/1342 variables, 699/825 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1342 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (OVERLAPS) 67/1409 variables, 34/859 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1409 variables, 8/867 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1409/2322 variables, and 867 constraints, problems are : Problem set: 0 solved, 550 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 134/359 constraints, State Equation: 733/1209 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 149/699 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-01 06:38:08] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-06-01 06:38:14] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:38:15] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:38:16] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:38:17] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:38:17] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:38:18] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 4 ms to minimize.
[2024-06-01 06:38:19] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-01 06:38:22] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:38:23] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 3 ms to minimize.
[2024-06-01 06:38:23] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 4 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 196 places in 143 ms of which 4 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 3 ms to minimize.
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 3 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 550 unsolved
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 7 (OVERLAPS) 643/1342 variables, 699/878 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/2322 variables, and 1428 constraints, problems are : Problem set: 0 solved, 550 unsolved in 75033 ms.
Refiners :[Positive P Invariants (semi-flows): 126/359 constraints, State Equation: 699/1209 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 53/53 constraints]
After SMT, in 150187ms problems are : Problem set: 0 solved, 550 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 550 out of 1209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1209/1209 places, 1113/1113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1209 transition count 1101
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1197 transition count 1101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 24 place count 1197 transition count 1094
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 38 place count 1190 transition count 1094
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 76 place count 1171 transition count 1075
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 1167 transition count 1076
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 1167 transition count 1074
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 1165 transition count 1074
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 1165 transition count 1074
Applied a total of 89 rules in 96 ms. Remains 1165 /1209 variables (removed 44) and now considering 1074/1113 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1165/1209 places, 1074/1113 transitions.
RANDOM walk for 1514153 steps (4 resets) in 120004 ms. (12 steps per ms) remains 497/550 properties
BEST_FIRST walk for 40004 steps (8 resets) in 554 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 624 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 635 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 620 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 658 ms. (60 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 661 ms. (60 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 647 ms. (61 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40002 steps (8 resets) in 612 ms. (65 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 620 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 599 ms. (66 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40001 steps (8 resets) in 636 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 637 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 584 ms. (68 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 696 ms. (57 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 583 ms. (68 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 728 ms. (54 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 569 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 670 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 737 ms. (54 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 565 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 672 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 655 ms. (60 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 666 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 610 ms. (65 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 655 ms. (60 steps per ms) remains 497/497 properties
// Phase 1: matrix 1074 rows 1165 cols
[2024-06-01 06:39:57] [INFO ] Computed 359 invariants in 3 ms
[2024-06-01 06:39:57] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 131/628 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (OVERLAPS) 576/1204 variables, 628/742 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1204 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (OVERLAPS) 69/1273 variables, 31/773 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 7/780 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 8 (OVERLAPS) 13/1286 variables, 8/788 constraints. Problems are: Problem set: 0 solved, 497 unsolved
SMT process timed out in 90107ms, After SMT, problems are : Problem set: 0 solved, 497 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 497 out of 1165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1165/1165 places, 1074/1074 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1165 transition count 1064
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1155 transition count 1064
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 20 place count 1155 transition count 1058
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 1149 transition count 1058
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 72 place count 1129 transition count 1038
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1127 transition count 1039
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1127 transition count 1037
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 1125 transition count 1037
Applied a total of 80 rules in 74 ms. Remains 1125 /1165 variables (removed 40) and now considering 1037/1074 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1125/1165 places, 1037/1074 transitions.
RANDOM walk for 1502867 steps (4 resets) in 120004 ms. (12 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 666 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 675 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 666 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 604 ms. (66 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 658 ms. (60 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 715 ms. (55 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 605 ms. (66 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 636 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 639 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 600 ms. (66 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 679 ms. (58 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 557 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 694 ms. (57 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 721 ms. (55 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 636 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 673 ms. (59 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 651 ms. (61 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 632 ms. (63 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 704 ms. (56 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 742 ms. (53 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 763 ms. (52 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 776 ms. (51 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 578 ms. (69 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 695 ms. (57 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 497/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 497/497 properties
Interrupted probabilistic random walk after 1991916 steps, run timeout after 117001 ms. (steps per millisecond=17 ) properties seen :0 out of 497
Probabilistic random walk after 1991916 steps, saw 1566217 distinct states, run finished after 117010 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 1037 rows 1125 cols
[2024-06-01 06:44:03] [INFO ] Computed 359 invariants in 6 ms
[2024-06-01 06:44:03] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 111/608 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (OVERLAPS) 558/1166 variables, 608/722 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1166 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (OVERLAPS) 61/1227 variables, 30/752 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1227 variables, 12/764 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1227 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 8 (OVERLAPS) 3/1230 variables, 3/767 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1230 variables, 3/770 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1230 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 497 unsolved
SMT process timed out in 105100ms, After SMT, problems are : Problem set: 0 solved, 497 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 497 out of 1125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1125/1125 places, 1037/1037 transitions.
Applied a total of 0 rules in 17 ms. Remains 1125 /1125 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1125/1125 places, 1037/1037 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1125/1125 places, 1037/1037 transitions.
Applied a total of 0 rules in 15 ms. Remains 1125 /1125 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
[2024-06-01 06:45:48] [INFO ] Invariant cache hit.
[2024-06-01 06:45:49] [INFO ] Implicit Places using invariants in 370 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1124/1125 places, 1037/1037 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1123 transition count 1036
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1123 transition count 1036
Applied a total of 2 rules in 23 ms. Remains 1123 /1124 variables (removed 1) and now considering 1036/1037 (removed 1) transitions.
// Phase 1: matrix 1036 rows 1123 cols
[2024-06-01 06:45:49] [INFO ] Computed 358 invariants in 3 ms
[2024-06-01 06:45:49] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-01 06:45:49] [INFO ] Invariant cache hit.
[2024-06-01 06:45:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:45:50] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1123/1125 places, 1036/1037 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1705 ms. Remains : 1123/1125 places, 1036/1037 transitions.
RANDOM walk for 1635116 steps (4 resets) in 120004 ms. (13 steps per ms) remains 490/497 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 726 ms. (55 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 643 ms. (62 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 630 ms. (63 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 553 ms. (72 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 653 ms. (61 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 722 ms. (55 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 712 ms. (56 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 635 ms. (62 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 492 ms. (81 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 700 ms. (57 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 688 ms. (58 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 540 ms. (73 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 719 ms. (55 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 624 ms. (64 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 554 ms. (72 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 744 ms. (53 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40002 steps (8 resets) in 531 ms. (75 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 540 ms. (73 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40002 steps (8 resets) in 584 ms. (68 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 701 ms. (56 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 575 ms. (69 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40002 steps (8 resets) in 571 ms. (69 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 609 ms. (65 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40002 steps (8 resets) in 563 ms. (70 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 654 ms. (61 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 634 ms. (62 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 490/490 properties
BEST_FIRST walk for 40003 steps (8 resets) in 627 ms. (63 steps per ms) remains 490/490 properties
Interrupted probabilistic random walk after 1897018 steps, run timeout after 114001 ms. (steps per millisecond=16 ) properties seen :0 out of 490
Probabilistic random walk after 1897018 steps, saw 1506065 distinct states, run finished after 114002 ms. (steps per millisecond=16 ) properties seen :0
[2024-06-01 06:48:23] [INFO ] Invariant cache hit.
[2024-06-01 06:48:23] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 104/594 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (OVERLAPS) 539/1133 variables, 594/704 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1133 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (OVERLAPS) 25/1158 variables, 14/718 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1158 variables, 6/724 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1158 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 8 (OVERLAPS) 1/1159 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1159 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1159 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 11 (OVERLAPS) 2/1161 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1161 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 120099ms, After SMT, problems are : Problem set: 0 solved, 490 unsolved
Fused 490 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 490 out of 1123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1123/1123 places, 1036/1036 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 1 place count 1123 transition count 1035
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1122 transition count 1035
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1119 transition count 1032
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1117 transition count 1033
Applied a total of 12 rules in 38 ms. Remains 1117 /1123 variables (removed 6) and now considering 1033/1036 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1117/1123 places, 1033/1036 transitions.
RANDOM walk for 1574661 steps (4 resets) in 120004 ms. (13 steps per ms) remains 391/490 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 522 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 586 ms. (68 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 519 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 545 ms. (73 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 477 ms. (83 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40002 steps (8 resets) in 526 ms. (75 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40002 steps (8 resets) in 612 ms. (65 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 569 ms. (70 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 664 ms. (60 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 536 ms. (74 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 511 ms. (78 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 594 ms. (67 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 524 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 522 ms. (76 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40002 steps (8 resets) in 516 ms. (77 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 587 ms. (68 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 656 ms. (60 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40003 steps (8 resets) in 493 ms. (80 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 661 ms. (60 steps per ms) remains 391/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 391/391 properties
// Phase 1: matrix 1033 rows 1117 cols
[2024-06-01 06:51:01] [INFO ] Computed 358 invariants in 3 ms
[2024-06-01 06:51:01] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 125/516 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 475/991 variables, 516/607 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/991 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 41/1032 variables, 24/631 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 5/636 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1032 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 9/1041 variables, 5/641 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1041 variables, 7/648 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1041 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 11 (OVERLAPS) 19/1060 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1060 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 13 (OVERLAPS) 13/1073 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1073 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1073 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 16 (OVERLAPS) 18/1091 variables, 17/678 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 19 (OVERLAPS) 3/1094 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1094 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 1.0 228.0))
(t1 (/ 11.0 114.0))
(t2 (/ 1.0 228.0))
(t3 (/ 1.0 228.0))
(t4 (/ 1.0 228.0))
(t5 (/ 1.0 228.0))
(t6 (/ 1.0 228.0))
(t7 (/ 1.0 228.0))
(t8 (/ 1.0 228.0))
(t9 (/ 1.0 228.0))
(t10 0.0)
(t11 1.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 1.0)
(t36 0.0)
(t37 1.0)
(t38 1.0)
(t39 1.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 1.0)
(t44 0.0)
(t45 2.0)
(t48 1.0)
(t49 (/ 1.0 228.0))
(t50 0.0)
(t51 (/ 1.0 38.0))
(t52 0.0)
(t53 0.0)
(t54 1.0)
(t55 (/ 227.0 228.0))
(t56 (/ 227.0 228.0))
(t57 0.0)
(t58 (/ 1.0 228.0))
(t59 0.0)
(t60 0.0)
(t61 (/ 227.0 228.0))
(t62 (/ 113.0 114.0))
(t63 (/ 113.0 114.0))
(t64 0.0)
(t65 (/ 1.0 228.0))
(t66 0.0)
(t67 (/ 227.0 228.0))
(t68 0.0)
(t69 (/ 227.0 228.0))
(t70 0.0)
(t71 0.0)
(t72 (/ 1.0 38.0))
(t73 (/ 1.0 38.0))
(t74 (/ 1.0 38.0))
(t75 (/ 1.0 38.0))
(t76 (/ 1.0 38.0))
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 (/ 1.0 57.0))
(t81 (/ 5.0 228.0))
(t82 (/ 1.0 57.0))
(t83 (/ 1.0 57.0))
(t84 0.0)
(t85 (/ 1.0 228.0))
(t86 0.0)
(t87 (/ 1.0 228.0))
(t88 (/ 1.0 38.0))
(t89 (/ 1.0 38.0))
(t90 (/ 5.0 228.0))
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 (/ 1.0 114.0))
(t96 (/ 1.0 114.0))
(t97 (/ 1.0 114.0))
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 (/ 1.0 114.0))
(t102 0.0)
(t103 0.0)
(t104 (/ 1.0 76.0))
(t105 0.0)
(t106 0.0)
(t107 (/ 1.0 57.0))
(t108 (/ 7.0 228.0))
(t109 (/ 1.0 38.0))
(t110 (/ 1.0 38.0))
(t111 (/ 1.0 38.0))
(t112 (/ 1.0 228.0))
(t113 0.0)
(t114 (/ 1.0 76.0))
(t115 (/ 1.0 57.0))
(t116 (/ 1.0 57.0))
(t117 (/ 1.0 57.0))
(t118 (/ 1.0 76.0))
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 (/ 1.0 38.0))
(t124 (/ 1.0 38.0))
(t125 (/ 5.0 228.0))
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 (/ 1.0 76.0))
(t130 (/ 1.0 57.0))
(t131 (/ 1.0 57.0))
(t132 (/ 1.0 76.0))
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 (/ 1.0 114.0))
(t137 0.0)
(t138 0.0)
(t139 (/ 1.0 76.0))
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 (/ 119.0 114.0))
(t144 (/ 59.0 57.0))
(t145 (/ 235.0 228.0))
(t146 (/ 13.0 228.0))
(t147 (/ 1.0 228.0))
(t148 0.0)
(t149 (/ 239.0 228.0))
(t150 0.0)
(t151 (/ 56.0 57.0))
(t152 (/ 37.0 38.0))
(t153 (/ 221.0 228.0))
(t154 0.0)
(t155 (/ 1.0 228.0))
(t156 0.0)
(t157 (/ 75.0 76.0))
(t158 (/ 58.0 57.0))
(t159 (/ 115.0 114.0))
(t160 (/ 229.0 228.0))
(t161 (/ 5.0 228.0))
(t162 (/ 1.0 228.0))
(t163 0.0)
(t164 (/ 239.0 228.0))
(t165 (/ 119.0 114.0))
(t166 (/ 59.0 57.0))
(t167 (/ 235.0 228.0))
(t168 (/ 7.0 114.0))
(t169 (/ 1.0 228.0))
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 (/ 13.0 228.0))
(t174 (/ 227.0 228.0))
(t175 0.0)
(t176 (/ 58.0 57.0))
(t177 (/ 109.0 114.0))
(t178 (/ 119.0 114.0))
(t179 (/ 59.0 57.0))
(t180 (/ 235.0 228.0))
(t181 (/ 13.0 228.0))
(t182 (/ 1.0 228.0))
(t183 0.0)
(t184 (/ 7.0 76.0))
(t185 (/ 109.0 114.0))
(t186 (/ 245.0 228.0))
(t187 (/ 81.0 76.0))
(t188 (/ 121.0 114.0))
(t189 (/ 5.0 57.0))
(t190 (/ 1.0 228.0))
(t191 0.0)
(t192 (/ 7.0 57.0))
(t193 (/ 58.0 57.0))
(t194 (/ 115.0 114.0))
(t195 (/ 229.0 228.0))
(t196 (/ 5.0 228.0))
(t197 (/ 1.0 228.0))
(t198 0.0)
(t199 (/ 7.0 76.0))
(t200 (/ 245.0 228.0))
(t201 (/ 81.0 76.0))
(t202 (/ 121.0 114.0))
(t203 (/ 5.0 57.0))
(t204 (/ 1.0 228.0))
(t205 0.0)
(t206 (/ 75.0 76.0))
(t207 0.0)
(t208 0.0)
(t209 (/ 227.0 228.0))
(t210 0.0)
(t211 (/ 1.0 38.0))
(t212 (/ 239.0 228.0))
(t213 (/ 119.0 114.0))
(t214 (/ 59.0 57.0))
(t215 (/ 235.0 228.0))
(t216 (/ 13.0 228.0))
(t217 (/ 1.0 228.0))
(t218 0.0)
(t219 0.0)
(t220 (/ 5.0 57.0))
(t221 (/ 1.0 12.0))
(t222 (/ 1.0 57.0))
(t223 (/ 1.0 76.0))
(t224 (/ 1.0 228.0))
(t225 (/ 7.0 114.0))
(t226 (/ 13.0 228.0))
(t227 0.0)
(t228 (/ 58.0 57.0))
(t229 (/ 115.0 114.0))
(t230 (/ 229.0 228.0))
(t231 (/ 5.0 228.0))
(t232 (/ 1.0 228.0))
(t233 0.0)
(t234 0.0)
(t235 (/ 9.0 76.0))
(t236 (/ 25.0 228.0))
(t237 (/ 2.0 19.0))
(t238 0.0)
(t239 (/ 1.0 228.0))
(t240 0.0)
(t241 (/ 7.0 57.0))
(t242 (/ 13.0 228.0))
(t243 0.0)
(t244 (/ 227.0 228.0))
(t245 0.0)
(t246 (/ 1.0 38.0))
(t247 0.0)
(t248 (/ 119.0 114.0))
(t249 (/ 59.0 57.0))
(t250 (/ 235.0 228.0))
(t251 (/ 13.0 228.0))
(t252 (/ 1.0 228.0))
(t253 0.0)
(t254 (/ 239.0 228.0))
(t255 0.0)
(t256 (/ 56.0 57.0))
(t257 (/ 37.0 38.0))
(t258 (/ 221.0 228.0))
(t259 0.0)
(t260 (/ 1.0 228.0))
(t261 0.0)
(t262 (/ 75.0 76.0))
(t263 (/ 58.0 57.0))
(t264 (/ 115.0 114.0))
(t265 (/ 229.0 228.0))
(t266 (/ 5.0 228.0))
(t267 (/ 1.0 228.0))
(t268 0.0)
(t269 (/ 239.0 228.0))
(t270 (/ 119.0 114.0))
(t271 (/ 1.0 57.0))
(t272 (/ 1.0 76.0))
(t273 0.0)
(t274 (/ 233.0 228.0))
(t275 (/ 7.0 114.0))
(t276 0.0)
(t277 0.0)
(t278 (/ 13.0 228.0))
(t279 (/ 227.0 228.0))
(t280 0.0)
(t281 (/ 58.0 57.0))
(t282 (/ 109.0 114.0))
(t283 (/ 119.0 114.0))
(t284 (/ 59.0 57.0))
(t285 (/ 235.0 228.0))
(t286 (/ 13.0 228.0))
(t287 (/ 1.0 228.0))
(t288 0.0)
(t289 (/ 7.0 76.0))
(t290 (/ 4.0 19.0))
(t291 (/ 4.0 19.0))
(t292 (/ 23.0 114.0))
(t293 (/ 15.0 76.0))
(t294 0.0)
(t295 (/ 1.0 228.0))
(t296 0.0)
(t297 (/ 1.0 228.0))
(t298 (/ 58.0 57.0))
(t299 (/ 115.0 114.0))
(t300 (/ 229.0 228.0))
(t301 (/ 5.0 228.0))
(t302 (/ 1.0 228.0))
(t303 0.0)
(t304 (/ 7.0 76.0))
(t305 (/ 245.0 228.0))
(t306 (/ 81.0 76.0))
(t307 (/ 121.0 114.0))
(t308 (/ 5.0 57.0))
(t309 (/ 1.0 228.0))
(t310 0.0)
(t311 (/ 75.0 76.0))
(t312 0.0)
(t313 0.0)
(t314 (/ 227.0 228.0))
(t315 0.0)
(t316 (/ 1.0 38.0))
(t317 0.0)
(t318 (/ 119.0 114.0))
(t319 (/ 59.0 57.0))
(t320 (/ 235.0 228.0))
(t321 (/ 55.0 228.0))
(t322 (/ 1.0 228.0))
(t323 0.0)
(t324 (/ 239.0 228.0))
(t325 (/ 7.0 38.0))
(t326 (/ 7.0 6.0))
(t327 (/ 22.0 19.0))
(t328 (/ 263.0 228.0))
(t329 (/ 41.0 228.0))
(t330 (/ 1.0 228.0))
(t331 0.0)
(t332 (/ 75.0 76.0))
(t333 (/ 58.0 57.0))
(t334 (/ 115.0 114.0))
(t335 (/ 229.0 228.0))
(t336 (/ 5.0 228.0))
(t337 (/ 1.0 228.0))
(t338 0.0)
(t339 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 135086ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Fused 391 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 391 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 1033/1033 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1117 transition count 1012
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1096 transition count 1012
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 42 place count 1096 transition count 1002
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 62 place count 1086 transition count 1002
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1085 transition count 1001
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1085 transition count 1001
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 1085 transition count 1000
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1084 transition count 1000
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 128 place count 1053 transition count 969
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 1048 transition count 971
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 1048 transition count 967
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 1044 transition count 967
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 1044 transition count 967
Applied a total of 148 rules in 114 ms. Remains 1044 /1117 variables (removed 73) and now considering 967/1033 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1044/1117 places, 967/1033 transitions.
RANDOM walk for 1698291 steps (4 resets) in 120004 ms. (14 steps per ms) remains 389/391 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 519 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 570 ms. (70 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 485 ms. (82 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 621 ms. (64 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 613 ms. (65 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 549 ms. (72 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 575 ms. (69 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 587 ms. (68 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 607 ms. (65 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 597 ms. (66 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 524 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 553 ms. (72 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 584 ms. (68 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 504 ms. (79 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 520 ms. (76 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 500 ms. (79 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 599 ms. (66 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 585 ms. (68 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 576 ms. (69 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40002 steps (8 resets) in 502 ms. (79 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 553 ms. (72 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 389/389 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 389/389 properties
Interrupted probabilistic random walk after 1973063 steps, run timeout after 114001 ms. (steps per millisecond=17 ) properties seen :0 out of 389
Probabilistic random walk after 1973063 steps, saw 1561028 distinct states, run finished after 114001 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 967 rows 1044 cols
[2024-06-01 06:55:48] [INFO ] Computed 358 invariants in 4 ms
[2024-06-01 06:55:48] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 89/478 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (OVERLAPS) 436/914 variables, 478/568 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 32/946 variables, 18/586 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/947 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/947 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/947 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 11 (OVERLAPS) 2/949 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/949 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 13 (OVERLAPS) 18/967 variables, 10/607 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/967 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/967 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 16 (OVERLAPS) 1/968 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/968 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/968 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 19 (OVERLAPS) 17/985 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/985 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/985 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 22 (OVERLAPS) 1/986 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/986 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/986 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 25 (OVERLAPS) 16/1002 variables, 8/636 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SMT process timed out in 150068ms, After SMT, problems are : Problem set: 0 solved, 389 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 389 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 967/967 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 0 with 2 rules applied. Total rules applied 2 place count 1044 transition count 965
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1042 transition count 965
Applied a total of 4 rules in 18 ms. Remains 1042 /1044 variables (removed 2) and now considering 965/967 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1042/1044 places, 965/967 transitions.
RANDOM walk for 3133305 steps (7 resets) in 120004 ms. (26 steps per ms) remains 368/389 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40002 steps (8 resets) in 623 ms. (64 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 710 ms. (56 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 626 ms. (63 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 668 ms. (59 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 578 ms. (69 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 558 ms. (71 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 715 ms. (55 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 560 ms. (71 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 592 ms. (67 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40002 steps (8 resets) in 851 ms. (46 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 635 ms. (62 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 657 ms. (60 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40002 steps (8 resets) in 514 ms. (77 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 536 ms. (74 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 676 ms. (59 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 487 ms. (81 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 461 ms. (86 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 559 ms. (71 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 559 ms. (71 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 490 ms. (81 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40003 steps (8 resets) in 599 ms. (66 steps per ms) remains 368/368 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 368/368 properties
Interrupted probabilistic random walk after 2125770 steps, run timeout after 114001 ms. (steps per millisecond=18 ) properties seen :0 out of 368
Probabilistic random walk after 2125770 steps, saw 1699648 distinct states, run finished after 114003 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 965 rows 1042 cols
[2024-06-01 07:00:51] [INFO ] Computed 358 invariants in 4 ms
[2024-06-01 07:00:51] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 87/455 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 415/870 variables, 455/539 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/870 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 45/915 variables, 21/560 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/915 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 7/922 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/922 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 11 (OVERLAPS) 4/926 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/926 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 14 (OVERLAPS) 29/955 variables, 19/597 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/955 variables, 6/603 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/955 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 17 (OVERLAPS) 3/958 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/958 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/958 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 20 (OVERLAPS) 21/979 variables, 12/617 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/979 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/979 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 23 (OVERLAPS) 1/980 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/980 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/980 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 26 (OVERLAPS) 2/982 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/982 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/982 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 368 unsolved
SMT process timed out in 165075ms, After SMT, problems are : Problem set: 0 solved, 368 unsolved
Fused 368 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 368 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 965/965 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1042 transition count 961
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1038 transition count 961
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 1038 transition count 959
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1036 transition count 959
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 28 place count 1028 transition count 951
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 1028 transition count 950
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 1027 transition count 950
Applied a total of 30 rules in 45 ms. Remains 1027 /1042 variables (removed 15) and now considering 950/965 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1027/1042 places, 950/965 transitions.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-040B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r530-tall-171683778800198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;