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.r153-smll-167819440300298.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 smartxred
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 r153-smll-167819440300298
=====================================================================

--------------------
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 1678404485107

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 23:28:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 23:28:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:28:08] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-09 23:28:08] [INFO ] Transformed 534 places.
[2023-03-09 23:28:08] [INFO ] Transformed 498 transitions.
[2023-03-09 23:28:08] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 251 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 1005 ms. (steps per millisecond=9 ) properties (out of 523) seen :80
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 443) 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 443) 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 443) 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 443) 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 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 443) 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 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 443) 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 443) 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 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 443) 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 443) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 443) 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 443) 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 443) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 443) 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 443) 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 443) 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 443) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 443) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) 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 443) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 443) seen :0
Running SMT prover for 443 properties.
// Phase 1: matrix 498 rows 534 cols
[2023-03-09 23:28:09] [INFO ] Computed 54 place invariants in 94 ms
[2023-03-09 23:28:17] [INFO ] After 7351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:443
[2023-03-09 23:28:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-09 23:28:22] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 35 ms returned sat
[2023-03-09 23:28:40] [INFO ] After 13360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :443
[2023-03-09 23:28:40] [INFO ] Deduced a trap composed of 48 places in 374 ms of which 11 ms to minimize.
[2023-03-09 23:28:41] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 2 ms to minimize.
[2023-03-09 23:28:41] [INFO ] Deduced a trap composed of 208 places in 301 ms of which 2 ms to minimize.
[2023-03-09 23:28:41] [INFO ] Deduced a trap composed of 188 places in 288 ms of which 2 ms to minimize.
[2023-03-09 23:28:42] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 2 ms to minimize.
[2023-03-09 23:28:42] [INFO ] Deduced a trap composed of 220 places in 339 ms of which 8 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 23:28:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 23:28:42] [INFO ] After 25234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:443
Fused 443 Parikh solutions to 424 different solutions.
Parikh walk visited 0 properties in 30291 ms.
Support contains 443 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 534 transition count 481
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 517 transition count 481
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 517 transition count 478
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 514 transition count 478
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 493 transition count 457
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 490 transition count 457
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 490 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 488 transition count 455
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 488 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 487 transition count 454
Applied a total of 99 rules in 195 ms. Remains 487 /534 variables (removed 47) and now considering 454/498 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 487/534 places, 454/498 transitions.
Interrupted random walk after 495074 steps, including 63352 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 441) 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 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 885 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 441) seen :0
Probably explored full state space saw : 184904 states, properties seen :68
Probabilistic random walk after 369813 steps, saw 184904 distinct states, run finished after 14596 ms. (steps per millisecond=25 ) properties seen :68
Interrupted probabilistic random walk after 4040630 steps, run timeout after 150001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 52=1, 53=1, 54=1}
Exhaustive walk after 4040630 steps, saw 2020547 distinct states, run finished after 150004 ms. (steps per millisecond=26 ) properties seen :36
Running SMT prover for 337 properties.
// Phase 1: matrix 454 rows 487 cols
[2023-03-09 23:32:48] [INFO ] Computed 54 place invariants in 47 ms
[2023-03-09 23:32:52] [INFO ] After 4796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:337
[2023-03-09 23:32:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2023-03-09 23:32:56] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 30 ms returned sat
[2023-03-09 23:33:09] [INFO ] After 8910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :337
[2023-03-09 23:33:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 23:33:17] [INFO ] After 8755ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :337
[2023-03-09 23:33:18] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 2 ms to minimize.
[2023-03-09 23:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 458 ms
[2023-03-09 23:33:19] [INFO ] Deduced a trap composed of 22 places in 576 ms of which 3 ms to minimize.
[2023-03-09 23:33:20] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:33:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1035 ms
[2023-03-09 23:33:20] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2023-03-09 23:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-09 23:33:21] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 1 ms to minimize.
[2023-03-09 23:33:22] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 1 ms to minimize.
[2023-03-09 23:33:22] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 4 ms to minimize.
[2023-03-09 23:33:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 886 ms
[2023-03-09 23:33:22] [INFO ] Deduced a trap composed of 132 places in 301 ms of which 15 ms to minimize.
[2023-03-09 23:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2023-03-09 23:33:23] [INFO ] Deduced a trap composed of 50 places in 358 ms of which 1 ms to minimize.
[2023-03-09 23:33:24] [INFO ] Deduced a trap composed of 126 places in 280 ms of which 1 ms to minimize.
[2023-03-09 23:33:24] [INFO ] Deduced a trap composed of 187 places in 328 ms of which 2 ms to minimize.
[2023-03-09 23:33:24] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 0 ms to minimize.
[2023-03-09 23:33:25] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 1 ms to minimize.
[2023-03-09 23:33:25] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:33:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2129 ms
[2023-03-09 23:33:29] [INFO ] Deduced a trap composed of 143 places in 289 ms of which 1 ms to minimize.
[2023-03-09 23:33:29] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 3 ms to minimize.
[2023-03-09 23:33:29] [INFO ] Deduced a trap composed of 201 places in 225 ms of which 0 ms to minimize.
[2023-03-09 23:33:30] [INFO ] Deduced a trap composed of 75 places in 223 ms of which 0 ms to minimize.
[2023-03-09 23:33:30] [INFO ] Deduced a trap composed of 186 places in 334 ms of which 1 ms to minimize.
[2023-03-09 23:33:30] [INFO ] Deduced a trap composed of 192 places in 237 ms of which 1 ms to minimize.
[2023-03-09 23:33:31] [INFO ] Deduced a trap composed of 199 places in 247 ms of which 1 ms to minimize.
[2023-03-09 23:33:31] [INFO ] Deduced a trap composed of 161 places in 332 ms of which 1 ms to minimize.
[2023-03-09 23:33:31] [INFO ] Deduced a trap composed of 153 places in 235 ms of which 1 ms to minimize.
[2023-03-09 23:33:32] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:33:32] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:33:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3307 ms
[2023-03-09 23:33:33] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 0 ms to minimize.
[2023-03-09 23:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-09 23:33:34] [INFO ] Deduced a trap composed of 200 places in 322 ms of which 1 ms to minimize.
[2023-03-09 23:33:35] [INFO ] Deduced a trap composed of 191 places in 318 ms of which 3 ms to minimize.
[2023-03-09 23:33:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 761 ms
[2023-03-09 23:33:35] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 4 ms to minimize.
[2023-03-09 23:33:35] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2023-03-09 23:33:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2023-03-09 23:33:36] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 1 ms to minimize.
[2023-03-09 23:33:36] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 0 ms to minimize.
[2023-03-09 23:33:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-09 23:33:37] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 1 ms to minimize.
[2023-03-09 23:33:37] [INFO ] Deduced a trap composed of 152 places in 228 ms of which 2 ms to minimize.
[2023-03-09 23:33:38] [INFO ] Deduced a trap composed of 184 places in 194 ms of which 0 ms to minimize.
[2023-03-09 23:33:38] [INFO ] Deduced a trap composed of 184 places in 226 ms of which 1 ms to minimize.
[2023-03-09 23:33:38] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:33:38] [INFO ] Deduced a trap composed of 185 places in 224 ms of which 1 ms to minimize.
[2023-03-09 23:33:39] [INFO ] Deduced a trap composed of 121 places in 229 ms of which 1 ms to minimize.
[2023-03-09 23:33:39] [INFO ] Deduced a trap composed of 195 places in 215 ms of which 0 ms to minimize.
[2023-03-09 23:33:39] [INFO ] Deduced a trap composed of 199 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:33:39] [INFO ] Deduced a trap composed of 193 places in 223 ms of which 1 ms to minimize.
[2023-03-09 23:33:40] [INFO ] Deduced a trap composed of 70 places in 226 ms of which 1 ms to minimize.
[2023-03-09 23:33:40] [INFO ] Deduced a trap composed of 195 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:33:40] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 5 ms to minimize.
[2023-03-09 23:33:40] [INFO ] Deduced a trap composed of 212 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:33:41] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:33:41] [INFO ] Deduced a trap composed of 144 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:33:41] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:33:41] [INFO ] Deduced a trap composed of 167 places in 200 ms of which 2 ms to minimize.
[2023-03-09 23:33:42] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:33:42] [INFO ] Deduced a trap composed of 135 places in 302 ms of which 1 ms to minimize.
[2023-03-09 23:33:42] [INFO ] Deduced a trap composed of 192 places in 288 ms of which 2 ms to minimize.
[2023-03-09 23:33:43] [INFO ] Deduced a trap composed of 128 places in 282 ms of which 0 ms to minimize.
[2023-03-09 23:33:43] [INFO ] Deduced a trap composed of 193 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:33:43] [INFO ] Deduced a trap composed of 155 places in 234 ms of which 1 ms to minimize.
[2023-03-09 23:33:44] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:33:44] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 2 ms to minimize.
[2023-03-09 23:33:44] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2023-03-09 23:33:44] [INFO ] Deduced a trap composed of 176 places in 319 ms of which 4 ms to minimize.
[2023-03-09 23:33:45] [INFO ] Deduced a trap composed of 197 places in 271 ms of which 1 ms to minimize.
[2023-03-09 23:33:45] [INFO ] Deduced a trap composed of 191 places in 294 ms of which 4 ms to minimize.
[2023-03-09 23:33:45] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 5 ms to minimize.
[2023-03-09 23:33:46] [INFO ] Deduced a trap composed of 141 places in 267 ms of which 2 ms to minimize.
[2023-03-09 23:33:46] [INFO ] Deduced a trap composed of 136 places in 250 ms of which 1 ms to minimize.
[2023-03-09 23:33:46] [INFO ] Deduced a trap composed of 191 places in 245 ms of which 0 ms to minimize.
[2023-03-09 23:33:47] [INFO ] Deduced a trap composed of 184 places in 250 ms of which 1 ms to minimize.
[2023-03-09 23:33:47] [INFO ] Deduced a trap composed of 130 places in 227 ms of which 0 ms to minimize.
[2023-03-09 23:33:47] [INFO ] Deduced a trap composed of 201 places in 227 ms of which 1 ms to minimize.
[2023-03-09 23:33:47] [INFO ] Deduced a trap composed of 127 places in 236 ms of which 0 ms to minimize.
[2023-03-09 23:33:48] [INFO ] Deduced a trap composed of 180 places in 241 ms of which 1 ms to minimize.
[2023-03-09 23:33:48] [INFO ] Deduced a trap composed of 213 places in 239 ms of which 0 ms to minimize.
[2023-03-09 23:33:48] [INFO ] Deduced a trap composed of 194 places in 234 ms of which 1 ms to minimize.
[2023-03-09 23:33:49] [INFO ] Deduced a trap composed of 215 places in 213 ms of which 0 ms to minimize.
[2023-03-09 23:33:49] [INFO ] Deduced a trap composed of 62 places in 241 ms of which 0 ms to minimize.
[2023-03-09 23:33:49] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:33:50] [INFO ] Deduced a trap composed of 163 places in 245 ms of which 1 ms to minimize.
[2023-03-09 23:33:50] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 1 ms to minimize.
[2023-03-09 23:33:50] [INFO ] Deduced a trap composed of 197 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:33:50] [INFO ] Deduced a trap composed of 152 places in 237 ms of which 1 ms to minimize.
[2023-03-09 23:33:51] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 1 ms to minimize.
[2023-03-09 23:33:51] [INFO ] Deduced a trap composed of 204 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:33:51] [INFO ] Deduced a trap composed of 208 places in 248 ms of which 0 ms to minimize.
[2023-03-09 23:33:51] [INFO ] Deduced a trap composed of 150 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:33:52] [INFO ] Deduced a trap composed of 184 places in 225 ms of which 1 ms to minimize.
[2023-03-09 23:33:52] [INFO ] Deduced a trap composed of 150 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:33:52] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 1 ms to minimize.
[2023-03-09 23:33:52] [INFO ] Deduced a trap composed of 176 places in 231 ms of which 0 ms to minimize.
[2023-03-09 23:33:53] [INFO ] Deduced a trap composed of 211 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:33:53] [INFO ] Deduced a trap composed of 127 places in 216 ms of which 0 ms to minimize.
[2023-03-09 23:33:53] [INFO ] Deduced a trap composed of 199 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:33:53] [INFO ] Deduced a trap composed of 192 places in 228 ms of which 0 ms to minimize.
[2023-03-09 23:33:54] [INFO ] Deduced a trap composed of 194 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:33:54] [INFO ] Deduced a trap composed of 187 places in 311 ms of which 1 ms to minimize.
[2023-03-09 23:33:54] [INFO ] Deduced a trap composed of 183 places in 282 ms of which 0 ms to minimize.
[2023-03-09 23:33:55] [INFO ] Deduced a trap composed of 132 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:33:55] [INFO ] Deduced a trap composed of 206 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:33:55] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:33:55] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 0 ms to minimize.
[2023-03-09 23:33:55] [INFO ] Deduced a trap composed of 207 places in 232 ms of which 1 ms to minimize.
[2023-03-09 23:33:56] [INFO ] Deduced a trap composed of 186 places in 234 ms of which 0 ms to minimize.
[2023-03-09 23:33:56] [INFO ] Deduced a trap composed of 145 places in 223 ms of which 12 ms to minimize.
[2023-03-09 23:33:56] [INFO ] Deduced a trap composed of 199 places in 181 ms of which 1 ms to minimize.
[2023-03-09 23:33:57] [INFO ] Deduced a trap composed of 159 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:33:57] [INFO ] Deduced a trap composed of 213 places in 329 ms of which 1 ms to minimize.
[2023-03-09 23:33:57] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 0 ms to minimize.
[2023-03-09 23:33:58] [INFO ] Deduced a trap composed of 212 places in 219 ms of which 0 ms to minimize.
[2023-03-09 23:33:58] [INFO ] Deduced a trap composed of 209 places in 205 ms of which 0 ms to minimize.
[2023-03-09 23:33:58] [INFO ] Deduced a trap composed of 200 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:33:58] [INFO ] Deduced a trap composed of 203 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:33:58] [INFO ] Deduced a trap composed of 128 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:33:59] [INFO ] Deduced a trap composed of 135 places in 224 ms of which 0 ms to minimize.
[2023-03-09 23:33:59] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:33:59] [INFO ] Deduced a trap composed of 223 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:33:59] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:00] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:00] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:34:00] [INFO ] Deduced a trap composed of 197 places in 200 ms of which 1 ms to minimize.
[2023-03-09 23:34:00] [INFO ] Deduced a trap composed of 149 places in 198 ms of which 0 ms to minimize.
[2023-03-09 23:34:01] [INFO ] Deduced a trap composed of 205 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:34:01] [INFO ] Deduced a trap composed of 203 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:34:01] [INFO ] Deduced a trap composed of 198 places in 206 ms of which 0 ms to minimize.
[2023-03-09 23:34:01] [INFO ] Deduced a trap composed of 221 places in 222 ms of which 0 ms to minimize.
[2023-03-09 23:34:02] [INFO ] Deduced a trap composed of 220 places in 191 ms of which 0 ms to minimize.
[2023-03-09 23:34:02] [INFO ] Deduced a trap composed of 216 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:34:02] [INFO ] Deduced a trap composed of 209 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:34:02] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:02] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:03] [INFO ] Deduced a trap composed of 189 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:34:03] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 1 ms to minimize.
[2023-03-09 23:34:03] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:34:04] [INFO ] Deduced a trap composed of 129 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:04] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 1 ms to minimize.
[2023-03-09 23:34:05] [INFO ] Deduced a trap composed of 182 places in 171 ms of which 0 ms to minimize.
[2023-03-09 23:34:05] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:05] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:34:05] [INFO ] Trap strengthening (SAT) tested/added 105/104 trap constraints in 28427 ms
[2023-03-09 23:34:06] [INFO ] Deduced a trap composed of 128 places in 229 ms of which 2 ms to minimize.
[2023-03-09 23:34:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 649 ms
[2023-03-09 23:34:09] [INFO ] Deduced a trap composed of 172 places in 235 ms of which 1 ms to minimize.
[2023-03-09 23:34:09] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 1 ms to minimize.
[2023-03-09 23:34:09] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:34:09] [INFO ] Deduced a trap composed of 157 places in 222 ms of which 0 ms to minimize.
[2023-03-09 23:34:10] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:34:10] [INFO ] Deduced a trap composed of 144 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:10] [INFO ] Deduced a trap composed of 188 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:10] [INFO ] Deduced a trap composed of 148 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:34:11] [INFO ] Deduced a trap composed of 198 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:11] [INFO ] Deduced a trap composed of 204 places in 194 ms of which 0 ms to minimize.
[2023-03-09 23:34:11] [INFO ] Deduced a trap composed of 189 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:34:11] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-09 23:34:12] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 1 ms to minimize.
[2023-03-09 23:34:12] [INFO ] Deduced a trap composed of 227 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:12] [INFO ] Deduced a trap composed of 177 places in 225 ms of which 0 ms to minimize.
[2023-03-09 23:34:12] [INFO ] Deduced a trap composed of 204 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:34:12] [INFO ] Deduced a trap composed of 175 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:34:13] [INFO ] Deduced a trap composed of 228 places in 190 ms of which 0 ms to minimize.
[2023-03-09 23:34:13] [INFO ] Deduced a trap composed of 223 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:13] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 0 ms to minimize.
[2023-03-09 23:34:13] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 0 ms to minimize.
[2023-03-09 23:34:14] [INFO ] Deduced a trap composed of 149 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:34:14] [INFO ] Deduced a trap composed of 147 places in 216 ms of which 0 ms to minimize.
[2023-03-09 23:34:14] [INFO ] Deduced a trap composed of 223 places in 223 ms of which 1 ms to minimize.
[2023-03-09 23:34:14] [INFO ] Deduced a trap composed of 219 places in 216 ms of which 0 ms to minimize.
[2023-03-09 23:34:15] [INFO ] Deduced a trap composed of 212 places in 185 ms of which 1 ms to minimize.
[2023-03-09 23:34:15] [INFO ] Deduced a trap composed of 219 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:34:15] [INFO ] Deduced a trap composed of 219 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:15] [INFO ] Deduced a trap composed of 227 places in 246 ms of which 1 ms to minimize.
[2023-03-09 23:34:16] [INFO ] Deduced a trap composed of 218 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:34:16] [INFO ] Deduced a trap composed of 222 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:34:16] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:34:16] [INFO ] Deduced a trap composed of 223 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:34:17] [INFO ] Deduced a trap composed of 163 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:34:17] [INFO ] Deduced a trap composed of 185 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:34:17] [INFO ] Deduced a trap composed of 200 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:34:17] [INFO ] Deduced a trap composed of 202 places in 200 ms of which 1 ms to minimize.
[2023-03-09 23:34:18] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2023-03-09 23:34:18] [INFO ] Deduced a trap composed of 181 places in 306 ms of which 1 ms to minimize.
[2023-03-09 23:34:18] [INFO ] Deduced a trap composed of 204 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:34:18] [INFO ] Deduced a trap composed of 199 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:34:19] [INFO ] Deduced a trap composed of 187 places in 240 ms of which 1 ms to minimize.
[2023-03-09 23:34:19] [INFO ] Deduced a trap composed of 186 places in 221 ms of which 1 ms to minimize.
[2023-03-09 23:34:19] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 0 ms to minimize.
[2023-03-09 23:34:19] [INFO ] Deduced a trap composed of 230 places in 190 ms of which 1 ms to minimize.
[2023-03-09 23:34:20] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:34:20] [INFO ] Deduced a trap composed of 214 places in 226 ms of which 1 ms to minimize.
[2023-03-09 23:34:20] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 1 ms to minimize.
[2023-03-09 23:34:20] [INFO ] Deduced a trap composed of 216 places in 200 ms of which 1 ms to minimize.
[2023-03-09 23:34:21] [INFO ] Deduced a trap composed of 194 places in 187 ms of which 0 ms to minimize.
[2023-03-09 23:34:21] [INFO ] Deduced a trap composed of 193 places in 229 ms of which 1 ms to minimize.
[2023-03-09 23:34:21] [INFO ] Deduced a trap composed of 194 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:34:21] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:22] [INFO ] Deduced a trap composed of 181 places in 221 ms of which 2 ms to minimize.
[2023-03-09 23:34:22] [INFO ] Deduced a trap composed of 177 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:34:22] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 1 ms to minimize.
[2023-03-09 23:34:23] [INFO ] Deduced a trap composed of 191 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:34:23] [INFO ] Deduced a trap composed of 180 places in 269 ms of which 0 ms to minimize.
[2023-03-09 23:34:23] [INFO ] Deduced a trap composed of 203 places in 321 ms of which 1 ms to minimize.
[2023-03-09 23:34:23] [INFO ] Deduced a trap composed of 227 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:34:24] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:34:24] [INFO ] Deduced a trap composed of 221 places in 252 ms of which 1 ms to minimize.
[2023-03-09 23:34:24] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 1 ms to minimize.
[2023-03-09 23:34:24] [INFO ] Deduced a trap composed of 219 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:34:25] [INFO ] Deduced a trap composed of 217 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:34:25] [INFO ] Deduced a trap composed of 222 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:34:25] [INFO ] Deduced a trap composed of 212 places in 178 ms of which 1 ms to minimize.
[2023-03-09 23:34:25] [INFO ] Deduced a trap composed of 225 places in 199 ms of which 0 ms to minimize.
[2023-03-09 23:34:26] [INFO ] Deduced a trap composed of 205 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:34:26] [INFO ] Deduced a trap composed of 200 places in 172 ms of which 0 ms to minimize.
[2023-03-09 23:34:26] [INFO ] Deduced a trap composed of 186 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:34:27] [INFO ] Deduced a trap composed of 204 places in 194 ms of which 0 ms to minimize.
[2023-03-09 23:34:27] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:34:27] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:34:27] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 1 ms to minimize.
[2023-03-09 23:34:28] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:34:28] [INFO ] Deduced a trap composed of 206 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:34:28] [INFO ] Deduced a trap composed of 209 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:34:28] [INFO ] Deduced a trap composed of 189 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:29] [INFO ] Deduced a trap composed of 180 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:34:29] [INFO ] Deduced a trap composed of 152 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:34:29] [INFO ] Deduced a trap composed of 148 places in 221 ms of which 1 ms to minimize.
[2023-03-09 23:34:29] [INFO ] Deduced a trap composed of 207 places in 225 ms of which 0 ms to minimize.
[2023-03-09 23:34:30] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:34:30] [INFO ] Deduced a trap composed of 223 places in 219 ms of which 0 ms to minimize.
[2023-03-09 23:34:30] [INFO ] Deduced a trap composed of 181 places in 236 ms of which 0 ms to minimize.
[2023-03-09 23:34:30] [INFO ] Deduced a trap composed of 186 places in 225 ms of which 0 ms to minimize.
[2023-03-09 23:34:31] [INFO ] Deduced a trap composed of 213 places in 193 ms of which 0 ms to minimize.
[2023-03-09 23:34:31] [INFO ] Deduced a trap composed of 202 places in 203 ms of which 2 ms to minimize.
[2023-03-09 23:34:31] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:31] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:34:32] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:34:32] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 0 ms to minimize.
[2023-03-09 23:34:32] [INFO ] Deduced a trap composed of 233 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:34:32] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 0 ms to minimize.
[2023-03-09 23:34:32] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:34:33] [INFO ] Deduced a trap composed of 184 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:34:33] [INFO ] Deduced a trap composed of 189 places in 209 ms of which 0 ms to minimize.
[2023-03-09 23:34:33] [INFO ] Deduced a trap composed of 200 places in 198 ms of which 0 ms to minimize.
[2023-03-09 23:34:33] [INFO ] Deduced a trap composed of 209 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:34:34] [INFO ] Deduced a trap composed of 202 places in 207 ms of which 0 ms to minimize.
[2023-03-09 23:34:34] [INFO ] Deduced a trap composed of 199 places in 212 ms of which 2 ms to minimize.
[2023-03-09 23:34:34] [INFO ] Deduced a trap composed of 193 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:34:34] [INFO ] Deduced a trap composed of 196 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:35] [INFO ] Deduced a trap composed of 211 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:34:35] [INFO ] Deduced a trap composed of 220 places in 212 ms of which 2 ms to minimize.
[2023-03-09 23:34:35] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-09 23:34:35] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 1 ms to minimize.
[2023-03-09 23:34:36] [INFO ] Deduced a trap composed of 181 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:34:36] [INFO ] Deduced a trap composed of 148 places in 191 ms of which 1 ms to minimize.
[2023-03-09 23:34:36] [INFO ] Deduced a trap composed of 205 places in 198 ms of which 1 ms to minimize.
[2023-03-09 23:34:36] [INFO ] Deduced a trap composed of 184 places in 206 ms of which 4 ms to minimize.
[2023-03-09 23:34:37] [INFO ] Deduced a trap composed of 186 places in 212 ms of which 2 ms to minimize.
[2023-03-09 23:34:37] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:34:37] [INFO ] Deduced a trap composed of 207 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:34:37] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 0 ms to minimize.
[2023-03-09 23:34:38] [INFO ] Deduced a trap composed of 179 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:38] [INFO ] Deduced a trap composed of 220 places in 274 ms of which 1 ms to minimize.
[2023-03-09 23:34:38] [INFO ] Deduced a trap composed of 169 places in 298 ms of which 1 ms to minimize.
[2023-03-09 23:34:38] [INFO ] Deduced a trap composed of 190 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:39] [INFO ] Deduced a trap composed of 190 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:39] [INFO ] Deduced a trap composed of 191 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:34:39] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:34:40] [INFO ] Deduced a trap composed of 186 places in 210 ms of which 0 ms to minimize.
[2023-03-09 23:34:40] [INFO ] Deduced a trap composed of 194 places in 214 ms of which 0 ms to minimize.
[2023-03-09 23:34:40] [INFO ] Deduced a trap composed of 202 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:34:40] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:34:41] [INFO ] Deduced a trap composed of 215 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:41] [INFO ] Deduced a trap composed of 232 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:34:41] [INFO ] Deduced a trap composed of 228 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:34:41] [INFO ] Deduced a trap composed of 203 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:34:41] [INFO ] Deduced a trap composed of 214 places in 205 ms of which 0 ms to minimize.
[2023-03-09 23:34:42] [INFO ] Deduced a trap composed of 195 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:34:42] [INFO ] Deduced a trap composed of 199 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:34:42] [INFO ] Deduced a trap composed of 184 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:34:42] [INFO ] Deduced a trap composed of 202 places in 172 ms of which 1 ms to minimize.
[2023-03-09 23:34:43] [INFO ] Deduced a trap composed of 209 places in 217 ms of which 1 ms to minimize.
[2023-03-09 23:34:43] [INFO ] Deduced a trap composed of 153 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:34:43] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2023-03-09 23:34:44] [INFO ] Deduced a trap composed of 150 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:34:44] [INFO ] Deduced a trap composed of 149 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:34:44] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 1 ms to minimize.
[2023-03-09 23:34:44] [INFO ] Deduced a trap composed of 198 places in 217 ms of which 1 ms to minimize.
[2023-03-09 23:34:45] [INFO ] Deduced a trap composed of 199 places in 217 ms of which 1 ms to minimize.
[2023-03-09 23:34:45] [INFO ] Deduced a trap composed of 188 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:34:45] [INFO ] Deduced a trap composed of 209 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:34:45] [INFO ] Deduced a trap composed of 185 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:34:46] [INFO ] Deduced a trap composed of 195 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:34:46] [INFO ] Deduced a trap composed of 212 places in 181 ms of which 0 ms to minimize.
[2023-03-09 23:34:46] [INFO ] Deduced a trap composed of 206 places in 196 ms of which 0 ms to minimize.
[2023-03-09 23:34:46] [INFO ] Deduced a trap composed of 192 places in 189 ms of which 1 ms to minimize.
[2023-03-09 23:34:47] [INFO ] Deduced a trap composed of 174 places in 215 ms of which 0 ms to minimize.
[2023-03-09 23:34:47] [INFO ] Deduced a trap composed of 177 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:47] [INFO ] Deduced a trap composed of 184 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:34:47] [INFO ] Deduced a trap composed of 140 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:34:48] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:34:48] [INFO ] Deduced a trap composed of 145 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:48] [INFO ] Deduced a trap composed of 150 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:34:48] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2023-03-09 23:34:49] [INFO ] Deduced a trap composed of 201 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:34:49] [INFO ] Deduced a trap composed of 191 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:34:49] [INFO ] Deduced a trap composed of 215 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:34:49] [INFO ] Deduced a trap composed of 220 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:34:50] [INFO ] Deduced a trap composed of 214 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:34:50] [INFO ] Deduced a trap composed of 218 places in 208 ms of which 0 ms to minimize.
[2023-03-09 23:34:50] [INFO ] Deduced a trap composed of 204 places in 177 ms of which 1 ms to minimize.
[2023-03-09 23:34:50] [INFO ] Deduced a trap composed of 201 places in 200 ms of which 0 ms to minimize.
[2023-03-09 23:34:51] [INFO ] Deduced a trap composed of 196 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:34:51] [INFO ] Deduced a trap composed of 219 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:34:51] [INFO ] Deduced a trap composed of 211 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:34:51] [INFO ] Deduced a trap composed of 197 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:34:51] [INFO ] Deduced a trap composed of 224 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:34:52] [INFO ] Deduced a trap composed of 215 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:52] [INFO ] Deduced a trap composed of 225 places in 187 ms of which 0 ms to minimize.
[2023-03-09 23:34:52] [INFO ] Deduced a trap composed of 216 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:34:52] [INFO ] Deduced a trap composed of 233 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:34:53] [INFO ] Deduced a trap composed of 199 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:34:53] [INFO ] Deduced a trap composed of 213 places in 188 ms of which 1 ms to minimize.
[2023-03-09 23:34:53] [INFO ] Deduced a trap composed of 208 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:34:53] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:54] [INFO ] Deduced a trap composed of 203 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:34:54] [INFO ] Deduced a trap composed of 223 places in 228 ms of which 0 ms to minimize.
[2023-03-09 23:34:54] [INFO ] Deduced a trap composed of 205 places in 215 ms of which 0 ms to minimize.
[2023-03-09 23:34:54] [INFO ] Deduced a trap composed of 224 places in 185 ms of which 0 ms to minimize.
[2023-03-09 23:34:55] [INFO ] Deduced a trap composed of 183 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:34:55] [INFO ] Deduced a trap composed of 196 places in 206 ms of which 0 ms to minimize.
[2023-03-09 23:34:55] [INFO ] Deduced a trap composed of 188 places in 216 ms of which 0 ms to minimize.
[2023-03-09 23:34:55] [INFO ] Deduced a trap composed of 205 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:34:56] [INFO ] Deduced a trap composed of 201 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:56] [INFO ] Deduced a trap composed of 223 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:34:56] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:34:56] [INFO ] Deduced a trap composed of 204 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:34:57] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:34:57] [INFO ] Deduced a trap composed of 217 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:34:57] [INFO ] Deduced a trap composed of 213 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:34:57] [INFO ] Deduced a trap composed of 220 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:34:58] [INFO ] Deduced a trap composed of 177 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:34:58] [INFO ] Deduced a trap composed of 149 places in 205 ms of which 0 ms to minimize.
[2023-03-09 23:34:58] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 1 ms to minimize.
[2023-03-09 23:34:59] [INFO ] Deduced a trap composed of 180 places in 190 ms of which 1 ms to minimize.
[2023-03-09 23:34:59] [INFO ] Deduced a trap composed of 195 places in 195 ms of which 0 ms to minimize.
[2023-03-09 23:34:59] [INFO ] Deduced a trap composed of 144 places in 195 ms of which 0 ms to minimize.
[2023-03-09 23:35:01] [INFO ] Deduced a trap composed of 203 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:35:02] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:35:02] [INFO ] Deduced a trap composed of 216 places in 185 ms of which 1 ms to minimize.
[2023-03-09 23:35:02] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:35:02] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:35:02] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 0 ms to minimize.
[2023-03-09 23:35:03] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 1 ms to minimize.
[2023-03-09 23:35:03] [INFO ] Deduced a trap composed of 206 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:35:03] [INFO ] Deduced a trap composed of 182 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:35:03] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 1 ms to minimize.
[2023-03-09 23:35:04] [INFO ] Deduced a trap composed of 163 places in 184 ms of which 0 ms to minimize.
[2023-03-09 23:35:04] [INFO ] Deduced a trap composed of 225 places in 190 ms of which 0 ms to minimize.
[2023-03-09 23:35:04] [INFO ] Deduced a trap composed of 184 places in 189 ms of which 1 ms to minimize.
[2023-03-09 23:35:04] [INFO ] Deduced a trap composed of 213 places in 193 ms of which 0 ms to minimize.
[2023-03-09 23:35:05] [INFO ] Deduced a trap composed of 206 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:35:05] [INFO ] Deduced a trap composed of 230 places in 198 ms of which 1 ms to minimize.
[2023-03-09 23:35:05] [INFO ] Deduced a trap composed of 236 places in 189 ms of which 1 ms to minimize.
[2023-03-09 23:35:05] [INFO ] Deduced a trap composed of 195 places in 188 ms of which 1 ms to minimize.
[2023-03-09 23:35:06] [INFO ] Deduced a trap composed of 176 places in 186 ms of which 1 ms to minimize.
[2023-03-09 23:35:07] [INFO ] Deduced a trap composed of 202 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:35:07] [INFO ] Deduced a trap composed of 206 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:35:07] [INFO ] Deduced a trap composed of 208 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:35:08] [INFO ] Deduced a trap composed of 207 places in 322 ms of which 1 ms to minimize.
[2023-03-09 23:35:08] [INFO ] Deduced a trap composed of 209 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:35:08] [INFO ] Deduced a trap composed of 210 places in 363 ms of which 1 ms to minimize.
[2023-03-09 23:35:09] [INFO ] Deduced a trap composed of 87 places in 352 ms of which 1 ms to minimize.
[2023-03-09 23:35:09] [INFO ] Deduced a trap composed of 144 places in 341 ms of which 1 ms to minimize.
[2023-03-09 23:35:10] [INFO ] Deduced a trap composed of 216 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:35:10] [INFO ] Deduced a trap composed of 191 places in 343 ms of which 2 ms to minimize.
[2023-03-09 23:35:11] [INFO ] Deduced a trap composed of 169 places in 344 ms of which 1 ms to minimize.
[2023-03-09 23:35:11] [INFO ] Deduced a trap composed of 171 places in 375 ms of which 1 ms to minimize.
[2023-03-09 23:35:11] [INFO ] Deduced a trap composed of 147 places in 356 ms of which 2 ms to minimize.
[2023-03-09 23:35:12] [INFO ] Deduced a trap composed of 149 places in 283 ms of which 1 ms to minimize.
[2023-03-09 23:35:12] [INFO ] Deduced a trap composed of 210 places in 331 ms of which 1 ms to minimize.
[2023-03-09 23:35:13] [INFO ] Deduced a trap composed of 193 places in 354 ms of which 1 ms to minimize.
[2023-03-09 23:35:13] [INFO ] Deduced a trap composed of 220 places in 330 ms of which 1 ms to minimize.
[2023-03-09 23:35:13] [INFO ] Deduced a trap composed of 186 places in 311 ms of which 1 ms to minimize.
[2023-03-09 23:35:14] [INFO ] Deduced a trap composed of 210 places in 373 ms of which 1 ms to minimize.
[2023-03-09 23:35:14] [INFO ] Deduced a trap composed of 157 places in 343 ms of which 1 ms to minimize.
[2023-03-09 23:35:15] [INFO ] Deduced a trap composed of 210 places in 347 ms of which 1 ms to minimize.
[2023-03-09 23:35:15] [INFO ] Deduced a trap composed of 193 places in 346 ms of which 1 ms to minimize.
[2023-03-09 23:35:16] [INFO ] Deduced a trap composed of 184 places in 368 ms of which 1 ms to minimize.
[2023-03-09 23:35:16] [INFO ] Deduced a trap composed of 154 places in 358 ms of which 2 ms to minimize.
[2023-03-09 23:35:16] [INFO ] Deduced a trap composed of 175 places in 355 ms of which 1 ms to minimize.
[2023-03-09 23:35:17] [INFO ] Deduced a trap composed of 206 places in 285 ms of which 1 ms to minimize.
[2023-03-09 23:35:17] [INFO ] Deduced a trap composed of 193 places in 344 ms of which 1 ms to minimize.
[2023-03-09 23:35:18] [INFO ] Deduced a trap composed of 203 places in 344 ms of which 1 ms to minimize.
[2023-03-09 23:35:18] [INFO ] Deduced a trap composed of 217 places in 349 ms of which 1 ms to minimize.
[2023-03-09 23:35:18] [INFO ] Deduced a trap composed of 203 places in 341 ms of which 1 ms to minimize.
[2023-03-09 23:35:19] [INFO ] Deduced a trap composed of 198 places in 356 ms of which 1 ms to minimize.
[2023-03-09 23:35:19] [INFO ] Deduced a trap composed of 173 places in 338 ms of which 1 ms to minimize.
[2023-03-09 23:35:20] [INFO ] Deduced a trap composed of 156 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:35:20] [INFO ] Deduced a trap composed of 198 places in 334 ms of which 1 ms to minimize.
[2023-03-09 23:35:21] [INFO ] Deduced a trap composed of 102 places in 332 ms of which 1 ms to minimize.
[2023-03-09 23:35:21] [INFO ] Deduced a trap composed of 112 places in 342 ms of which 1 ms to minimize.
[2023-03-09 23:35:22] [INFO ] Deduced a trap composed of 194 places in 337 ms of which 1 ms to minimize.
[2023-03-09 23:35:22] [INFO ] Deduced a trap composed of 192 places in 342 ms of which 1 ms to minimize.
[2023-03-09 23:35:23] [INFO ] Deduced a trap composed of 224 places in 343 ms of which 1 ms to minimize.
[2023-03-09 23:35:23] [INFO ] Deduced a trap composed of 106 places in 347 ms of which 2 ms to minimize.
[2023-03-09 23:35:24] [INFO ] Deduced a trap composed of 145 places in 334 ms of which 1 ms to minimize.
[2023-03-09 23:35:24] [INFO ] Deduced a trap composed of 206 places in 336 ms of which 1 ms to minimize.
[2023-03-09 23:35:25] [INFO ] Deduced a trap composed of 148 places in 333 ms of which 1 ms to minimize.
[2023-03-09 23:35:25] [INFO ] Deduced a trap composed of 220 places in 352 ms of which 1 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Deduced a trap composed of 108 places in 323 ms of which 1 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 1 ms to minimize.
[2023-03-09 23:35:26] [INFO ] Deduced a trap composed of 203 places in 337 ms of which 1 ms to minimize.
[2023-03-09 23:35:27] [INFO ] Deduced a trap composed of 221 places in 346 ms of which 1 ms to minimize.
[2023-03-09 23:35:27] [INFO ] Deduced a trap composed of 222 places in 337 ms of which 1 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 207 places in 349 ms of which 1 ms to minimize.
[2023-03-09 23:35:28] [INFO ] Deduced a trap composed of 231 places in 340 ms of which 1 ms to minimize.
[2023-03-09 23:35:29] [INFO ] Deduced a trap composed of 212 places in 346 ms of which 1 ms to minimize.
[2023-03-09 23:35:29] [INFO ] Deduced a trap composed of 244 places in 340 ms of which 1 ms to minimize.
[2023-03-09 23:35:29] [INFO ] Deduced a trap composed of 222 places in 347 ms of which 1 ms to minimize.
[2023-03-09 23:35:30] [INFO ] Deduced a trap composed of 161 places in 355 ms of which 1 ms to minimize.
[2023-03-09 23:35:30] [INFO ] Deduced a trap composed of 218 places in 333 ms of which 1 ms to minimize.
[2023-03-09 23:35:31] [INFO ] Deduced a trap composed of 226 places in 348 ms of which 1 ms to minimize.
[2023-03-09 23:35:31] [INFO ] Deduced a trap composed of 186 places in 341 ms of which 1 ms to minimize.
[2023-03-09 23:35:32] [INFO ] Deduced a trap composed of 149 places in 335 ms of which 1 ms to minimize.
[2023-03-09 23:35:33] [INFO ] Deduced a trap composed of 211 places in 345 ms of which 1 ms to minimize.
[2023-03-09 23:35:33] [INFO ] Deduced a trap composed of 207 places in 324 ms of which 1 ms to minimize.
[2023-03-09 23:35:33] [INFO ] Deduced a trap composed of 143 places in 317 ms of which 1 ms to minimize.
[2023-03-09 23:35:34] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 1 ms to minimize.
[2023-03-09 23:35:34] [INFO ] Deduced a trap composed of 157 places in 315 ms of which 1 ms to minimize.
[2023-03-09 23:35:35] [INFO ] Deduced a trap composed of 190 places in 298 ms of which 1 ms to minimize.
[2023-03-09 23:35:35] [INFO ] Deduced a trap composed of 199 places in 292 ms of which 1 ms to minimize.
[2023-03-09 23:35:36] [INFO ] Deduced a trap composed of 157 places in 293 ms of which 1 ms to minimize.
[2023-03-09 23:35:36] [INFO ] Deduced a trap composed of 222 places in 330 ms of which 1 ms to minimize.
[2023-03-09 23:35:36] [INFO ] Deduced a trap composed of 248 places in 324 ms of which 1 ms to minimize.
[2023-03-09 23:35:37] [INFO ] Deduced a trap composed of 208 places in 336 ms of which 1 ms to minimize.
[2023-03-09 23:35:37] [INFO ] Deduced a trap composed of 169 places in 305 ms of which 1 ms to minimize.
[2023-03-09 23:35:38] [INFO ] Deduced a trap composed of 206 places in 287 ms of which 0 ms to minimize.
[2023-03-09 23:35:38] [INFO ] Deduced a trap composed of 219 places in 276 ms of which 0 ms to minimize.
[2023-03-09 23:35:38] [INFO ] Deduced a trap composed of 225 places in 259 ms of which 0 ms to minimize.
[2023-03-09 23:35:39] [INFO ] Deduced a trap composed of 251 places in 282 ms of which 1 ms to minimize.
[2023-03-09 23:35:39] [INFO ] Deduced a trap composed of 218 places in 304 ms of which 0 ms to minimize.
[2023-03-09 23:35:40] [INFO ] Deduced a trap composed of 184 places in 292 ms of which 1 ms to minimize.
[2023-03-09 23:35:40] [INFO ] Deduced a trap composed of 222 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:35:40] [INFO ] Deduced a trap composed of 230 places in 334 ms of which 1 ms to minimize.
[2023-03-09 23:35:41] [INFO ] Deduced a trap composed of 231 places in 325 ms of which 1 ms to minimize.
[2023-03-09 23:35:41] [INFO ] Deduced a trap composed of 158 places in 322 ms of which 1 ms to minimize.
[2023-03-09 23:35:42] [INFO ] Deduced a trap composed of 223 places in 354 ms of which 1 ms to minimize.
[2023-03-09 23:35:42] [INFO ] Deduced a trap composed of 235 places in 364 ms of which 3 ms to minimize.
[2023-03-09 23:35:42] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 1 ms to minimize.
[2023-03-09 23:35:43] [INFO ] Deduced a trap composed of 212 places in 359 ms of which 1 ms to minimize.
[2023-03-09 23:35:43] [INFO ] Deduced a trap composed of 249 places in 286 ms of which 0 ms to minimize.
[2023-03-09 23:35:43] [INFO ] Deduced a trap composed of 194 places in 166 ms of which 1 ms to minimize.
[2023-03-09 23:35:44] [INFO ] Deduced a trap composed of 211 places in 210 ms of which 3 ms to minimize.
[2023-03-09 23:35:44] [INFO ] Deduced a trap composed of 199 places in 330 ms of which 2 ms to minimize.
[2023-03-09 23:35:44] [INFO ] Deduced a trap composed of 223 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:35:45] [INFO ] Deduced a trap composed of 249 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:35:45] [INFO ] Deduced a trap composed of 225 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:35:45] [INFO ] Deduced a trap composed of 239 places in 194 ms of which 0 ms to minimize.
[2023-03-09 23:35:45] [INFO ] Deduced a trap composed of 211 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:35:46] [INFO ] Deduced a trap composed of 210 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:35:46] [INFO ] Deduced a trap composed of 193 places in 180 ms of which 0 ms to minimize.
[2023-03-09 23:35:46] [INFO ] Deduced a trap composed of 204 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:35:46] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 0 ms to minimize.
[2023-03-09 23:35:46] [INFO ] Deduced a trap composed of 213 places in 166 ms of which 0 ms to minimize.
[2023-03-09 23:35:47] [INFO ] Deduced a trap composed of 233 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:35:47] [INFO ] Deduced a trap composed of 226 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:35:47] [INFO ] Deduced a trap composed of 219 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:35:48] [INFO ] Deduced a trap composed of 220 places in 201 ms of which 0 ms to minimize.
[2023-03-09 23:35:48] [INFO ] Deduced a trap composed of 235 places in 214 ms of which 0 ms to minimize.
[2023-03-09 23:35:48] [INFO ] Deduced a trap composed of 253 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:35:48] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 0 ms to minimize.
[2023-03-09 23:35:49] [INFO ] Deduced a trap composed of 253 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:35:49] [INFO ] Deduced a trap composed of 231 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:35:49] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 1 ms to minimize.
[2023-03-09 23:35:49] [INFO ] Deduced a trap composed of 232 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:35:50] [INFO ] Deduced a trap composed of 230 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:35:50] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 0 ms to minimize.
[2023-03-09 23:35:50] [INFO ] Deduced a trap composed of 213 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:35:50] [INFO ] Deduced a trap composed of 103 places in 200 ms of which 1 ms to minimize.
[2023-03-09 23:35:51] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 0 ms to minimize.
[2023-03-09 23:35:51] [INFO ] Deduced a trap composed of 208 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:35:51] [INFO ] Deduced a trap composed of 119 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:35:52] [INFO ] Deduced a trap composed of 225 places in 217 ms of which 0 ms to minimize.
[2023-03-09 23:35:52] [INFO ] Deduced a trap composed of 225 places in 180 ms of which 1 ms to minimize.
[2023-03-09 23:35:52] [INFO ] Deduced a trap composed of 202 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:35:52] [INFO ] Deduced a trap composed of 211 places in 195 ms of which 0 ms to minimize.
[2023-03-09 23:35:52] [INFO ] Deduced a trap composed of 213 places in 195 ms of which 0 ms to minimize.
[2023-03-09 23:35:53] [INFO ] Deduced a trap composed of 197 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:35:53] [INFO ] Deduced a trap composed of 219 places in 187 ms of which 1 ms to minimize.
[2023-03-09 23:35:53] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 0 ms to minimize.
[2023-03-09 23:35:54] [INFO ] Deduced a trap composed of 119 places in 179 ms of which 1 ms to minimize.
[2023-03-09 23:35:54] [INFO ] Deduced a trap composed of 180 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:35:54] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 0 ms to minimize.
[2023-03-09 23:35:55] [INFO ] Deduced a trap composed of 197 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:35:55] [INFO ] Deduced a trap composed of 213 places in 221 ms of which 1 ms to minimize.
[2023-03-09 23:35:55] [INFO ] Deduced a trap composed of 199 places in 226 ms of which 0 ms to minimize.
[2023-03-09 23:35:55] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:35:56] [INFO ] Deduced a trap composed of 181 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:35:56] [INFO ] Deduced a trap composed of 169 places in 189 ms of which 1 ms to minimize.
[2023-03-09 23:35:56] [INFO ] Deduced a trap composed of 208 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:35:56] [INFO ] Deduced a trap composed of 209 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:35:57] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:35:57] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:35:57] [INFO ] Deduced a trap composed of 208 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:35:57] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:35:58] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-09 23:35:58] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:35:58] [INFO ] Deduced a trap composed of 195 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:35:59] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:35:59] [INFO ] Deduced a trap composed of 201 places in 182 ms of which 1 ms to minimize.
[2023-03-09 23:35:59] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 1 ms to minimize.
[2023-03-09 23:35:59] [INFO ] Deduced a trap composed of 234 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:36:00] [INFO ] Deduced a trap composed of 223 places in 215 ms of which 25 ms to minimize.
[2023-03-09 23:36:00] [INFO ] Deduced a trap composed of 167 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:36:01] [INFO ] Deduced a trap composed of 199 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:36:01] [INFO ] Deduced a trap composed of 198 places in 168 ms of which 1 ms to minimize.
[2023-03-09 23:36:01] [INFO ] Deduced a trap composed of 216 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:36:01] [INFO ] Deduced a trap composed of 105 places in 191 ms of which 1 ms to minimize.
[2023-03-09 23:36:02] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:36:02] [INFO ] Deduced a trap composed of 200 places in 182 ms of which 0 ms to minimize.
[2023-03-09 23:36:02] [INFO ] Deduced a trap composed of 201 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:36:02] [INFO ] Deduced a trap composed of 209 places in 183 ms of which 1 ms to minimize.
[2023-03-09 23:36:03] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 1 ms to minimize.
[2023-03-09 23:36:03] [INFO ] Deduced a trap composed of 195 places in 298 ms of which 1 ms to minimize.
[2023-03-09 23:36:03] [INFO ] Deduced a trap composed of 152 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:36:04] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:36:04] [INFO ] Deduced a trap composed of 187 places in 306 ms of which 1 ms to minimize.
[2023-03-09 23:36:04] [INFO ] Deduced a trap composed of 163 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:36:05] [INFO ] Deduced a trap composed of 208 places in 193 ms of which 0 ms to minimize.
[2023-03-09 23:36:05] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:36:05] [INFO ] Deduced a trap composed of 205 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:36:05] [INFO ] Deduced a trap composed of 209 places in 191 ms of which 0 ms to minimize.
[2023-03-09 23:36:06] [INFO ] Deduced a trap composed of 201 places in 204 ms of which 0 ms to minimize.
[2023-03-09 23:36:06] [INFO ] Deduced a trap composed of 233 places in 190 ms of which 1 ms to minimize.
[2023-03-09 23:36:06] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:36:06] [INFO ] Deduced a trap composed of 185 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:36:07] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 0 ms to minimize.
[2023-03-09 23:36:07] [INFO ] Deduced a trap composed of 170 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:36:08] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:36:08] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:36:08] [INFO ] Deduced a trap composed of 196 places in 179 ms of which 0 ms to minimize.
[2023-03-09 23:36:09] [INFO ] Deduced a trap composed of 194 places in 178 ms of which 1 ms to minimize.
[2023-03-09 23:36:09] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 0 ms to minimize.
[2023-03-09 23:36:09] [INFO ] Deduced a trap composed of 226 places in 200 ms of which 1 ms to minimize.
[2023-03-09 23:36:10] [INFO ] Deduced a trap composed of 191 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:36:10] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:36:10] [INFO ] Deduced a trap composed of 234 places in 200 ms of which 0 ms to minimize.
[2023-03-09 23:36:10] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:36:11] [INFO ] Deduced a trap composed of 214 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:36:12] [INFO ] Deduced a trap composed of 222 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:36:12] [INFO ] Deduced a trap composed of 213 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:36:12] [INFO ] Deduced a trap composed of 181 places in 219 ms of which 0 ms to minimize.
[2023-03-09 23:36:12] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:36:13] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2023-03-09 23:36:13] [INFO ] Deduced a trap composed of 219 places in 309 ms of which 0 ms to minimize.
[2023-03-09 23:36:13] [INFO ] Deduced a trap composed of 208 places in 310 ms of which 1 ms to minimize.
[2023-03-09 23:36:14] [INFO ] Deduced a trap composed of 185 places in 344 ms of which 1 ms to minimize.
[2023-03-09 23:36:15] [INFO ] Deduced a trap composed of 206 places in 357 ms of which 1 ms to minimize.
[2023-03-09 23:36:15] [INFO ] Deduced a trap composed of 210 places in 338 ms of which 1 ms to minimize.
[2023-03-09 23:36:16] [INFO ] Deduced a trap composed of 190 places in 368 ms of which 1 ms to minimize.
[2023-03-09 23:36:16] [INFO ] Deduced a trap composed of 192 places in 329 ms of which 1 ms to minimize.
[2023-03-09 23:36:16] [INFO ] Deduced a trap composed of 184 places in 255 ms of which 0 ms to minimize.
[2023-03-09 23:36:16] [INFO ] Deduced a trap composed of 174 places in 212 ms of which 0 ms to minimize.
[2023-03-09 23:36:17] [INFO ] Deduced a trap composed of 203 places in 257 ms of which 1 ms to minimize.
[2023-03-09 23:36:17] [INFO ] Deduced a trap composed of 148 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:36:17] [INFO ] Deduced a trap composed of 147 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:36:18] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:36:18] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 0 ms to minimize.
[2023-03-09 23:36:18] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:36:18] [INFO ] Deduced a trap composed of 204 places in 219 ms of which 1 ms to minimize.
[2023-03-09 23:36:19] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:36:19] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:36:19] [INFO ] Deduced a trap composed of 155 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:36:19] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 0 ms to minimize.
[2023-03-09 23:36:20] [INFO ] Deduced a trap composed of 150 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:36:20] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 0 ms to minimize.
[2023-03-09 23:36:20] [INFO ] Deduced a trap composed of 210 places in 205 ms of which 0 ms to minimize.
[2023-03-09 23:36:21] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:36:21] [INFO ] Deduced a trap composed of 211 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:36:21] [INFO ] Deduced a trap composed of 205 places in 209 ms of which 1 ms to minimize.
[2023-03-09 23:36:21] [INFO ] Deduced a trap composed of 207 places in 203 ms of which 0 ms to minimize.
[2023-03-09 23:36:22] [INFO ] Deduced a trap composed of 231 places in 220 ms of which 1 ms to minimize.
[2023-03-09 23:36:22] [INFO ] Deduced a trap composed of 193 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:36:22] [INFO ] Deduced a trap composed of 169 places in 187 ms of which 1 ms to minimize.
[2023-03-09 23:36:22] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 0 ms to minimize.
[2023-03-09 23:36:23] [INFO ] Deduced a trap composed of 204 places in 209 ms of which 0 ms to minimize.
[2023-03-09 23:36:23] [INFO ] Deduced a trap composed of 185 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:36:23] [INFO ] Deduced a trap composed of 215 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:36:23] [INFO ] Deduced a trap composed of 186 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:36:24] [INFO ] Deduced a trap composed of 217 places in 217 ms of which 0 ms to minimize.
[2023-03-09 23:36:24] [INFO ] Deduced a trap composed of 188 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:36:24] [INFO ] Deduced a trap composed of 219 places in 177 ms of which 0 ms to minimize.
[2023-03-09 23:36:24] [INFO ] Deduced a trap composed of 220 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:36:25] [INFO ] Deduced a trap composed of 210 places in 207 ms of which 0 ms to minimize.
[2023-03-09 23:36:25] [INFO ] Deduced a trap composed of 228 places in 185 ms of which 0 ms to minimize.
[2023-03-09 23:36:25] [INFO ] Deduced a trap composed of 229 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:36:25] [INFO ] Deduced a trap composed of 229 places in 177 ms of which 1 ms to minimize.
[2023-03-09 23:36:26] [INFO ] Deduced a trap composed of 201 places in 201 ms of which 0 ms to minimize.
[2023-03-09 23:36:26] [INFO ] Deduced a trap composed of 202 places in 185 ms of which 1 ms to minimize.
[2023-03-09 23:36:26] [INFO ] Deduced a trap composed of 212 places in 170 ms of which 0 ms to minimize.
[2023-03-09 23:36:26] [INFO ] Deduced a trap composed of 220 places in 169 ms of which 1 ms to minimize.
[2023-03-09 23:36:26] [INFO ] Deduced a trap composed of 212 places in 196 ms of which 0 ms to minimize.
[2023-03-09 23:36:27] [INFO ] Deduced a trap composed of 233 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:36:27] [INFO ] Deduced a trap composed of 224 places in 195 ms of which 1 ms to minimize.
[2023-03-09 23:36:27] [INFO ] Deduced a trap composed of 169 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:36:28] [INFO ] Deduced a trap composed of 219 places in 184 ms of which 1 ms to minimize.
[2023-03-09 23:36:29] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 0 ms to minimize.
[2023-03-09 23:36:29] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 0 ms to minimize.
[2023-03-09 23:36:29] [INFO ] Deduced a trap composed of 180 places in 229 ms of which 1 ms to minimize.
[2023-03-09 23:36:29] [INFO ] Deduced a trap composed of 240 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:36:30] [INFO ] Deduced a trap composed of 216 places in 213 ms of which 0 ms to minimize.
[2023-03-09 23:36:30] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 0 ms to minimize.
[2023-03-09 23:36:30] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:36:30] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:36:31] [INFO ] Deduced a trap composed of 235 places in 207 ms of which 0 ms to minimize.
[2023-03-09 23:36:31] [INFO ] Deduced a trap composed of 243 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:36:31] [INFO ] Deduced a trap composed of 177 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:36:31] [INFO ] Deduced a trap composed of 159 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:36:32] [INFO ] Deduced a trap composed of 217 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:36:32] [INFO ] Deduced a trap composed of 203 places in 204 ms of which 0 ms to minimize.
[2023-03-09 23:36:32] [INFO ] Deduced a trap composed of 208 places in 201 ms of which 1 ms to minimize.
[2023-03-09 23:36:32] [INFO ] Deduced a trap composed of 231 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:36:33] [INFO ] Deduced a trap composed of 232 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:36:33] [INFO ] Deduced a trap composed of 178 places in 173 ms of which 1 ms to minimize.
[2023-03-09 23:36:33] [INFO ] Deduced a trap composed of 243 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:36:33] [INFO ] Deduced a trap composed of 219 places in 208 ms of which 0 ms to minimize.
[2023-03-09 23:36:34] [INFO ] Deduced a trap composed of 207 places in 217 ms of which 1 ms to minimize.
[2023-03-09 23:36:34] [INFO ] Deduced a trap composed of 231 places in 198 ms of which 1 ms to minimize.
[2023-03-09 23:36:34] [INFO ] Deduced a trap composed of 226 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:36:34] [INFO ] Deduced a trap composed of 195 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:36:35] [INFO ] Deduced a trap composed of 233 places in 212 ms of which 1 ms to minimize.
[2023-03-09 23:36:35] [INFO ] Deduced a trap composed of 257 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:36:35] [INFO ] Deduced a trap composed of 228 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:36:35] [INFO ] Deduced a trap composed of 258 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:36:36] [INFO ] Deduced a trap composed of 208 places in 192 ms of which 1 ms to minimize.
[2023-03-09 23:36:36] [INFO ] Deduced a trap composed of 217 places in 197 ms of which 1 ms to minimize.
[2023-03-09 23:36:36] [INFO ] Deduced a trap composed of 237 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:36:37] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 0 ms to minimize.
[2023-03-09 23:36:37] [INFO ] Deduced a trap composed of 203 places in 179 ms of which 0 ms to minimize.
[2023-03-09 23:36:37] [INFO ] Deduced a trap composed of 149 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:36:37] [INFO ] Deduced a trap composed of 192 places in 212 ms of which 1 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 23:36:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 23:36:37] [INFO ] After 225023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:337
Fused 337 Parikh solutions to 313 different solutions.
Parikh walk visited 0 properties in 30307 ms.
Support contains 337 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 454/454 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 487 transition count 431
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 464 transition count 431
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 46 place count 464 transition count 427
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 460 transition count 427
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 92 place count 441 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 437 transition count 408
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 437 transition count 400
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 429 transition count 400
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 125 place count 429 transition count 400
Applied a total of 125 rules in 93 ms. Remains 429 /487 variables (removed 58) and now considering 400/454 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 429/487 places, 400/454 transitions.
Interrupted random walk after 501885 steps, including 64444 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 810 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 337) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 337) seen :0
Interrupted probabilistic random walk after 4069872 steps, run timeout after 147001 ms. (steps per millisecond=27 ) properties seen :{16=1, 17=1}
Probabilistic random walk after 4069872 steps, saw 2034885 distinct states, run finished after 147001 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 335 properties.
// Phase 1: matrix 400 rows 429 cols
[2023-03-09 23:40:24] [INFO ] Computed 54 place invariants in 49 ms
[2023-03-09 23:40:29] [INFO ] After 4018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 23:40:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-09 23:40:32] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-09 23:40:42] [INFO ] After 7332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 23:40:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:40:49] [INFO ] After 7323ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 23:40:51] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-03-09 23:40:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-09 23:41:02] [INFO ] After 19994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 7397 ms.
[2023-03-09 23:41:09] [INFO ] After 40762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 325 different solutions.
Parikh walk visited 0 properties in 30201 ms.
Support contains 335 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 400/400 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 428 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 428 transition count 399
Applied a total of 3 rules in 38 ms. Remains 428 /429 variables (removed 1) and now considering 399/400 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 428/429 places, 399/400 transitions.
Interrupted random walk after 534576 steps, including 68539 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 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 835 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 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 858 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 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 852 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 335) 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 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4086057 steps, run timeout after 147001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 4086057 steps, saw 2042973 distinct states, run finished after 147005 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 399 rows 428 cols
[2023-03-09 23:44:56] [INFO ] Computed 54 place invariants in 32 ms
[2023-03-09 23:45:00] [INFO ] After 4479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 23:45:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-09 23:45:04] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 46 ms returned sat
[2023-03-09 23:45:18] [INFO ] After 9207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 23:45:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:45:27] [INFO ] After 9357ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 23:45:28] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2023-03-09 23:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-09 23:45:32] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 2 ms to minimize.
[2023-03-09 23:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-09 23:45:32] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
[2023-03-09 23:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-09 23:45:33] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2023-03-09 23:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-09 23:45:34] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2023-03-09 23:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-09 23:45:36] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 0 ms to minimize.
[2023-03-09 23:45:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-09 23:45:36] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 1 ms to minimize.
[2023-03-09 23:45:37] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 1 ms to minimize.
[2023-03-09 23:45:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2023-03-09 23:45:38] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2023-03-09 23:45:38] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 0 ms to minimize.
[2023-03-09 23:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2023-03-09 23:45:49] [INFO ] After 31524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 12220 ms.
[2023-03-09 23:46:02] [INFO ] After 61096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 304 different solutions.
Parikh walk visited 0 properties in 30179 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 15 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 15 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 12 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2023-03-09 23:46:32] [INFO ] Invariant cache hit.
[2023-03-09 23:46:32] [INFO ] Implicit Places using invariants in 245 ms returned [20, 26, 221, 346, 419, 425]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 249 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 24 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 23:46:32] [INFO ] Computed 48 place invariants in 26 ms
[2023-03-09 23:46:32] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-09 23:46:32] [INFO ] Invariant cache hit.
[2023-03-09 23:46:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:46:34] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1712 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 1998 ms. Remains : 419/428 places, 396/399 transitions.
Interrupted random walk after 528386 steps, including 76394 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 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 949 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 896 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 912 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 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 936 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 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 900 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 911 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 905 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 882 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 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 937 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 911 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 870 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 915 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 921 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 886 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 953 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 921 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 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 945 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 916 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 935 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 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 928 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 920 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 905 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 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 898 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 950 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 884 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 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 933 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 904 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 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 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 907 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 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 889 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 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 896 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 931 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 3956025 steps, run timeout after 138001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 3956025 steps, saw 1977857 distinct states, run finished after 138013 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 335 properties.
[2023-03-09 23:49:39] [INFO ] Invariant cache hit.
[2023-03-09 23:49:44] [INFO ] After 5219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 23:49:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2023-03-09 23:49:48] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 23:50:02] [INFO ] After 10532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 23:50:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:50:13] [INFO ] After 10462ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 23:50:14] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2023-03-09 23:50:14] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2023-03-09 23:50:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2023-03-09 23:50:17] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2023-03-09 23:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-09 23:50:17] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 1 ms to minimize.
[2023-03-09 23:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2023-03-09 23:50:18] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:50:19] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 1 ms to minimize.
[2023-03-09 23:50:19] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-09 23:50:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 735 ms
[2023-03-09 23:50:19] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2023-03-09 23:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-09 23:50:21] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-09 23:50:21] [INFO ] Deduced a trap composed of 164 places in 335 ms of which 1 ms to minimize.
[2023-03-09 23:50:21] [INFO ] Deduced a trap composed of 162 places in 307 ms of which 1 ms to minimize.
[2023-03-09 23:50:22] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 1 ms to minimize.
[2023-03-09 23:50:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1505 ms
[2023-03-09 23:50:22] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 1 ms to minimize.
[2023-03-09 23:50:23] [INFO ] Deduced a trap composed of 158 places in 267 ms of which 1 ms to minimize.
[2023-03-09 23:50:23] [INFO ] Deduced a trap composed of 173 places in 266 ms of which 0 ms to minimize.
[2023-03-09 23:50:23] [INFO ] Deduced a trap composed of 156 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:50:24] [INFO ] Deduced a trap composed of 130 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:50:24] [INFO ] Deduced a trap composed of 165 places in 323 ms of which 1 ms to minimize.
[2023-03-09 23:50:24] [INFO ] Deduced a trap composed of 52 places in 331 ms of which 1 ms to minimize.
[2023-03-09 23:50:25] [INFO ] Deduced a trap composed of 144 places in 242 ms of which 1 ms to minimize.
[2023-03-09 23:50:25] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 1 ms to minimize.
[2023-03-09 23:50:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2942 ms
[2023-03-09 23:50:26] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 1 ms to minimize.
[2023-03-09 23:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-09 23:50:27] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:50:28] [INFO ] Deduced a trap composed of 167 places in 320 ms of which 1 ms to minimize.
[2023-03-09 23:50:28] [INFO ] Deduced a trap composed of 160 places in 331 ms of which 1 ms to minimize.
[2023-03-09 23:50:28] [INFO ] Deduced a trap composed of 165 places in 293 ms of which 1 ms to minimize.
[2023-03-09 23:50:29] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 1 ms to minimize.
[2023-03-09 23:50:29] [INFO ] Deduced a trap composed of 188 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:50:30] [INFO ] Deduced a trap composed of 192 places in 288 ms of which 1 ms to minimize.
[2023-03-09 23:50:30] [INFO ] Deduced a trap composed of 128 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:50:30] [INFO ] Deduced a trap composed of 127 places in 291 ms of which 1 ms to minimize.
[2023-03-09 23:50:31] [INFO ] Deduced a trap composed of 110 places in 327 ms of which 1 ms to minimize.
[2023-03-09 23:50:31] [INFO ] Deduced a trap composed of 109 places in 313 ms of which 1 ms to minimize.
[2023-03-09 23:50:31] [INFO ] Deduced a trap composed of 180 places in 328 ms of which 1 ms to minimize.
[2023-03-09 23:50:32] [INFO ] Deduced a trap composed of 117 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:50:32] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 1 ms to minimize.
[2023-03-09 23:50:32] [INFO ] Deduced a trap composed of 151 places in 286 ms of which 1 ms to minimize.
[2023-03-09 23:50:33] [INFO ] Deduced a trap composed of 131 places in 277 ms of which 0 ms to minimize.
[2023-03-09 23:50:33] [INFO ] Deduced a trap composed of 178 places in 342 ms of which 1 ms to minimize.
[2023-03-09 23:50:33] [INFO ] Deduced a trap composed of 173 places in 311 ms of which 1 ms to minimize.
[2023-03-09 23:50:34] [INFO ] Deduced a trap composed of 171 places in 286 ms of which 1 ms to minimize.
[2023-03-09 23:50:34] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 1 ms to minimize.
[2023-03-09 23:50:34] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 1 ms to minimize.
[2023-03-09 23:50:35] [INFO ] Deduced a trap composed of 143 places in 277 ms of which 1 ms to minimize.
[2023-03-09 23:50:35] [INFO ] Deduced a trap composed of 133 places in 256 ms of which 0 ms to minimize.
[2023-03-09 23:50:35] [INFO ] Deduced a trap composed of 162 places in 318 ms of which 1 ms to minimize.
[2023-03-09 23:50:36] [INFO ] Deduced a trap composed of 143 places in 282 ms of which 1 ms to minimize.
[2023-03-09 23:50:36] [INFO ] Deduced a trap composed of 132 places in 267 ms of which 1 ms to minimize.
[2023-03-09 23:50:36] [INFO ] Deduced a trap composed of 140 places in 265 ms of which 1 ms to minimize.
[2023-03-09 23:50:37] [INFO ] Deduced a trap composed of 122 places in 266 ms of which 1 ms to minimize.
[2023-03-09 23:50:37] [INFO ] Deduced a trap composed of 153 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:50:37] [INFO ] Deduced a trap composed of 126 places in 306 ms of which 1 ms to minimize.
[2023-03-09 23:50:38] [INFO ] Deduced a trap composed of 132 places in 313 ms of which 1 ms to minimize.
[2023-03-09 23:50:38] [INFO ] Deduced a trap composed of 127 places in 307 ms of which 1 ms to minimize.
[2023-03-09 23:50:38] [INFO ] Deduced a trap composed of 66 places in 303 ms of which 1 ms to minimize.
[2023-03-09 23:50:39] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 1 ms to minimize.
[2023-03-09 23:50:39] [INFO ] Deduced a trap composed of 127 places in 296 ms of which 1 ms to minimize.
[2023-03-09 23:50:39] [INFO ] Deduced a trap composed of 127 places in 290 ms of which 1 ms to minimize.
[2023-03-09 23:50:40] [INFO ] Deduced a trap composed of 128 places in 262 ms of which 1 ms to minimize.
[2023-03-09 23:50:40] [INFO ] Deduced a trap composed of 180 places in 294 ms of which 1 ms to minimize.
[2023-03-09 23:50:40] [INFO ] Deduced a trap composed of 111 places in 309 ms of which 1 ms to minimize.
[2023-03-09 23:50:41] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 0 ms to minimize.
[2023-03-09 23:50:41] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 1 ms to minimize.
[2023-03-09 23:50:41] [INFO ] Deduced a trap composed of 133 places in 288 ms of which 1 ms to minimize.
[2023-03-09 23:50:42] [INFO ] Deduced a trap composed of 134 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:50:42] [INFO ] Deduced a trap composed of 191 places in 298 ms of which 1 ms to minimize.
[2023-03-09 23:50:43] [INFO ] Deduced a trap composed of 129 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:50:43] [INFO ] Deduced a trap composed of 171 places in 306 ms of which 1 ms to minimize.
[2023-03-09 23:50:43] [INFO ] Deduced a trap composed of 173 places in 276 ms of which 1 ms to minimize.
[2023-03-09 23:50:43] [INFO ] Deduced a trap composed of 128 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:50:44] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2023-03-09 23:50:44] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:50:44] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:50:44] [INFO ] Deduced a trap composed of 173 places in 266 ms of which 1 ms to minimize.
[2023-03-09 23:50:45] [INFO ] Deduced a trap composed of 124 places in 260 ms of which 0 ms to minimize.
[2023-03-09 23:50:45] [INFO ] Deduced a trap composed of 161 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:50:45] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 1 ms to minimize.
[2023-03-09 23:50:46] [INFO ] Deduced a trap composed of 181 places in 206 ms of which 1 ms to minimize.
[2023-03-09 23:50:46] [INFO ] Deduced a trap composed of 134 places in 272 ms of which 1 ms to minimize.
[2023-03-09 23:50:46] [INFO ] Deduced a trap composed of 183 places in 311 ms of which 1 ms to minimize.
[2023-03-09 23:50:47] [INFO ] Deduced a trap composed of 135 places in 278 ms of which 1 ms to minimize.
[2023-03-09 23:50:47] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 1 ms to minimize.
[2023-03-09 23:50:48] [INFO ] Deduced a trap composed of 176 places in 311 ms of which 1 ms to minimize.
[2023-03-09 23:50:48] [INFO ] Deduced a trap composed of 146 places in 302 ms of which 1 ms to minimize.
[2023-03-09 23:50:48] [INFO ] Deduced a trap composed of 164 places in 291 ms of which 1 ms to minimize.
[2023-03-09 23:50:48] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 21190 ms
[2023-03-09 23:50:51] [INFO ] Deduced a trap composed of 162 places in 302 ms of which 1 ms to minimize.
[2023-03-09 23:50:51] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 0 ms to minimize.
[2023-03-09 23:50:51] [INFO ] Deduced a trap composed of 168 places in 282 ms of which 0 ms to minimize.
[2023-03-09 23:50:52] [INFO ] Deduced a trap composed of 76 places in 275 ms of which 0 ms to minimize.
[2023-03-09 23:50:52] [INFO ] Deduced a trap composed of 174 places in 288 ms of which 1 ms to minimize.
[2023-03-09 23:50:52] [INFO ] Deduced a trap composed of 156 places in 266 ms of which 1 ms to minimize.
[2023-03-09 23:50:53] [INFO ] Deduced a trap composed of 92 places in 267 ms of which 1 ms to minimize.
[2023-03-09 23:50:53] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 1 ms to minimize.
[2023-03-09 23:50:53] [INFO ] Deduced a trap composed of 140 places in 272 ms of which 1 ms to minimize.
[2023-03-09 23:50:54] [INFO ] Deduced a trap composed of 176 places in 276 ms of which 1 ms to minimize.
[2023-03-09 23:50:54] [INFO ] Deduced a trap composed of 157 places in 283 ms of which 1 ms to minimize.
[2023-03-09 23:50:54] [INFO ] Deduced a trap composed of 168 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:50:54] [INFO ] Deduced a trap composed of 179 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:50:55] [INFO ] Deduced a trap composed of 118 places in 261 ms of which 1 ms to minimize.
[2023-03-09 23:50:55] [INFO ] Deduced a trap composed of 185 places in 277 ms of which 1 ms to minimize.
[2023-03-09 23:50:55] [INFO ] Deduced a trap composed of 97 places in 280 ms of which 1 ms to minimize.
[2023-03-09 23:50:56] [INFO ] Deduced a trap composed of 194 places in 274 ms of which 1 ms to minimize.
[2023-03-09 23:50:56] [INFO ] Deduced a trap composed of 161 places in 270 ms of which 1 ms to minimize.
[2023-03-09 23:50:56] [INFO ] Deduced a trap composed of 185 places in 272 ms of which 1 ms to minimize.
[2023-03-09 23:50:57] [INFO ] Deduced a trap composed of 114 places in 286 ms of which 1 ms to minimize.
[2023-03-09 23:50:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6235 ms
[2023-03-09 23:50:58] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 0 ms to minimize.
[2023-03-09 23:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-09 23:50:59] [INFO ] Deduced a trap composed of 154 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:50:59] [INFO ] Deduced a trap composed of 188 places in 307 ms of which 1 ms to minimize.
[2023-03-09 23:50:59] [INFO ] Deduced a trap composed of 154 places in 277 ms of which 0 ms to minimize.
[2023-03-09 23:51:00] [INFO ] Deduced a trap composed of 131 places in 295 ms of which 1 ms to minimize.
[2023-03-09 23:51:00] [INFO ] Deduced a trap composed of 194 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:51:00] [INFO ] Deduced a trap composed of 177 places in 295 ms of which 1 ms to minimize.
[2023-03-09 23:51:01] [INFO ] Deduced a trap composed of 162 places in 302 ms of which 1 ms to minimize.
[2023-03-09 23:51:01] [INFO ] Deduced a trap composed of 133 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:51:01] [INFO ] Deduced a trap composed of 134 places in 214 ms of which 1 ms to minimize.
[2023-03-09 23:51:02] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:51:02] [INFO ] Deduced a trap composed of 155 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:51:02] [INFO ] Deduced a trap composed of 156 places in 295 ms of which 1 ms to minimize.
[2023-03-09 23:51:02] [INFO ] Deduced a trap composed of 152 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:51:03] [INFO ] Deduced a trap composed of 155 places in 204 ms of which 1 ms to minimize.
[2023-03-09 23:51:03] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 1 ms to minimize.
[2023-03-09 23:51:03] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 1 ms to minimize.
[2023-03-09 23:51:03] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:51:04] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-09 23:51:04] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 0 ms to minimize.
[2023-03-09 23:51:04] [INFO ] Deduced a trap composed of 128 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:51:05] [INFO ] Deduced a trap composed of 172 places in 288 ms of which 1 ms to minimize.
[2023-03-09 23:51:05] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6294 ms
[2023-03-09 23:51:06] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2023-03-09 23:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-09 23:51:08] [INFO ] Deduced a trap composed of 174 places in 322 ms of which 2 ms to minimize.
[2023-03-09 23:51:08] [INFO ] Deduced a trap composed of 171 places in 303 ms of which 1 ms to minimize.
[2023-03-09 23:51:08] [INFO ] Deduced a trap composed of 104 places in 284 ms of which 1 ms to minimize.
[2023-03-09 23:51:09] [INFO ] Deduced a trap composed of 115 places in 303 ms of which 1 ms to minimize.
[2023-03-09 23:51:09] [INFO ] Deduced a trap composed of 112 places in 216 ms of which 1 ms to minimize.
[2023-03-09 23:51:09] [INFO ] Deduced a trap composed of 105 places in 317 ms of which 1 ms to minimize.
[2023-03-09 23:51:10] [INFO ] Deduced a trap composed of 177 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:51:10] [INFO ] Deduced a trap composed of 166 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:51:10] [INFO ] Deduced a trap composed of 154 places in 284 ms of which 1 ms to minimize.
[2023-03-09 23:51:11] [INFO ] Deduced a trap composed of 180 places in 276 ms of which 1 ms to minimize.
[2023-03-09 23:51:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3302 ms
[2023-03-09 23:51:11] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 1 ms to minimize.
[2023-03-09 23:51:11] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 1 ms to minimize.
[2023-03-09 23:51:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2023-03-09 23:51:14] [INFO ] Deduced a trap composed of 137 places in 314 ms of which 1 ms to minimize.
[2023-03-09 23:51:14] [INFO ] Deduced a trap composed of 180 places in 291 ms of which 1 ms to minimize.
[2023-03-09 23:51:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 950 ms
[2023-03-09 23:51:15] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 1 ms to minimize.
[2023-03-09 23:51:16] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2023-03-09 23:51:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 872 ms
[2023-03-09 23:51:17] [INFO ] Deduced a trap composed of 155 places in 271 ms of which 1 ms to minimize.
[2023-03-09 23:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-09 23:51:18] [INFO ] Deduced a trap composed of 82 places in 295 ms of which 1 ms to minimize.
[2023-03-09 23:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-09 23:51:19] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2023-03-09 23:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-09 23:51:21] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2023-03-09 23:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-09 23:51:23] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 0 ms to minimize.
[2023-03-09 23:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-09 23:51:24] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 0 ms to minimize.
[2023-03-09 23:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-09 23:51:27] [INFO ] After 85250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 23694 ms.
[2023-03-09 23:51:51] [INFO ] After 127163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 322 different solutions.
Parikh walk visited 0 properties in 30058 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 23:52:21] [INFO ] Invariant cache hit.
[2023-03-09 23:52:21] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-09 23:52:21] [INFO ] Invariant cache hit.
[2023-03-09 23:52:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:52:23] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2023-03-09 23:52:23] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-09 23:52:23] [INFO ] Invariant cache hit.
[2023-03-09 23:52:24] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2324 ms. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14487 resets, run finished after 6080 ms. (steps per millisecond=16 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
[2023-03-09 23:52:30] [INFO ] Invariant cache hit.
[2023-03-09 23:52:30] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-09 23:52:30] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-09 23:52:32] [INFO ] After 1660ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2023-03-09 23:52:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:52:34] [INFO ] After 1957ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
[2023-03-09 23:52:34] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-09 23:52:35] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2023-03-09 23:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 23:52:36] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2023-03-09 23:52:36] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 1 ms to minimize.
[2023-03-09 23:52:36] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 0 ms to minimize.
[2023-03-09 23:52:37] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2023-03-09 23:52:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 787 ms
[2023-03-09 23:52:37] [INFO ] Deduced a trap composed of 120 places in 182 ms of which 0 ms to minimize.
[2023-03-09 23:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-09 23:52:38] [INFO ] Deduced a trap composed of 166 places in 332 ms of which 1 ms to minimize.
[2023-03-09 23:52:38] [INFO ] Deduced a trap composed of 172 places in 319 ms of which 1 ms to minimize.
[2023-03-09 23:52:39] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 1 ms to minimize.
[2023-03-09 23:52:39] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 1 ms to minimize.
[2023-03-09 23:52:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1327 ms
[2023-03-09 23:52:41] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2023-03-09 23:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 23:52:41] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 1 ms to minimize.
[2023-03-09 23:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-09 23:52:42] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 0 ms to minimize.
[2023-03-09 23:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-09 23:52:45] [INFO ] Deduced a trap composed of 129 places in 352 ms of which 1 ms to minimize.
[2023-03-09 23:52:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 445 ms
[2023-03-09 23:52:46] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 1 ms to minimize.
[2023-03-09 23:52:46] [INFO ] Deduced a trap composed of 151 places in 272 ms of which 1 ms to minimize.
[2023-03-09 23:52:46] [INFO ] Deduced a trap composed of 189 places in 173 ms of which 1 ms to minimize.
[2023-03-09 23:52:46] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 0 ms to minimize.
[2023-03-09 23:52:47] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:52:47] [INFO ] Deduced a trap composed of 159 places in 205 ms of which 1 ms to minimize.
[2023-03-09 23:52:47] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 1 ms to minimize.
[2023-03-09 23:52:48] [INFO ] Deduced a trap composed of 167 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:52:48] [INFO ] Deduced a trap composed of 167 places in 248 ms of which 0 ms to minimize.
[2023-03-09 23:52:48] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 1 ms to minimize.
[2023-03-09 23:52:49] [INFO ] Deduced a trap composed of 146 places in 315 ms of which 1 ms to minimize.
[2023-03-09 23:52:49] [INFO ] Deduced a trap composed of 86 places in 311 ms of which 1 ms to minimize.
[2023-03-09 23:52:49] [INFO ] Deduced a trap composed of 62 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:52:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3787 ms
[2023-03-09 23:52:50] [INFO ] Deduced a trap composed of 165 places in 309 ms of which 1 ms to minimize.
[2023-03-09 23:52:50] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 1 ms to minimize.
[2023-03-09 23:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 749 ms
[2023-03-09 23:52:52] [INFO ] Deduced a trap composed of 168 places in 312 ms of which 1 ms to minimize.
[2023-03-09 23:52:52] [INFO ] Deduced a trap composed of 157 places in 303 ms of which 1 ms to minimize.
[2023-03-09 23:52:52] [INFO ] Deduced a trap composed of 152 places in 304 ms of which 1 ms to minimize.
[2023-03-09 23:52:53] [INFO ] Deduced a trap composed of 56 places in 292 ms of which 1 ms to minimize.
[2023-03-09 23:52:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1383 ms
[2023-03-09 23:52:54] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 0 ms to minimize.
[2023-03-09 23:52:54] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 0 ms to minimize.
[2023-03-09 23:52:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2023-03-09 23:52:55] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 0 ms to minimize.
[2023-03-09 23:52:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 23:52:56] [INFO ] Deduced a trap composed of 162 places in 289 ms of which 1 ms to minimize.
[2023-03-09 23:52:56] [INFO ] Deduced a trap composed of 139 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:52:56] [INFO ] Deduced a trap composed of 157 places in 277 ms of which 1 ms to minimize.
[2023-03-09 23:52:57] [INFO ] Deduced a trap composed of 174 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:52:57] [INFO ] Deduced a trap composed of 134 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:52:57] [INFO ] Deduced a trap composed of 160 places in 267 ms of which 1 ms to minimize.
[2023-03-09 23:52:58] [INFO ] Deduced a trap composed of 161 places in 300 ms of which 2 ms to minimize.
[2023-03-09 23:52:58] [INFO ] Deduced a trap composed of 125 places in 259 ms of which 0 ms to minimize.
[2023-03-09 23:52:58] [INFO ] Deduced a trap composed of 152 places in 166 ms of which 1 ms to minimize.
[2023-03-09 23:52:58] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 1 ms to minimize.
[2023-03-09 23:52:59] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:52:59] [INFO ] Deduced a trap composed of 148 places in 202 ms of which 1 ms to minimize.
[2023-03-09 23:52:59] [INFO ] Deduced a trap composed of 153 places in 284 ms of which 1 ms to minimize.
[2023-03-09 23:53:00] [INFO ] Deduced a trap composed of 128 places in 291 ms of which 1 ms to minimize.
[2023-03-09 23:53:00] [INFO ] Deduced a trap composed of 126 places in 269 ms of which 1 ms to minimize.
[2023-03-09 23:53:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4624 ms
[2023-03-09 23:53:01] [INFO ] Deduced a trap composed of 153 places in 278 ms of which 1 ms to minimize.
[2023-03-09 23:53:01] [INFO ] Deduced a trap composed of 111 places in 262 ms of which 1 ms to minimize.
[2023-03-09 23:53:01] [INFO ] Deduced a trap composed of 115 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:53:01] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 1 ms to minimize.
[2023-03-09 23:53:02] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 1 ms to minimize.
[2023-03-09 23:53:02] [INFO ] Deduced a trap composed of 167 places in 293 ms of which 1 ms to minimize.
[2023-03-09 23:53:02] [INFO ] Deduced a trap composed of 142 places in 249 ms of which 1 ms to minimize.
[2023-03-09 23:53:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2087 ms
[2023-03-09 23:53:03] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2023-03-09 23:53:03] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 0 ms to minimize.
[2023-03-09 23:53:03] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 1 ms to minimize.
[2023-03-09 23:53:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 488 ms
[2023-03-09 23:53:03] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 1 ms to minimize.
[2023-03-09 23:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-09 23:53:07] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 0 ms to minimize.
[2023-03-09 23:53:07] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 1 ms to minimize.
[2023-03-09 23:53:07] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 1 ms to minimize.
[2023-03-09 23:53:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 559 ms
[2023-03-09 23:53:09] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 1 ms to minimize.
[2023-03-09 23:53:09] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 1 ms to minimize.
[2023-03-09 23:53:09] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 1 ms to minimize.
[2023-03-09 23:53:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 547 ms
[2023-03-09 23:53:11] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2023-03-09 23:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-09 23:53:13] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2023-03-09 23:53:13] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 0 ms to minimize.
[2023-03-09 23:53:13] [INFO ] Deduced a trap composed of 114 places in 264 ms of which 1 ms to minimize.
[2023-03-09 23:53:14] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 0 ms to minimize.
[2023-03-09 23:53:14] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 1 ms to minimize.
[2023-03-09 23:53:14] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 1 ms to minimize.
[2023-03-09 23:53:14] [INFO ] Deduced a trap composed of 171 places in 284 ms of which 1 ms to minimize.
[2023-03-09 23:53:15] [INFO ] Deduced a trap composed of 160 places in 320 ms of which 1 ms to minimize.
[2023-03-09 23:53:15] [INFO ] Deduced a trap composed of 158 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:53:15] [INFO ] Deduced a trap composed of 152 places in 290 ms of which 1 ms to minimize.
[2023-03-09 23:53:16] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 0 ms to minimize.
[2023-03-09 23:53:16] [INFO ] Deduced a trap composed of 117 places in 290 ms of which 1 ms to minimize.
[2023-03-09 23:53:16] [INFO ] Deduced a trap composed of 161 places in 304 ms of which 1 ms to minimize.
[2023-03-09 23:53:17] [INFO ] Deduced a trap composed of 166 places in 304 ms of which 2 ms to minimize.
[2023-03-09 23:53:17] [INFO ] Deduced a trap composed of 123 places in 294 ms of which 1 ms to minimize.
[2023-03-09 23:53:17] [INFO ] Deduced a trap composed of 161 places in 280 ms of which 1 ms to minimize.
[2023-03-09 23:53:18] [INFO ] Deduced a trap composed of 163 places in 316 ms of which 1 ms to minimize.
[2023-03-09 23:53:18] [INFO ] Deduced a trap composed of 169 places in 275 ms of which 1 ms to minimize.
[2023-03-09 23:53:19] [INFO ] Deduced a trap composed of 161 places in 278 ms of which 1 ms to minimize.
[2023-03-09 23:53:19] [INFO ] Deduced a trap composed of 161 places in 263 ms of which 1 ms to minimize.
[2023-03-09 23:53:19] [INFO ] Deduced a trap composed of 164 places in 278 ms of which 1 ms to minimize.
[2023-03-09 23:53:20] [INFO ] Deduced a trap composed of 173 places in 285 ms of which 1 ms to minimize.
[2023-03-09 23:53:20] [INFO ] Deduced a trap composed of 173 places in 211 ms of which 0 ms to minimize.
[2023-03-09 23:53:20] [INFO ] Deduced a trap composed of 113 places in 304 ms of which 1 ms to minimize.
[2023-03-09 23:53:20] [INFO ] Deduced a trap composed of 161 places in 274 ms of which 1 ms to minimize.
[2023-03-09 23:53:21] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 1 ms to minimize.
[2023-03-09 23:53:21] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:53:21] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 1 ms to minimize.
[2023-03-09 23:53:21] [INFO ] Deduced a trap composed of 92 places in 198 ms of which 0 ms to minimize.
[2023-03-09 23:53:21] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8750 ms
[2023-03-09 23:53:22] [INFO ] Deduced a trap composed of 147 places in 321 ms of which 1 ms to minimize.
[2023-03-09 23:53:22] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2023-03-09 23:53:23] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 2 ms to minimize.
[2023-03-09 23:53:23] [INFO ] Deduced a trap composed of 177 places in 308 ms of which 1 ms to minimize.
[2023-03-09 23:53:23] [INFO ] Deduced a trap composed of 143 places in 299 ms of which 1 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Deduced a trap composed of 165 places in 313 ms of which 1 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Deduced a trap composed of 82 places in 318 ms of which 1 ms to minimize.
[2023-03-09 23:53:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2355 ms
[2023-03-09 23:53:27] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2023-03-09 23:53:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-09 23:53:28] [INFO ] After 56179ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 23:53:28] [INFO ] After 58402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 23:53:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-09 23:53:29] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 23:53:31] [INFO ] After 1737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 23:53:32] [INFO ] After 1208ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 23:53:32] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 0 ms to minimize.
[2023-03-09 23:53:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-09 23:53:33] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 0 ms to minimize.
[2023-03-09 23:53:33] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2023-03-09 23:53:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2023-03-09 23:53:34] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 1 ms to minimize.
[2023-03-09 23:53:34] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 1 ms to minimize.
[2023-03-09 23:53:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-09 23:53:35] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
[2023-03-09 23:53:36] [INFO ] Deduced a trap composed of 165 places in 312 ms of which 1 ms to minimize.
[2023-03-09 23:53:36] [INFO ] Deduced a trap composed of 145 places in 341 ms of which 1 ms to minimize.
[2023-03-09 23:53:36] [INFO ] Deduced a trap composed of 163 places in 319 ms of which 2 ms to minimize.
[2023-03-09 23:53:37] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 1 ms to minimize.
[2023-03-09 23:53:37] [INFO ] Deduced a trap composed of 151 places in 333 ms of which 1 ms to minimize.
[2023-03-09 23:53:38] [INFO ] Deduced a trap composed of 160 places in 323 ms of which 1 ms to minimize.
[2023-03-09 23:53:38] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 1 ms to minimize.
[2023-03-09 23:53:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3103 ms
[2023-03-09 23:53:38] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 1 ms to minimize.
[2023-03-09 23:53:39] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-09 23:53:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 668 ms
[2023-03-09 23:53:39] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 1 ms to minimize.
[2023-03-09 23:53:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2023-03-09 23:53:40] [INFO ] Deduced a trap composed of 166 places in 321 ms of which 1 ms to minimize.
[2023-03-09 23:53:41] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2023-03-09 23:53:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1056 ms
[2023-03-09 23:53:43] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2023-03-09 23:53:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-09 23:53:43] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 1 ms to minimize.
[2023-03-09 23:53:43] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 0 ms to minimize.
[2023-03-09 23:53:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-09 23:53:44] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 1 ms to minimize.
[2023-03-09 23:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-09 23:53:44] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 1 ms to minimize.
[2023-03-09 23:53:44] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 0 ms to minimize.
[2023-03-09 23:53:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2023-03-09 23:53:48] [INFO ] Deduced a trap composed of 160 places in 322 ms of which 1 ms to minimize.
[2023-03-09 23:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-09 23:53:48] [INFO ] Deduced a trap composed of 156 places in 281 ms of which 1 ms to minimize.
[2023-03-09 23:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-09 23:53:49] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 0 ms to minimize.
[2023-03-09 23:53:49] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2023-03-09 23:53:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-09 23:53:50] [INFO ] Deduced a trap composed of 145 places in 297 ms of which 1 ms to minimize.
[2023-03-09 23:53:50] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 1 ms to minimize.
[2023-03-09 23:53:51] [INFO ] Deduced a trap composed of 172 places in 288 ms of which 1 ms to minimize.
[2023-03-09 23:53:51] [INFO ] Deduced a trap composed of 110 places in 274 ms of which 1 ms to minimize.
[2023-03-09 23:53:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1376 ms
[2023-03-09 23:53:52] [INFO ] Deduced a trap composed of 131 places in 243 ms of which 1 ms to minimize.
[2023-03-09 23:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-09 23:53:54] [INFO ] Deduced a trap composed of 188 places in 320 ms of which 1 ms to minimize.
[2023-03-09 23:53:54] [INFO ] Deduced a trap composed of 174 places in 306 ms of which 1 ms to minimize.
[2023-03-09 23:53:55] [INFO ] Deduced a trap composed of 50 places in 300 ms of which 1 ms to minimize.
[2023-03-09 23:53:55] [INFO ] Deduced a trap composed of 175 places in 304 ms of which 1 ms to minimize.
[2023-03-09 23:53:55] [INFO ] Deduced a trap composed of 194 places in 280 ms of which 1 ms to minimize.
[2023-03-09 23:53:56] [INFO ] Deduced a trap composed of 178 places in 295 ms of which 1 ms to minimize.
[2023-03-09 23:53:56] [INFO ] Deduced a trap composed of 192 places in 302 ms of which 1 ms to minimize.
[2023-03-09 23:53:57] [INFO ] Deduced a trap composed of 187 places in 305 ms of which 1 ms to minimize.
[2023-03-09 23:53:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2789 ms
[2023-03-09 23:53:57] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 1 ms to minimize.
[2023-03-09 23:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-09 23:53:58] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 1 ms to minimize.
[2023-03-09 23:53:58] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 1 ms to minimize.
[2023-03-09 23:53:58] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 0 ms to minimize.
[2023-03-09 23:53:59] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 0 ms to minimize.
[2023-03-09 23:53:59] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2023-03-09 23:53:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 882 ms
[2023-03-09 23:54:00] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 1 ms to minimize.
[2023-03-09 23:54:00] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 0 ms to minimize.
[2023-03-09 23:54:01] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 1 ms to minimize.
[2023-03-09 23:54:01] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 0 ms to minimize.
[2023-03-09 23:54:01] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 1 ms to minimize.
[2023-03-09 23:54:01] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 1 ms to minimize.
[2023-03-09 23:54:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 950 ms
[2023-03-09 23:54:02] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 1 ms to minimize.
[2023-03-09 23:54:03] [INFO ] Deduced a trap composed of 117 places in 287 ms of which 1 ms to minimize.
[2023-03-09 23:54:03] [INFO ] Deduced a trap composed of 173 places in 286 ms of which 1 ms to minimize.
[2023-03-09 23:54:03] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-09 23:54:03] [INFO ] Deduced a trap composed of 178 places in 166 ms of which 1 ms to minimize.
[2023-03-09 23:54:04] [INFO ] Deduced a trap composed of 189 places in 163 ms of which 1 ms to minimize.
[2023-03-09 23:54:04] [INFO ] Deduced a trap composed of 184 places in 160 ms of which 0 ms to minimize.
[2023-03-09 23:54:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1887 ms
[2023-03-09 23:54:04] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 1 ms to minimize.
[2023-03-09 23:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-09 23:54:08] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 1 ms to minimize.
[2023-03-09 23:54:08] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2023-03-09 23:54:08] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 0 ms to minimize.
[2023-03-09 23:54:08] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 0 ms to minimize.
[2023-03-09 23:54:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 642 ms
[2023-03-09 23:54:13] [INFO ] After 41974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 5575 ms.
[2023-03-09 23:54:18] [INFO ] After 50140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Interrupted random walk after 540659 steps, including 77917 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 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 891 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 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 933 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 423 ms. (steps per millisecond=23 ) 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 914 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 922 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 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 927 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 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 926 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 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 924 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 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 899 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 942 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 880 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 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 933 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 915 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 916 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 922 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 904 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 899 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 903 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 907 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 896 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 886 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4127623 steps, run timeout after 144001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 4127623 steps, saw 2063633 distinct states, run finished after 144001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 335 properties.
[2023-03-09 23:57:30] [INFO ] Invariant cache hit.
[2023-03-09 23:57:36] [INFO ] After 6031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 23:57:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-09 23:57:41] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 23:57:55] [INFO ] After 9263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 23:57:55] [INFO ] State equation strengthened by 12 read => feed constraints.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 14482412 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16130588 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="smartxred"
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 smartxred"
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 r153-smll-167819440300298"
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 ;