Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r151-smll-167819438100298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r151-smll-167819438100298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678391638209

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 19:54:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 19:54:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:54:01] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-09 19:54:01] [INFO ] Transformed 534 places.
[2023-03-09 19:54:01] [INFO ] Transformed 498 transitions.
[2023-03-09 19:54:01] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 234 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 323 resets, run finished after 992 ms. (steps per millisecond=10 ) properties (out of 523) seen :44
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 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 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) 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 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 11 ms. (steps per millisecond=9 ) 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 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=9 ) 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 2 resets, run finished after 11 ms. (steps per millisecond=9 ) 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 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 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 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 11 ms. (steps per millisecond=9 ) 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 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 9 ms. (steps per millisecond=11 ) 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 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 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 101 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=7 ) 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 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) 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 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 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 9 ms. (steps per millisecond=11 ) 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 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 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
Interrupted probabilistic random walk after 68654 steps, run timeout after 3001 ms. (steps per millisecond=22 ) 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 68654 steps, saw 34337 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :91
Running SMT prover for 388 properties.
// Phase 1: matrix 498 rows 534 cols
[2023-03-09 19:54:06] [INFO ] Computed 54 place invariants in 83 ms
[2023-03-09 19:54:13] [INFO ] After 6958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:388
[2023-03-09 19:54:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2023-03-09 19:54:18] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 36 ms returned sat
[2023-03-09 19:54:33] [INFO ] After 11033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :388
[2023-03-09 19:54:34] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 10 ms to minimize.
[2023-03-09 19:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2023-03-09 19:54:34] [INFO ] Deduced a trap composed of 174 places in 292 ms of which 3 ms to minimize.
[2023-03-09 19:54:35] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 1 ms to minimize.
[2023-03-09 19:54:35] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2023-03-09 19:54:35] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 2 ms to minimize.
[2023-03-09 19:54:36] [INFO ] Deduced a trap composed of 187 places in 237 ms of which 1 ms to minimize.
[2023-03-09 19:54:36] [INFO ] Deduced a trap composed of 61 places in 325 ms of which 2 ms to minimize.
[2023-03-09 19:54:36] [INFO ] Deduced a trap composed of 60 places in 217 ms of which 2 ms to minimize.
[2023-03-09 19:54:37] [INFO ] Deduced a trap composed of 181 places in 227 ms of which 1 ms to minimize.
[2023-03-09 19:54:37] [INFO ] Deduced a trap composed of 179 places in 213 ms of which 1 ms to minimize.
[2023-03-09 19:54:37] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 1 ms to minimize.
[2023-03-09 19:54:38] [INFO ] Deduced a trap composed of 196 places in 179 ms of which 1 ms to minimize.
[2023-03-09 19:54:38] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 19:54:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 19:54:38] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:388
Fused 388 Parikh solutions to 363 different solutions.
Parikh walk visited 0 properties in 30415 ms.
Support contains 388 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 4 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 12 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 12 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 182 ms. Remains 457 /534 variables (removed 77) and now considering 426/498 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 457/534 places, 426/498 transitions.
Interrupted random walk after 535457 steps, including 68660 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 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 839 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 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 899 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 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 853 resets, run finished after 369 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 372 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 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 833 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 817 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 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 860 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 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 849 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 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 888 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 796 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Interrupted probabilistic random walk after 4196399 steps, run timeout after 144001 ms. (steps per millisecond=29 ) 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 4196399 steps, saw 2097968 distinct states, run finished after 144002 ms. (steps per millisecond=29 ) properties seen :53
Running SMT prover for 335 properties.
// Phase 1: matrix 426 rows 457 cols
[2023-03-09 19:58:21] [INFO ] Computed 54 place invariants in 26 ms
[2023-03-09 19:58:26] [INFO ] After 4320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 19:58:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 19:58:29] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 43 ms returned sat
[2023-03-09 19:58:41] [INFO ] After 8921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 19:58:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 19:58:49] [INFO ] After 7791ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 19:58:49] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-09 19:58:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-09 19:58:50] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-09 19:58:50] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 1 ms to minimize.
[2023-03-09 19:58:50] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-09 19:58:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 680 ms
[2023-03-09 19:58:51] [INFO ] Deduced a trap composed of 144 places in 176 ms of which 0 ms to minimize.
[2023-03-09 19:58:51] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 1 ms to minimize.
[2023-03-09 19:58:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-03-09 19:58:52] [INFO ] Deduced a trap composed of 120 places in 223 ms of which 2 ms to minimize.
[2023-03-09 19:58:52] [INFO ] Deduced a trap composed of 157 places in 217 ms of which 1 ms to minimize.
[2023-03-09 19:58:52] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 1 ms to minimize.
[2023-03-09 19:58:52] [INFO ] Deduced a trap composed of 178 places in 220 ms of which 1 ms to minimize.
[2023-03-09 19:58:53] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 1 ms to minimize.
[2023-03-09 19:58:53] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 2 ms to minimize.
[2023-03-09 19:58:53] [INFO ] Deduced a trap composed of 133 places in 213 ms of which 1 ms to minimize.
[2023-03-09 19:58:53] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 1 ms to minimize.
[2023-03-09 19:58:54] [INFO ] Deduced a trap composed of 152 places in 304 ms of which 1 ms to minimize.
[2023-03-09 19:58:54] [INFO ] Deduced a trap composed of 131 places in 266 ms of which 1 ms to minimize.
[2023-03-09 19:58:54] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 1 ms to minimize.
[2023-03-09 19:58:54] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 1 ms to minimize.
[2023-03-09 19:58:55] [INFO ] Deduced a trap composed of 182 places in 209 ms of which 0 ms to minimize.
[2023-03-09 19:58:55] [INFO ] Deduced a trap composed of 187 places in 218 ms of which 1 ms to minimize.
[2023-03-09 19:58:55] [INFO ] Deduced a trap composed of 145 places in 313 ms of which 2 ms to minimize.
[2023-03-09 19:58:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3911 ms
[2023-03-09 19:58:56] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2023-03-09 19:58:56] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2023-03-09 19:58:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2023-03-09 19:58:58] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 1 ms to minimize.
[2023-03-09 19:58:59] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 1 ms to minimize.
[2023-03-09 19:58:59] [INFO ] Deduced a trap composed of 139 places in 260 ms of which 1 ms to minimize.
[2023-03-09 19:58:59] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 2 ms to minimize.
[2023-03-09 19:58:59] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 1 ms to minimize.
[2023-03-09 19:58:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1375 ms
[2023-03-09 19:59:00] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 1 ms to minimize.
[2023-03-09 19:59:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-09 19:59:01] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2023-03-09 19:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-09 19:59:01] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-09 19:59:01] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 1 ms to minimize.
[2023-03-09 19:59:02] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 1 ms to minimize.
[2023-03-09 19:59:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1021 ms
[2023-03-09 19:59:02] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 0 ms to minimize.
[2023-03-09 19:59:03] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 1 ms to minimize.
[2023-03-09 19:59:03] [INFO ] Deduced a trap composed of 122 places in 229 ms of which 1 ms to minimize.
[2023-03-09 19:59:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 825 ms
[2023-03-09 19:59:04] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 1 ms to minimize.
[2023-03-09 19:59:04] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-09 19:59:04] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2023-03-09 19:59:04] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2023-03-09 19:59:04] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 1 ms to minimize.
[2023-03-09 19:59:05] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 1 ms to minimize.
[2023-03-09 19:59:05] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 1 ms to minimize.
[2023-03-09 19:59:05] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 16 ms to minimize.
[2023-03-09 19:59:05] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-09 19:59:05] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2023-03-09 19:59:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1787 ms
[2023-03-09 19:59:06] [INFO ] Deduced a trap composed of 148 places in 223 ms of which 1 ms to minimize.
[2023-03-09 19:59:06] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 1 ms to minimize.
[2023-03-09 19:59:07] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 0 ms to minimize.
[2023-03-09 19:59:07] [INFO ] Deduced a trap composed of 210 places in 215 ms of which 1 ms to minimize.
[2023-03-09 19:59:07] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 2 ms to minimize.
[2023-03-09 19:59:07] [INFO ] Deduced a trap composed of 184 places in 302 ms of which 1 ms to minimize.
[2023-03-09 19:59:08] [INFO ] Deduced a trap composed of 152 places in 272 ms of which 1 ms to minimize.
[2023-03-09 19:59:08] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2023-03-09 19:59:09] [INFO ] Deduced a trap composed of 141 places in 326 ms of which 3 ms to minimize.
[2023-03-09 19:59:09] [INFO ] Deduced a trap composed of 176 places in 229 ms of which 5 ms to minimize.
[2023-03-09 19:59:09] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 0 ms to minimize.
[2023-03-09 19:59:09] [INFO ] Deduced a trap composed of 176 places in 206 ms of which 1 ms to minimize.
[2023-03-09 19:59:10] [INFO ] Deduced a trap composed of 207 places in 192 ms of which 1 ms to minimize.
[2023-03-09 19:59:10] [INFO ] Deduced a trap composed of 183 places in 209 ms of which 1 ms to minimize.
[2023-03-09 19:59:10] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 1 ms to minimize.
[2023-03-09 19:59:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4288 ms
[2023-03-09 19:59:12] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 1 ms to minimize.
[2023-03-09 19:59:13] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 1 ms to minimize.
[2023-03-09 19:59:13] [INFO ] Deduced a trap composed of 150 places in 170 ms of which 1 ms to minimize.
[2023-03-09 19:59:13] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 0 ms to minimize.
[2023-03-09 19:59:13] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 1 ms to minimize.
[2023-03-09 19:59:14] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 1 ms to minimize.
[2023-03-09 19:59:14] [INFO ] Deduced a trap composed of 198 places in 200 ms of which 1 ms to minimize.
[2023-03-09 19:59:14] [INFO ] Deduced a trap composed of 130 places in 197 ms of which 0 ms to minimize.
[2023-03-09 19:59:14] [INFO ] Deduced a trap composed of 124 places in 189 ms of which 1 ms to minimize.
[2023-03-09 19:59:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2108 ms
[2023-03-09 19:59:15] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 1 ms to minimize.
[2023-03-09 19:59:15] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 0 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 0 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 0 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 1 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 1 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 0 ms to minimize.
[2023-03-09 19:59:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1168 ms
[2023-03-09 19:59:17] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 0 ms to minimize.
[2023-03-09 19:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-09 19:59:19] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 0 ms to minimize.
[2023-03-09 19:59:19] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 0 ms to minimize.
[2023-03-09 19:59:19] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 0 ms to minimize.
[2023-03-09 19:59:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 706 ms
[2023-03-09 19:59:20] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 1 ms to minimize.
[2023-03-09 19:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-09 19:59:21] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 0 ms to minimize.
[2023-03-09 19:59:21] [INFO ] Deduced a trap composed of 142 places in 198 ms of which 1 ms to minimize.
[2023-03-09 19:59:21] [INFO ] Deduced a trap composed of 132 places in 183 ms of which 0 ms to minimize.
[2023-03-09 19:59:21] [INFO ] Deduced a trap composed of 196 places in 204 ms of which 1 ms to minimize.
[2023-03-09 19:59:22] [INFO ] Deduced a trap composed of 114 places in 191 ms of which 0 ms to minimize.
[2023-03-09 19:59:22] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 0 ms to minimize.
[2023-03-09 19:59:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1384 ms
[2023-03-09 19:59:23] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 0 ms to minimize.
[2023-03-09 19:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-09 19:59:25] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2023-03-09 19:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-09 19:59:26] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 1 ms to minimize.
[2023-03-09 19:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-09 19:59:27] [INFO ] Deduced a trap composed of 186 places in 188 ms of which 0 ms to minimize.
[2023-03-09 19:59:27] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 1 ms to minimize.
[2023-03-09 19:59:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2023-03-09 19:59:28] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 1 ms to minimize.
[2023-03-09 19:59:28] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 0 ms to minimize.
[2023-03-09 19:59:28] [INFO ] Deduced a trap composed of 99 places in 74 ms of which 0 ms to minimize.
[2023-03-09 19:59:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2023-03-09 19:59:30] [INFO ] Deduced a trap composed of 177 places in 190 ms of which 1 ms to minimize.
[2023-03-09 19:59:30] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 1 ms to minimize.
[2023-03-09 19:59:30] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-09 19:59:31] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 0 ms to minimize.
[2023-03-09 19:59:31] [INFO ] Deduced a trap composed of 124 places in 191 ms of which 1 ms to minimize.
[2023-03-09 19:59:31] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-09 19:59:31] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 1 ms to minimize.
[2023-03-09 19:59:32] [INFO ] Deduced a trap composed of 100 places in 311 ms of which 1 ms to minimize.
[2023-03-09 19:59:32] [INFO ] Deduced a trap composed of 201 places in 232 ms of which 1 ms to minimize.
[2023-03-09 19:59:32] [INFO ] Deduced a trap composed of 182 places in 193 ms of which 1 ms to minimize.
[2023-03-09 19:59:32] [INFO ] Deduced a trap composed of 148 places in 250 ms of which 1 ms to minimize.
[2023-03-09 19:59:33] [INFO ] Deduced a trap composed of 164 places in 308 ms of which 1 ms to minimize.
[2023-03-09 19:59:33] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 1 ms to minimize.
[2023-03-09 19:59:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3476 ms
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 102 places in 307 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 110 places in 210 ms of which 0 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 185 places in 204 ms of which 1 ms to minimize.
[2023-03-09 19:59:36] [INFO ] Deduced a trap composed of 148 places in 192 ms of which 1 ms to minimize.
[2023-03-09 19:59:37] [INFO ] Deduced a trap composed of 184 places in 205 ms of which 1 ms to minimize.
[2023-03-09 19:59:37] [INFO ] Deduced a trap composed of 123 places in 199 ms of which 1 ms to minimize.
[2023-03-09 19:59:37] [INFO ] Deduced a trap composed of 111 places in 201 ms of which 1 ms to minimize.
[2023-03-09 19:59:37] [INFO ] Deduced a trap composed of 97 places in 238 ms of which 1 ms to minimize.
[2023-03-09 19:59:38] [INFO ] Deduced a trap composed of 116 places in 298 ms of which 2 ms to minimize.
[2023-03-09 19:59:38] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 1 ms to minimize.
[2023-03-09 19:59:38] [INFO ] Deduced a trap composed of 191 places in 199 ms of which 0 ms to minimize.
[2023-03-09 19:59:38] [INFO ] Deduced a trap composed of 185 places in 164 ms of which 0 ms to minimize.
[2023-03-09 19:59:39] [INFO ] Deduced a trap composed of 200 places in 204 ms of which 1 ms to minimize.
[2023-03-09 19:59:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3260 ms
[2023-03-09 19:59:39] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-09 19:59:39] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2023-03-09 19:59:39] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-09 19:59:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 538 ms
[2023-03-09 19:59:40] [INFO ] After 58614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 15232 ms.
[2023-03-09 19:59:55] [INFO ] After 89278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 311 different solutions.
Parikh walk visited 0 properties in 30380 ms.
Support contains 335 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 10 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 10 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 9 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 119 ms. Remains 428 /457 variables (removed 29) and now considering 399/426 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 428/457 places, 399/426 transitions.
Interrupted random walk after 641891 steps, including 82493 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 864 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 861 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 845 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 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 850 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 853 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 859 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 884 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 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 864 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 865 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 860 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 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 819 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 833 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 837 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 844 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 841 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 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 866 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 861 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 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 826 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 866 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 860 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 850 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 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 830 resets, run finished after 357 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 297 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 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 840 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 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 843 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4002945 steps, run timeout after 138001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 4002945 steps, saw 2001269 distinct states, run finished after 138009 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 399 rows 428 cols
[2023-03-09 20:03:30] [INFO ] Computed 54 place invariants in 32 ms
[2023-03-09 20:03:34] [INFO ] After 4076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:03:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-09 20:03:37] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-09 20:03:48] [INFO ] After 7868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 20:03:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:03:56] [INFO ] After 8219ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 20:03:58] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2023-03-09 20:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-09 20:03:59] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:03:59] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2023-03-09 20:03:59] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-03-09 20:03:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 521 ms
[2023-03-09 20:04:00] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 1 ms to minimize.
[2023-03-09 20:04:00] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 1 ms to minimize.
[2023-03-09 20:04:00] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 0 ms to minimize.
[2023-03-09 20:04:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 713 ms
[2023-03-09 20:04:01] [INFO ] Deduced a trap composed of 157 places in 211 ms of which 1 ms to minimize.
[2023-03-09 20:04:01] [INFO ] Deduced a trap composed of 173 places in 197 ms of which 1 ms to minimize.
[2023-03-09 20:04:01] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:04:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 711 ms
[2023-03-09 20:04:01] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-09 20:04:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-09 20:04:02] [INFO ] Deduced a trap composed of 157 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:04:02] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 1 ms to minimize.
[2023-03-09 20:04:02] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2023-03-09 20:04:02] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 1 ms to minimize.
[2023-03-09 20:04:03] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 1 ms to minimize.
[2023-03-09 20:04:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1180 ms
[2023-03-09 20:04:03] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 0 ms to minimize.
[2023-03-09 20:04:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-09 20:04:04] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2023-03-09 20:04:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-09 20:04:04] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 1 ms to minimize.
[2023-03-09 20:04:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 20:04:05] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-09 20:04:05] [INFO ] Deduced a trap composed of 172 places in 161 ms of which 1 ms to minimize.
[2023-03-09 20:04:06] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 0 ms to minimize.
[2023-03-09 20:04:06] [INFO ] Deduced a trap composed of 153 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:04:06] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 1 ms to minimize.
[2023-03-09 20:04:06] [INFO ] Deduced a trap composed of 184 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:04:06] [INFO ] Deduced a trap composed of 169 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:04:07] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:04:07] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 1 ms to minimize.
[2023-03-09 20:04:07] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 0 ms to minimize.
[2023-03-09 20:04:07] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:04:08] [INFO ] Deduced a trap composed of 152 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:04:08] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:04:08] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:04:08] [INFO ] Deduced a trap composed of 173 places in 191 ms of which 1 ms to minimize.
[2023-03-09 20:04:08] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 1 ms to minimize.
[2023-03-09 20:04:09] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:04:09] [INFO ] Deduced a trap composed of 131 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:04:09] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-09 20:04:11] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-09 20:04:11] [INFO ] Deduced a trap composed of 155 places in 192 ms of which 1 ms to minimize.
[2023-03-09 20:04:13] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-09 20:04:13] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:04:13] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2023-03-09 20:04:13] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:04:14] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:04:14] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:04:14] [INFO ] Deduced a trap composed of 182 places in 200 ms of which 1 ms to minimize.
[2023-03-09 20:04:14] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 0 ms to minimize.
[2023-03-09 20:04:15] [INFO ] Deduced a trap composed of 159 places in 192 ms of which 0 ms to minimize.
[2023-03-09 20:04:15] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:04:15] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:04:15] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:04:15] [INFO ] Deduced a trap composed of 167 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:04:16] [INFO ] Deduced a trap composed of 121 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:04:16] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:04:16] [INFO ] Deduced a trap composed of 167 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:04:16] [INFO ] Deduced a trap composed of 185 places in 183 ms of which 0 ms to minimize.
[2023-03-09 20:04:16] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:04:17] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:04:17] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:04:17] [INFO ] Deduced a trap composed of 161 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:04:17] [INFO ] Deduced a trap composed of 159 places in 178 ms of which 0 ms to minimize.
[2023-03-09 20:04:18] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:04:18] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 1 ms to minimize.
[2023-03-09 20:04:18] [INFO ] Deduced a trap composed of 184 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:04:18] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:04:19] [INFO ] Deduced a trap composed of 187 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:04:19] [INFO ] Deduced a trap composed of 157 places in 185 ms of which 0 ms to minimize.
[2023-03-09 20:04:19] [INFO ] Deduced a trap composed of 188 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:04:19] [INFO ] Deduced a trap composed of 187 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:04:19] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 1 ms to minimize.
[2023-03-09 20:04:20] [INFO ] Deduced a trap composed of 182 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:04:20] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:04:20] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:04:20] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2023-03-09 20:04:20] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:04:21] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:04:21] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 0 ms to minimize.
[2023-03-09 20:04:21] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 1 ms to minimize.
[2023-03-09 20:04:21] [INFO ] Deduced a trap composed of 169 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:04:22] [INFO ] Deduced a trap composed of 171 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:04:22] [INFO ] Deduced a trap composed of 143 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:04:22] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:04:22] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 0 ms to minimize.
[2023-03-09 20:04:22] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:04:23] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 1 ms to minimize.
[2023-03-09 20:04:23] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:04:23] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:04:23] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:04:23] [INFO ] Deduced a trap composed of 173 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:04:24] [INFO ] Deduced a trap composed of 176 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:04:24] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 2 ms to minimize.
[2023-03-09 20:04:24] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 0 ms to minimize.
[2023-03-09 20:04:24] [INFO ] Deduced a trap composed of 172 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:04:24] [INFO ] Deduced a trap composed of 195 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:04:25] [INFO ] Deduced a trap composed of 171 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:04:25] [INFO ] Deduced a trap composed of 177 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:04:25] [INFO ] Deduced a trap composed of 184 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:04:25] [INFO ] Deduced a trap composed of 175 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:04:25] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 1 ms to minimize.
[2023-03-09 20:04:26] [INFO ] Deduced a trap composed of 167 places in 273 ms of which 1 ms to minimize.
[2023-03-09 20:04:26] [INFO ] Deduced a trap composed of 176 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:04:26] [INFO ] Deduced a trap composed of 175 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:04:27] [INFO ] Deduced a trap composed of 182 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:04:27] [INFO ] Deduced a trap composed of 168 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:04:27] [INFO ] Deduced a trap composed of 178 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:04:28] [INFO ] Deduced a trap composed of 170 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:04:28] [INFO ] Deduced a trap composed of 180 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:04:29] [INFO ] Deduced a trap composed of 177 places in 347 ms of which 2 ms to minimize.
[2023-03-09 20:04:29] [INFO ] Deduced a trap composed of 182 places in 323 ms of which 1 ms to minimize.
[2023-03-09 20:04:29] [INFO ] Deduced a trap composed of 152 places in 325 ms of which 1 ms to minimize.
[2023-03-09 20:04:30] [INFO ] Deduced a trap composed of 187 places in 325 ms of which 0 ms to minimize.
[2023-03-09 20:04:30] [INFO ] Deduced a trap composed of 191 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:04:30] [INFO ] Deduced a trap composed of 180 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:04:31] [INFO ] Deduced a trap composed of 171 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:04:31] [INFO ] Deduced a trap composed of 140 places in 303 ms of which 2 ms to minimize.
[2023-03-09 20:04:32] [INFO ] Deduced a trap composed of 205 places in 319 ms of which 2 ms to minimize.
[2023-03-09 20:04:32] [INFO ] Deduced a trap composed of 194 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:04:32] [INFO ] Deduced a trap composed of 164 places in 322 ms of which 1 ms to minimize.
[2023-03-09 20:04:33] [INFO ] Deduced a trap composed of 199 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:04:33] [INFO ] Deduced a trap composed of 45 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:04:34] [INFO ] Deduced a trap composed of 168 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:04:34] [INFO ] Deduced a trap composed of 197 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:04:35] [INFO ] Deduced a trap composed of 154 places in 334 ms of which 1 ms to minimize.
[2023-03-09 20:04:35] [INFO ] Deduced a trap composed of 174 places in 342 ms of which 1 ms to minimize.
[2023-03-09 20:04:35] [INFO ] Deduced a trap composed of 180 places in 338 ms of which 1 ms to minimize.
[2023-03-09 20:04:36] [INFO ] Deduced a trap composed of 181 places in 334 ms of which 1 ms to minimize.
[2023-03-09 20:04:36] [INFO ] Deduced a trap composed of 130 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:04:36] [INFO ] Deduced a trap composed of 154 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:04:37] [INFO ] Deduced a trap composed of 185 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:04:37] [INFO ] Deduced a trap composed of 143 places in 304 ms of which 2 ms to minimize.
[2023-03-09 20:04:38] [INFO ] Deduced a trap composed of 194 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:04:38] [INFO ] Deduced a trap composed of 146 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:04:38] [INFO ] Deduced a trap composed of 190 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:04:39] [INFO ] Deduced a trap composed of 171 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:04:39] [INFO ] Deduced a trap composed of 187 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:04:39] [INFO ] Deduced a trap composed of 171 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:04:40] [INFO ] Deduced a trap composed of 181 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:04:40] [INFO ] Deduced a trap composed of 211 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:04:40] [INFO ] Deduced a trap composed of 191 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:04:41] [INFO ] Deduced a trap composed of 195 places in 309 ms of which 2 ms to minimize.
[2023-03-09 20:04:42] [INFO ] Deduced a trap composed of 156 places in 329 ms of which 1 ms to minimize.
[2023-03-09 20:04:42] [INFO ] Deduced a trap composed of 163 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:04:42] [INFO ] Deduced a trap composed of 172 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:04:43] [INFO ] Deduced a trap composed of 155 places in 325 ms of which 1 ms to minimize.
[2023-03-09 20:04:43] [INFO ] Deduced a trap composed of 156 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:04:43] [INFO ] Deduced a trap composed of 155 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:04:44] [INFO ] Deduced a trap composed of 192 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:04:44] [INFO ] Deduced a trap composed of 167 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:04:44] [INFO ] Deduced a trap composed of 188 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:04:45] [INFO ] Deduced a trap composed of 170 places in 321 ms of which 1 ms to minimize.
[2023-03-09 20:04:45] [INFO ] Deduced a trap composed of 172 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 192 places in 328 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 170 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:04:46] [INFO ] Deduced a trap composed of 141 places in 352 ms of which 1 ms to minimize.
[2023-03-09 20:04:47] [INFO ] Deduced a trap composed of 142 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:04:48] [INFO ] Deduced a trap composed of 164 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:04:48] [INFO ] Deduced a trap composed of 159 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:04:48] [INFO ] Deduced a trap composed of 169 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:04:49] [INFO ] Deduced a trap composed of 180 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:04:49] [INFO ] Deduced a trap composed of 158 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:04:50] [INFO ] Deduced a trap composed of 217 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:04:50] [INFO ] Deduced a trap composed of 192 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:04:50] [INFO ] Deduced a trap composed of 167 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 148 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 155 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:04:51] [INFO ] Deduced a trap composed of 157 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:04:52] [INFO ] Deduced a trap composed of 150 places in 325 ms of which 1 ms to minimize.
[2023-03-09 20:04:52] [INFO ] Deduced a trap composed of 130 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:04:53] [INFO ] Deduced a trap composed of 143 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:04:53] [INFO ] Deduced a trap composed of 139 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:04:53] [INFO ] Deduced a trap composed of 140 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:04:54] [INFO ] Deduced a trap composed of 173 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:04:54] [INFO ] Deduced a trap composed of 176 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:04:54] [INFO ] Deduced a trap composed of 184 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:04:55] [INFO ] Deduced a trap composed of 166 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:04:55] [INFO ] Deduced a trap composed of 178 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:04:55] [INFO ] Deduced a trap composed of 157 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:04:56] [INFO ] Deduced a trap composed of 177 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:04:56] [INFO ] Deduced a trap composed of 155 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:04:56] [INFO ] Deduced a trap composed of 144 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:04:57] [INFO ] Deduced a trap composed of 144 places in 298 ms of which 2 ms to minimize.
[2023-03-09 20:04:57] [INFO ] Deduced a trap composed of 155 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:04:57] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:04:58] [INFO ] Deduced a trap composed of 167 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:04:58] [INFO ] Deduced a trap composed of 173 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:04:58] [INFO ] Deduced a trap composed of 180 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:04:59] [INFO ] Deduced a trap composed of 176 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:04:59] [INFO ] Deduced a trap composed of 142 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:04:59] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:05:00] [INFO ] Deduced a trap composed of 168 places in 260 ms of which 1 ms to minimize.
[2023-03-09 20:05:00] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 1 ms to minimize.
[2023-03-09 20:05:00] [INFO ] Deduced a trap composed of 158 places in 260 ms of which 1 ms to minimize.
[2023-03-09 20:05:01] [INFO ] Deduced a trap composed of 168 places in 254 ms of which 0 ms to minimize.
[2023-03-09 20:05:01] [INFO ] Deduced a trap composed of 161 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:05:01] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:05:02] [INFO ] Deduced a trap composed of 193 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:05:02] [INFO ] Deduced a trap composed of 208 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:05:02] [INFO ] Deduced a trap composed of 186 places in 331 ms of which 1 ms to minimize.
[2023-03-09 20:05:03] [INFO ] Deduced a trap composed of 178 places in 322 ms of which 1 ms to minimize.
[2023-03-09 20:05:03] [INFO ] Deduced a trap composed of 166 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:05:03] [INFO ] Deduced a trap composed of 183 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:05:04] [INFO ] Deduced a trap composed of 169 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:05:04] [INFO ] Deduced a trap composed of 151 places in 328 ms of which 1 ms to minimize.
[2023-03-09 20:05:05] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:05:05] [INFO ] Deduced a trap composed of 155 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:05:05] [INFO ] Deduced a trap composed of 196 places in 195 ms of which 0 ms to minimize.
[2023-03-09 20:05:05] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:05:06] [INFO ] Deduced a trap composed of 193 places in 157 ms of which 1 ms to minimize.
[2023-03-09 20:05:06] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 0 ms to minimize.
[2023-03-09 20:05:06] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:05:06] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:05:07] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 0 ms to minimize.
[2023-03-09 20:05:07] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:05:07] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 1 ms to minimize.
[2023-03-09 20:05:07] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 0 ms to minimize.
[2023-03-09 20:05:07] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:05:08] [INFO ] Deduced a trap composed of 150 places in 212 ms of which 1 ms to minimize.
[2023-03-09 20:05:08] [INFO ] Deduced a trap composed of 176 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:05:08] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:08] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2023-03-09 20:05:08] [INFO ] Deduced a trap composed of 147 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:09] [INFO ] Deduced a trap composed of 172 places in 183 ms of which 0 ms to minimize.
[2023-03-09 20:05:09] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:05:09] [INFO ] Deduced a trap composed of 184 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:05:09] [INFO ] Deduced a trap composed of 174 places in 236 ms of which 0 ms to minimize.
[2023-03-09 20:05:10] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2023-03-09 20:05:10] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 1 ms to minimize.
[2023-03-09 20:05:10] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 1 ms to minimize.
[2023-03-09 20:05:10] [INFO ] Deduced a trap composed of 155 places in 190 ms of which 1 ms to minimize.
[2023-03-09 20:05:11] [INFO ] Deduced a trap composed of 165 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:11] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:11] [INFO ] Deduced a trap composed of 169 places in 185 ms of which 0 ms to minimize.
[2023-03-09 20:05:11] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:11] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:05:12] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 1 ms to minimize.
[2023-03-09 20:05:12] [INFO ] Deduced a trap composed of 181 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:12] [INFO ] Deduced a trap composed of 184 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:05:12] [INFO ] Deduced a trap composed of 179 places in 252 ms of which 1 ms to minimize.
[2023-03-09 20:05:13] [INFO ] Deduced a trap composed of 174 places in 224 ms of which 1 ms to minimize.
[2023-03-09 20:05:13] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:05:13] [INFO ] Deduced a trap composed of 184 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:13] [INFO ] Deduced a trap composed of 140 places in 189 ms of which 0 ms to minimize.
[2023-03-09 20:05:14] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:05:14] [INFO ] Deduced a trap composed of 191 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:14] [INFO ] Deduced a trap composed of 191 places in 187 ms of which 1 ms to minimize.
[2023-03-09 20:05:14] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 0 ms to minimize.
[2023-03-09 20:05:14] [INFO ] Deduced a trap composed of 193 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:15] [INFO ] Deduced a trap composed of 157 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:15] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 0 ms to minimize.
[2023-03-09 20:05:15] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:05:15] [INFO ] Deduced a trap composed of 202 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:16] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 1 ms to minimize.
[2023-03-09 20:05:16] [INFO ] Deduced a trap composed of 175 places in 197 ms of which 1 ms to minimize.
[2023-03-09 20:05:16] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:05:16] [INFO ] Deduced a trap composed of 173 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:05:16] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:05:17] [INFO ] Deduced a trap composed of 183 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:17] [INFO ] Deduced a trap composed of 194 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:17] [INFO ] Deduced a trap composed of 194 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:05:17] [INFO ] Deduced a trap composed of 189 places in 188 ms of which 1 ms to minimize.
[2023-03-09 20:05:18] [INFO ] Deduced a trap composed of 180 places in 206 ms of which 0 ms to minimize.
[2023-03-09 20:05:18] [INFO ] Deduced a trap composed of 186 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:18] [INFO ] Deduced a trap composed of 180 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:18] [INFO ] Deduced a trap composed of 169 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:19] [INFO ] Deduced a trap composed of 182 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:05:19] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:19] [INFO ] Deduced a trap composed of 181 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:05:19] [INFO ] Deduced a trap composed of 176 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:05:20] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 0 ms to minimize.
[2023-03-09 20:05:20] [INFO ] Deduced a trap composed of 192 places in 241 ms of which 1 ms to minimize.
[2023-03-09 20:05:20] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-09 20:05:20] [INFO ] Deduced a trap composed of 172 places in 180 ms of which 0 ms to minimize.
[2023-03-09 20:05:20] [INFO ] Deduced a trap composed of 165 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:05:21] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 2 ms to minimize.
[2023-03-09 20:05:21] [INFO ] Deduced a trap composed of 175 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:21] [INFO ] Deduced a trap composed of 183 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:21] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:21] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:22] [INFO ] Deduced a trap composed of 174 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:05:22] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 0 ms to minimize.
[2023-03-09 20:05:22] [INFO ] Deduced a trap composed of 173 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:05:23] [INFO ] Deduced a trap composed of 186 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:05:23] [INFO ] Deduced a trap composed of 179 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:05:23] [INFO ] Deduced a trap composed of 180 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:05:23] [INFO ] Deduced a trap composed of 184 places in 198 ms of which 1 ms to minimize.
[2023-03-09 20:05:24] [INFO ] Deduced a trap composed of 199 places in 273 ms of which 1 ms to minimize.
[2023-03-09 20:05:24] [INFO ] Deduced a trap composed of 195 places in 194 ms of which 1 ms to minimize.
[2023-03-09 20:05:24] [INFO ] Deduced a trap composed of 189 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:05:24] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:05:25] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:05:25] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:05:27] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 0 ms to minimize.
[2023-03-09 20:05:27] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 1 ms to minimize.
[2023-03-09 20:05:27] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 0 ms to minimize.
[2023-03-09 20:05:27] [INFO ] Deduced a trap composed of 196 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:28] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 0 ms to minimize.
[2023-03-09 20:05:28] [INFO ] Deduced a trap composed of 212 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:05:28] [INFO ] Deduced a trap composed of 188 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:29] [INFO ] Deduced a trap composed of 174 places in 156 ms of which 1 ms to minimize.
[2023-03-09 20:05:29] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 1 ms to minimize.
[2023-03-09 20:05:29] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:05:30] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:05:30] [INFO ] Deduced a trap composed of 160 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:05:30] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 0 ms to minimize.
[2023-03-09 20:05:31] [INFO ] Deduced a trap composed of 187 places in 155 ms of which 0 ms to minimize.
[2023-03-09 20:05:31] [INFO ] Deduced a trap composed of 175 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:05:31] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:05:31] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2023-03-09 20:05:32] [INFO ] Deduced a trap composed of 187 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:05:32] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 1 ms to minimize.
[2023-03-09 20:05:32] [INFO ] Deduced a trap composed of 173 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:05:32] [INFO ] Deduced a trap composed of 177 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:05:33] [INFO ] Deduced a trap composed of 182 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:05:33] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 0 ms to minimize.
[2023-03-09 20:05:33] [INFO ] Deduced a trap composed of 193 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:05:33] [INFO ] Deduced a trap composed of 195 places in 179 ms of which 0 ms to minimize.
[2023-03-09 20:05:34] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:05:34] [INFO ] Deduced a trap composed of 174 places in 183 ms of which 0 ms to minimize.
[2023-03-09 20:05:34] [INFO ] Deduced a trap composed of 183 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:05:34] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:05:34] [INFO ] Deduced a trap composed of 163 places in 190 ms of which 0 ms to minimize.
[2023-03-09 20:05:35] [INFO ] Deduced a trap composed of 179 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:05:35] [INFO ] Deduced a trap composed of 143 places in 249 ms of which 0 ms to minimize.
[2023-03-09 20:05:35] [INFO ] Deduced a trap composed of 152 places in 263 ms of which 1 ms to minimize.
[2023-03-09 20:05:36] [INFO ] Deduced a trap composed of 175 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:05:36] [INFO ] Deduced a trap composed of 185 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:05:36] [INFO ] Deduced a trap composed of 178 places in 229 ms of which 2 ms to minimize.
[2023-03-09 20:05:37] [INFO ] Deduced a trap composed of 151 places in 151 ms of which 1 ms to minimize.
[2023-03-09 20:05:37] [INFO ] Deduced a trap composed of 183 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:05:37] [INFO ] Deduced a trap composed of 183 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:05:37] [INFO ] Deduced a trap composed of 193 places in 197 ms of which 0 ms to minimize.
[2023-03-09 20:05:37] [INFO ] Deduced a trap composed of 180 places in 228 ms of which 1 ms to minimize.
[2023-03-09 20:05:38] [INFO ] Deduced a trap composed of 112 places in 198 ms of which 0 ms to minimize.
[2023-03-09 20:05:38] [INFO ] Deduced a trap composed of 175 places in 253 ms of which 1 ms to minimize.
[2023-03-09 20:05:38] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:05:39] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:05:39] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:39] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:05:39] [INFO ] Deduced a trap composed of 169 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:05:40] [INFO ] Deduced a trap composed of 176 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:05:40] [INFO ] Deduced a trap composed of 190 places in 151 ms of which 1 ms to minimize.
[2023-03-09 20:05:40] [INFO ] Deduced a trap composed of 186 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:05:40] [INFO ] Deduced a trap composed of 177 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:05:41] [INFO ] Deduced a trap composed of 184 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:05:41] [INFO ] Deduced a trap composed of 169 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:05:41] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:05:41] [INFO ] Deduced a trap composed of 155 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:05:42] [INFO ] Deduced a trap composed of 190 places in 277 ms of which 2 ms to minimize.
[2023-03-09 20:05:42] [INFO ] Deduced a trap composed of 175 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:05:42] [INFO ] Deduced a trap composed of 182 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:05:43] [INFO ] Deduced a trap composed of 164 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:05:43] [INFO ] Deduced a trap composed of 180 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:05:44] [INFO ] Deduced a trap composed of 167 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:05:44] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:05:44] [INFO ] Deduced a trap composed of 187 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:05:45] [INFO ] Deduced a trap composed of 199 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:05:45] [INFO ] Deduced a trap composed of 191 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:05:45] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2023-03-09 20:05:46] [INFO ] Deduced a trap composed of 148 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:05:46] [INFO ] Deduced a trap composed of 147 places in 210 ms of which 1 ms to minimize.
[2023-03-09 20:05:46] [INFO ] Deduced a trap composed of 181 places in 227 ms of which 1 ms to minimize.
[2023-03-09 20:05:46] [INFO ] Deduced a trap composed of 177 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:05:47] [INFO ] Deduced a trap composed of 183 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:05:47] [INFO ] Deduced a trap composed of 179 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:05:48] [INFO ] Deduced a trap composed of 177 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:05:48] [INFO ] Deduced a trap composed of 190 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:05:48] [INFO ] Deduced a trap composed of 186 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:05:49] [INFO ] Deduced a trap composed of 191 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:05:49] [INFO ] Deduced a trap composed of 179 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:05:49] [INFO ] Deduced a trap composed of 195 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:05:50] [INFO ] Deduced a trap composed of 170 places in 288 ms of which 5 ms to minimize.
[2023-03-09 20:05:50] [INFO ] Deduced a trap composed of 173 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:05:50] [INFO ] Deduced a trap composed of 181 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:05:51] [INFO ] Deduced a trap composed of 185 places in 289 ms of which 0 ms to minimize.
[2023-03-09 20:05:51] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:05:51] [INFO ] Deduced a trap composed of 179 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:05:52] [INFO ] Deduced a trap composed of 170 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:05:52] [INFO ] Deduced a trap composed of 166 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:05:52] [INFO ] Deduced a trap composed of 180 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:05:53] [INFO ] Deduced a trap composed of 165 places in 310 ms of which 2 ms to minimize.
[2023-03-09 20:05:53] [INFO ] Deduced a trap composed of 178 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:05:54] [INFO ] Deduced a trap composed of 172 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:05:54] [INFO ] Deduced a trap composed of 180 places in 230 ms of which 1 ms to minimize.
[2023-03-09 20:05:54] [INFO ] Deduced a trap composed of 190 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:05:54] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:05:54] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 0 ms to minimize.
[2023-03-09 20:05:55] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:05:55] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 0 ms to minimize.
[2023-03-09 20:05:55] [INFO ] Deduced a trap composed of 193 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:05:55] [INFO ] Deduced a trap composed of 189 places in 159 ms of which 0 ms to minimize.
[2023-03-09 20:05:55] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:05:56] [INFO ] Deduced a trap composed of 183 places in 245 ms of which 1 ms to minimize.
[2023-03-09 20:05:56] [INFO ] Deduced a trap composed of 185 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:05:56] [INFO ] Deduced a trap composed of 194 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:05:57] [INFO ] Deduced a trap composed of 172 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:05:58] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:05:58] [INFO ] Deduced a trap composed of 177 places in 191 ms of which 1 ms to minimize.
[2023-03-09 20:05:58] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:05:59] [INFO ] Deduced a trap composed of 179 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:05:59] [INFO ] Deduced a trap composed of 156 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:06:00] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 1 ms to minimize.
[2023-03-09 20:06:00] [INFO ] Deduced a trap composed of 150 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:06:01] [INFO ] Deduced a trap composed of 154 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:06:01] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:06:01] [INFO ] Deduced a trap composed of 175 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:06:02] [INFO ] Deduced a trap composed of 188 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:06:02] [INFO ] Deduced a trap composed of 178 places in 284 ms of which 0 ms to minimize.
[2023-03-09 20:06:02] [INFO ] Deduced a trap composed of 200 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:06:03] [INFO ] Deduced a trap composed of 189 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:06:03] [INFO ] Deduced a trap composed of 188 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:06:04] [INFO ] Deduced a trap composed of 193 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:06:04] [INFO ] Deduced a trap composed of 151 places in 269 ms of which 0 ms to minimize.
[2023-03-09 20:06:04] [INFO ] Deduced a trap composed of 126 places in 281 ms of which 1 ms to minimize.
[2023-03-09 20:06:05] [INFO ] Deduced a trap composed of 85 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:06:05] [INFO ] Deduced a trap composed of 163 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:06:05] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 1 ms to minimize.
[2023-03-09 20:06:06] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 1 ms to minimize.
[2023-03-09 20:06:06] [INFO ] Deduced a trap composed of 174 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:06:06] [INFO ] Deduced a trap composed of 168 places in 283 ms of which 0 ms to minimize.
[2023-03-09 20:06:07] [INFO ] Deduced a trap composed of 167 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:06:07] [INFO ] Deduced a trap composed of 180 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:06:07] [INFO ] Deduced a trap composed of 180 places in 273 ms of which 1 ms to minimize.
[2023-03-09 20:06:08] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:06:08] [INFO ] Deduced a trap composed of 176 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:06:08] [INFO ] Deduced a trap composed of 163 places in 219 ms of which 1 ms to minimize.
[2023-03-09 20:06:09] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:06:09] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:06:09] [INFO ] Deduced a trap composed of 188 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:06:09] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:06:09] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:06:10] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 1 ms to minimize.
[2023-03-09 20:06:10] [INFO ] Deduced a trap composed of 187 places in 162 ms of which 0 ms to minimize.
[2023-03-09 20:06:10] [INFO ] Deduced a trap composed of 188 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:06:10] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 1 ms to minimize.
[2023-03-09 20:06:10] [INFO ] Deduced a trap composed of 176 places in 168 ms of which 0 ms to minimize.
[2023-03-09 20:06:11] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:06:11] [INFO ] Deduced a trap composed of 178 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:06:11] [INFO ] Deduced a trap composed of 174 places in 157 ms of which 1 ms to minimize.
[2023-03-09 20:06:13] [INFO ] Deduced a trap composed of 192 places in 156 ms of which 0 ms to minimize.
[2023-03-09 20:06:13] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 0 ms to minimize.
[2023-03-09 20:06:13] [INFO ] Deduced a trap composed of 173 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:06:13] [INFO ] Deduced a trap composed of 167 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:13] [INFO ] Deduced a trap composed of 179 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:06:14] [INFO ] Deduced a trap composed of 181 places in 180 ms of which 0 ms to minimize.
[2023-03-09 20:06:14] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:06:14] [INFO ] Deduced a trap composed of 185 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:14] [INFO ] Deduced a trap composed of 196 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:06:15] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 1 ms to minimize.
[2023-03-09 20:06:15] [INFO ] Deduced a trap composed of 175 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:06:15] [INFO ] Deduced a trap composed of 181 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:15] [INFO ] Deduced a trap composed of 191 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:06:15] [INFO ] Deduced a trap composed of 175 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:06:16] [INFO ] Deduced a trap composed of 191 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:06:16] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 0 ms to minimize.
[2023-03-09 20:06:16] [INFO ] Deduced a trap composed of 181 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:06:16] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:06:17] [INFO ] Deduced a trap composed of 194 places in 190 ms of which 1 ms to minimize.
[2023-03-09 20:06:17] [INFO ] Deduced a trap composed of 170 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:06:17] [INFO ] Deduced a trap composed of 187 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:06:17] [INFO ] Deduced a trap composed of 198 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:06:18] [INFO ] Deduced a trap composed of 171 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:06:18] [INFO ] Deduced a trap composed of 198 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:06:18] [INFO ] Deduced a trap composed of 157 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:06:18] [INFO ] Deduced a trap composed of 197 places in 217 ms of which 1 ms to minimize.
[2023-03-09 20:06:19] [INFO ] Deduced a trap composed of 191 places in 164 ms of which 0 ms to minimize.
[2023-03-09 20:06:19] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 1 ms to minimize.
[2023-03-09 20:06:19] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 1 ms to minimize.
[2023-03-09 20:06:19] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 0 ms to minimize.
[2023-03-09 20:06:19] [INFO ] Deduced a trap composed of 185 places in 151 ms of which 0 ms to minimize.
[2023-03-09 20:06:20] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 0 ms to minimize.
[2023-03-09 20:06:20] [INFO ] Deduced a trap composed of 183 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:06:20] [INFO ] Deduced a trap composed of 195 places in 175 ms of which 0 ms to minimize.
[2023-03-09 20:06:20] [INFO ] Deduced a trap composed of 177 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:06:20] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:06:21] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:06:21] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:06:21] [INFO ] Deduced a trap composed of 183 places in 180 ms of which 1 ms to minimize.
[2023-03-09 20:06:21] [INFO ] Deduced a trap composed of 185 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:06:22] [INFO ] Deduced a trap composed of 176 places in 189 ms of which 0 ms to minimize.
[2023-03-09 20:06:22] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 1 ms to minimize.
[2023-03-09 20:06:22] [INFO ] Deduced a trap composed of 194 places in 277 ms of which 1 ms to minimize.
[2023-03-09 20:06:22] [INFO ] Deduced a trap composed of 198 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:06:23] [INFO ] Deduced a trap composed of 187 places in 183 ms of which 0 ms to minimize.
[2023-03-09 20:06:23] [INFO ] Deduced a trap composed of 186 places in 160 ms of which 0 ms to minimize.
[2023-03-09 20:06:23] [INFO ] Deduced a trap composed of 182 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:06:23] [INFO ] Deduced a trap composed of 179 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:06:24] [INFO ] Deduced a trap composed of 210 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:06:24] [INFO ] Deduced a trap composed of 189 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:06:24] [INFO ] Deduced a trap composed of 187 places in 181 ms of which 0 ms to minimize.
[2023-03-09 20:06:24] [INFO ] Deduced a trap composed of 197 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:06:24] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:06:25] [INFO ] Deduced a trap composed of 183 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:06:25] [INFO ] Deduced a trap composed of 150 places in 188 ms of which 1 ms to minimize.
[2023-03-09 20:06:25] [INFO ] Deduced a trap composed of 145 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:06:25] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 0 ms to minimize.
[2023-03-09 20:06:26] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:06:26] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:06:26] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 1 ms to minimize.
[2023-03-09 20:06:26] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 1 ms to minimize.
[2023-03-09 20:06:27] [INFO ] Deduced a trap composed of 195 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:06:27] [INFO ] Deduced a trap composed of 182 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:06:27] [INFO ] Deduced a trap composed of 165 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:27] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:06:27] [INFO ] Deduced a trap composed of 175 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:06:28] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:06:28] [INFO ] Deduced a trap composed of 207 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:06:28] [INFO ] Deduced a trap composed of 218 places in 178 ms of which 0 ms to minimize.
[2023-03-09 20:06:28] [INFO ] Deduced a trap composed of 199 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:06:29] [INFO ] Deduced a trap composed of 185 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:06:29] [INFO ] Deduced a trap composed of 180 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:06:29] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 0 ms to minimize.
[2023-03-09 20:06:29] [INFO ] Deduced a trap composed of 187 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:06:29] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2023-03-09 20:06:30] [INFO ] Deduced a trap composed of 200 places in 218 ms of which 1 ms to minimize.
[2023-03-09 20:06:30] [INFO ] Deduced a trap composed of 179 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:06:30] [INFO ] Deduced a trap composed of 187 places in 154 ms of which 1 ms to minimize.
[2023-03-09 20:06:30] [INFO ] Deduced a trap composed of 206 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:06:31] [INFO ] Deduced a trap composed of 193 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:06:31] [INFO ] Deduced a trap composed of 186 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:06:31] [INFO ] Deduced a trap composed of 193 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:06:31] [INFO ] Deduced a trap composed of 204 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:06:31] [INFO ] Deduced a trap composed of 187 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:06:32] [INFO ] Deduced a trap composed of 161 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:32] [INFO ] Deduced a trap composed of 200 places in 186 ms of which 0 ms to minimize.
[2023-03-09 20:06:32] [INFO ] Deduced a trap composed of 188 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:06:32] [INFO ] Deduced a trap composed of 180 places in 161 ms of which 0 ms to minimize.
[2023-03-09 20:06:33] [INFO ] Deduced a trap composed of 172 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:06:33] [INFO ] Deduced a trap composed of 192 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:06:33] [INFO ] Deduced a trap composed of 176 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:06:33] [INFO ] Deduced a trap composed of 196 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:06:33] [INFO ] Deduced a trap composed of 195 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:34] [INFO ] Deduced a trap composed of 161 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:06:34] [INFO ] Deduced a trap composed of 192 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:06:34] [INFO ] Deduced a trap composed of 203 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:06:34] [INFO ] Deduced a trap composed of 206 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:06:34] [INFO ] Deduced a trap composed of 174 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:06:35] [INFO ] Deduced a trap composed of 172 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:06:35] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:35] [INFO ] Deduced a trap composed of 175 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:06:35] [INFO ] Deduced a trap composed of 190 places in 177 ms of which 0 ms to minimize.
[2023-03-09 20:06:36] [INFO ] Deduced a trap composed of 178 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:06:36] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:06:36] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:06:36] [INFO ] Deduced a trap composed of 185 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:06:36] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:06:37] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 0 ms to minimize.
[2023-03-09 20:06:37] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 1 ms to minimize.
[2023-03-09 20:06:37] [INFO ] Deduced a trap composed of 190 places in 152 ms of which 0 ms to minimize.
[2023-03-09 20:06:37] [INFO ] Deduced a trap composed of 200 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:06:37] [INFO ] Deduced a trap composed of 193 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:06:38] [INFO ] Deduced a trap composed of 196 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:38] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:06:38] [INFO ] Deduced a trap composed of 202 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:06:38] [INFO ] Deduced a trap composed of 193 places in 161 ms of which 0 ms to minimize.
[2023-03-09 20:06:38] [INFO ] Deduced a trap composed of 203 places in 159 ms of which 1 ms to minimize.
[2023-03-09 20:06:39] [INFO ] Deduced a trap composed of 182 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:39] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:06:39] [INFO ] Deduced a trap composed of 182 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:40] [INFO ] Deduced a trap composed of 172 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:06:40] [INFO ] Deduced a trap composed of 195 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:06:40] [INFO ] Deduced a trap composed of 188 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:06:40] [INFO ] Deduced a trap composed of 202 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:06:41] [INFO ] Deduced a trap composed of 195 places in 264 ms of which 0 ms to minimize.
[2023-03-09 20:06:41] [INFO ] Deduced a trap composed of 181 places in 216 ms of which 1 ms to minimize.
[2023-03-09 20:06:41] [INFO ] Deduced a trap composed of 189 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:06:41] [INFO ] Deduced a trap composed of 192 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:06:41] [INFO ] Deduced a trap composed of 159 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:06:42] [INFO ] Deduced a trap composed of 195 places in 175 ms of which 0 ms to minimize.
[2023-03-09 20:06:42] [INFO ] Deduced a trap composed of 208 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:42] [INFO ] Deduced a trap composed of 189 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:06:42] [INFO ] Deduced a trap composed of 190 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:06:43] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:06:43] [INFO ] Deduced a trap composed of 201 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:06:43] [INFO ] Deduced a trap composed of 211 places in 162 ms of which 0 ms to minimize.
[2023-03-09 20:06:43] [INFO ] Deduced a trap composed of 200 places in 147 ms of which 0 ms to minimize.
[2023-03-09 20:06:43] [INFO ] Deduced a trap composed of 193 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:06:44] [INFO ] Deduced a trap composed of 216 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:06:44] [INFO ] Deduced a trap composed of 213 places in 148 ms of which 1 ms to minimize.
[2023-03-09 20:06:44] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 0 ms to minimize.
[2023-03-09 20:06:44] [INFO ] Deduced a trap composed of 193 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:06:44] [INFO ] Deduced a trap composed of 175 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:06:45] [INFO ] Deduced a trap composed of 201 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:06:45] [INFO ] Deduced a trap composed of 207 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:45] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:06:46] [INFO ] Deduced a trap composed of 185 places in 187 ms of which 0 ms to minimize.
[2023-03-09 20:06:46] [INFO ] Deduced a trap composed of 185 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:06:46] [INFO ] Deduced a trap composed of 191 places in 147 ms of which 1 ms to minimize.
[2023-03-09 20:06:46] [INFO ] Deduced a trap composed of 152 places in 146 ms of which 1 ms to minimize.
[2023-03-09 20:06:47] [INFO ] Deduced a trap composed of 182 places in 164 ms of which 0 ms to minimize.
[2023-03-09 20:06:47] [INFO ] Deduced a trap composed of 180 places in 173 ms of which 0 ms to minimize.
[2023-03-09 20:06:47] [INFO ] Deduced a trap composed of 186 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:06:47] [INFO ] Deduced a trap composed of 184 places in 145 ms of which 1 ms to minimize.
[2023-03-09 20:06:48] [INFO ] Deduced a trap composed of 202 places in 146 ms of which 0 ms to minimize.
[2023-03-09 20:06:48] [INFO ] Deduced a trap composed of 199 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:06:48] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 1 ms to minimize.
[2023-03-09 20:06:48] [INFO ] Deduced a trap composed of 193 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:06:48] [INFO ] Deduced a trap composed of 205 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:49] [INFO ] Deduced a trap composed of 202 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:06:49] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 1 ms to minimize.
[2023-03-09 20:06:49] [INFO ] Deduced a trap composed of 193 places in 157 ms of which 0 ms to minimize.
[2023-03-09 20:06:49] [INFO ] Deduced a trap composed of 201 places in 147 ms of which 1 ms to minimize.
[2023-03-09 20:06:49] [INFO ] Deduced a trap composed of 177 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:06:50] [INFO ] Deduced a trap composed of 184 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:06:50] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:06:50] [INFO ] Deduced a trap composed of 192 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:06:50] [INFO ] Deduced a trap composed of 207 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:06:51] [INFO ] Deduced a trap composed of 194 places in 173 ms of which 0 ms to minimize.
[2023-03-09 20:06:51] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2023-03-09 20:06:51] [INFO ] Deduced a trap composed of 215 places in 157 ms of which 1 ms to minimize.
[2023-03-09 20:06:51] [INFO ] Deduced a trap composed of 211 places in 161 ms of which 1 ms to minimize.
[2023-03-09 20:06:51] [INFO ] Deduced a trap composed of 206 places in 149 ms of which 0 ms to minimize.
[2023-03-09 20:06:52] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:06:53] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:06:53] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:06:53] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:06:54] [INFO ] Deduced a trap composed of 184 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:06:54] [INFO ] Deduced a trap composed of 178 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:06:54] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:06:54] [INFO ] Deduced a trap composed of 213 places in 183 ms of which 1 ms to minimize.
[2023-03-09 20:06:55] [INFO ] Deduced a trap composed of 201 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:06:55] [INFO ] Deduced a trap composed of 190 places in 187 ms of which 1 ms to minimize.
[2023-03-09 20:06:55] [INFO ] Deduced a trap composed of 196 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:06:55] [INFO ] Deduced a trap composed of 196 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:56] [INFO ] Deduced a trap composed of 169 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:06:56] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 0 ms to minimize.
[2023-03-09 20:06:57] [INFO ] Deduced a trap composed of 194 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:06:57] [INFO ] Deduced a trap composed of 218 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:57] [INFO ] Deduced a trap composed of 204 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:06:57] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:06:57] [INFO ] Deduced a trap composed of 200 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:06:58] [INFO ] Deduced a trap composed of 198 places in 181 ms of which 0 ms to minimize.
[2023-03-09 20:06:58] [INFO ] Deduced a trap composed of 205 places in 182 ms of which 0 ms to minimize.
[2023-03-09 20:06:58] [INFO ] Deduced a trap composed of 196 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:06:58] [INFO ] Deduced a trap composed of 215 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:06:59] [INFO ] Deduced a trap composed of 199 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:06:59] [INFO ] Deduced a trap composed of 200 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:06:59] [INFO ] Deduced a trap composed of 188 places in 152 ms of which 0 ms to minimize.
[2023-03-09 20:06:59] [INFO ] Deduced a trap composed of 193 places in 152 ms of which 0 ms to minimize.
[2023-03-09 20:06:59] [INFO ] Deduced a trap composed of 186 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:07:00] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:07:00] [INFO ] Deduced a trap composed of 182 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:07:00] [INFO ] Deduced a trap composed of 212 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:07:00] [INFO ] Deduced a trap composed of 204 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:07:01] [INFO ] Deduced a trap composed of 204 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:07:01] [INFO ] Deduced a trap composed of 194 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:07:01] [INFO ] Deduced a trap composed of 206 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:07:01] [INFO ] Deduced a trap composed of 204 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:07:01] [INFO ] Deduced a trap composed of 195 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:07:02] [INFO ] Deduced a trap composed of 210 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:07:02] [INFO ] Deduced a trap composed of 205 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:07:02] [INFO ] Deduced a trap composed of 206 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:07:04] [INFO ] Deduced a trap composed of 194 places in 183 ms of which 1 ms to minimize.
[2023-03-09 20:07:05] [INFO ] Deduced a trap composed of 214 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:07:05] [INFO ] Deduced a trap composed of 197 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:07:05] [INFO ] Deduced a trap composed of 227 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:07:06] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:07:06] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:07:06] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 0 ms to minimize.
[2023-03-09 20:07:06] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 1 ms to minimize.
[2023-03-09 20:07:07] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 1 ms to minimize.
[2023-03-09 20:07:07] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:07:09] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 1 ms to minimize.
[2023-03-09 20:07:09] [INFO ] Deduced a trap composed of 184 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:07:09] [INFO ] Deduced a trap composed of 194 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:07:15] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 1 ms to minimize.
[2023-03-09 20:07:15] [INFO ] Deduced a trap composed of 183 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:07:15] [INFO ] Deduced a trap composed of 190 places in 156 ms of which 0 ms to minimize.
[2023-03-09 20:07:15] [INFO ] Deduced a trap composed of 179 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:07:16] [INFO ] Deduced a trap composed of 174 places in 153 ms of which 0 ms to minimize.
[2023-03-09 20:07:16] [INFO ] Deduced a trap composed of 188 places in 182 ms of which 1 ms to minimize.
[2023-03-09 20:07:16] [INFO ] Deduced a trap composed of 202 places in 152 ms of which 0 ms to minimize.
[2023-03-09 20:07:17] [INFO ] Deduced a trap composed of 193 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:07:17] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:07:17] [INFO ] Deduced a trap composed of 198 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:07:17] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-09 20:07:17] [INFO ] Deduced a trap composed of 185 places in 150 ms of which 0 ms to minimize.
[2023-03-09 20:07:18] [INFO ] Deduced a trap composed of 180 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:07:18] [INFO ] Deduced a trap composed of 197 places in 149 ms of which 0 ms to minimize.
[2023-03-09 20:07:18] [INFO ] Deduced a trap composed of 209 places in 161 ms of which 1 ms to minimize.
[2023-03-09 20:07:18] [INFO ] Deduced a trap composed of 179 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:07:19] [INFO ] Deduced a trap composed of 160 places in 148 ms of which 0 ms to minimize.
[2023-03-09 20:07:19] [INFO ] Deduced a trap composed of 189 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:07:19] [INFO ] Deduced a trap composed of 194 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:07:19] [INFO ] Deduced a trap composed of 222 places in 146 ms of which 0 ms to minimize.
[2023-03-09 20:07:19] [INFO ] Deduced a trap composed of 214 places in 169 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 20:07:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 20:07:19] [INFO ] After 225072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:335
Fused 335 Parikh solutions to 310 different solutions.
Parikh walk visited 0 properties in 30505 ms.
Support contains 335 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 28 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 428/428 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 19 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2023-03-09 20:07:50] [INFO ] Invariant cache hit.
[2023-03-09 20:07:50] [INFO ] Implicit Places using invariants in 271 ms returned [20, 26, 221, 346, 419, 425]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 275 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY 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 42 ms. Remains 419 /422 variables (removed 3) and now considering 396/399 (removed 3) transitions.
// Phase 1: matrix 396 rows 419 cols
[2023-03-09 20:07:50] [INFO ] Computed 48 place invariants in 40 ms
[2023-03-09 20:07:51] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-09 20:07:51] [INFO ] Invariant cache hit.
[2023-03-09 20:07:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:07:52] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/428 places, 396/399 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1851 ms. Remains : 419/428 places, 396/399 transitions.
Interrupted random walk after 589343 steps, including 85270 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 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 926 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 920 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 908 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 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 911 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 920 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 942 resets, run finished after 330 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 336 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 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 916 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 919 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 934 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 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 912 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 915 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 894 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 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 920 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 933 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 893 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 922 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 898 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 915 resets, run finished after 316 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 313 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 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 939 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 913 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 902 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 923 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 916 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 919 resets, run finished after 317 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 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 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 917 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 900 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 911 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 937 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 937 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 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 909 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 946 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 947 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4041921 steps, run timeout after 138001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 4041921 steps, saw 2020763 distinct states, run finished after 138003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 335 properties.
[2023-03-09 20:10:56] [INFO ] Invariant cache hit.
[2023-03-09 20:11:01] [INFO ] After 5269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:11:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-09 20:11:05] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 20:11:18] [INFO ] After 9281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 20:11:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:11:29] [INFO ] After 10582ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 20:11:30] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 1 ms to minimize.
[2023-03-09 20:11:30] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:11:31] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 1 ms to minimize.
[2023-03-09 20:11:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 909 ms
[2023-03-09 20:11:32] [INFO ] Deduced a trap composed of 112 places in 339 ms of which 1 ms to minimize.
[2023-03-09 20:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-09 20:11:35] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 1 ms to minimize.
[2023-03-09 20:11:35] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2023-03-09 20:11:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2023-03-09 20:11:36] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-09 20:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-09 20:11:38] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:11:39] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 1 ms to minimize.
[2023-03-09 20:11:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2023-03-09 20:11:39] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2023-03-09 20:11:39] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 1 ms to minimize.
[2023-03-09 20:11:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2023-03-09 20:11:39] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2023-03-09 20:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2023-03-09 20:11:41] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 2 ms to minimize.
[2023-03-09 20:11:41] [INFO ] Deduced a trap composed of 165 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:11:42] [INFO ] Deduced a trap composed of 174 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:11:42] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:11:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1569 ms
[2023-03-09 20:11:43] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 1 ms to minimize.
[2023-03-09 20:11:43] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 0 ms to minimize.
[2023-03-09 20:11:44] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 0 ms to minimize.
[2023-03-09 20:11:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2023-03-09 20:11:46] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 0 ms to minimize.
[2023-03-09 20:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-09 20:11:46] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 1 ms to minimize.
[2023-03-09 20:11:46] [INFO ] Deduced a trap composed of 169 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:11:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2023-03-09 20:11:47] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:11:47] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:11:47] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 0 ms to minimize.
[2023-03-09 20:11:47] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:11:48] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:11:48] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:11:48] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 0 ms to minimize.
[2023-03-09 20:11:48] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:11:48] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 0 ms to minimize.
[2023-03-09 20:11:49] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 0 ms to minimize.
[2023-03-09 20:11:49] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 1 ms to minimize.
[2023-03-09 20:11:49] [INFO ] Deduced a trap composed of 173 places in 213 ms of which 1 ms to minimize.
[2023-03-09 20:11:49] [INFO ] Deduced a trap composed of 157 places in 254 ms of which 1 ms to minimize.
[2023-03-09 20:11:50] [INFO ] Deduced a trap composed of 168 places in 261 ms of which 0 ms to minimize.
[2023-03-09 20:11:50] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:11:50] [INFO ] Deduced a trap composed of 99 places in 222 ms of which 0 ms to minimize.
[2023-03-09 20:11:51] [INFO ] Deduced a trap composed of 159 places in 152 ms of which 1 ms to minimize.
[2023-03-09 20:11:51] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 0 ms to minimize.
[2023-03-09 20:11:51] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 1 ms to minimize.
[2023-03-09 20:11:51] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:11:51] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:11:51] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:11:52] [INFO ] Deduced a trap composed of 174 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:11:52] [INFO ] Deduced a trap composed of 174 places in 178 ms of which 1 ms to minimize.
[2023-03-09 20:11:52] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 1 ms to minimize.
[2023-03-09 20:11:52] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 0 ms to minimize.
[2023-03-09 20:11:53] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:11:53] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 1 ms to minimize.
[2023-03-09 20:11:53] [INFO ] Deduced a trap composed of 171 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:11:54] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:11:54] [INFO ] Deduced a trap composed of 138 places in 292 ms of which 0 ms to minimize.
[2023-03-09 20:11:54] [INFO ] Deduced a trap composed of 129 places in 302 ms of which 2 ms to minimize.
[2023-03-09 20:11:55] [INFO ] Deduced a trap composed of 121 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:11:55] [INFO ] Deduced a trap composed of 100 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:11:55] [INFO ] Deduced a trap composed of 102 places in 288 ms of which 0 ms to minimize.
[2023-03-09 20:11:56] [INFO ] Deduced a trap composed of 106 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:11:56] [INFO ] Deduced a trap composed of 107 places in 263 ms of which 1 ms to minimize.
[2023-03-09 20:11:56] [INFO ] Deduced a trap composed of 166 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:11:57] [INFO ] Deduced a trap composed of 176 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:11:57] [INFO ] Deduced a trap composed of 149 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:11:57] [INFO ] Deduced a trap composed of 114 places in 290 ms of which 5 ms to minimize.
[2023-03-09 20:11:58] [INFO ] Deduced a trap composed of 173 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:11:58] [INFO ] Deduced a trap composed of 111 places in 232 ms of which 1 ms to minimize.
[2023-03-09 20:11:58] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:11:58] [INFO ] Deduced a trap composed of 117 places in 162 ms of which 0 ms to minimize.
[2023-03-09 20:11:58] [INFO ] Deduced a trap composed of 183 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:11:59] [INFO ] Deduced a trap composed of 165 places in 169 ms of which 1 ms to minimize.
[2023-03-09 20:11:59] [INFO ] Deduced a trap composed of 191 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:11:59] [INFO ] Deduced a trap composed of 175 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:11:59] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:11:59] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 12611 ms
[2023-03-09 20:12:00] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-09 20:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-09 20:12:00] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 0 ms to minimize.
[2023-03-09 20:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-09 20:12:01] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2023-03-09 20:12:01] [INFO ] Deduced a trap composed of 167 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:12:02] [INFO ] Deduced a trap composed of 117 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:12:02] [INFO ] Deduced a trap composed of 169 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:12:02] [INFO ] Deduced a trap composed of 76 places in 346 ms of which 1 ms to minimize.
[2023-03-09 20:12:03] [INFO ] Deduced a trap composed of 172 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:12:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2300 ms
[2023-03-09 20:12:03] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:12:04] [INFO ] Deduced a trap composed of 165 places in 242 ms of which 1 ms to minimize.
[2023-03-09 20:12:04] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 1 ms to minimize.
[2023-03-09 20:12:04] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 1 ms to minimize.
[2023-03-09 20:12:04] [INFO ] Deduced a trap composed of 128 places in 221 ms of which 1 ms to minimize.
[2023-03-09 20:12:05] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 1 ms to minimize.
[2023-03-09 20:12:05] [INFO ] Deduced a trap composed of 93 places in 238 ms of which 1 ms to minimize.
[2023-03-09 20:12:05] [INFO ] Deduced a trap composed of 81 places in 237 ms of which 1 ms to minimize.
[2023-03-09 20:12:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2253 ms
[2023-03-09 20:12:08] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2023-03-09 20:12:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 20:12:08] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:12:08] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:12:08] [INFO ] Deduced a trap composed of 190 places in 210 ms of which 0 ms to minimize.
[2023-03-09 20:12:09] [INFO ] Deduced a trap composed of 81 places in 207 ms of which 1 ms to minimize.
[2023-03-09 20:12:09] [INFO ] Deduced a trap composed of 153 places in 214 ms of which 1 ms to minimize.
[2023-03-09 20:12:09] [INFO ] Deduced a trap composed of 177 places in 210 ms of which 1 ms to minimize.
[2023-03-09 20:12:09] [INFO ] Deduced a trap composed of 174 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:12:10] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 1 ms to minimize.
[2023-03-09 20:12:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1642 ms
[2023-03-09 20:12:12] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 0 ms to minimize.
[2023-03-09 20:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-09 20:12:14] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 1 ms to minimize.
[2023-03-09 20:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 20:12:15] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:12:15] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 0 ms to minimize.
[2023-03-09 20:12:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-03-09 20:12:16] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 1 ms to minimize.
[2023-03-09 20:12:16] [INFO ] Deduced a trap composed of 161 places in 212 ms of which 0 ms to minimize.
[2023-03-09 20:12:16] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 1 ms to minimize.
[2023-03-09 20:12:17] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 1 ms to minimize.
[2023-03-09 20:12:17] [INFO ] Deduced a trap composed of 187 places in 256 ms of which 1 ms to minimize.
[2023-03-09 20:12:17] [INFO ] Deduced a trap composed of 102 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:12:18] [INFO ] Deduced a trap composed of 91 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:12:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2132 ms
[2023-03-09 20:12:18] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-09 20:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-09 20:12:18] [INFO ] After 60144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 16405 ms.
[2023-03-09 20:12:35] [INFO ] After 93324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 314 different solutions.
Parikh walk visited 0 properties in 30595 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 15 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-09 20:13:05] [INFO ] Invariant cache hit.
[2023-03-09 20:13:05] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-09 20:13:05] [INFO ] Invariant cache hit.
[2023-03-09 20:13:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:13:07] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
[2023-03-09 20:13:07] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-09 20:13:07] [INFO ] Invariant cache hit.
[2023-03-09 20:13:07] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1922 ms. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14310 resets, run finished after 5831 ms. (steps per millisecond=17 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
[2023-03-09 20:13:13] [INFO ] Invariant cache hit.
[2023-03-09 20:13:13] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-09 20:13:13] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-09 20:13:15] [INFO ] After 1761ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2023-03-09 20:13:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:13:17] [INFO ] After 1704ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
[2023-03-09 20:13:18] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:13:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-09 20:13:18] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 0 ms to minimize.
[2023-03-09 20:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-09 20:13:20] [INFO ] Deduced a trap composed of 149 places in 333 ms of which 2 ms to minimize.
[2023-03-09 20:13:20] [INFO ] Deduced a trap composed of 153 places in 352 ms of which 1 ms to minimize.
[2023-03-09 20:13:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 762 ms
[2023-03-09 20:13:21] [INFO ] Deduced a trap composed of 114 places in 242 ms of which 1 ms to minimize.
[2023-03-09 20:13:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-09 20:13:21] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 1 ms to minimize.
[2023-03-09 20:13:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-09 20:13:22] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 1 ms to minimize.
[2023-03-09 20:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-09 20:13:23] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 1 ms to minimize.
[2023-03-09 20:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-09 20:13:23] [INFO ] Deduced a trap composed of 147 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:13:24] [INFO ] Deduced a trap composed of 155 places in 348 ms of which 1 ms to minimize.
[2023-03-09 20:13:24] [INFO ] Deduced a trap composed of 120 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:13:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1115 ms
[2023-03-09 20:13:25] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:13:25] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 1 ms to minimize.
[2023-03-09 20:13:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2023-03-09 20:13:27] [INFO ] Deduced a trap composed of 154 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:13:27] [INFO ] Deduced a trap composed of 148 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:13:27] [INFO ] Deduced a trap composed of 142 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:13:28] [INFO ] Deduced a trap composed of 152 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:13:28] [INFO ] Deduced a trap composed of 142 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:13:28] [INFO ] Deduced a trap composed of 166 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:13:29] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:13:29] [INFO ] Deduced a trap composed of 150 places in 230 ms of which 1 ms to minimize.
[2023-03-09 20:13:29] [INFO ] Deduced a trap composed of 152 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:13:30] [INFO ] Deduced a trap composed of 163 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:13:30] [INFO ] Deduced a trap composed of 165 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:13:30] [INFO ] Deduced a trap composed of 181 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:13:31] [INFO ] Deduced a trap composed of 128 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:13:31] [INFO ] Deduced a trap composed of 147 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:13:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4710 ms
[2023-03-09 20:13:34] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 1 ms to minimize.
[2023-03-09 20:13:34] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 1 ms to minimize.
[2023-03-09 20:13:34] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 0 ms to minimize.
[2023-03-09 20:13:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 503 ms
[2023-03-09 20:13:35] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 0 ms to minimize.
[2023-03-09 20:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-09 20:13:35] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2023-03-09 20:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-09 20:13:36] [INFO ] Deduced a trap composed of 124 places in 331 ms of which 2 ms to minimize.
[2023-03-09 20:13:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2023-03-09 20:13:37] [INFO ] Deduced a trap composed of 170 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:13:37] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 1 ms to minimize.
[2023-03-09 20:13:37] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 0 ms to minimize.
[2023-03-09 20:13:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 899 ms
[2023-03-09 20:13:38] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 0 ms to minimize.
[2023-03-09 20:13:38] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 1 ms to minimize.
[2023-03-09 20:13:38] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 0 ms to minimize.
[2023-03-09 20:13:38] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 1 ms to minimize.
[2023-03-09 20:13:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 704 ms
[2023-03-09 20:13:39] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-09 20:13:40] [INFO ] Deduced a trap composed of 139 places in 329 ms of which 1 ms to minimize.
[2023-03-09 20:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-09 20:13:41] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:13:41] [INFO ] Deduced a trap composed of 152 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:13:42] [INFO ] Deduced a trap composed of 140 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:13:42] [INFO ] Deduced a trap composed of 148 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:13:42] [INFO ] Deduced a trap composed of 154 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:13:43] [INFO ] Deduced a trap composed of 159 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:13:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2114 ms
[2023-03-09 20:13:43] [INFO ] Deduced a trap composed of 56 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:13:44] [INFO ] Deduced a trap composed of 118 places in 331 ms of which 1 ms to minimize.
[2023-03-09 20:13:44] [INFO ] Deduced a trap composed of 171 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:13:44] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:13:45] [INFO ] Deduced a trap composed of 145 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:13:45] [INFO ] Deduced a trap composed of 140 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:13:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2183 ms
[2023-03-09 20:13:45] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 0 ms to minimize.
[2023-03-09 20:13:45] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 1 ms to minimize.
[2023-03-09 20:13:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-09 20:13:46] [INFO ] Deduced a trap composed of 138 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:13:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-09 20:13:46] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 1 ms to minimize.
[2023-03-09 20:13:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-09 20:13:47] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-09 20:13:48] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 0 ms to minimize.
[2023-03-09 20:13:48] [INFO ] Deduced a trap composed of 172 places in 169 ms of which 0 ms to minimize.
[2023-03-09 20:13:48] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 0 ms to minimize.
[2023-03-09 20:13:48] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:13:48] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 1 ms to minimize.
[2023-03-09 20:13:49] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:13:49] [INFO ] Deduced a trap composed of 181 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:13:49] [INFO ] Deduced a trap composed of 190 places in 150 ms of which 1 ms to minimize.
[2023-03-09 20:13:49] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-09 20:13:49] [INFO ] Deduced a trap composed of 188 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:13:50] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 1 ms to minimize.
[2023-03-09 20:13:50] [INFO ] Deduced a trap composed of 112 places in 196 ms of which 1 ms to minimize.
[2023-03-09 20:13:50] [INFO ] Deduced a trap composed of 122 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:13:51] [INFO ] Deduced a trap composed of 169 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:13:51] [INFO ] Deduced a trap composed of 175 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:13:51] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:13:52] [INFO ] Deduced a trap composed of 126 places in 290 ms of which 0 ms to minimize.
[2023-03-09 20:13:52] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:13:52] [INFO ] Deduced a trap composed of 127 places in 288 ms of which 0 ms to minimize.
[2023-03-09 20:13:53] [INFO ] Deduced a trap composed of 161 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:13:53] [INFO ] Deduced a trap composed of 152 places in 248 ms of which 1 ms to minimize.
[2023-03-09 20:13:53] [INFO ] Deduced a trap composed of 179 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:13:54] [INFO ] Deduced a trap composed of 136 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:13:54] [INFO ] Deduced a trap composed of 141 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:13:54] [INFO ] Deduced a trap composed of 157 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:13:55] [INFO ] Deduced a trap composed of 112 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:13:55] [INFO ] Deduced a trap composed of 154 places in 279 ms of which 1 ms to minimize.
[2023-03-09 20:13:55] [INFO ] Deduced a trap composed of 172 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:13:56] [INFO ] Deduced a trap composed of 177 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:13:56] [INFO ] Deduced a trap composed of 137 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:13:56] [INFO ] Deduced a trap composed of 183 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:13:57] [INFO ] Deduced a trap composed of 134 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:13:57] [INFO ] Deduced a trap composed of 121 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:13:57] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9659 ms
[2023-03-09 20:13:58] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:13:58] [INFO ] Deduced a trap composed of 131 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 773 ms
[2023-03-09 20:14:01] [INFO ] Deduced a trap composed of 121 places in 323 ms of which 0 ms to minimize.
[2023-03-09 20:14:01] [INFO ] Deduced a trap composed of 123 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:14:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 764 ms
[2023-03-09 20:14:02] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 0 ms to minimize.
[2023-03-09 20:14:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-09 20:14:03] [INFO ] Deduced a trap composed of 174 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:14:03] [INFO ] Deduced a trap composed of 165 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:14:04] [INFO ] Deduced a trap composed of 161 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:14:04] [INFO ] Deduced a trap composed of 155 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:14:04] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:14:05] [INFO ] Deduced a trap composed of 157 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:14:05] [INFO ] Deduced a trap composed of 158 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:14:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2467 ms
[2023-03-09 20:14:05] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 0 ms to minimize.
[2023-03-09 20:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 20:14:06] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2023-03-09 20:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 20:14:07] [INFO ] Deduced a trap composed of 121 places in 234 ms of which 1 ms to minimize.
[2023-03-09 20:14:07] [INFO ] Deduced a trap composed of 120 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:14:07] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 0 ms to minimize.
[2023-03-09 20:14:07] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 0 ms to minimize.
[2023-03-09 20:14:07] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:14:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1136 ms
[2023-03-09 20:14:08] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2023-03-09 20:14:08] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:14:09] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 1 ms to minimize.
[2023-03-09 20:14:09] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:14:09] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2023-03-09 20:14:09] [INFO ] Deduced a trap composed of 110 places in 63 ms of which 0 ms to minimize.
[2023-03-09 20:14:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 583 ms
[2023-03-09 20:14:12] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 0 ms to minimize.
[2023-03-09 20:14:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-09 20:14:14] [INFO ] After 58488ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:14:14] [INFO ] After 60896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:14:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-09 20:14:14] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 20:14:16] [INFO ] After 1430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 20:14:18] [INFO ] After 1509ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 20:14:19] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 0 ms to minimize.
[2023-03-09 20:14:20] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2023-03-09 20:14:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2023-03-09 20:14:20] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2023-03-09 20:14:20] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:14:20] [INFO ] Deduced a trap composed of 147 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:14:20] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 1 ms to minimize.
[2023-03-09 20:14:21] [INFO ] Deduced a trap composed of 157 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:14:21] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:14:21] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 0 ms to minimize.
[2023-03-09 20:14:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1725 ms
[2023-03-09 20:14:22] [INFO ] Deduced a trap composed of 130 places in 262 ms of which 1 ms to minimize.
[2023-03-09 20:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-09 20:14:22] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 1 ms to minimize.
[2023-03-09 20:14:23] [INFO ] Deduced a trap composed of 134 places in 220 ms of which 1 ms to minimize.
[2023-03-09 20:14:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2023-03-09 20:14:24] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 1 ms to minimize.
[2023-03-09 20:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-09 20:14:24] [INFO ] Deduced a trap composed of 174 places in 322 ms of which 1 ms to minimize.
[2023-03-09 20:14:25] [INFO ] Deduced a trap composed of 181 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:14:25] [INFO ] Deduced a trap composed of 170 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:14:25] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2023-03-09 20:14:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1417 ms
[2023-03-09 20:14:26] [INFO ] Deduced a trap composed of 161 places in 319 ms of which 1 ms to minimize.
[2023-03-09 20:14:27] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 1 ms to minimize.
[2023-03-09 20:14:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 971 ms
[2023-03-09 20:14:31] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 1 ms to minimize.
[2023-03-09 20:14:31] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 0 ms to minimize.
[2023-03-09 20:14:31] [INFO ] Deduced a trap composed of 117 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:14:31] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 0 ms to minimize.
[2023-03-09 20:14:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1005 ms
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 52 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 161 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:14:33] [INFO ] Deduced a trap composed of 178 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:14:34] [INFO ] Deduced a trap composed of 141 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:14:34] [INFO ] Deduced a trap composed of 129 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:14:34] [INFO ] Deduced a trap composed of 133 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:14:35] [INFO ] Deduced a trap composed of 147 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:14:35] [INFO ] Deduced a trap composed of 133 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:14:36] [INFO ] Deduced a trap composed of 181 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:14:36] [INFO ] Deduced a trap composed of 172 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:14:36] [INFO ] Deduced a trap composed of 178 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:14:37] [INFO ] Deduced a trap composed of 157 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:14:37] [INFO ] Deduced a trap composed of 128 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:14:37] [INFO ] Deduced a trap composed of 110 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:14:38] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 0 ms to minimize.
[2023-03-09 20:14:38] [INFO ] Deduced a trap composed of 197 places in 302 ms of which 0 ms to minimize.
[2023-03-09 20:14:38] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:14:39] [INFO ] Deduced a trap composed of 127 places in 281 ms of which 1 ms to minimize.
[2023-03-09 20:14:39] [INFO ] Deduced a trap composed of 163 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:14:39] [INFO ] Deduced a trap composed of 149 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:14:40] [INFO ] Deduced a trap composed of 189 places in 250 ms of which 0 ms to minimize.
[2023-03-09 20:14:40] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 1 ms to minimize.
[2023-03-09 20:14:40] [INFO ] Deduced a trap composed of 172 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:14:41] [INFO ] Deduced a trap composed of 151 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:14:41] [INFO ] Deduced a trap composed of 140 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:14:41] [INFO ] Deduced a trap composed of 130 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:14:42] [INFO ] Deduced a trap composed of 168 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:14:42] [INFO ] Deduced a trap composed of 138 places in 258 ms of which 1 ms to minimize.
[2023-03-09 20:14:42] [INFO ] Deduced a trap composed of 175 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:14:43] [INFO ] Deduced a trap composed of 182 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:14:43] [INFO ] Deduced a trap composed of 157 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:14:43] [INFO ] Deduced a trap composed of 171 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:14:44] [INFO ] Deduced a trap composed of 64 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:14:44] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:14:44] [INFO ] Deduced a trap composed of 171 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:14:45] [INFO ] Deduced a trap composed of 159 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:14:45] [INFO ] Deduced a trap composed of 134 places in 231 ms of which 0 ms to minimize.
[2023-03-09 20:14:45] [INFO ] Deduced a trap composed of 156 places in 267 ms of which 1 ms to minimize.
[2023-03-09 20:14:45] [INFO ] Deduced a trap composed of 132 places in 248 ms of which 1 ms to minimize.
[2023-03-09 20:14:46] [INFO ] Deduced a trap composed of 131 places in 244 ms of which 0 ms to minimize.
[2023-03-09 20:14:46] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-09 20:14:46] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 1 ms to minimize.
[2023-03-09 20:14:47] [INFO ] Deduced a trap composed of 130 places in 219 ms of which 0 ms to minimize.
[2023-03-09 20:14:47] [INFO ] Deduced a trap composed of 130 places in 224 ms of which 1 ms to minimize.
[2023-03-09 20:14:47] [INFO ] Deduced a trap composed of 141 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:14:47] [INFO ] Deduced a trap composed of 128 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:14:48] [INFO ] Deduced a trap composed of 131 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:14:48] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 0 ms to minimize.
[2023-03-09 20:14:48] [INFO ] Deduced a trap composed of 135 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:14:49] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:14:49] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 1 ms to minimize.
[2023-03-09 20:14:49] [INFO ] Deduced a trap composed of 168 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:14:50] [INFO ] Deduced a trap composed of 123 places in 287 ms of which 0 ms to minimize.
[2023-03-09 20:14:50] [INFO ] Deduced a trap composed of 179 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:14:50] [INFO ] Deduced a trap composed of 162 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:14:51] [INFO ] Deduced a trap composed of 139 places in 268 ms of which 1 ms to minimize.
[2023-03-09 20:14:51] [INFO ] Deduced a trap composed of 163 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:14:51] [INFO ] Deduced a trap composed of 163 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:14:52] [INFO ] Deduced a trap composed of 119 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:14:52] [INFO ] Deduced a trap composed of 182 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:14:52] [INFO ] Deduced a trap composed of 169 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:14:53] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:14:53] [INFO ] Deduced a trap composed of 74 places in 278 ms of which 1 ms to minimize.
[2023-03-09 20:14:53] [INFO ] Deduced a trap composed of 174 places in 273 ms of which 1 ms to minimize.
[2023-03-09 20:14:54] [INFO ] Deduced a trap composed of 100 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:14:54] [INFO ] Deduced a trap composed of 156 places in 281 ms of which 1 ms to minimize.
[2023-03-09 20:14:54] [INFO ] Deduced a trap composed of 175 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:14:55] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 1 ms to minimize.
[2023-03-09 20:14:55] [INFO ] Deduced a trap composed of 188 places in 173 ms of which 1 ms to minimize.
[2023-03-09 20:14:55] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:14:55] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 0 ms to minimize.
[2023-03-09 20:14:56] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 0 ms to minimize.
[2023-03-09 20:14:56] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 5 ms to minimize.
[2023-03-09 20:14:56] [INFO ] Deduced a trap composed of 194 places in 175 ms of which 1 ms to minimize.
[2023-03-09 20:14:56] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2023-03-09 20:14:56] [INFO ] Deduced a trap composed of 84 places in 199 ms of which 1 ms to minimize.
[2023-03-09 20:14:57] [INFO ] Deduced a trap composed of 113 places in 287 ms of which 1 ms to minimize.
[2023-03-09 20:14:57] [INFO ] Deduced a trap composed of 112 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:14:57] [INFO ] Deduced a trap composed of 182 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:14:57] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 25127 ms
[2023-03-09 20:14:58] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2023-03-09 20:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-09 20:15:01] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:15:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-09 20:15:02] [INFO ] Deduced a trap composed of 107 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:15:02] [INFO ] Deduced a trap composed of 103 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:15:02] [INFO ] Deduced a trap composed of 103 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:15:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1088 ms
[2023-03-09 20:15:05] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 1 ms to minimize.
[2023-03-09 20:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-09 20:15:07] [INFO ] Deduced a trap composed of 112 places in 196 ms of which 1 ms to minimize.
[2023-03-09 20:15:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-09 20:15:08] [INFO ] Deduced a trap composed of 174 places in 335 ms of which 1 ms to minimize.
[2023-03-09 20:15:08] [INFO ] Deduced a trap composed of 167 places in 319 ms of which 1 ms to minimize.
[2023-03-09 20:15:09] [INFO ] Deduced a trap composed of 155 places in 333 ms of which 1 ms to minimize.
[2023-03-09 20:15:09] [INFO ] Deduced a trap composed of 155 places in 330 ms of which 1 ms to minimize.
[2023-03-09 20:15:09] [INFO ] Deduced a trap composed of 180 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:15:10] [INFO ] Deduced a trap composed of 163 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:15:10] [INFO ] Deduced a trap composed of 169 places in 319 ms of which 2 ms to minimize.
[2023-03-09 20:15:10] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 1 ms to minimize.
[2023-03-09 20:15:11] [INFO ] Deduced a trap composed of 129 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:15:11] [INFO ] Deduced a trap composed of 183 places in 323 ms of which 1 ms to minimize.
[2023-03-09 20:15:12] [INFO ] Deduced a trap composed of 170 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:15:12] [INFO ] Deduced a trap composed of 176 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:15:12] [INFO ] Deduced a trap composed of 184 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:15:13] [INFO ] Deduced a trap composed of 170 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:15:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5355 ms
[2023-03-09 20:15:16] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:15:17] [INFO ] Deduced a trap composed of 159 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:15:17] [INFO ] Deduced a trap composed of 169 places in 250 ms of which 1 ms to minimize.
[2023-03-09 20:15:17] [INFO ] Deduced a trap composed of 167 places in 251 ms of which 1 ms to minimize.
[2023-03-09 20:15:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1282 ms
[2023-03-09 20:15:18] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 0 ms to minimize.
[2023-03-09 20:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-09 20:15:21] [INFO ] Deduced a trap composed of 147 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:15:21] [INFO ] Deduced a trap composed of 145 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:15:21] [INFO ] Deduced a trap composed of 130 places in 217 ms of which 1 ms to minimize.
[2023-03-09 20:15:22] [INFO ] Deduced a trap composed of 163 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:15:22] [INFO ] Deduced a trap composed of 163 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:15:22] [INFO ] Deduced a trap composed of 141 places in 261 ms of which 1 ms to minimize.
[2023-03-09 20:15:23] [INFO ] Deduced a trap composed of 159 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:15:23] [INFO ] Deduced a trap composed of 185 places in 279 ms of which 1 ms to minimize.
[2023-03-09 20:15:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2673 ms
[2023-03-09 20:15:23] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-09 20:15:24] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 0 ms to minimize.
[2023-03-09 20:15:24] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 1 ms to minimize.
[2023-03-09 20:15:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2023-03-09 20:15:25] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2023-03-09 20:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-09 20:15:28] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 0 ms to minimize.
[2023-03-09 20:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1183 ms
[2023-03-09 20:15:31] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 0 ms to minimize.
[2023-03-09 20:15:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-09 20:15:32] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2023-03-09 20:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-09 20:15:33] [INFO ] Deduced a trap composed of 152 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:15:34] [INFO ] Deduced a trap composed of 160 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:15:34] [INFO ] Deduced a trap composed of 170 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:15:34] [INFO ] Deduced a trap composed of 86 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:15:35] [INFO ] Deduced a trap composed of 93 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:15:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1835 ms
[2023-03-09 20:15:37] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2023-03-09 20:15:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-09 20:15:38] [INFO ] After 82081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 12430 ms.
[2023-03-09 20:15:51] [INFO ] After 96811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Interrupted random walk after 589338 steps, including 85072 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 892 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 910 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 904 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 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 900 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 912 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 916 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 913 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 907 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 925 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 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 924 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 915 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 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 922 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 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 897 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 909 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 908 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 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 902 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 898 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 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 914 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 907 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 896 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 900 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 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 936 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 899 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 931 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 932 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 902 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 963 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 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 936 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 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 894 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 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 946 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 951 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 905 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 930 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 905 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 904 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 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 911 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 907 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4182257 steps, run timeout after 138001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 4182257 steps, saw 2090921 distinct states, run finished after 138002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 335 properties.
[2023-03-09 20:18:56] [INFO ] Invariant cache hit.
[2023-03-09 20:19:02] [INFO ] After 6417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:19:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2023-03-09 20:19:05] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-09 20:19:20] [INFO ] After 10624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 20:19:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:19:31] [INFO ] After 11406ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 20:19:33] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 2 ms to minimize.
[2023-03-09 20:19:33] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 1 ms to minimize.
[2023-03-09 20:19:34] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:19:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 909 ms
[2023-03-09 20:19:35] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:19:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-09 20:19:36] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2023-03-09 20:19:36] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 1 ms to minimize.
[2023-03-09 20:19:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2023-03-09 20:19:37] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2023-03-09 20:19:40] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 1 ms to minimize.
[2023-03-09 20:19:40] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:19:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-03-09 20:19:40] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:19:41] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2023-03-09 20:19:41] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 1 ms to minimize.
[2023-03-09 20:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2023-03-09 20:19:43] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:19:43] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 1 ms to minimize.
[2023-03-09 20:19:43] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 0 ms to minimize.
[2023-03-09 20:19:43] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2023-03-09 20:19:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 890 ms
[2023-03-09 20:19:44] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 0 ms to minimize.
[2023-03-09 20:19:44] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 0 ms to minimize.
[2023-03-09 20:19:44] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2023-03-09 20:19:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2023-03-09 20:19:46] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 1 ms to minimize.
[2023-03-09 20:19:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 20:19:47] [INFO ] Deduced a trap composed of 174 places in 263 ms of which 1 ms to minimize.
[2023-03-09 20:19:47] [INFO ] Deduced a trap composed of 169 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:19:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 660 ms
[2023-03-09 20:19:48] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 1 ms to minimize.
[2023-03-09 20:19:48] [INFO ] Deduced a trap composed of 158 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:19:48] [INFO ] Deduced a trap composed of 155 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:19:48] [INFO ] Deduced a trap composed of 107 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:19:49] [INFO ] Deduced a trap composed of 160 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:19:49] [INFO ] Deduced a trap composed of 100 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:19:49] [INFO ] Deduced a trap composed of 149 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:19:50] [INFO ] Deduced a trap composed of 104 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:19:50] [INFO ] Deduced a trap composed of 119 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:19:51] [INFO ] Deduced a trap composed of 162 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:19:51] [INFO ] Deduced a trap composed of 165 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:19:51] [INFO ] Deduced a trap composed of 173 places in 306 ms of which 2 ms to minimize.
[2023-03-09 20:19:52] [INFO ] Deduced a trap composed of 157 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:19:52] [INFO ] Deduced a trap composed of 168 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:19:52] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 1 ms to minimize.
[2023-03-09 20:19:53] [INFO ] Deduced a trap composed of 99 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:19:53] [INFO ] Deduced a trap composed of 159 places in 305 ms of which 0 ms to minimize.
[2023-03-09 20:19:53] [INFO ] Deduced a trap composed of 166 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:19:54] [INFO ] Deduced a trap composed of 156 places in 268 ms of which 1 ms to minimize.
[2023-03-09 20:19:54] [INFO ] Deduced a trap composed of 159 places in 269 ms of which 1 ms to minimize.
[2023-03-09 20:19:54] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 1 ms to minimize.
[2023-03-09 20:19:54] [INFO ] Deduced a trap composed of 160 places in 268 ms of which 1 ms to minimize.
[2023-03-09 20:19:55] [INFO ] Deduced a trap composed of 174 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:19:55] [INFO ] Deduced a trap composed of 174 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:19:56] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-09 20:19:56] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
[2023-03-09 20:19:56] [INFO ] Deduced a trap composed of 167 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:19:57] [INFO ] Deduced a trap composed of 165 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:19:57] [INFO ] Deduced a trap composed of 171 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:19:57] [INFO ] Deduced a trap composed of 136 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:19:58] [INFO ] Deduced a trap composed of 138 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:19:58] [INFO ] Deduced a trap composed of 129 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:19:58] [INFO ] Deduced a trap composed of 121 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:19:59] [INFO ] Deduced a trap composed of 100 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:19:59] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:19:59] [INFO ] Deduced a trap composed of 106 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:20:00] [INFO ] Deduced a trap composed of 107 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:20:00] [INFO ] Deduced a trap composed of 166 places in 310 ms of which 2 ms to minimize.
[2023-03-09 20:20:00] [INFO ] Deduced a trap composed of 176 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 149 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 114 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:20:01] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 0 ms to minimize.
[2023-03-09 20:20:02] [INFO ] Deduced a trap composed of 111 places in 288 ms of which 0 ms to minimize.
[2023-03-09 20:20:02] [INFO ] Deduced a trap composed of 178 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:20:02] [INFO ] Deduced a trap composed of 117 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:20:03] [INFO ] Deduced a trap composed of 183 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:20:03] [INFO ] Deduced a trap composed of 165 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:20:03] [INFO ] Deduced a trap composed of 191 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:20:04] [INFO ] Deduced a trap composed of 175 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:20:04] [INFO ] Deduced a trap composed of 184 places in 274 ms of which 1 ms to minimize.
[2023-03-09 20:20:04] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 16808 ms
[2023-03-09 20:20:05] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-09 20:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-09 20:20:05] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 1 ms to minimize.
[2023-03-09 20:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-09 20:20:06] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 1 ms to minimize.
[2023-03-09 20:20:07] [INFO ] Deduced a trap composed of 167 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:20:07] [INFO ] Deduced a trap composed of 117 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:20:07] [INFO ] Deduced a trap composed of 169 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:20:08] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 0 ms to minimize.
[2023-03-09 20:20:08] [INFO ] Deduced a trap composed of 172 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:20:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2094 ms
[2023-03-09 20:20:08] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 1 ms to minimize.
[2023-03-09 20:20:09] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 1 ms to minimize.
[2023-03-09 20:20:09] [INFO ] Deduced a trap composed of 163 places in 267 ms of which 1 ms to minimize.
[2023-03-09 20:20:09] [INFO ] Deduced a trap composed of 168 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:20:10] [INFO ] Deduced a trap composed of 128 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:20:10] [INFO ] Deduced a trap composed of 84 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:20:10] [INFO ] Deduced a trap composed of 93 places in 296 ms of which 0 ms to minimize.
[2023-03-09 20:20:11] [INFO ] Deduced a trap composed of 81 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:20:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2621 ms
[2023-03-09 20:20:14] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 0 ms to minimize.
[2023-03-09 20:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-09 20:20:15] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2023-03-09 20:20:15] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2023-03-09 20:20:15] [INFO ] Deduced a trap composed of 190 places in 279 ms of which 1 ms to minimize.
[2023-03-09 20:20:15] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:20:16] [INFO ] Deduced a trap composed of 153 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:20:16] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 1 ms to minimize.
[2023-03-09 20:20:16] [INFO ] Deduced a trap composed of 174 places in 256 ms of which 1 ms to minimize.
[2023-03-09 20:20:17] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:20:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1945 ms
[2023-03-09 20:20:20] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 0 ms to minimize.
[2023-03-09 20:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-09 20:20:22] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2023-03-09 20:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 20:20:23] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2023-03-09 20:20:23] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:20:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-03-09 20:20:24] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 0 ms to minimize.
[2023-03-09 20:20:24] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 1 ms to minimize.
[2023-03-09 20:20:24] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 0 ms to minimize.
[2023-03-09 20:20:24] [INFO ] Deduced a trap composed of 177 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:20:24] [INFO ] Deduced a trap composed of 187 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:20:25] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:20:25] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 0 ms to minimize.
[2023-03-09 20:20:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1443 ms
[2023-03-09 20:20:25] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2023-03-09 20:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-09 20:20:25] [INFO ] After 65102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 16169 ms.
[2023-03-09 20:20:41] [INFO ] After 99374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 314 different solutions.
Parikh walk visited 0 properties in 30304 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 10 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-03-09 20:21:12] [INFO ] Invariant cache hit.
[2023-03-09 20:21:12] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-09 20:21:12] [INFO ] Invariant cache hit.
[2023-03-09 20:21:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:21:13] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2023-03-09 20:21:13] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 20:21:13] [INFO ] Invariant cache hit.
[2023-03-09 20:21:14] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2068 ms. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14352 resets, run finished after 5465 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
[2023-03-09 20:21:19] [INFO ] Invariant cache hit.
[2023-03-09 20:21:19] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-09 20:21:19] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-09 20:21:21] [INFO ] After 1734ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2023-03-09 20:21:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:21:23] [INFO ] After 1391ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
[2023-03-09 20:21:23] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2023-03-09 20:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-09 20:21:24] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 1 ms to minimize.
[2023-03-09 20:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-09 20:21:25] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:21:25] [INFO ] Deduced a trap composed of 153 places in 258 ms of which 1 ms to minimize.
[2023-03-09 20:21:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2023-03-09 20:21:26] [INFO ] Deduced a trap composed of 114 places in 235 ms of which 1 ms to minimize.
[2023-03-09 20:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-09 20:21:26] [INFO ] Deduced a trap composed of 121 places in 221 ms of which 0 ms to minimize.
[2023-03-09 20:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-09 20:21:27] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2023-03-09 20:21:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-09 20:21:28] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2023-03-09 20:21:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 20:21:28] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 1 ms to minimize.
[2023-03-09 20:21:28] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:21:29] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 1 ms to minimize.
[2023-03-09 20:21:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 608 ms
[2023-03-09 20:21:29] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 1 ms to minimize.
[2023-03-09 20:21:29] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 0 ms to minimize.
[2023-03-09 20:21:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 154 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:21:31] [INFO ] Deduced a trap composed of 148 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:21:32] [INFO ] Deduced a trap composed of 142 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:21:32] [INFO ] Deduced a trap composed of 152 places in 322 ms of which 1 ms to minimize.
[2023-03-09 20:21:32] [INFO ] Deduced a trap composed of 142 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 166 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:21:33] [INFO ] Deduced a trap composed of 150 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:21:34] [INFO ] Deduced a trap composed of 152 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:21:34] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:21:34] [INFO ] Deduced a trap composed of 165 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:21:35] [INFO ] Deduced a trap composed of 181 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:21:35] [INFO ] Deduced a trap composed of 128 places in 250 ms of which 1 ms to minimize.
[2023-03-09 20:21:35] [INFO ] Deduced a trap composed of 147 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:21:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4668 ms
[2023-03-09 20:21:38] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 1 ms to minimize.
[2023-03-09 20:21:38] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2023-03-09 20:21:38] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 1 ms to minimize.
[2023-03-09 20:21:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2023-03-09 20:21:39] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 1 ms to minimize.
[2023-03-09 20:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-09 20:21:39] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2023-03-09 20:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-09 20:21:40] [INFO ] Deduced a trap composed of 124 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-09 20:21:41] [INFO ] Deduced a trap composed of 170 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:21:41] [INFO ] Deduced a trap composed of 151 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:21:41] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 1 ms to minimize.
[2023-03-09 20:21:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 958 ms
[2023-03-09 20:21:42] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2023-03-09 20:21:42] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 1 ms to minimize.
[2023-03-09 20:21:42] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 1 ms to minimize.
[2023-03-09 20:21:43] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 1 ms to minimize.
[2023-03-09 20:21:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 717 ms
[2023-03-09 20:21:43] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-09 20:21:44] [INFO ] Deduced a trap composed of 139 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-09 20:21:45] [INFO ] Deduced a trap composed of 166 places in 331 ms of which 1 ms to minimize.
[2023-03-09 20:21:46] [INFO ] Deduced a trap composed of 152 places in 340 ms of which 1 ms to minimize.
[2023-03-09 20:21:46] [INFO ] Deduced a trap composed of 140 places in 267 ms of which 1 ms to minimize.
[2023-03-09 20:21:46] [INFO ] Deduced a trap composed of 148 places in 328 ms of which 1 ms to minimize.
[2023-03-09 20:21:47] [INFO ] Deduced a trap composed of 154 places in 328 ms of which 1 ms to minimize.
[2023-03-09 20:21:47] [INFO ] Deduced a trap composed of 159 places in 261 ms of which 1 ms to minimize.
[2023-03-09 20:21:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2158 ms
[2023-03-09 20:21:48] [INFO ] Deduced a trap composed of 56 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:21:48] [INFO ] Deduced a trap composed of 118 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:21:48] [INFO ] Deduced a trap composed of 171 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:21:49] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:21:49] [INFO ] Deduced a trap composed of 145 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:21:49] [INFO ] Deduced a trap composed of 140 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:21:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2170 ms
[2023-03-09 20:21:50] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 0 ms to minimize.
[2023-03-09 20:21:50] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 0 ms to minimize.
[2023-03-09 20:21:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-03-09 20:21:51] [INFO ] Deduced a trap composed of 138 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-09 20:21:51] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 0 ms to minimize.
[2023-03-09 20:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-09 20:21:52] [INFO ] Deduced a trap composed of 128 places in 327 ms of which 1 ms to minimize.
[2023-03-09 20:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-09 20:21:53] [INFO ] Deduced a trap composed of 168 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:21:53] [INFO ] Deduced a trap composed of 172 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:21:54] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:21:54] [INFO ] Deduced a trap composed of 152 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:21:54] [INFO ] Deduced a trap composed of 171 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:21:55] [INFO ] Deduced a trap composed of 170 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:21:55] [INFO ] Deduced a trap composed of 181 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:21:55] [INFO ] Deduced a trap composed of 190 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:21:56] [INFO ] Deduced a trap composed of 170 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:21:56] [INFO ] Deduced a trap composed of 188 places in 255 ms of which 1 ms to minimize.
[2023-03-09 20:21:56] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:21:57] [INFO ] Deduced a trap composed of 112 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:21:57] [INFO ] Deduced a trap composed of 122 places in 255 ms of which 1 ms to minimize.
[2023-03-09 20:21:57] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:21:58] [INFO ] Deduced a trap composed of 175 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:21:58] [INFO ] Deduced a trap composed of 134 places in 265 ms of which 1 ms to minimize.
[2023-03-09 20:21:58] [INFO ] Deduced a trap composed of 126 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:21:59] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:21:59] [INFO ] Deduced a trap composed of 127 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:21:59] [INFO ] Deduced a trap composed of 161 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:00] [INFO ] Deduced a trap composed of 152 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:22:00] [INFO ] Deduced a trap composed of 179 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:22:00] [INFO ] Deduced a trap composed of 136 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:22:01] [INFO ] Deduced a trap composed of 141 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:22:01] [INFO ] Deduced a trap composed of 157 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:01] [INFO ] Deduced a trap composed of 112 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:22:02] [INFO ] Deduced a trap composed of 154 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:22:02] [INFO ] Deduced a trap composed of 172 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:22:02] [INFO ] Deduced a trap composed of 177 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:22:03] [INFO ] Deduced a trap composed of 137 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:22:03] [INFO ] Deduced a trap composed of 183 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:22:03] [INFO ] Deduced a trap composed of 134 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:22:04] [INFO ] Deduced a trap composed of 121 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:22:04] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 11356 ms
[2023-03-09 20:22:05] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 1 ms to minimize.
[2023-03-09 20:22:05] [INFO ] Deduced a trap composed of 131 places in 322 ms of which 1 ms to minimize.
[2023-03-09 20:22:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 723 ms
[2023-03-09 20:22:08] [INFO ] Deduced a trap composed of 121 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:22:08] [INFO ] Deduced a trap composed of 123 places in 314 ms of which 0 ms to minimize.
[2023-03-09 20:22:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 759 ms
[2023-03-09 20:22:09] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 1 ms to minimize.
[2023-03-09 20:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-09 20:22:10] [INFO ] Deduced a trap composed of 174 places in 319 ms of which 1 ms to minimize.
[2023-03-09 20:22:10] [INFO ] Deduced a trap composed of 165 places in 319 ms of which 1 ms to minimize.
[2023-03-09 20:22:10] [INFO ] Deduced a trap composed of 161 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:22:11] [INFO ] Deduced a trap composed of 155 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:22:11] [INFO ] Deduced a trap composed of 164 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:22:11] [INFO ] Deduced a trap composed of 157 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:22:12] [INFO ] Deduced a trap composed of 158 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:22:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2549 ms
[2023-03-09 20:22:12] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2023-03-09 20:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 20:22:13] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 0 ms to minimize.
[2023-03-09 20:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-09 20:22:14] [INFO ] Deduced a trap composed of 121 places in 312 ms of which 1 ms to minimize.
[2023-03-09 20:22:14] [INFO ] Deduced a trap composed of 120 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:22:14] [INFO ] Deduced a trap composed of 80 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:22:15] [INFO ] Deduced a trap composed of 111 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:22:15] [INFO ] Deduced a trap composed of 119 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:22:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1807 ms
[2023-03-09 20:22:16] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 1 ms to minimize.
[2023-03-09 20:22:17] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 0 ms to minimize.
[2023-03-09 20:22:17] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 0 ms to minimize.
[2023-03-09 20:22:17] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2023-03-09 20:22:17] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 0 ms to minimize.
[2023-03-09 20:22:17] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 0 ms to minimize.
[2023-03-09 20:22:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 922 ms
[2023-03-09 20:22:22] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-09 20:22:23] [INFO ] After 61425ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:22:23] [INFO ] After 63658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 20:22:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2023-03-09 20:22:23] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 20:22:25] [INFO ] After 1600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 20:22:27] [INFO ] After 1581ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 20:22:29] [INFO ] Deduced a trap composed of 34 places in 319 ms of which 0 ms to minimize.
[2023-03-09 20:22:29] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 0 ms to minimize.
[2023-03-09 20:22:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 707 ms
[2023-03-09 20:22:30] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:22:30] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 1 ms to minimize.
[2023-03-09 20:22:31] [INFO ] Deduced a trap composed of 147 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:22:31] [INFO ] Deduced a trap composed of 161 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:22:31] [INFO ] Deduced a trap composed of 157 places in 312 ms of which 2 ms to minimize.
[2023-03-09 20:22:32] [INFO ] Deduced a trap composed of 38 places in 328 ms of which 1 ms to minimize.
[2023-03-09 20:22:32] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:22:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2609 ms
[2023-03-09 20:22:33] [INFO ] Deduced a trap composed of 130 places in 249 ms of which 1 ms to minimize.
[2023-03-09 20:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-09 20:22:33] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 0 ms to minimize.
[2023-03-09 20:22:33] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 1 ms to minimize.
[2023-03-09 20:22:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2023-03-09 20:22:34] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 1 ms to minimize.
[2023-03-09 20:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2023-03-09 20:22:35] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:22:35] [INFO ] Deduced a trap composed of 181 places in 164 ms of which 1 ms to minimize.
[2023-03-09 20:22:35] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 1 ms to minimize.
[2023-03-09 20:22:36] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-09 20:22:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 996 ms
[2023-03-09 20:22:37] [INFO ] Deduced a trap composed of 161 places in 318 ms of which 1 ms to minimize.
[2023-03-09 20:22:37] [INFO ] Deduced a trap composed of 113 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:22:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 999 ms
[2023-03-09 20:22:41] [INFO ] Deduced a trap composed of 119 places in 202 ms of which 1 ms to minimize.
[2023-03-09 20:22:41] [INFO ] Deduced a trap composed of 121 places in 206 ms of which 0 ms to minimize.
[2023-03-09 20:22:41] [INFO ] Deduced a trap composed of 117 places in 194 ms of which 0 ms to minimize.
[2023-03-09 20:22:42] [INFO ] Deduced a trap composed of 121 places in 200 ms of which 1 ms to minimize.
[2023-03-09 20:22:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1073 ms
[2023-03-09 20:22:43] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 0 ms to minimize.
[2023-03-09 20:22:43] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:22:43] [INFO ] Deduced a trap composed of 178 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:44] [INFO ] Deduced a trap composed of 141 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:22:44] [INFO ] Deduced a trap composed of 129 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:22:44] [INFO ] Deduced a trap composed of 133 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:22:45] [INFO ] Deduced a trap composed of 147 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:22:45] [INFO ] Deduced a trap composed of 133 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:22:46] [INFO ] Deduced a trap composed of 181 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:22:46] [INFO ] Deduced a trap composed of 172 places in 289 ms of which 1 ms to minimize.
[2023-03-09 20:22:46] [INFO ] Deduced a trap composed of 178 places in 295 ms of which 0 ms to minimize.
[2023-03-09 20:22:47] [INFO ] Deduced a trap composed of 157 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:22:47] [INFO ] Deduced a trap composed of 128 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:48] [INFO ] Deduced a trap composed of 110 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:22:48] [INFO ] Deduced a trap composed of 173 places in 316 ms of which 1 ms to minimize.
[2023-03-09 20:22:48] [INFO ] Deduced a trap composed of 197 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:22:49] [INFO ] Deduced a trap composed of 166 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:22:49] [INFO ] Deduced a trap composed of 127 places in 314 ms of which 1 ms to minimize.
[2023-03-09 20:22:49] [INFO ] Deduced a trap composed of 163 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:22:50] [INFO ] Deduced a trap composed of 149 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:22:50] [INFO ] Deduced a trap composed of 189 places in 303 ms of which 2 ms to minimize.
[2023-03-09 20:22:50] [INFO ] Deduced a trap composed of 167 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:22:51] [INFO ] Deduced a trap composed of 172 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:22:51] [INFO ] Deduced a trap composed of 151 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:22:51] [INFO ] Deduced a trap composed of 140 places in 316 ms of which 2 ms to minimize.
[2023-03-09 20:22:52] [INFO ] Deduced a trap composed of 130 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:22:52] [INFO ] Deduced a trap composed of 168 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:22:52] [INFO ] Deduced a trap composed of 138 places in 307 ms of which 1 ms to minimize.
[2023-03-09 20:22:53] [INFO ] Deduced a trap composed of 175 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:22:53] [INFO ] Deduced a trap composed of 182 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:53] [INFO ] Deduced a trap composed of 157 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:54] [INFO ] Deduced a trap composed of 171 places in 303 ms of which 1 ms to minimize.
[2023-03-09 20:22:54] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:22:54] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:22:55] [INFO ] Deduced a trap composed of 171 places in 320 ms of which 1 ms to minimize.
[2023-03-09 20:22:55] [INFO ] Deduced a trap composed of 159 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:22:55] [INFO ] Deduced a trap composed of 134 places in 306 ms of which 1 ms to minimize.
[2023-03-09 20:22:56] [INFO ] Deduced a trap composed of 156 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:22:56] [INFO ] Deduced a trap composed of 132 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:22:56] [INFO ] Deduced a trap composed of 131 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:22:57] [INFO ] Deduced a trap composed of 166 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:22:57] [INFO ] Deduced a trap composed of 130 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:22:58] [INFO ] Deduced a trap composed of 130 places in 329 ms of which 1 ms to minimize.
[2023-03-09 20:22:58] [INFO ] Deduced a trap composed of 130 places in 308 ms of which 0 ms to minimize.
[2023-03-09 20:22:58] [INFO ] Deduced a trap composed of 141 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:22:59] [INFO ] Deduced a trap composed of 128 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:22:59] [INFO ] Deduced a trap composed of 131 places in 301 ms of which 1 ms to minimize.
[2023-03-09 20:22:59] [INFO ] Deduced a trap composed of 166 places in 315 ms of which 1 ms to minimize.
[2023-03-09 20:23:00] [INFO ] Deduced a trap composed of 135 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:23:00] [INFO ] Deduced a trap composed of 164 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:23:00] [INFO ] Deduced a trap composed of 173 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:23:01] [INFO ] Deduced a trap composed of 168 places in 305 ms of which 1 ms to minimize.
[2023-03-09 20:23:01] [INFO ] Deduced a trap composed of 123 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:23:01] [INFO ] Deduced a trap composed of 179 places in 305 ms of which 0 ms to minimize.
[2023-03-09 20:23:02] [INFO ] Deduced a trap composed of 162 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:23:02] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:23:02] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 0 ms to minimize.
[2023-03-09 20:23:02] [INFO ] Deduced a trap composed of 163 places in 172 ms of which 1 ms to minimize.
[2023-03-09 20:23:03] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 0 ms to minimize.
[2023-03-09 20:23:03] [INFO ] Deduced a trap composed of 182 places in 166 ms of which 1 ms to minimize.
[2023-03-09 20:23:03] [INFO ] Deduced a trap composed of 169 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:23:03] [INFO ] Deduced a trap composed of 167 places in 280 ms of which 1 ms to minimize.
[2023-03-09 20:23:04] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 1 ms to minimize.
[2023-03-09 20:23:04] [INFO ] Deduced a trap composed of 174 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:23:04] [INFO ] Deduced a trap composed of 100 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:23:05] [INFO ] Deduced a trap composed of 156 places in 302 ms of which 1 ms to minimize.
[2023-03-09 20:23:05] [INFO ] Deduced a trap composed of 175 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:23:05] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 1 ms to minimize.
[2023-03-09 20:23:06] [INFO ] Deduced a trap composed of 188 places in 260 ms of which 1 ms to minimize.
[2023-03-09 20:23:06] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 1 ms to minimize.
[2023-03-09 20:23:06] [INFO ] Deduced a trap composed of 113 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 90 places in 295 ms of which 0 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 173 places in 309 ms of which 1 ms to minimize.
[2023-03-09 20:23:07] [INFO ] Deduced a trap composed of 194 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:23:08] [INFO ] Deduced a trap composed of 162 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:23:08] [INFO ] Deduced a trap composed of 84 places in 284 ms of which 1 ms to minimize.
[2023-03-09 20:23:08] [INFO ] Deduced a trap composed of 113 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:23:09] [INFO ] Deduced a trap composed of 112 places in 295 ms of which 1 ms to minimize.
[2023-03-09 20:23:09] [INFO ] Deduced a trap composed of 182 places in 288 ms of which 1 ms to minimize.
[2023-03-09 20:23:09] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 26506 ms
[2023-03-09 20:23:10] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-09 20:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-09 20:23:12] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 1 ms to minimize.
[2023-03-09 20:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-09 20:23:13] [INFO ] Deduced a trap composed of 107 places in 304 ms of which 1 ms to minimize.
[2023-03-09 20:23:13] [INFO ] Deduced a trap composed of 103 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:23:14] [INFO ] Deduced a trap composed of 103 places in 290 ms of which 1 ms to minimize.
[2023-03-09 20:23:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1066 ms
[2023-03-09 20:23:16] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-09 20:23:17] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 0 ms to minimize.
[2023-03-09 20:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-09 20:23:18] [INFO ] Deduced a trap composed of 174 places in 197 ms of which 1 ms to minimize.
[2023-03-09 20:23:18] [INFO ] Deduced a trap composed of 167 places in 194 ms of which 1 ms to minimize.
[2023-03-09 20:23:18] [INFO ] Deduced a trap composed of 155 places in 193 ms of which 0 ms to minimize.
[2023-03-09 20:23:18] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 1 ms to minimize.
[2023-03-09 20:23:19] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 1 ms to minimize.
[2023-03-09 20:23:19] [INFO ] Deduced a trap composed of 163 places in 224 ms of which 0 ms to minimize.
[2023-03-09 20:23:19] [INFO ] Deduced a trap composed of 169 places in 218 ms of which 1 ms to minimize.
[2023-03-09 20:23:19] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-09 20:23:20] [INFO ] Deduced a trap composed of 129 places in 214 ms of which 1 ms to minimize.
[2023-03-09 20:23:20] [INFO ] Deduced a trap composed of 183 places in 238 ms of which 1 ms to minimize.
[2023-03-09 20:23:20] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 1 ms to minimize.
[2023-03-09 20:23:21] [INFO ] Deduced a trap composed of 176 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:23:21] [INFO ] Deduced a trap composed of 184 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:23:21] [INFO ] Deduced a trap composed of 170 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:23:21] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3896 ms
[2023-03-09 20:23:25] [INFO ] Deduced a trap composed of 45 places in 328 ms of which 1 ms to minimize.
[2023-03-09 20:23:25] [INFO ] Deduced a trap composed of 159 places in 317 ms of which 1 ms to minimize.
[2023-03-09 20:23:26] [INFO ] Deduced a trap composed of 169 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:23:26] [INFO ] Deduced a trap composed of 167 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:23:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1477 ms
[2023-03-09 20:23:27] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 1 ms to minimize.
[2023-03-09 20:23:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-09 20:23:29] [INFO ] Deduced a trap composed of 147 places in 300 ms of which 1 ms to minimize.
[2023-03-09 20:23:30] [INFO ] Deduced a trap composed of 145 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:23:30] [INFO ] Deduced a trap composed of 130 places in 310 ms of which 1 ms to minimize.
[2023-03-09 20:23:30] [INFO ] Deduced a trap composed of 163 places in 308 ms of which 1 ms to minimize.
[2023-03-09 20:23:31] [INFO ] Deduced a trap composed of 163 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:23:31] [INFO ] Deduced a trap composed of 141 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:23:32] [INFO ] Deduced a trap composed of 159 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:23:32] [INFO ] Deduced a trap composed of 185 places in 296 ms of which 1 ms to minimize.
[2023-03-09 20:23:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2852 ms
[2023-03-09 20:23:32] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2023-03-09 20:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-09 20:23:33] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 1 ms to minimize.
[2023-03-09 20:23:33] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 1 ms to minimize.
[2023-03-09 20:23:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-09 20:23:34] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 0 ms to minimize.
[2023-03-09 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-09 20:23:37] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2023-03-09 20:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1052 ms
[2023-03-09 20:23:40] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 0 ms to minimize.
[2023-03-09 20:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-09 20:23:41] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 0 ms to minimize.
[2023-03-09 20:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-09 20:23:42] [INFO ] Deduced a trap composed of 152 places in 265 ms of which 1 ms to minimize.
[2023-03-09 20:23:42] [INFO ] Deduced a trap composed of 160 places in 291 ms of which 1 ms to minimize.
[2023-03-09 20:23:43] [INFO ] Deduced a trap composed of 170 places in 293 ms of which 1 ms to minimize.
[2023-03-09 20:23:43] [INFO ] Deduced a trap composed of 86 places in 286 ms of which 1 ms to minimize.
[2023-03-09 20:23:43] [INFO ] Deduced a trap composed of 93 places in 271 ms of which 1 ms to minimize.
[2023-03-09 20:23:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1733 ms
[2023-03-09 20:23:46] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2023-03-09 20:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-09 20:23:47] [INFO ] After 81360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 10664 ms.
[2023-03-09 20:23:57] [INFO ] After 94358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15809128 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16130696 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r151-smll-167819438100298"
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 ;