Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r085-tall-165260115500123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-010, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-tall-165260115500123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652702111733

Running Version 202205111006
[2022-05-16 11:55:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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]
[2022-05-16 11:55:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:55:13] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-16 11:55:13] [INFO ] Transformed 534 places.
[2022-05-16 11:55:13] [INFO ] Transformed 498 transitions.
[2022-05-16 11:55:13] [INFO ] Parsed PT model containing 534 places and 498 transitions in 206 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 855 ms. (steps per millisecond=11 ) properties (out of 523) seen :44
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Interrupted probabilistic random walk after 80390 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 61=1, 62=1, 63=1, 150=1, 391=1, 437=1, 438=1, 439=1, 440=1, 441=1, 442=1, 443=1, 444=1, 445=1, 446=1, 447=1, 448=1, 449=1, 450=1, 451=1, 452=1, 453=1, 454=1, 455=1, 456=1, 457=1, 458=1, 459=1, 460=1, 461=1, 462=1, 463=1, 464=1, 465=1, 466=1, 467=1, 468=1, 469=1, 470=1, 471=1, 472=1, 473=1, 474=1, 475=1, 476=1, 477=1, 478=1}
Probabilistic random walk after 80390 steps, saw 40200 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :91
Running SMT prover for 388 properties.
// Phase 1: matrix 498 rows 534 cols
[2022-05-16 11:55:17] [INFO ] Computed 54 place invariants in 65 ms
[2022-05-16 11:55:22] [INFO ] After 4871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:388
[2022-05-16 11:55:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-16 11:55:25] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2022-05-16 11:55:38] [INFO ] After 9864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :388
[2022-05-16 11:55:39] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 6 ms to minimize.
[2022-05-16 11:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2022-05-16 11:55:39] [INFO ] Deduced a trap composed of 159 places in 233 ms of which 2 ms to minimize.
[2022-05-16 11:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2022-05-16 11:55:40] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 1 ms to minimize.
[2022-05-16 11:55:40] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 1 ms to minimize.
[2022-05-16 11:55:40] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2022-05-16 11:55:40] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2022-05-16 11:55:40] [INFO ] Deduced a trap composed of 181 places in 125 ms of which 1 ms to minimize.
[2022-05-16 11:55:41] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 1 ms to minimize.
[2022-05-16 11:55:41] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 1 ms to minimize.
[2022-05-16 11:55:41] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 1 ms to minimize.
[2022-05-16 11:55:41] [INFO ] Deduced a trap composed of 194 places in 121 ms of which 1 ms to minimize.
[2022-05-16 11:55:41] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 1 ms to minimize.
[2022-05-16 11:55:41] [INFO ] Deduced a trap composed of 173 places in 121 ms of which 0 ms to minimize.
[2022-05-16 11:55:42] [INFO ] Deduced a trap composed of 193 places in 113 ms of which 0 ms to minimize.
[2022-05-16 11:55:42] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 1 ms to minimize.
[2022-05-16 11:55:42] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 0 ms to minimize.
[2022-05-16 11:55:42] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2022-05-16 11:55:42] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 1 ms to minimize.
[2022-05-16 11:55:43] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 0 ms to minimize.
[2022-05-16 11:55:43] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 0 ms to minimize.
[2022-05-16 11:55:43] [INFO ] Deduced a trap composed of 191 places in 121 ms of which 0 ms to minimize.
[2022-05-16 11:55:43] [INFO ] Deduced a trap composed of 180 places in 147 ms of which 1 ms to minimize.
[2022-05-16 11:55:43] [INFO ] Deduced a trap composed of 177 places in 137 ms of which 0 ms to minimize.
[2022-05-16 11:55:43] [INFO ] Deduced a trap composed of 197 places in 157 ms of which 0 ms to minimize.
[2022-05-16 11:55:44] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4057 ms
[2022-05-16 11:55:46] [INFO ] Deduced a trap composed of 178 places in 128 ms of which 0 ms to minimize.
[2022-05-16 11:55:47] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 1 ms to minimize.
[2022-05-16 11:55:47] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 1 ms to minimize.
[2022-05-16 11:55:47] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 12 ms to minimize.
[2022-05-16 11:55:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 11:55:47] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:388
Fused 388 Parikh solutions to 374 different solutions.
Parikh walk visited 0 properties in 30246 ms.
Support contains 388 out of 534 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 534/534 places, 498/498 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 534 transition count 468
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 504 transition count 468
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 504 transition count 463
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 499 transition count 463
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 9 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 469 transition count 433
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 464 transition count 433
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 464 transition count 427
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 458 transition count 427
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 458 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 457 transition count 426
Applied a total of 164 rules in 132 ms. Remains 457 /534 variables (removed 77) and now considering 426/498 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/534 places, 426/498 transitions.
Interrupted random walk after 521769 steps, including 66850 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 881 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Interrupted probabilistic random walk after 4539291 steps, run timeout after 147001 ms. (steps per millisecond=30 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 67=1, 68=1, 69=1}
Probabilistic random walk after 4539291 steps, saw 2269369 distinct states, run finished after 147001 ms. (steps per millisecond=30 ) properties seen :53
Running SMT prover for 335 properties.
// Phase 1: matrix 426 rows 457 cols
[2022-05-16 11:59:34] [INFO ] Computed 54 place invariants in 21 ms
[2022-05-16 11:59:37] [INFO ] After 3367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2022-05-16 11:59:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-05-16 11:59:39] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 36 ms returned sat
[2022-05-16 11:59:49] [INFO ] After 6890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2022-05-16 11:59:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 11:59:56] [INFO ] After 6871ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2022-05-16 11:59:56] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2022-05-16 11:59:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-16 11:59:56] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2022-05-16 11:59:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-16 11:59:57] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2022-05-16 11:59:57] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2022-05-16 11:59:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-16 11:59:57] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 1 ms to minimize.
[2022-05-16 11:59:58] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2022-05-16 11:59:58] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 21 ms to minimize.
[2022-05-16 11:59:58] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2022-05-16 11:59:58] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 0 ms to minimize.
[2022-05-16 11:59:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1154 ms
[2022-05-16 11:59:59] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2022-05-16 12:00:00] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 1 ms to minimize.
[2022-05-16 12:00:00] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2022-05-16 12:00:00] [INFO ] Deduced a trap composed of 187 places in 132 ms of which 0 ms to minimize.
[2022-05-16 12:00:00] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 0 ms to minimize.
[2022-05-16 12:00:00] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:00:00] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:00:01] [INFO ] Deduced a trap composed of 177 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:00:01] [INFO ] Deduced a trap composed of 171 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:00:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1609 ms
[2022-05-16 12:00:02] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-16 12:00:03] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:00:03] [INFO ] Deduced a trap composed of 174 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:00:03] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2022-05-16 12:00:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 425 ms
[2022-05-16 12:00:03] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:00:03] [INFO ] Deduced a trap composed of 149 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:00:04] [INFO ] Deduced a trap composed of 201 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:00:04] [INFO ] Deduced a trap composed of 172 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:00:04] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:00:04] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:00:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 894 ms
[2022-05-16 12:00:05] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 4 ms to minimize.
[2022-05-16 12:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-16 12:00:05] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2022-05-16 12:00:05] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2022-05-16 12:00:05] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:00:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 322 ms
[2022-05-16 12:00:05] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:00:05] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 0 ms to minimize.
[2022-05-16 12:00:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2022-05-16 12:00:06] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-16 12:00:06] [INFO ] Deduced a trap composed of 142 places in 128 ms of which 2 ms to minimize.
[2022-05-16 12:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-16 12:00:08] [INFO ] Deduced a trap composed of 181 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-16 12:00:08] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2022-05-16 12:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-16 12:00:09] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2022-05-16 12:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-16 12:00:09] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-16 12:00:09] [INFO ] Deduced a trap composed of 187 places in 127 ms of which 2 ms to minimize.
[2022-05-16 12:00:10] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:00:10] [INFO ] Deduced a trap composed of 171 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:00:11] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:00:11] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 0 ms to minimize.
[2022-05-16 12:00:11] [INFO ] Deduced a trap composed of 197 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:00:11] [INFO ] Deduced a trap composed of 180 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:00:11] [INFO ] Deduced a trap composed of 161 places in 136 ms of which 1 ms to minimize.
[2022-05-16 12:00:11] [INFO ] Deduced a trap composed of 163 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:00:12] [INFO ] Deduced a trap composed of 171 places in 130 ms of which 0 ms to minimize.
[2022-05-16 12:00:12] [INFO ] Deduced a trap composed of 152 places in 126 ms of which 0 ms to minimize.
[2022-05-16 12:00:12] [INFO ] Deduced a trap composed of 175 places in 129 ms of which 0 ms to minimize.
[2022-05-16 12:00:12] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:00:12] [INFO ] Deduced a trap composed of 182 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:00:12] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:00:13] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 0 ms to minimize.
[2022-05-16 12:00:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3430 ms
[2022-05-16 12:00:13] [INFO ] Deduced a trap composed of 174 places in 135 ms of which 1 ms to minimize.
[2022-05-16 12:00:13] [INFO ] Deduced a trap composed of 182 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:00:14] [INFO ] Deduced a trap composed of 170 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:00:14] [INFO ] Deduced a trap composed of 181 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:00:14] [INFO ] Deduced a trap composed of 145 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:00:14] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:00:14] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:00:14] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 167 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 142 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 163 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:00:15] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:00:16] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 0 ms to minimize.
[2022-05-16 12:00:16] [INFO ] Deduced a trap composed of 159 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:00:16] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:00:16] [INFO ] Deduced a trap composed of 169 places in 127 ms of which 0 ms to minimize.
[2022-05-16 12:00:16] [INFO ] Deduced a trap composed of 173 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 183 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 142 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 168 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 173 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:00:17] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:00:18] [INFO ] Deduced a trap composed of 171 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:00:18] [INFO ] Deduced a trap composed of 181 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:00:18] [INFO ] Deduced a trap composed of 151 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:00:18] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:00:18] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:00:18] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:00:19] [INFO ] Deduced a trap composed of 161 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:00:19] [INFO ] Deduced a trap composed of 158 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:00:19] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:00:19] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:00:19] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5967 ms
[2022-05-16 12:00:20] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2022-05-16 12:00:20] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:00:21] [INFO ] Deduced a trap composed of 128 places in 77 ms of which 1 ms to minimize.
[2022-05-16 12:00:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2022-05-16 12:00:21] [INFO ] Deduced a trap composed of 118 places in 71 ms of which 1 ms to minimize.
[2022-05-16 12:00:21] [INFO ] Deduced a trap composed of 140 places in 71 ms of which 1 ms to minimize.
[2022-05-16 12:00:21] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 0 ms to minimize.
[2022-05-16 12:00:21] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 1 ms to minimize.
[2022-05-16 12:00:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 437 ms
[2022-05-16 12:00:22] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:00:22] [INFO ] Deduced a trap composed of 131 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:00:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-16 12:00:23] [INFO ] Deduced a trap composed of 184 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:00:23] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:00:23] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:00:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 492 ms
[2022-05-16 12:00:24] [INFO ] Deduced a trap composed of 105 places in 72 ms of which 0 ms to minimize.
[2022-05-16 12:00:24] [INFO ] Deduced a trap composed of 110 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:00:24] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 0 ms to minimize.
[2022-05-16 12:00:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2022-05-16 12:00:26] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2022-05-16 12:00:26] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 0 ms to minimize.
[2022-05-16 12:00:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-16 12:00:26] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:00:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-16 12:00:27] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:00:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-16 12:00:27] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:00:27] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:00:27] [INFO ] Deduced a trap composed of 181 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:00:27] [INFO ] Deduced a trap composed of 178 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:00:27] [INFO ] Deduced a trap composed of 185 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:00:28] [INFO ] Deduced a trap composed of 206 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:00:28] [INFO ] Deduced a trap composed of 193 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:00:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 991 ms
[2022-05-16 12:00:33] [INFO ] After 43766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 12428 ms.
[2022-05-16 12:00:45] [INFO ] After 67962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 322 different solutions.
Parikh walk visited 0 properties in 30363 ms.
Support contains 335 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 457/457 places, 426/426 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 457 transition count 414
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 445 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24 place count 445 transition count 412
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 443 transition count 412
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 12 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 434 transition count 403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 432 transition count 403
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 432 transition count 399
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 428 transition count 399
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 428 transition count 399
Applied a total of 63 rules in 94 ms. Remains 428 /457 variables (removed 29) and now considering 399/426 (removed 27) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/457 places, 399/426 transitions.
Interrupted random walk after 616933 steps, including 79219 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4455544 steps, run timeout after 138001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 4455544 steps, saw 2227522 distinct states, run finished after 138004 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 399 rows 428 cols
[2022-05-16 12:04:21] [INFO ] Computed 54 place invariants in 27 ms
[2022-05-16 12:04:24] [INFO ] After 3192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2022-05-16 12:04:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2022-05-16 12:04:26] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2022-05-16 12:04:34] [INFO ] After 6006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2022-05-16 12:04:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:04:41] [INFO ] After 6085ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2022-05-16 12:04:41] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-16 12:04:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-16 12:04:41] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 0 ms to minimize.
[2022-05-16 12:04:42] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:04:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2022-05-16 12:04:42] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:04:42] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2022-05-16 12:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2022-05-16 12:04:44] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-16 12:04:44] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2022-05-16 12:04:44] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 0 ms to minimize.
[2022-05-16 12:04:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2022-05-16 12:04:44] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2022-05-16 12:04:45] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Deduced a trap composed of 129 places in 92 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 0 ms to minimize.
[2022-05-16 12:04:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2022-05-16 12:04:54] [INFO ] After 19918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 7022 ms.
[2022-05-16 12:05:01] [INFO ] After 37574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 312 different solutions.
Parikh walk visited 0 properties in 30175 ms.
Support contains 335 out of 428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 16 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 428/428 places, 399/399 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 18 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
// Phase 1: matrix 399 rows 428 cols
[2022-05-16 12:05:32] [INFO ] Computed 54 place invariants in 25 ms
[2022-05-16 12:05:32] [INFO ] Implicit Places using invariants in 190 ms returned [20, 26, 221, 346, 419, 425]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 195 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 422/428 places, 399/399 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 422 transition count 396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 419 transition count 396
Applied a total of 6 rules in 23 ms. Remains 419 /422 variables (removed 3) and now considering 396/399 (removed 3) transitions.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:05:32] [INFO ] Computed 48 place invariants in 24 ms
[2022-05-16 12:05:32] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:05:32] [INFO ] Computed 48 place invariants in 21 ms
[2022-05-16 12:05:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:05:33] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/428 places, 396/399 transitions.
Finished structural reductions, in 2 iterations. Remains : 419/428 places, 396/399 transitions.
Interrupted random walk after 599586 steps, including 86499 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 967 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4284686 steps, run timeout after 135001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 4284686 steps, saw 2142114 distinct states, run finished after 135001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:08:34] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-16 12:08:37] [INFO ] After 3200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2022-05-16 12:08:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-05-16 12:08:39] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 15 ms returned sat
[2022-05-16 12:08:48] [INFO ] After 6311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2022-05-16 12:08:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:08:54] [INFO ] After 6156ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2022-05-16 12:08:55] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 0 ms to minimize.
[2022-05-16 12:08:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-16 12:08:55] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2022-05-16 12:08:55] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:08:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2022-05-16 12:08:55] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:08:55] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:08:55] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 145 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 0 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 170 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 171 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:08:56] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:08:57] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:08:57] [INFO ] Deduced a trap composed of 156 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:08:57] [INFO ] Deduced a trap composed of 144 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:08:57] [INFO ] Deduced a trap composed of 176 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:08:57] [INFO ] Deduced a trap composed of 152 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:08:57] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 166 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 136 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 158 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 146 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 152 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:08:58] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 172 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 170 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 156 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:08:59] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 118 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 166 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:09:00] [INFO ] Deduced a trap composed of 168 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 136 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 124 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 154 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 165 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 136 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:01] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 154 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 165 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:02] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 149 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 175 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 186 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:09:03] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 168 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 161 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 177 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:09:04] [INFO ] Deduced a trap composed of 161 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:09:05] [INFO ] Deduced a trap composed of 154 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:09:05] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:09:05] [INFO ] Deduced a trap composed of 169 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:09:05] [INFO ] Deduced a trap composed of 170 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:09:05] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:09:05] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 152 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 165 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 174 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 176 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 177 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 177 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:09:06] [INFO ] Deduced a trap composed of 157 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 160 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 179 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 184 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 197 places in 101 ms of which 2 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 148 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 167 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:09:07] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 185 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 168 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 173 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 183 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 1 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:09:08] [INFO ] Deduced a trap composed of 187 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 166 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 137 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 168 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 164 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 183 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 175 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:09:09] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 149 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 168 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 182 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 150 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 143 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 157 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:09:10] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 1 ms to minimize.
[2022-05-16 12:09:11] [INFO ] Deduced a trap composed of 182 places in 95 ms of which 1 ms to minimize.
[2022-05-16 12:09:11] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 15659 ms
[2022-05-16 12:09:11] [INFO ] Deduced a trap composed of 183 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Deduced a trap composed of 122 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Deduced a trap composed of 161 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:09:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1091 ms
[2022-05-16 12:09:13] [INFO ] Deduced a trap composed of 148 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:09:13] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-16 12:09:13] [INFO ] Deduced a trap composed of 171 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:09:13] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:09:13] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:09:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 449 ms
[2022-05-16 12:09:15] [INFO ] Deduced a trap composed of 118 places in 83 ms of which 1 ms to minimize.
[2022-05-16 12:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-16 12:09:16] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2022-05-16 12:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-16 12:09:16] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:09:16] [INFO ] Deduced a trap composed of 143 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:09:16] [INFO ] Deduced a trap composed of 163 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:09:16] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:09:16] [INFO ] Deduced a trap composed of 173 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 174 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 167 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:17] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 188 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 155 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 176 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 171 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:09:18] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 136 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 153 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 145 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 173 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 180 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:09:19] [INFO ] Deduced a trap composed of 174 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:09:20] [INFO ] Deduced a trap composed of 170 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:09:20] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:09:20] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 1 ms to minimize.
[2022-05-16 12:09:20] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4101 ms
[2022-05-16 12:09:20] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2022-05-16 12:09:20] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 1 ms to minimize.
[2022-05-16 12:09:20] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 115 places in 75 ms of which 1 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 131 places in 74 ms of which 1 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 128 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 128 places in 77 ms of which 1 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2022-05-16 12:09:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1248 ms
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:09:25] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 105 places in 64 ms of which 1 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 100 places in 62 ms of which 0 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 909 ms
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 111 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 117 places in 66 ms of which 1 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 114 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:09:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 394 ms
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 0 ms to minimize.
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2022-05-16 12:09:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 107 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 112 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:09:30] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 0 ms to minimize.
[2022-05-16 12:09:30] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:09:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 595 ms
[2022-05-16 12:09:31] [INFO ] Deduced a trap composed of 119 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:09:31] [INFO ] Deduced a trap composed of 117 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:09:31] [INFO ] Deduced a trap composed of 119 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:09:31] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 1 ms to minimize.
[2022-05-16 12:09:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 399 ms
[2022-05-16 12:09:31] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2022-05-16 12:09:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-16 12:09:33] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-16 12:09:33] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 0 ms to minimize.
[2022-05-16 12:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-16 12:09:35] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 0 ms to minimize.
[2022-05-16 12:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-16 12:09:37] [INFO ] After 49092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 13555 ms.
[2022-05-16 12:09:50] [INFO ] After 73460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 309 different solutions.
Parikh walk visited 0 properties in 30218 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:10:21] [INFO ] Computed 48 place invariants in 31 ms
[2022-05-16 12:10:21] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:10:21] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-16 12:10:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:10:22] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2022-05-16 12:10:22] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:10:22] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-16 12:10:22] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14442 resets, run finished after 5960 ms. (steps per millisecond=16 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:10:28] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-16 12:10:31] [INFO ] After 3264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2022-05-16 12:10:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2022-05-16 12:10:33] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-16 12:10:42] [INFO ] After 5954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2022-05-16 12:10:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:10:48] [INFO ] After 5844ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2022-05-16 12:10:48] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 0 ms to minimize.
[2022-05-16 12:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-16 12:10:49] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:10:49] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:10:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2022-05-16 12:10:49] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 1 ms to minimize.
[2022-05-16 12:10:49] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2022-05-16 12:10:49] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 1 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 1 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 1 ms to minimize.
[2022-05-16 12:10:50] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:10:51] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:10:51] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:10:51] [INFO ] Deduced a trap composed of 156 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:10:51] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:10:51] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 0 ms to minimize.
[2022-05-16 12:10:51] [INFO ] Deduced a trap composed of 152 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 158 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 146 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:10:52] [INFO ] Deduced a trap composed of 152 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 172 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 170 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 138 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:10:53] [INFO ] Deduced a trap composed of 156 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 118 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 135 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 166 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:10:54] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 168 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 124 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 154 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 165 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 136 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:10:55] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 135 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 161 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 132 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 154 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:10:56] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 149 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 175 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 186 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 147 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 146 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:10:57] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 166 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 168 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 161 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 177 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:10:58] [INFO ] Deduced a trap composed of 161 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 154 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 169 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 170 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:10:59] [INFO ] Deduced a trap composed of 152 places in 102 ms of which 1 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 174 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 176 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 177 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 177 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 157 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:11:00] [INFO ] Deduced a trap composed of 160 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 179 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 184 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 197 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 148 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 167 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:11:01] [INFO ] Deduced a trap composed of 185 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 168 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 183 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 166 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 187 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:11:02] [INFO ] Deduced a trap composed of 177 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 166 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 168 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 183 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 175 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 164 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:11:03] [INFO ] Deduced a trap composed of 149 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 168 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 182 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 150 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 133 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 157 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 141 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:11:04] [INFO ] Deduced a trap composed of 182 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:11:05] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 15745 ms
[2022-05-16 12:11:05] [INFO ] Deduced a trap composed of 183 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 1 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Deduced a trap composed of 171 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Deduced a trap composed of 161 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:11:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1168 ms
[2022-05-16 12:11:07] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 0 ms to minimize.
[2022-05-16 12:11:07] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:11:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2022-05-16 12:11:07] [INFO ] Deduced a trap composed of 171 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:11:07] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:11:07] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2022-05-16 12:11:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2022-05-16 12:11:09] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:11:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-16 12:11:10] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:11:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-16 12:11:10] [INFO ] Deduced a trap composed of 149 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:11:10] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:11:10] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:11:10] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 173 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 174 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 10 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:11:11] [INFO ] Deduced a trap composed of 167 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 188 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 155 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 176 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 171 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:11:12] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 153 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 145 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 173 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 117 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:11:13] [INFO ] Deduced a trap composed of 180 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:11:14] [INFO ] Deduced a trap composed of 174 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:11:14] [INFO ] Deduced a trap composed of 170 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:11:14] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:11:14] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:11:14] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4239 ms
[2022-05-16 12:11:14] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 118 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 115 places in 81 ms of which 1 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 131 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 1 ms to minimize.
[2022-05-16 12:11:15] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:11:16] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:11:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1266 ms
[2022-05-16 12:11:19] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:11:19] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:11:19] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:11:19] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 0 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 1 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 104 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 100 places in 76 ms of which 1 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1004 ms
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 111 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 117 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:11:20] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:11:21] [INFO ] Deduced a trap composed of 110 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:11:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 491 ms
[2022-05-16 12:11:23] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-16 12:11:23] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:11:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-16 12:11:24] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:11:24] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:11:24] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:11:24] [INFO ] Deduced a trap composed of 112 places in 70 ms of which 1 ms to minimize.
[2022-05-16 12:11:24] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:11:24] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:11:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 590 ms
[2022-05-16 12:11:25] [INFO ] Deduced a trap composed of 119 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:11:25] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:11:25] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:11:25] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:11:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2022-05-16 12:11:25] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-16 12:11:27] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2022-05-16 12:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-16 12:11:27] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 0 ms to minimize.
[2022-05-16 12:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-16 12:11:29] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 0 ms to minimize.
[2022-05-16 12:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-16 12:11:31] [INFO ] After 49288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 13937 ms.
[2022-05-16 12:11:45] [INFO ] After 73540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Interrupted random walk after 473163 steps, including 68245 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 878 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4566419 steps, run timeout after 141001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 4566419 steps, saw 2282953 distinct states, run finished after 141001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:14:54] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-16 12:14:57] [INFO ] After 3207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2022-05-16 12:14:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-05-16 12:14:59] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 11 ms returned sat
[2022-05-16 12:15:08] [INFO ] After 6276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2022-05-16 12:15:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:15:14] [INFO ] After 6020ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2022-05-16 12:15:15] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 1 ms to minimize.
[2022-05-16 12:15:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-16 12:15:15] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:15] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:15:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2022-05-16 12:15:15] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:15:15] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:15:15] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:15:16] [INFO ] Deduced a trap composed of 171 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Deduced a trap composed of 156 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Deduced a trap composed of 144 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Deduced a trap composed of 176 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:15:17] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 166 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 163 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 158 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 146 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 152 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:15:18] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 125 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 172 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 170 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 138 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 136 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 156 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:15:19] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 135 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 1 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 166 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:15:20] [INFO ] Deduced a trap composed of 168 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 124 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 154 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 165 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:21] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 161 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 154 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 1 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 130 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:22] [INFO ] Deduced a trap composed of 149 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 135 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 175 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 186 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 147 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 146 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 144 places in 93 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 166 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 168 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 163 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 164 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 161 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 161 places in 102 ms of which 1 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 154 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 164 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 169 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 170 places in 96 ms of which 1 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 163 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 152 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:15:25] [INFO ] Deduced a trap composed of 174 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 176 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 177 places in 96 ms of which 1 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 177 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 157 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 160 places in 95 ms of which 1 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 179 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 184 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:26] [INFO ] Deduced a trap composed of 197 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 148 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 133 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 167 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 185 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 168 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 173 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:15:27] [INFO ] Deduced a trap composed of 183 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 166 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 187 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 177 places in 97 ms of which 1 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 166 places in 93 ms of which 0 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 137 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 168 places in 97 ms of which 1 ms to minimize.
[2022-05-16 12:15:28] [INFO ] Deduced a trap composed of 164 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 183 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 175 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 164 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 168 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 182 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 150 places in 94 ms of which 1 ms to minimize.
[2022-05-16 12:15:29] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:15:30] [INFO ] Deduced a trap composed of 143 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:15:30] [INFO ] Deduced a trap composed of 157 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:15:30] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:15:30] [INFO ] Deduced a trap composed of 182 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:15:30] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 14905 ms
[2022-05-16 12:15:31] [INFO ] Deduced a trap composed of 183 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:15:31] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:15:31] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:15:31] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:15:31] [INFO ] Deduced a trap composed of 161 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:32] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:32] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:15:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1105 ms
[2022-05-16 12:15:32] [INFO ] Deduced a trap composed of 148 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:15:32] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:15:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2022-05-16 12:15:32] [INFO ] Deduced a trap composed of 171 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:15:33] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:15:33] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:15:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 442 ms
[2022-05-16 12:15:35] [INFO ] Deduced a trap composed of 118 places in 80 ms of which 0 ms to minimize.
[2022-05-16 12:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-16 12:15:35] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2022-05-16 12:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-16 12:15:35] [INFO ] Deduced a trap composed of 149 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:15:35] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:15:35] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 173 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 174 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:15:36] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 167 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 171 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 188 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 155 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 176 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:15:37] [INFO ] Deduced a trap composed of 171 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 143 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 153 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 145 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 173 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:15:38] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:15:39] [INFO ] Deduced a trap composed of 180 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:15:39] [INFO ] Deduced a trap composed of 174 places in 105 ms of which 1 ms to minimize.
[2022-05-16 12:15:39] [INFO ] Deduced a trap composed of 170 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:15:39] [INFO ] Deduced a trap composed of 117 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:15:39] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:39] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4087 ms
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 0 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 0 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 0 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 0 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 124 places in 89 ms of which 1 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 129 places in 82 ms of which 1 ms to minimize.
[2022-05-16 12:15:40] [INFO ] Deduced a trap composed of 121 places in 78 ms of which 1 ms to minimize.
[2022-05-16 12:15:41] [INFO ] Deduced a trap composed of 131 places in 80 ms of which 1 ms to minimize.
[2022-05-16 12:15:41] [INFO ] Deduced a trap composed of 128 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:15:41] [INFO ] Deduced a trap composed of 128 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:15:41] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:15:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1353 ms
[2022-05-16 12:15:44] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2022-05-16 12:15:44] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 0 ms to minimize.
[2022-05-16 12:15:44] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 103 places in 67 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 104 places in 66 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 929 ms
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 111 places in 77 ms of which 1 ms to minimize.
[2022-05-16 12:15:45] [INFO ] Deduced a trap composed of 117 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:15:46] [INFO ] Deduced a trap composed of 114 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:15:46] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:15:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 411 ms
[2022-05-16 12:15:48] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2022-05-16 12:15:48] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:15:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-05-16 12:15:49] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:15:49] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:15:49] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:15:49] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:15:49] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:15:49] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:15:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 555 ms
[2022-05-16 12:15:50] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:15:50] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:15:50] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:15:50] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:15:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 387 ms
[2022-05-16 12:15:50] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2022-05-16 12:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-16 12:15:52] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2022-05-16 12:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-16 12:15:52] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 0 ms to minimize.
[2022-05-16 12:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-16 12:15:54] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 0 ms to minimize.
[2022-05-16 12:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-16 12:15:56] [INFO ] After 48130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 13936 ms.
[2022-05-16 12:16:10] [INFO ] After 72789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 309 different solutions.
Parikh walk visited 0 properties in 30533 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:16:41] [INFO ] Computed 48 place invariants in 23 ms
[2022-05-16 12:16:41] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:16:41] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-16 12:16:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:16:42] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2022-05-16 12:16:42] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:16:42] [INFO ] Computed 48 place invariants in 24 ms
[2022-05-16 12:16:42] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14379 resets, run finished after 4906 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:16:47] [INFO ] Computed 48 place invariants in 31 ms
[2022-05-16 12:16:50] [INFO ] After 3246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2022-05-16 12:16:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-05-16 12:16:52] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 11 ms returned sat
[2022-05-16 12:17:01] [INFO ] After 6125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2022-05-16 12:17:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:17:06] [INFO ] After 5876ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2022-05-16 12:17:07] [INFO ] Deduced a trap composed of 150 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-16 12:17:07] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:17:08] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:17:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2022-05-16 12:17:08] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 1 ms to minimize.
[2022-05-16 12:17:08] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:17:08] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:17:08] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:17:08] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 0 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 0 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 0 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 171 places in 131 ms of which 1 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:17:09] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:17:10] [INFO ] Deduced a trap composed of 156 places in 126 ms of which 0 ms to minimize.
[2022-05-16 12:17:10] [INFO ] Deduced a trap composed of 144 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:17:10] [INFO ] Deduced a trap composed of 176 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:17:10] [INFO ] Deduced a trap composed of 152 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:10] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:17:10] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:17:11] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:17:11] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:17:11] [INFO ] Deduced a trap composed of 158 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:17:11] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:17:11] [INFO ] Deduced a trap composed of 152 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:11] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 172 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 170 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:17:12] [INFO ] Deduced a trap composed of 156 places in 140 ms of which 0 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 0 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:17:13] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 154 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:17:14] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 1 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 161 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:17:15] [INFO ] Deduced a trap composed of 154 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 175 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:16] [INFO ] Deduced a trap composed of 186 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 147 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 0 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 163 places in 141 ms of which 1 ms to minimize.
[2022-05-16 12:17:17] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:17:18] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 1 ms to minimize.
[2022-05-16 12:17:18] [INFO ] Deduced a trap composed of 161 places in 127 ms of which 1 ms to minimize.
[2022-05-16 12:17:18] [INFO ] Deduced a trap composed of 177 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:17:18] [INFO ] Deduced a trap composed of 161 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:17:18] [INFO ] Deduced a trap composed of 154 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:17:18] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 169 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 170 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 152 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:17:19] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 0 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 176 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 177 places in 128 ms of which 0 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 177 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 160 places in 134 ms of which 0 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 179 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 184 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 197 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 133 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 0 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:21] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 173 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 183 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 187 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 177 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:17:22] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 1 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 168 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 183 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 175 places in 113 ms of which 2 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 149 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 182 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 150 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 143 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:25] [INFO ] Deduced a trap composed of 182 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:17:25] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 16988 ms
[2022-05-16 12:17:25] [INFO ] Deduced a trap composed of 183 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Deduced a trap composed of 171 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:17:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1148 ms
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 148 places in 135 ms of which 0 ms to minimize.
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 171 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 1 ms to minimize.
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 1 ms to minimize.
[2022-05-16 12:17:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 487 ms
[2022-05-16 12:17:30] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-16 12:17:30] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-16 12:17:30] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 1 ms to minimize.
[2022-05-16 12:17:30] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:17:30] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 1 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 173 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 1 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 174 places in 129 ms of which 0 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:17:31] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 0 ms to minimize.
[2022-05-16 12:17:32] [INFO ] Deduced a trap composed of 167 places in 107 ms of which 1 ms to minimize.
[2022-05-16 12:17:32] [INFO ] Deduced a trap composed of 121 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:17:32] [INFO ] Deduced a trap composed of 171 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:17:32] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:17:32] [INFO ] Deduced a trap composed of 155 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:32] [INFO ] Deduced a trap composed of 176 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 171 places in 131 ms of which 0 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 1 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:17:33] [INFO ] Deduced a trap composed of 173 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Deduced a trap composed of 180 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Deduced a trap composed of 174 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 0 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:17:34] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4476 ms
[2022-05-16 12:17:35] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2022-05-16 12:17:35] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:17:35] [INFO ] Deduced a trap composed of 118 places in 91 ms of which 0 ms to minimize.
[2022-05-16 12:17:35] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:17:35] [INFO ] Deduced a trap composed of 115 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:17:35] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 1 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Deduced a trap composed of 121 places in 92 ms of which 0 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Deduced a trap composed of 131 places in 87 ms of which 1 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Deduced a trap composed of 128 places in 86 ms of which 0 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Deduced a trap composed of 121 places in 93 ms of which 1 ms to minimize.
[2022-05-16 12:17:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1438 ms
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 1 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 1 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 0 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 0 ms to minimize.
[2022-05-16 12:17:40] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 0 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 0 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Deduced a trap composed of 100 places in 80 ms of which 1 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1107 ms
[2022-05-16 12:17:41] [INFO ] Deduced a trap composed of 111 places in 94 ms of which 0 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Deduced a trap composed of 117 places in 90 ms of which 0 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 1 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Deduced a trap composed of 110 places in 84 ms of which 1 ms to minimize.
[2022-05-16 12:17:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 489 ms
[2022-05-16 12:17:44] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2022-05-16 12:17:44] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2022-05-16 12:17:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-16 12:17:44] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:17:44] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 1 ms to minimize.
[2022-05-16 12:17:44] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2022-05-16 12:17:44] [INFO ] Deduced a trap composed of 112 places in 62 ms of which 0 ms to minimize.
[2022-05-16 12:17:45] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:17:45] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 0 ms to minimize.
[2022-05-16 12:17:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 654 ms
[2022-05-16 12:17:46] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:17:46] [INFO ] Deduced a trap composed of 117 places in 87 ms of which 0 ms to minimize.
[2022-05-16 12:17:46] [INFO ] Deduced a trap composed of 119 places in 93 ms of which 0 ms to minimize.
[2022-05-16 12:17:46] [INFO ] Deduced a trap composed of 122 places in 91 ms of which 0 ms to minimize.
[2022-05-16 12:17:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 486 ms
[2022-05-16 12:17:46] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2022-05-16 12:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-16 12:17:48] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2022-05-16 12:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-16 12:17:48] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2022-05-16 12:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-16 12:17:50] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 0 ms to minimize.
[2022-05-16 12:17:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-16 12:17:52] [INFO ] After 50978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 13227 ms.
[2022-05-16 12:18:05] [INFO ] After 74758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Incomplete random walk after 10000 steps, including 1457 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617463 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617463 steps, saw 309046 distinct states, run finished after 3003 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:18:08] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-16 12:18:08] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:18:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-16 12:18:08] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-16 12:18:08] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:18:08] [INFO ] After 71ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:08] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-16 12:18:08] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 412 transition count 316
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 347 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 374 place count 227 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 400 place count 227 transition count 220
Applied a total of 400 rules in 69 ms. Remains 227 /419 variables (removed 192) and now considering 220/396 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/419 places, 220/396 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 794387 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 794387 steps, saw 397506 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2022-05-16 12:18:12] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-16 12:18:12] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:18:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:18:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 17 ms returned sat
[2022-05-16 12:18:12] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:18:12] [INFO ] After 31ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:12] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:18:12] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 227 cols
[2022-05-16 12:18:12] [INFO ] Computed 44 place invariants in 30 ms
[2022-05-16 12:18:12] [INFO ] Implicit Places using invariants in 311 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 321 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 213/227 places, 220/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 219
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 212 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 205 transition count 212
Applied a total of 16 rules in 17 ms. Remains 205 /213 variables (removed 8) and now considering 212/220 (removed 8) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:18:12] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-16 12:18:12] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:18:12] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:18:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:18:14] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 205/227 places, 212/220 transitions.
Finished structural reductions, in 2 iterations. Remains : 205/227 places, 212/220 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 836370 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{}
Probabilistic random walk after 836370 steps, saw 418490 distinct states, run finished after 3002 ms. (steps per millisecond=278 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:18:17] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-16 12:18:17] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:18:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-05-16 12:18:17] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-16 12:18:17] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:18:17] [INFO ] After 24ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:17] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:18:17] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:18:17] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 12:18:17] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:18:17] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 12:18:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:18:19] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2022-05-16 12:18:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:18:19] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-16 12:18:19] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 205 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 194
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 177 transition count 184
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 177 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 176 transition count 183
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 174 transition count 181
Applied a total of 62 rules in 24 ms. Remains 174 /205 variables (removed 31) and now considering 181/212 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 174 cols
[2022-05-16 12:18:19] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:18:19] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:18:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2022-05-16 12:18:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 12:18:19] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:18:19] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:19] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-05-16 12:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-16 12:18:19] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 12:18:19] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:18:20] [INFO ] Flatten gal took : 115 ms
[2022-05-16 12:18:20] [INFO ] Flatten gal took : 22 ms
[2022-05-16 12:18:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1295961742669339114.gal : 26 ms
[2022-05-16 12:18:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3540754714416061035.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality1295961742669339114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3540754714416061035.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/ReachabilityCardinality3540754714416061035.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23043
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23043 after 50349
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50349 after 106795
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106795 after 224170
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224170 after 461332
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461332 after 942906
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942906 after 1.91211e+06
Detected timeout of ITS tools.
[2022-05-16 12:18:35] [INFO ] Flatten gal took : 19 ms
[2022-05-16 12:18:35] [INFO ] Applying decomposition
[2022-05-16 12:18:35] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16204314987225815057.txt' '-o' '/tmp/graph16204314987225815057.bin' '-w' '/tmp/graph16204314987225815057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16204314987225815057.bin' '-l' '-1' '-v' '-w' '/tmp/graph16204314987225815057.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:18:35] [INFO ] Decomposing Gal with order
[2022-05-16 12:18:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:18:35] [INFO ] Removed a total of 119 redundant transitions.
[2022-05-16 12:18:35] [INFO ] Flatten gal took : 67 ms
[2022-05-16 12:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 9 ms.
[2022-05-16 12:18:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9507236867440995086.gal : 6 ms
[2022-05-16 12:18:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9381448575135750377.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality9507236867440995086.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9381448575135750377.prop' '--nowitness'

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...298
Loading property file /tmp/ReachabilityCardinality9381448575135750377.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :26 after 58
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :58 after 160
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :160 after 10263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8245660629557331875
[2022-05-16 12:18:50] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8245660629557331875
Running compilation step : cd /tmp/ltsmin8245660629557331875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 434 ms.
Running link step : cd /tmp/ltsmin8245660629557331875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8245660629557331875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626412 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626412 steps, saw 313522 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:19:08] [INFO ] Computed 48 place invariants in 28 ms
[2022-05-16 12:19:08] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:19:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-16 12:19:08] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 8 ms returned sat
[2022-05-16 12:19:09] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:19:09] [INFO ] After 63ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:09] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-16 12:19:09] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 412 transition count 317
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 159 place count 335 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 346 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 372 place count 228 transition count 221
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 399 place count 228 transition count 221
Applied a total of 399 rules in 45 ms. Remains 228 /419 variables (removed 191) and now considering 221/396 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/419 places, 221/396 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 822950 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 822950 steps, saw 411793 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2022-05-16 12:19:12] [INFO ] Computed 44 place invariants in 20 ms
[2022-05-16 12:19:12] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:19:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 12:19:12] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 13 ms returned sat
[2022-05-16 12:19:12] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:19:12] [INFO ] After 27ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:12] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 12:19:12] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 228 cols
[2022-05-16 12:19:12] [INFO ] Computed 44 place invariants in 16 ms
[2022-05-16 12:19:12] [INFO ] Implicit Places using invariants in 242 ms returned [44, 49, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180, 194, 199]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 243 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 214/228 places, 221/221 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 220
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 213 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 206 transition count 213
Applied a total of 16 rules in 15 ms. Remains 206 /214 variables (removed 8) and now considering 213/221 (removed 8) transitions.
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:19:12] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-16 12:19:12] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:19:12] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:19:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:19:14] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 206/228 places, 213/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 206/228 places, 213/221 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 876245 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 876245 steps, saw 438273 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:19:17] [INFO ] Computed 31 place invariants in 23 ms
[2022-05-16 12:19:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:19:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-16 12:19:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 12:19:17] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:19:17] [INFO ] After 23ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:17] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:19:17] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:19:17] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-16 12:19:17] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:19:17] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:19:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:19:19] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2022-05-16 12:19:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:19:19] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 12:19:19] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 195
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 178 transition count 185
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 178 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 175 transition count 182
Applied a total of 62 rules in 15 ms. Remains 175 /206 variables (removed 31) and now considering 182/213 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 175 cols
[2022-05-16 12:19:19] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 12:19:19] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:19:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 12:19:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 12:19:19] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:19:19] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:19] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 12:19:19] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:19:19] [INFO ] Flatten gal took : 19 ms
[2022-05-16 12:19:19] [INFO ] Flatten gal took : 17 ms
[2022-05-16 12:19:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9637717809144149508.gal : 12 ms
[2022-05-16 12:19:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3743600759320979281.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality9637717809144149508.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3743600759320979281.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/ReachabilityCardinality3743600759320979281.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1262
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1262 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10156
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10156 after 21793
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21793 after 49371
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49371 after 106543
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106543 after 226643
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :226643 after 471807
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :471807 after 972184
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :972184 after 1.98964e+06
Detected timeout of ITS tools.
[2022-05-16 12:19:34] [INFO ] Flatten gal took : 32 ms
[2022-05-16 12:19:34] [INFO ] Applying decomposition
[2022-05-16 12:19:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4846171641147596569.txt' '-o' '/tmp/graph4846171641147596569.bin' '-w' '/tmp/graph4846171641147596569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4846171641147596569.bin' '-l' '-1' '-v' '-w' '/tmp/graph4846171641147596569.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:19:34] [INFO ] Decomposing Gal with order
[2022-05-16 12:19:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:19:34] [INFO ] Removed a total of 126 redundant transitions.
[2022-05-16 12:19:34] [INFO ] Flatten gal took : 37 ms
[2022-05-16 12:19:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2022-05-16 12:19:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1949476868939645037.gal : 4 ms
[2022-05-16 12:19:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7919370661012657039.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality1949476868939645037.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7919370661012657039.prop' '--nowitness'

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...298
Loading property file /tmp/ReachabilityCardinality7919370661012657039.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29654
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9621478701029651648
[2022-05-16 12:19:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9621478701029651648
Running compilation step : cd /tmp/ltsmin9621478701029651648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin9621478701029651648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9621478701029651648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1486 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 621020 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 621020 steps, saw 310824 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:20:07] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-16 12:20:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:20:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-16 12:20:07] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-16 12:20:08] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:20:08] [INFO ] After 46ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:08] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2022-05-16 12:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-16 12:20:08] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-16 12:20:08] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 412 transition count 316
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 346 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 372 place count 228 transition count 221
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 399 place count 228 transition count 221
Applied a total of 399 rules in 30 ms. Remains 228 /419 variables (removed 191) and now considering 221/396 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/419 places, 221/396 transitions.
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 823354 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 823354 steps, saw 411997 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2022-05-16 12:20:11] [INFO ] Computed 44 place invariants in 17 ms
[2022-05-16 12:20:11] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:20:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:20:11] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 14 ms returned sat
[2022-05-16 12:20:11] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:20:11] [INFO ] After 21ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:11] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:20:11] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 228 cols
[2022-05-16 12:20:11] [INFO ] Computed 44 place invariants in 10 ms
[2022-05-16 12:20:12] [INFO ] Implicit Places using invariants in 320 ms returned [44, 49, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180, 194, 199]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 324 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 214/228 places, 221/221 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 220
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 213 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 206 transition count 213
Applied a total of 16 rules in 11 ms. Remains 206 /214 variables (removed 8) and now considering 213/221 (removed 8) transitions.
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:20:12] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-16 12:20:12] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:20:12] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:20:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:20:13] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 206/228 places, 213/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 206/228 places, 213/221 transitions.
Incomplete random walk after 10000 steps, including 1470 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 832880 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 832880 steps, saw 416604 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:20:16] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-16 12:20:16] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:20:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-16 12:20:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 12:20:16] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:20:16] [INFO ] After 32ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:16] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:20:16] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:20:16] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 12:20:16] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:20:16] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:20:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:20:17] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2022-05-16 12:20:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2022-05-16 12:20:17] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 12:20:17] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 195
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 178 transition count 185
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 178 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 175 transition count 182
Applied a total of 62 rules in 13 ms. Remains 175 /206 variables (removed 31) and now considering 182/213 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 175 cols
[2022-05-16 12:20:17] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 12:20:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:20:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-16 12:20:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-16 12:20:17] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:20:17] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:18] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2022-05-16 12:20:18] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:20:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2022-05-16 12:20:18] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 12:20:18] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:20:18] [INFO ] Flatten gal took : 17 ms
[2022-05-16 12:20:18] [INFO ] Flatten gal took : 15 ms
[2022-05-16 12:20:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6409271894380841223.gal : 2 ms
[2022-05-16 12:20:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8298730576632765101.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality6409271894380841223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8298730576632765101.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/ReachabilityCardinality8298730576632765101.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23034
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23034 after 50314
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50314 after 106695
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106695 after 224080
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224080 after 461196
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461196 after 942753
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942753 after 1.91193e+06
Detected timeout of ITS tools.
[2022-05-16 12:20:33] [INFO ] Flatten gal took : 13 ms
[2022-05-16 12:20:33] [INFO ] Applying decomposition
[2022-05-16 12:20:33] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5393037197809909471.txt' '-o' '/tmp/graph5393037197809909471.bin' '-w' '/tmp/graph5393037197809909471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5393037197809909471.bin' '-l' '-1' '-v' '-w' '/tmp/graph5393037197809909471.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:20:33] [INFO ] Decomposing Gal with order
[2022-05-16 12:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:20:33] [INFO ] Removed a total of 112 redundant transitions.
[2022-05-16 12:20:33] [INFO ] Flatten gal took : 28 ms
[2022-05-16 12:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2022-05-16 12:20:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11625194153689769720.gal : 3 ms
[2022-05-16 12:20:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3154331453732160882.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality11625194153689769720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3154331453732160882.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality3154331453732160882.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 165
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :165 after 449
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :449 after 21333
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6500176215599080930
[2022-05-16 12:20:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6500176215599080930
Running compilation step : cd /tmp/ltsmin6500176215599080930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 334 ms.
Running link step : cd /tmp/ltsmin6500176215599080930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6500176215599080930;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619895 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619895 steps, saw 310265 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:21:06] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-16 12:21:06] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:21:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-16 12:21:06] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 12 ms returned sat
[2022-05-16 12:21:06] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:21:06] [INFO ] After 117ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:06] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 12:21:07] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 412 transition count 317
Reduce places removed 77 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 335 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 333 transition count 315
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 162 place count 333 transition count 302
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 188 place count 320 transition count 302
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 300 place count 264 transition count 246
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 253 transition count 246
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 348 place count 253 transition count 220
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 374 place count 227 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 400 place count 227 transition count 220
Applied a total of 400 rules in 42 ms. Remains 227 /419 variables (removed 192) and now considering 220/396 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/419 places, 220/396 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 819265 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 819265 steps, saw 409945 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2022-05-16 12:21:10] [INFO ] Computed 44 place invariants in 12 ms
[2022-05-16 12:21:10] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:21:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 12:21:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 13 ms returned sat
[2022-05-16 12:21:10] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:21:10] [INFO ] After 187ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:10] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-16 12:21:10] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 227 cols
[2022-05-16 12:21:10] [INFO ] Computed 44 place invariants in 14 ms
[2022-05-16 12:21:10] [INFO ] Implicit Places using invariants in 221 ms returned [49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 221 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 214/227 places, 220/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 219
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 213 transition count 213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 207 transition count 213
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 207 transition count 213
Applied a total of 15 rules in 13 ms. Remains 207 /214 variables (removed 7) and now considering 213/220 (removed 7) transitions.
// Phase 1: matrix 213 rows 207 cols
[2022-05-16 12:21:10] [INFO ] Computed 32 place invariants in 7 ms
[2022-05-16 12:21:10] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-16 12:21:10] [INFO ] Computed 32 place invariants in 7 ms
[2022-05-16 12:21:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:21:12] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 207/227 places, 213/220 transitions.
Finished structural reductions, in 2 iterations. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 800735 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{}
Probabilistic random walk after 800735 steps, saw 400678 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 207 cols
[2022-05-16 12:21:15] [INFO ] Computed 32 place invariants in 15 ms
[2022-05-16 12:21:15] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:21:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-05-16 12:21:15] [INFO ] [Nat]Absence check using 8 positive and 24 generalized place invariants in 4 ms returned sat
[2022-05-16 12:21:15] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:21:15] [INFO ] After 36ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:15] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 12:21:15] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 207 cols
[2022-05-16 12:21:15] [INFO ] Computed 32 place invariants in 16 ms
[2022-05-16 12:21:16] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-16 12:21:16] [INFO ] Computed 32 place invariants in 7 ms
[2022-05-16 12:21:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:21:17] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2022-05-16 12:21:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 213 rows 207 cols
[2022-05-16 12:21:17] [INFO ] Computed 32 place invariants in 7 ms
[2022-05-16 12:21:17] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 11 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2022-05-16 12:21:17] [INFO ] Computed 32 place invariants in 9 ms
[2022-05-16 12:21:17] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:21:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-16 12:21:17] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 12:21:17] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:21:17] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:17] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:21:18] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2022-05-16 12:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2022-05-16 12:21:18] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-16 12:21:18] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:21:18] [INFO ] Flatten gal took : 14 ms
[2022-05-16 12:21:18] [INFO ] Flatten gal took : 12 ms
[2022-05-16 12:21:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7943739855979311183.gal : 2 ms
[2022-05-16 12:21:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14440666609515311902.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality7943739855979311183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14440666609515311902.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...320
Loading property file /tmp/ReachabilityCardinality14440666609515311902.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 369
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :369 after 1257
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1257 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10156
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10156 after 21713
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21713 after 49363
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49363 after 106407
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106407 after 226523
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :226523 after 471699
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :471699 after 971928
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :971928 after 1.98937e+06
Detected timeout of ITS tools.
[2022-05-16 12:21:33] [INFO ] Flatten gal took : 10 ms
[2022-05-16 12:21:33] [INFO ] Applying decomposition
[2022-05-16 12:21:33] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7164355844348497606.txt' '-o' '/tmp/graph7164355844348497606.bin' '-w' '/tmp/graph7164355844348497606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7164355844348497606.bin' '-l' '-1' '-v' '-w' '/tmp/graph7164355844348497606.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:21:33] [INFO ] Decomposing Gal with order
[2022-05-16 12:21:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:21:33] [INFO ] Removed a total of 117 redundant transitions.
[2022-05-16 12:21:33] [INFO ] Flatten gal took : 21 ms
[2022-05-16 12:21:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2022-05-16 12:21:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8033280794338287670.gal : 3 ms
[2022-05-16 12:21:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10936803168752642203.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality8033280794338287670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10936803168752642203.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality10936803168752642203.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 151
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :151 after 253
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :253 after 10109
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11539668602543589449
[2022-05-16 12:21:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11539668602543589449
Running compilation step : cd /tmp/ltsmin11539668602543589449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin11539668602543589449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11539668602543589449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618189 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 618189 steps, saw 309410 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:22:06] [INFO ] Computed 48 place invariants in 33 ms
[2022-05-16 12:22:06] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:22:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-05-16 12:22:06] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 8 ms returned sat
[2022-05-16 12:22:06] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:22:06] [INFO ] After 73ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:06] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-16 12:22:06] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 412 transition count 317
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 158 place count 335 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 158 place count 335 transition count 305
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 182 place count 323 transition count 305
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 296 place count 266 transition count 248
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 316 place count 256 transition count 248
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 345 place count 256 transition count 219
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 374 place count 227 transition count 219
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 400 place count 227 transition count 219
Applied a total of 400 rules in 33 ms. Remains 227 /419 variables (removed 192) and now considering 219/396 (removed 177) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/419 places, 219/396 transitions.
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 815402 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 815402 steps, saw 408018 distinct states, run finished after 3004 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 227 cols
[2022-05-16 12:22:09] [INFO ] Computed 44 place invariants in 13 ms
[2022-05-16 12:22:09] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:22:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:22:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 15 ms returned sat
[2022-05-16 12:22:10] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:22:10] [INFO ] After 75ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:10] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-05-16 12:22:10] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2022-05-16 12:22:10] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2022-05-16 12:22:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2022-05-16 12:22:10] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-16 12:22:10] [INFO ] After 565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 219/219 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 227 cols
[2022-05-16 12:22:10] [INFO ] Computed 44 place invariants in 8 ms
[2022-05-16 12:22:10] [INFO ] Implicit Places using invariants in 220 ms returned [43, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 222 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 213/227 places, 219/219 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 218
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 212 transition count 211
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 205 transition count 211
Applied a total of 16 rules in 10 ms. Remains 205 /213 variables (removed 8) and now considering 211/219 (removed 8) transitions.
// Phase 1: matrix 211 rows 205 cols
[2022-05-16 12:22:10] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 12:22:10] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 211 rows 205 cols
[2022-05-16 12:22:10] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 12:22:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:22:12] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 205/227 places, 211/219 transitions.
Finished structural reductions, in 2 iterations. Remains : 205/227 places, 211/219 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 816065 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 816065 steps, saw 408341 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 211 rows 205 cols
[2022-05-16 12:22:15] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 12:22:15] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:22:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 12:22:15] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-16 12:22:15] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:22:15] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:15] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:22:15] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-05-16 12:22:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2022-05-16 12:22:15] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-16 12:22:15] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 211/211 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 205 cols
[2022-05-16 12:22:15] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-16 12:22:15] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 211 rows 205 cols
[2022-05-16 12:22:15] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:22:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:22:17] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2022-05-16 12:22:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 211 rows 205 cols
[2022-05-16 12:22:17] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 12:22:17] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 211/211 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 204 transition count 210
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 2 place count 204 transition count 193
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 187 transition count 193
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 177 transition count 183
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 177 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 176 transition count 182
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 176 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 174 transition count 180
Applied a total of 62 rules in 14 ms. Remains 174 /205 variables (removed 31) and now considering 180/211 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 174 cols
[2022-05-16 12:22:17] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 12:22:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:22:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 12:22:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 12:22:17] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:22:17] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:17] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-16 12:22:17] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:22:17] [INFO ] Flatten gal took : 16 ms
[2022-05-16 12:22:17] [INFO ] Flatten gal took : 9 ms
[2022-05-16 12:22:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2783470812488614630.gal : 1 ms
[2022-05-16 12:22:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16328843931248205001.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality2783470812488614630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16328843931248205001.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...320
Loading property file /tmp/ReachabilityCardinality16328843931248205001.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23034
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23034 after 50314
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50314 after 106695
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106695 after 224080
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224080 after 461196
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461196 after 942753
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942753 after 1.91193e+06
Detected timeout of ITS tools.
[2022-05-16 12:22:32] [INFO ] Flatten gal took : 11 ms
[2022-05-16 12:22:32] [INFO ] Applying decomposition
[2022-05-16 12:22:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8552285193261901338.txt' '-o' '/tmp/graph8552285193261901338.bin' '-w' '/tmp/graph8552285193261901338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8552285193261901338.bin' '-l' '-1' '-v' '-w' '/tmp/graph8552285193261901338.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:22:32] [INFO ] Decomposing Gal with order
[2022-05-16 12:22:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:22:32] [INFO ] Removed a total of 114 redundant transitions.
[2022-05-16 12:22:32] [INFO ] Flatten gal took : 18 ms
[2022-05-16 12:22:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2022-05-16 12:22:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2994287751920805822.gal : 3 ms
[2022-05-16 12:22:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11494030105916013067.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality2994287751920805822.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11494030105916013067.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality11494030105916013067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 148338
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11079506335548671203
[2022-05-16 12:22:47] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11079506335548671203
Running compilation step : cd /tmp/ltsmin11079506335548671203;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 334 ms.
Running link step : cd /tmp/ltsmin11079506335548671203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11079506335548671203;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 615849 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615849 steps, saw 308239 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:23:06] [INFO ] Computed 48 place invariants in 23 ms
[2022-05-16 12:23:06] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:23:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-05-16 12:23:06] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 8 ms returned sat
[2022-05-16 12:23:06] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:23:06] [INFO ] After 115ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:06] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 12:23:06] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 412 transition count 315
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 162 place count 333 transition count 315
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 162 place count 333 transition count 303
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 318 place count 255 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 345 place count 255 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 372 place count 228 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 398 place count 228 transition count 220
Applied a total of 398 rules in 38 ms. Remains 228 /419 variables (removed 191) and now considering 220/396 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/419 places, 220/396 transitions.
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 789421 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 789421 steps, saw 395023 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 228 cols
[2022-05-16 12:23:09] [INFO ] Computed 44 place invariants in 10 ms
[2022-05-16 12:23:09] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:23:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:23:09] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 12 ms returned sat
[2022-05-16 12:23:09] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:23:09] [INFO ] After 157ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:09] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-16 12:23:09] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/228 places, 220/220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 228 cols
[2022-05-16 12:23:09] [INFO ] Computed 44 place invariants in 9 ms
[2022-05-16 12:23:10] [INFO ] Implicit Places using invariants in 269 ms returned [43, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180, 194, 199]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 270 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 214/228 places, 220/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 219
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 206 transition count 212
Applied a total of 16 rules in 11 ms. Remains 206 /214 variables (removed 8) and now considering 212/220 (removed 8) transitions.
// Phase 1: matrix 212 rows 206 cols
[2022-05-16 12:23:10] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 12:23:10] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 212 rows 206 cols
[2022-05-16 12:23:10] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:23:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:23:12] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 206/228 places, 212/220 transitions.
Finished structural reductions, in 2 iterations. Remains : 206/228 places, 212/220 transitions.
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 865095 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 865095 steps, saw 432709 distinct states, run finished after 3003 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 206 cols
[2022-05-16 12:23:15] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 12:23:15] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:23:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2022-05-16 12:23:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 12:23:15] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:23:15] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:15] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 12:23:15] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 206 cols
[2022-05-16 12:23:15] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:23:15] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 212 rows 206 cols
[2022-05-16 12:23:15] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:23:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:23:17] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2022-05-16 12:23:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 212 rows 206 cols
[2022-05-16 12:23:17] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:23:17] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 212/212 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 205 transition count 211
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 2 place count 205 transition count 194
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 178 transition count 184
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 178 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 177 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 175 transition count 181
Applied a total of 62 rules in 16 ms. Remains 175 /206 variables (removed 31) and now considering 181/212 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 175 cols
[2022-05-16 12:23:17] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-16 12:23:17] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:23:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 12:23:17] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 5 ms returned sat
[2022-05-16 12:23:17] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:23:17] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:17] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2022-05-16 12:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-16 12:23:17] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 12:23:17] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:23:17] [INFO ] Flatten gal took : 10 ms
[2022-05-16 12:23:17] [INFO ] Flatten gal took : 9 ms
[2022-05-16 12:23:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10093160764952827802.gal : 2 ms
[2022-05-16 12:23:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5815973856438597846.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality10093160764952827802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5815973856438597846.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...320
Loading property file /tmp/ReachabilityCardinality5815973856438597846.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1286
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1286 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10222
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10222 after 21829
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21829 after 49313
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49313 after 105426
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :105426 after 221610
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :221610 after 457731
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :457731 after 937742
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :937742 after 1.90598e+06
Detected timeout of ITS tools.
[2022-05-16 12:23:32] [INFO ] Flatten gal took : 10 ms
[2022-05-16 12:23:32] [INFO ] Applying decomposition
[2022-05-16 12:23:32] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10966855614727413071.txt' '-o' '/tmp/graph10966855614727413071.bin' '-w' '/tmp/graph10966855614727413071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10966855614727413071.bin' '-l' '-1' '-v' '-w' '/tmp/graph10966855614727413071.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:23:32] [INFO ] Decomposing Gal with order
[2022-05-16 12:23:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:23:32] [INFO ] Removed a total of 114 redundant transitions.
[2022-05-16 12:23:32] [INFO ] Flatten gal took : 27 ms
[2022-05-16 12:23:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2022-05-16 12:23:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9841930072134456130.gal : 11 ms
[2022-05-16 12:23:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15583508797619638813.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality9841930072134456130.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15583508797619638813.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality15583508797619638813.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :136 after 145
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :54915 after 55033
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4190369396948766253
[2022-05-16 12:23:47] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4190369396948766253
Running compilation step : cd /tmp/ltsmin4190369396948766253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin4190369396948766253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4190369396948766253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631395 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631395 steps, saw 316010 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:24:05] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-16 12:24:05] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:24:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-16 12:24:05] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-16 12:24:06] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:24:06] [INFO ] After 209ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:06] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 12:24:06] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 412 transition count 316
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 161 place count 334 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 333 transition count 315
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 162 place count 333 transition count 302
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 188 place count 320 transition count 302
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 300 place count 264 transition count 246
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 320 place count 254 transition count 246
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 348 place count 254 transition count 218
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 376 place count 226 transition count 218
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 401 place count 226 transition count 218
Applied a total of 401 rules in 29 ms. Remains 226 /419 variables (removed 193) and now considering 218/396 (removed 178) transitions.
Finished structural reductions, in 1 iterations. Remains : 226/419 places, 218/396 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 819617 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 819617 steps, saw 410125 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 226 cols
[2022-05-16 12:24:09] [INFO ] Computed 44 place invariants in 16 ms
[2022-05-16 12:24:09] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:24:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 12:24:09] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 16 ms returned sat
[2022-05-16 12:24:09] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:24:09] [INFO ] After 241ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:09] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:24:09] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 226/226 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 226/226 places, 218/218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 226/226 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 226 cols
[2022-05-16 12:24:09] [INFO ] Computed 44 place invariants in 10 ms
[2022-05-16 12:24:10] [INFO ] Implicit Places using invariants in 227 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 172, 178, 192, 197]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 237 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 212/226 places, 218/218 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 211 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 204 transition count 210
Applied a total of 16 rules in 9 ms. Remains 204 /212 variables (removed 8) and now considering 210/218 (removed 8) transitions.
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 12:24:10] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-16 12:24:10] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 12:24:10] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-16 12:24:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:24:11] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 204/226 places, 210/218 transitions.
Finished structural reductions, in 2 iterations. Remains : 204/226 places, 210/218 transitions.
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 811718 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 811718 steps, saw 406167 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 12:24:14] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 12:24:14] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:24:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2022-05-16 12:24:14] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 12:24:14] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:24:14] [INFO ] After 73ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:14] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:24:14] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 12:24:14] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-16 12:24:14] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 12:24:14] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 12:24:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2022-05-16 12:24:15] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2022-05-16 12:24:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 12:24:15] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-16 12:24:15] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 210/210 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 204 transition count 193
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 187 transition count 193
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 177 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 177 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 176 transition count 182
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 176 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 174 transition count 180
Applied a total of 60 rules in 11 ms. Remains 174 /204 variables (removed 30) and now considering 180/210 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 174 cols
[2022-05-16 12:24:15] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-16 12:24:15] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:24:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-16 12:24:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 12:24:16] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 12:24:16] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:16] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 12:24:16] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:24:16] [INFO ] Flatten gal took : 11 ms
[2022-05-16 12:24:16] [INFO ] Flatten gal took : 8 ms
[2022-05-16 12:24:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6817927009279315657.gal : 1 ms
[2022-05-16 12:24:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17708491801006963029.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality6817927009279315657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17708491801006963029.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...320
Loading property file /tmp/ReachabilityCardinality17708491801006963029.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1345
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1345 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23034
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23034 after 50314
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50314 after 106695
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106695 after 224034
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224034 after 461128
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461128 after 942666
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942666 after 1.91179e+06
Detected timeout of ITS tools.
[2022-05-16 12:24:31] [INFO ] Flatten gal took : 14 ms
[2022-05-16 12:24:31] [INFO ] Applying decomposition
[2022-05-16 12:24:31] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11588199067108586185.txt' '-o' '/tmp/graph11588199067108586185.bin' '-w' '/tmp/graph11588199067108586185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11588199067108586185.bin' '-l' '-1' '-v' '-w' '/tmp/graph11588199067108586185.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:24:31] [INFO ] Decomposing Gal with order
[2022-05-16 12:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:24:31] [INFO ] Removed a total of 114 redundant transitions.
[2022-05-16 12:24:31] [INFO ] Flatten gal took : 29 ms
[2022-05-16 12:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 17 ms.
[2022-05-16 12:24:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11009980113329998395.gal : 3 ms
[2022-05-16 12:24:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10029189191115993379.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12675411907321021196;'/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/ReachabilityCardinality11009980113329998395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10029189191115993379.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality10029189191115993379.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 27262
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17297386987642911105
[2022-05-16 12:24:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17297386987642911105
Running compilation step : cd /tmp/ltsmin17297386987642911105;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin17297386987642911105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17297386987642911105;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 605077 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 605077 steps, saw 302849 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2022-05-16 12:25:04] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-16 12:25:04] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:25:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-16 12:25:04] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-16 12:25:04] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:25:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 12:25:04] [INFO ] After 117ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:25:04] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:25:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-16 12:25:05] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-16 12:25:05] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 412 transition count 316
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 347 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 374 place count 227 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 400 place count 227 transition count 220
Applied a total of 400 rules in 28 ms. Remains 227 /419 variables (removed 192) and now considering 220/396 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/419 places, 220/396 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 784511 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 784511 steps, saw 392566 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2022-05-16 12:25:08] [INFO ] Computed 44 place invariants in 14 ms
[2022-05-16 12:25:08] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 12:25:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 12:25:08] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 14 ms returned sat
[2022-05-16 12:25:08] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 12:25:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-16 12:25:08] [INFO ] After 65ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 12:25:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2022-05-16 12:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-16 12:25:08] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 12:25:08] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 227 cols
[2022-05-16 12:25:08] [INFO ] Computed 44 place invariants in 10 ms
[2022-05-16 12:25:08] [INFO ] Implicit Places using invariants in 227 ms returned [43, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 228 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 213/227 places, 220/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 219
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 212 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 205 transition count 212
Applied a total of 16 rules in 11 ms. Remains 205 /213 variables (removed 8) and now considering 212/220 (removed 8) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:25:08] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-16 12:25:08] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 12:25:08] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 12:25:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-16 12:25:10] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 205/227 places, 212/220 transitions.
Finished structural reductions, in 2 iterations. Remains : 205/227 places, 212/220 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 StableMarking -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="DoubleExponent-PT-010"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r085-tall-165260115500123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;