Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r032-oct2-167813615900307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r032-oct2-167813615900307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 538K Mar 5 18:22 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678837385561

Running Version 202205111006
[2023-03-14 23:43:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-14 23:43:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 23:43:08] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-03-14 23:43:08] [INFO ] Transformed 2230 places.
[2023-03-14 23:43:08] [INFO ] Transformed 2228 transitions.
[2023-03-14 23:43:08] [INFO ] Found NUPN structural information;
[2023-03-14 23:43:08] [INFO ] Parsed PT model containing 2230 places and 2228 transitions in 600 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 46 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 2832 place count 753 transition count 631
Iterating global reduction 3 with 242 rules applied. Total rules applied 3074 place count 753 transition count 631
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 3074 place count 753 transition count 559
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 3218 place count 681 transition count 559
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3558 place count 511 transition count 389
Applied a total of 3558 rules in 504 ms. Remains 511 /2230 variables (removed 1719) and now considering 389/2228 (removed 1839) transitions.
// Phase 1: matrix 389 rows 511 cols
[2023-03-14 23:43:08] [INFO ] Computed 148 place invariants in 25 ms
[2023-03-14 23:43:11] [INFO ] Implicit Places using invariants in 2620 ms returned [169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 291, 365, 371, 377, 383, 389, 395, 401, 407, 413, 419, 425, 431, 437, 443, 449, 455, 461, 467, 473, 479, 485, 491, 497, 503, 510]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 2655 ms to find 75 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 436/2230 places, 389/2228 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 436 transition count 341
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 388 transition count 341
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 121 place count 363 transition count 316
Iterating global reduction 2 with 25 rules applied. Total rules applied 146 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 362 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 361 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 360 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 359 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 358 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 357 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 356 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 355 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 354 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 353 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 352 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 351 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 350 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 349 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 348 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 347 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 346 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 345 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 344 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 343 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 342 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 341 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 340 transition count 293
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 340 transition count 293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 339 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 339 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 338 transition count 291
Applied a total of 196 rules in 267 ms. Remains 338 /436 variables (removed 98) and now considering 291/389 (removed 98) transitions.
// Phase 1: matrix 291 rows 338 cols
[2023-03-14 23:43:11] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-14 23:43:11] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 291 rows 338 cols
[2023-03-14 23:43:11] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-14 23:43:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-14 23:43:12] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 338/2230 places, 291/2228 transitions.
Finished structural reductions, in 2 iterations. Remains : 338/2230 places, 291/2228 transitions.
Discarding 121 transitions out of 291. Remains 170
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 169) seen :101
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Running SMT prover for 68 properties.
// Phase 1: matrix 291 rows 338 cols
[2023-03-14 23:43:13] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-14 23:43:14] [INFO ] [Real]Absence check using 73 positive place invariants in 30 ms returned sat
[2023-03-14 23:43:17] [INFO ] After 3786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:68
[2023-03-14 23:43:17] [INFO ] [Nat]Absence check using 73 positive place invariants in 27 ms returned sat
[2023-03-14 23:43:20] [INFO ] After 1832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :68
[2023-03-14 23:43:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-14 23:43:22] [INFO ] After 2076ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :68
[2023-03-14 23:43:25] [INFO ] After 5216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :68
Attempting to minimize the solution found.
Minimization took 2051 ms.
[2023-03-14 23:43:27] [INFO ] After 10476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :68
Parikh walk visited 33 properties in 7693 ms.
Support contains 70 out of 338 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 338/338 places, 291/291 transitions.
Free-agglomeration rule applied 82 times.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 338 transition count 209
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 0 with 82 rules applied. Total rules applied 164 place count 256 transition count 209
Applied a total of 164 rules in 25 ms. Remains 256 /338 variables (removed 82) and now considering 209/291 (removed 82) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/338 places, 209/291 transitions.
Interrupted random walk after 871249 steps, including 11445 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 9
Incomplete Best-First random walk after 100001 steps, including 102 resets, run finished after 386 ms. (steps per millisecond=259 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 104 resets, run finished after 408 ms. (steps per millisecond=245 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 102 resets, run finished after 504 ms. (steps per millisecond=198 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100000 steps, including 103 resets, run finished after 398 ms. (steps per millisecond=251 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 101 resets, run finished after 434 ms. (steps per millisecond=230 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 105 resets, run finished after 382 ms. (steps per millisecond=261 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 92 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 323 ms. (steps per millisecond=309 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 92 resets, run finished after 330 ms. (steps per millisecond=303 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 320 ms. (steps per millisecond=312 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100000 steps, including 87 resets, run finished after 321 ms. (steps per millisecond=311 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 322 ms. (steps per millisecond=310 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 324 ms. (steps per millisecond=308 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 319 ms. (steps per millisecond=313 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 92 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 312 ms. (steps per millisecond=320 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 322 ms. (steps per millisecond=310 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 209 rows 256 cols
[2023-03-14 23:44:14] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-14 23:44:14] [INFO ] [Real]Absence check using 73 positive place invariants in 96 ms returned sat
[2023-03-14 23:44:16] [INFO ] After 1917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-14 23:44:16] [INFO ] [Nat]Absence check using 73 positive place invariants in 20 ms returned sat
[2023-03-14 23:44:17] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-14 23:44:17] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-14 23:44:17] [INFO ] After 524ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-14 23:44:18] [INFO ] After 1478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-14 23:44:19] [INFO ] After 2883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 6 properties in 1049 ms.
Support contains 40 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 209/209 transitions.
Interrupted random walk after 927520 steps, including 12255 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 94 resets, run finished after 330 ms. (steps per millisecond=303 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 97 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 97 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 329 ms. (steps per millisecond=303 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 330 ms. (steps per millisecond=303 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 338 ms. (steps per millisecond=295 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 338 ms. (steps per millisecond=295 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 96 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 94 resets, run finished after 400 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 93 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 96 resets, run finished after 362 ms. (steps per millisecond=276 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100000 steps, including 94 resets, run finished after 417 ms. (steps per millisecond=239 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 413 ms. (steps per millisecond=242 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 330 ms. (steps per millisecond=303 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 334 ms. (steps per millisecond=299 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 18903000 steps, run timeout after 108001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 18903000 steps, saw 2470512 distinct states, run finished after 108004 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 209 rows 256 cols
[2023-03-14 23:46:45] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-14 23:46:45] [INFO ] [Real]Absence check using 73 positive place invariants in 11 ms returned sat
[2023-03-14 23:46:46] [INFO ] After 941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:46:46] [INFO ] [Nat]Absence check using 73 positive place invariants in 34 ms returned sat
[2023-03-14 23:46:47] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-14 23:46:47] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-14 23:46:47] [INFO ] After 616ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-14 23:46:48] [INFO ] After 1498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 470 ms.
[2023-03-14 23:46:49] [INFO ] After 2965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 873 ms.
Support contains 40 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 209/209 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 256 cols
[2023-03-14 23:46:49] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-14 23:46:50] [INFO ] Implicit Places using invariants in 219 ms returned [1, 2, 6, 7, 11, 12, 16, 17, 21, 22, 26, 27, 31, 32, 36, 37, 41, 42, 46, 47, 51, 52, 56, 57, 61, 62, 66, 67, 71, 72, 76, 77, 81, 82, 86, 87, 91, 92, 96, 97, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 233 ms to find 52 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 204/256 places, 209/209 transitions.
Graph (trivial) has 107 edges and 204 vertex of which 25 / 204 are part of one of the 1 SCC in 4 ms
Free SCC test removed 24 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions 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 57 place count 180 transition count 105
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 124 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 113 place count 124 transition count 104
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 123 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 122 transition count 104
Applied a total of 117 rules in 16 ms. Remains 122 /204 variables (removed 82) and now considering 104/209 (removed 105) transitions.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:46:50] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:46:50] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:46:50] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:46:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:46:50] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 122/256 places, 104/209 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/256 places, 104/209 transitions.
Interrupted random walk after 885647 steps, including 36931 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 204 ms. (steps per millisecond=490 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 217 ms. (steps per millisecond=460 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 208 ms. (steps per millisecond=480 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 205 ms. (steps per millisecond=487 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 208 ms. (steps per millisecond=480 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 202 ms. (steps per millisecond=495 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 213 resets, run finished after 212 ms. (steps per millisecond=471 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 204 ms. (steps per millisecond=490 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 213 resets, run finished after 210 ms. (steps per millisecond=476 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 204 ms. (steps per millisecond=490 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 202 ms. (steps per millisecond=495 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 198 ms. (steps per millisecond=505 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 214 ms. (steps per millisecond=467 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 211 ms. (steps per millisecond=473 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 221 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 209 ms. (steps per millisecond=478 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 21419924 steps, run timeout after 102001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 21419924 steps, saw 2408357 distinct states, run finished after 102001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:49:06] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:49:06] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-14 23:49:06] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:49:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-14 23:49:07] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-14 23:49:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:49:07] [INFO ] After 220ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-14 23:49:07] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-14 23:49:08] [INFO ] After 1293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 958 ms.
Support contains 40 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 104/104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:49:09] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:49:09] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:49:09] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:49:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:49:09] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-14 23:49:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:49:09] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:49:09] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 104/104 transitions.
Incomplete random walk after 100000 steps, including 4170 resets, run finished after 2982 ms. (steps per millisecond=33 ) properties (out of 40) seen :20
Running SMT prover for 20 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:49:12] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:49:12] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-14 23:49:12] [INFO ] After 221ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20
[2023-03-14 23:49:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:49:13] [INFO ] After 288ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1 real:19
[2023-03-14 23:49:13] [INFO ] After 334ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:49:13] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:49:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:49:14] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-14 23:49:14] [INFO ] After 157ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-14 23:49:14] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-14 23:49:14] [INFO ] After 1673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Interrupted random walk after 880509 steps, including 36696 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 205 ms. (steps per millisecond=487 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 208 ms. (steps per millisecond=480 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 218 ms. (steps per millisecond=458 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100000 steps, including 215 resets, run finished after 212 ms. (steps per millisecond=471 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100000 steps, including 214 resets, run finished after 208 ms. (steps per millisecond=480 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 203 ms. (steps per millisecond=492 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 217 resets, run finished after 221 ms. (steps per millisecond=452 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 214 ms. (steps per millisecond=467 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 166 ms. (steps per millisecond=602 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 182 ms. (steps per millisecond=549 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 161 ms. (steps per millisecond=621 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 181 ms. (steps per millisecond=552 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 213 ms. (steps per millisecond=469 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 214 ms. (steps per millisecond=467 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 216 resets, run finished after 215 ms. (steps per millisecond=465 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 216 ms. (steps per millisecond=462 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 214 resets, run finished after 217 ms. (steps per millisecond=460 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 217 resets, run finished after 221 ms. (steps per millisecond=452 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 220 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 215 resets, run finished after 255 ms. (steps per millisecond=392 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 22196487 steps, run timeout after 102001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 22196487 steps, saw 2487751 distinct states, run finished after 102001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:31] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:31] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-14 23:51:31] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:51:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-14 23:51:31] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-14 23:51:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:31] [INFO ] After 164ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-14 23:51:32] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 265 ms.
[2023-03-14 23:51:32] [INFO ] After 1205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 614 ms.
Support contains 40 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 104/104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:33] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:51:33] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:33] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:33] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-14 23:51:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:33] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:51:33] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 104/104 transitions.
Incomplete random walk after 100000 steps, including 4156 resets, run finished after 2992 ms. (steps per millisecond=33 ) properties (out of 40) seen :20
Running SMT prover for 20 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:36] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:36] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-14 23:51:36] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20
[2023-03-14 23:51:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:36] [INFO ] After 285ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1 real:19
[2023-03-14 23:51:36] [INFO ] After 310ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:51:36] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:51:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-14 23:51:37] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-14 23:51:37] [INFO ] After 172ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-14 23:51:37] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-14 23:51:38] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 417 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2861428 steps, run timeout after 3001 ms. (steps per millisecond=953 ) properties seen :{}
Probabilistic random walk after 2861428 steps, saw 366140 distinct states, run finished after 3001 ms. (steps per millisecond=953 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:41] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:41] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:51:41] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:51:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:41] [INFO ] After 26ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:51:41] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-14 23:51:41] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 43 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 417 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3040934 steps, run timeout after 3001 ms. (steps per millisecond=1013 ) properties seen :{}
Probabilistic random walk after 3040934 steps, saw 389244 distinct states, run finished after 3002 ms. (steps per millisecond=1012 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:44] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:44] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:51:44] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:51:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:44] [INFO ] After 11ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:51:44] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-14 23:51:44] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 41 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 414 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3002462 steps, run timeout after 3001 ms. (steps per millisecond=1000 ) properties seen :{}
Probabilistic random walk after 3002462 steps, saw 384170 distinct states, run finished after 3001 ms. (steps per millisecond=1000 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:47] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:47] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-14 23:51:47] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:51:47] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:47] [INFO ] After 16ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:51:47] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-14 23:51:47] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 31 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 414 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2728739 steps, run timeout after 3001 ms. (steps per millisecond=909 ) properties seen :{}
Probabilistic random walk after 2728739 steps, saw 350244 distinct states, run finished after 3001 ms. (steps per millisecond=909 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:50] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:51] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:51:51] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:51:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:51] [INFO ] After 17ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:51:51] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-14 23:51:51] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 26 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 416 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2718576 steps, run timeout after 3001 ms. (steps per millisecond=905 ) properties seen :{}
Probabilistic random walk after 2718576 steps, saw 348974 distinct states, run finished after 3001 ms. (steps per millisecond=905 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:54] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:54] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:51:54] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:51:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:54] [INFO ] After 13ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:51:54] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-14 23:51:54] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 28 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 416 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2908282 steps, run timeout after 3001 ms. (steps per millisecond=969 ) properties seen :{}
Probabilistic random walk after 2908282 steps, saw 370938 distinct states, run finished after 3001 ms. (steps per millisecond=969 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:51:57] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:51:57] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-14 23:51:57] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:51:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:51:57] [INFO ] After 43ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:51:57] [INFO ] After 70ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-14 23:51:57] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 12 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 423 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3042284 steps, run timeout after 3001 ms. (steps per millisecond=1013 ) properties seen :{}
Probabilistic random walk after 3042284 steps, saw 389436 distinct states, run finished after 3001 ms. (steps per millisecond=1013 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:00] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:00] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-14 23:52:00] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:00] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:00] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-14 23:52:00] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 17 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 417 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2911706 steps, run timeout after 3001 ms. (steps per millisecond=970 ) properties seen :{}
Probabilistic random walk after 2911706 steps, saw 371250 distinct states, run finished after 3001 ms. (steps per millisecond=970 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:03] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 23:52:04] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-14 23:52:04] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:04] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:04] [INFO ] After 13ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:04] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-14 23:52:04] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 24 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 419 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2864246 steps, run timeout after 3001 ms. (steps per millisecond=954 ) properties seen :{}
Probabilistic random walk after 2864246 steps, saw 366404 distinct states, run finished after 3001 ms. (steps per millisecond=954 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:07] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:07] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2023-03-14 23:52:07] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:07] [INFO ] After 64ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:07] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-14 23:52:07] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 17 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 414 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2900679 steps, run timeout after 3001 ms. (steps per millisecond=966 ) properties seen :{}
Probabilistic random walk after 2900679 steps, saw 370166 distinct states, run finished after 3001 ms. (steps per millisecond=966 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:10] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:52:10] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-14 23:52:10] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:10] [INFO ] After 13ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:10] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 23:52:10] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 22 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 420 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3112344 steps, run timeout after 3001 ms. (steps per millisecond=1037 ) properties seen :{}
Probabilistic random walk after 3112344 steps, saw 399196 distinct states, run finished after 3001 ms. (steps per millisecond=1037 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:13] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:13] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:52:13] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:13] [INFO ] After 10ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:13] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-14 23:52:13] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 27 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 422 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3156605 steps, run timeout after 3001 ms. (steps per millisecond=1051 ) properties seen :{}
Probabilistic random walk after 3156605 steps, saw 406086 distinct states, run finished after 3001 ms. (steps per millisecond=1051 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:16] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:17] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-14 23:52:17] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:17] [INFO ] After 10ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:17] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 23:52:17] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 26 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Incomplete random walk after 10000 steps, including 416 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2963891 steps, run timeout after 3001 ms. (steps per millisecond=987 ) properties seen :{}
Probabilistic random walk after 2963891 steps, saw 377988 distinct states, run finished after 3001 ms. (steps per millisecond=987 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:20] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:20] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-14 23:52:20] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:20] [INFO ] After 53ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:20] [INFO ] After 104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-14 23:52:20] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 26 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 414 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3128942 steps, run timeout after 3001 ms. (steps per millisecond=1042 ) properties seen :{}
Probabilistic random walk after 3128942 steps, saw 401820 distinct states, run finished after 3001 ms. (steps per millisecond=1042 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:23] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 23:52:23] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-14 23:52:23] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:23] [INFO ] After 6ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:23] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-14 23:52:23] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 13 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Incomplete random walk after 10000 steps, including 419 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3157899 steps, run timeout after 3001 ms. (steps per millisecond=1052 ) properties seen :{}
Probabilistic random walk after 3157899 steps, saw 406216 distinct states, run finished after 3001 ms. (steps per millisecond=1052 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:26] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:26] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-14 23:52:26] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:26] [INFO ] After 15ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:26] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-14 23:52:26] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 13 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 418 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3150536 steps, run timeout after 3001 ms. (steps per millisecond=1049 ) properties seen :{}
Probabilistic random walk after 3150536 steps, saw 405314 distinct states, run finished after 3001 ms. (steps per millisecond=1049 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:29] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:52:29] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:52:29] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:29] [INFO ] After 10ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:29] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-14 23:52:29] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 15 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 418 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3115702 steps, run timeout after 3001 ms. (steps per millisecond=1038 ) properties seen :{}
Probabilistic random walk after 3115702 steps, saw 399594 distinct states, run finished after 3001 ms. (steps per millisecond=1038 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:32] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:52:32] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 23:52:33] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:33] [INFO ] After 15ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:33] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-14 23:52:33] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 20 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 416 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2476086 steps, run timeout after 3001 ms. (steps per millisecond=825 ) properties seen :{}
Probabilistic random walk after 2476086 steps, saw 313846 distinct states, run finished after 3001 ms. (steps per millisecond=825 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:36] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:36] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-14 23:52:36] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:36] [INFO ] After 16ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:36] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 23:52:36] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 56 rules applied. Total rules applied 181 place count 40 transition count 4
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 25 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 414 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2955119 steps, run timeout after 3001 ms. (steps per millisecond=984 ) properties seen :{}
Probabilistic random walk after 2955119 steps, saw 376536 distinct states, run finished after 3001 ms. (steps per millisecond=984 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:39] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 23:52:39] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-14 23:52:39] [INFO ] After 74ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:39] [INFO ] After 22ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:39] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 23:52:39] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 122 transition count 64
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 80 place count 82 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 81 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 122 place count 62 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 61 transition count 41
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 2 with 57 rules applied. Total rules applied 180 place count 41 transition count 4
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 38 rules applied. Total rules applied 218 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 26 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 417 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3262150 steps, run timeout after 3001 ms. (steps per millisecond=1087 ) properties seen :{}
Probabilistic random walk after 3262150 steps, saw 418886 distinct states, run finished after 3001 ms. (steps per millisecond=1087 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:42] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:52:42] [INFO ] [Real]Absence check using 21 positive place invariants in 31 ms returned sat
[2023-03-14 23:52:42] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 23:52:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 23:52:42] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 23:52:42] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-14 23:52:42] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 104/104 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 103
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 42 place count 121 transition count 63
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 80 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 80 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 79 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 79 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 78 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 78 transition count 60
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 77 transition count 59
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 77 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 76 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 76 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 75 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 75 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 74 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 74 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 73 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 73 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 72 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 72 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 71 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 71 transition count 53
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 70 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 70 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 69 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 69 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 68 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 68 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 67 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 67 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 66 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 66 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 65 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 65 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 64 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 64 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 63 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 62 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 62 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 61 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 60 transition count 40
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 2 with 57 rules applied. Total rules applied 182 place count 40 transition count 3
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 219 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 219 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 2 transition count 2
Applied a total of 221 rules in 11 ms. Remains 2 /122 variables (removed 120) and now considering 2/104 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/122 places, 2/104 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running SMT prover for 20 properties.
// Phase 1: matrix 104 rows 122 cols
[2023-03-14 23:52:42] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-14 23:52:42] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-14 23:52:43] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-14 23:52:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-14 23:52:43] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-14 23:52:43] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-14 23:52:44] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
[2023-03-14 23:52:44] [INFO ] Flatten gal took : 48 ms
[2023-03-14 23:52:44] [INFO ] Flatten gal took : 18 ms
[2023-03-14 23:52:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2153825013191373733.gal : 9 ms
[2023-03-14 23:52:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3839097408375633794.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2153825013191373733.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3839097408375633794.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3839097408375633794.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :37 after 2197
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :2197 after 118108
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :118108 after 1.91319e+07
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :1.91319e+07 after 4.78297e+07
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :4.78297e+07 after 5.91893e+09
Reachability property qltransition_240 is true.
SDD proceeding with computation,19 properties remain. new max is 128
SDD size :5.91893e+09 after 5.56594e+10
SDD proceeding with computation,19 properties remain. new max is 256
SDD size :5.56594e+10 after 9.20724e+10
SDD proceeding with computation,19 properties remain. new max is 512
SDD size :9.20724e+10 after 9.94379e+10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.12694e+11,0.097136,7332,2,1859,15,18011,25,0,613,13021,0
Total reachable state count : 212693848462

Verifying 20 reachability properties.
Reachability property qltransition_131 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_131,8,0.098539,7332,2,146,15,18011,25,0,616,13021,0
Reachability property qltransition_136 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_136,24,0.099236,7596,2,197,15,18011,25,0,618,13021,0
Reachability property qltransition_144 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_144,36,0.09979,7596,2,220,15,18011,25,0,620,13021,0
Reachability property qltransition_150 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_150,162,0.100075,7596,2,333,15,18011,25,0,622,13021,0
Reachability property qltransition_156 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_156,243,0.100471,7596,2,423,15,18011,25,0,624,13021,0
Reachability property qltransition_161 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_161,729,0.100886,7596,2,502,15,18011,25,0,626,13021,0
Reachability property qltransition_168 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_168,2187,0.101294,7596,2,525,15,18011,25,0,628,13021,0
Reachability property qltransition_172 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_172,6561,0.101615,7596,2,542,15,18011,25,0,630,13021,0
Reachability property qltransition_180 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_180,19683,0.101944,7596,2,551,15,18011,25,0,632,13021,0
Reachability property qltransition_186 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_186,59049,0.102248,7596,2,559,15,18011,25,0,634,13021,0
Reachability property qltransition_192 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_192,118098,0.102546,7596,2,561,16,18011,25,0,636,13021,0
Reachability property qltransition_197 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_197,354294,0.102854,7596,2,568,17,18011,25,0,638,13021,0
Reachability property qltransition_204 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_204,1.06288e+06,0.103153,7596,2,579,18,18011,25,0,640,13021,0
Reachability property qltransition_208 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_208,3.18865e+06,0.103446,7596,2,588,19,18011,25,0,642,13021,0
Reachability property qltransition_216 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_216,3.18865e+06,0.103732,7596,2,588,20,18011,25,0,644,13021,0
Reachability property qltransition_222 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_222,9.56594e+06,0.104029,7596,2,603,21,18011,25,0,646,13021,0
Reachability property qltransition_227 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_227,2.86978e+07,0.104324,7596,2,631,22,18011,25,0,648,13021,0
Reachability property qltransition_232 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_232,2.86978e+07,0.104603,7596,2,631,23,18011,25,0,650,13021,0
Reachability property qltransition_240 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_240,9.56594e+06,0.104905,7596,2,603,24,18011,26,0,653,13021,0
Reachability property qltransition_267 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_267,54,0.105173,7596,2,280,25,18011,26,0,655,13021,0
[2023-03-14 23:52:44] [INFO ] Flatten gal took : 23 ms
[2023-03-14 23:52:44] [INFO ] Flatten gal took : 15 ms
[2023-03-14 23:52:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10817033315856189244.gal : 4 ms
[2023-03-14 23:52:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11786930373562502426.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10817033315856189244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11786930373562502426.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityFireability11786930373562502426.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 37
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :37 after 2197
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :2197 after 118108
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :118108 after 295246
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :295246 after 2.10451e+08
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :2.10451e+08 after 8.71209e+09
Reachability property qltransition_240 is true.
Reachability property qltransition_232 is true.
Reachability property qltransition_227 is true.
Reachability property qltransition_222 is true.
Reachability property qltransition_216 is true.
Reachability property qltransition_208 is true.
Reachability property qltransition_204 is true.
Reachability property qltransition_197 is true.
Reachability property qltransition_192 is true.
Reachability property qltransition_186 is true.
Reachability property qltransition_180 is true.
Reachability property qltransition_172 is true.
Reachability property qltransition_168 is true.
Reachability property qltransition_161 is true.
Reachability property qltransition_156 is true.
Reachability property qltransition_150 is true.
Reachability property qltransition_144 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_131 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.71209e+09 after 1.6848e+10
Reachability property qltransition_267 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.34892e+10,0.076934,6800,2,1989,32,12345,6,0,594,7832,0
Total reachable state count : 23489160760

Verifying 20 reachability properties.
Reachability property qltransition_131 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_131,12,0.077535,6800,2,176,32,12345,7,0,598,7832,0
Reachability property qltransition_136 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_136,4,0.078093,6800,2,140,32,12345,8,0,601,7832,0
Reachability property qltransition_144 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_144,18,0.078433,6800,2,201,32,12345,9,0,604,7832,0
Reachability property qltransition_150 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_150,54,0.078766,6800,2,241,32,12345,10,0,607,7832,0
Reachability property qltransition_156 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_156,162,0.079067,6800,2,319,32,12345,11,0,610,7832,0
Reachability property qltransition_161 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_161,729,0.079364,6800,2,374,32,12345,12,0,613,7832,0
Reachability property qltransition_168 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_168,2187,0.079653,6800,2,403,32,12345,13,0,616,7832,0
Reachability property qltransition_172 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_172,6561,0.079951,6800,2,413,32,12345,14,0,619,7832,0
Reachability property qltransition_180 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_180,19683,0.080228,6800,2,420,32,12345,15,0,622,7832,0
Reachability property qltransition_186 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_186,59049,0.080498,6800,2,424,32,12345,16,0,625,7832,0
Reachability property qltransition_192 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_192,177147,0.080773,6800,2,429,32,12345,17,0,628,7832,0
Reachability property qltransition_197 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_197,354294,0.081035,6800,2,430,32,12345,18,0,631,7832,0
Reachability property qltransition_204 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_204,1.06288e+06,0.081291,6800,2,441,32,12345,19,0,634,7832,0
Reachability property qltransition_208 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_208,3.18865e+06,0.081543,6800,2,453,32,12345,20,0,637,7832,0
Reachability property qltransition_216 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_216,4.78297e+06,0.081802,6800,2,458,32,12345,21,0,640,7832,0
Reachability property qltransition_222 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_222,2.86978e+07,0.08207,6800,2,490,32,12345,22,0,643,7832,0
Reachability property qltransition_227 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_227,4.30467e+07,0.082325,6800,2,499,32,12345,23,0,646,7832,0
Reachability property qltransition_232 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_232,4.30467e+07,0.082568,6800,2,499,32,12345,24,0,649,7832,0
Reachability property qltransition_240 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_240,531441,0.083045,6800,2,435,32,12345,25,0,652,7832,0
Reachability property qltransition_267 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_267,243,0.08334,6800,2,326,32,12345,26,0,655,7832,0
Able to resolve query QuasiLiveness after proving 170 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL INITIAL_STATE
Total runtime 577334 ms.

BK_STOP 1678837964963

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="AutoFlight-PT-24b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is AutoFlight-PT-24b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r032-oct2-167813615900307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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